اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدOriented Hypergraphs: Balanceability
183
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
An oriented hypergraph is an oriented incidence structure that extends the concepts of signed graphs, balanced hypergraphs, and balanced matrices. We introduce hypergraphic structures and techniques that generalize the circuit classification of the signed graphic frame matroid to any oriented hypergraphic incidence matrix via its locally-signed-graphic substructure. To achieve this, Camions algorithm is applied to oriented hypergraphs to provide a generalization of reorientation sets and frustration that is only well-defined on balanceable oriented hypergraphs. A simple partial characterization of unbalanceable circuits extends the applications to representable matroids demonstrating that the difference between the Fano and non-Fano matroids is one of balance.
قيم البحث
اقرأ أيضاً
An oriented hypergraph is a hypergraph where each vertex-edge incidence is given a label of $+1$ or $-1$. The adjacency and Laplacian eigenvalues of an oriented hypergraph are studied. Eigenvalue bounds for both the adjacency and Laplacian matrices o
f an oriented hypergraph which depend on structural parameters of the oriented hypergraph are found. An oriented hypergraph and its incidence dual are shown to have the same nonzero Laplacian eigenvalues. A family of oriented hypergraphs with uniformally labeled incidences is also studied. This family provides a hypergraphic generalization of the signless Laplacian of a graph and also suggests a natural way to define the adjacency and Laplacian matrices of a hypergraph. Some results presented generalize both graph and signed graph results to a hypergraphic setting.
An oriented hypergraph is an oriented incidence structure that extends the concept of a signed graph. We introduce hypergraphic structures and techniques central to the extension of the circuit classification of signed graphs to oriented hypergraphs.
Oriented hypergraphs are further decomposed into three families -- balanced, balanceable, and unbalanceable -- and we obtain a complete classification of the balanced circuits of oriented hypergraphs.
For a given hypergraph, an orientation can be assigned to the vertex-edge incidences. This orientation is used to define the adjacency and Laplacian matrices. In addition to studying these matrices, several related structures are investigated includi
ng the incidence dual, the intersection graph (line graph), and the 2-section. A connection is then made between oriented hypergraphs and balanced incomplete block designs.
The determinants of ${pm 1}$-matrices are calculated by via the oriented hypergraphic Laplacian and summing over an incidence generalization of vertex cycle-covers. These cycle-covers are signed and partitioned into families based on their hyperedge
containment. Every non-edge-monic family is shown to contribute a net value of $0$ to the Laplacian, while each edge-monic family is shown to sum to the absolute value of the determinant of the original incidence matrix. Simple symmetries are identified as well as their relationship to Hadamards maximum determinant problem. Finally, the entries of the incidence matrix are reclaimed using only the signs of an adjacency-minimal set of cycle-covers from an edge-monic family.
In this paper, we prove that for any $kge 3$, there exist infinitely many minimal asymmetric $k$-uniform hypergraphs. This is in a striking contrast to $k=2$, where it has been proved recently that there are exactly $18$ minimal asymmetric graphs.
We also determine, for every $kge 1$, the minimum size of an asymmetric $k$-uniform hypergraph.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
