Results 111 to 120 of about 40,185 (227)
Demonstration of hypergraph-state quantum information processing
Complex entangled states are the key resources for measurement-based quantum computations, which is realised by performing a sequence of measurements on initially entangled qubits.
Jieshan Huang +9 more
doaj +1 more source
In 1986, Johnson and Perry proved a class of inequalities for uniform hypergraphs which included the following: for any such hypergraph, the geometric mean over the hyperedges of the geometric means of the degrees of the nodes on the hyperedge is no less
P. D. Johnson, R. N. Mohapatra
doaj +1 more source
Discrepancy of Sums of two Arithmetic Progressions
Estimating the discrepancy of the hypergraph of all arithmetic progressions in the set $[N]=\{1,2,\hdots,N\}$ was one of the famous open problems in combinatorial discrepancy theory for a long time.
Hebbinghaus, Nils
core +1 more source
AbstractWe introduce a theory of hypergraphical t-designs. We show the existence of these designs and prove a finiteness theorem on these designs for infinitely many parameter sets. We also give effective bounds on the number of points in these cases.
openaire +2 more sources
This article presents a new generalization of the cyclomatic number of a graph. This is the cyclicity of a hypergraph \(E\), defined as \[ \gamma(E) =\sum_{f: \delta_E(f)>1} \bigl(\delta_E (f)-1\bigr)- \bigl| \text{Max} (E)\bigr |+1, \] where \(\delta_E\) is a notion of `degree' of a subedge \(f\in E\) and \(\text{Max} (E)\) is the set of maximal edges
openaire +1 more source
Node Classification Method Based on Hierarchical Hypergraph Neural Network
Hypergraph neural networks have gained widespread attention due to their effectiveness in handling graph-structured data with complex relationships and multi-dimensional interactions.
Feng Xu +3 more
doaj +1 more source
A Novel Algorithm for Imbalance Data Classification Based on Neighborhood Hypergraph
The classification problem for imbalance data is paid more attention to. So far, many significant methods are proposed and applied to many fields. But more efficient methods are needed still. Hypergraph may not be powerful enough to deal with the data in
Feng Hu, Xiao Liu, Jin Dai, Hong Yu
doaj +1 more source
The complexity of recognizing $ABAB$-free hypergraphs [PDF]
The study of geometric hypergraphs gave rise to the notion of $ABAB$-free hypergraphs. A hypergraph $\mathcal{H}$ is called $ABAB$-free if there is an ordering of its vertices such that there are no hyperedges $A,B$ and vertices $v_1,v_2,v_3,v_4$ in this
Gábor Damásdi +3 more
doaj +1 more source
Properties of Hereditary Hypergraphs and Middle Graphs [PDF]
E. J. Cockayne +2 more
openalex +1 more source
Formulae for the generating functions for hypergraphs, dihypergraphs, oriented hypergraphs, selfcomplementary directed hypergraphs and self complementary hypergraphs are presented here.
Hegde, M, Sridharan, MR
openaire +3 more sources

