Results 81 to 90 of about 47,538 (182)

Spectral Properties of Oriented Hypergraphs

open access: yes, 2014
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 of an
Reff, Nathan
core   +1 more source

Split Hypergraphs

open access: yesSIAM Journal on Discrete Mathematics, 2008
13 ...
openaire   +2 more sources

Stall‐Free Asynchronous State Repartitioning With a Proactive Workload Tracking Window

open access: yesConcurrency and Computation: Practice and Experience, Volume 38, Issue 3, February 2026.
ABSTRACT High‐throughput stateful applications rely on dynamic data repartitioning to adapt to changing workloads, but this process presents significant challenges. This paper provides a detailed analysis of such challenges, drilling down into the tradeoffs between adaptation, computational overhead, and service availability. We identify that a primary
Douglas Pereira Luiz   +1 more
wiley   +1 more source

Definition and Computation of Tensor‐Based Generalized Function Composition

open access: yesNumerical Linear Algebra with Applications, Volume 33, Issue 1, February 2026.
ABSTRACT Functions are fundamental to mathematics as they offer a structured and analytical framework to express relations between variables. While scalar and matrix‐based functions are well‐established, higher‐order tensor‐based functions have not been as extensively explored.
Remy Boyer
wiley   +1 more source

Hypergraph animals

open access: yesPhysical Review E
Here we introduce simple structures for the analysis of complex hypergraphs, hypergraph animals. These structures are designed to describe the local node neighbourhoods of nodes in hypergraphs. We establish their relationships to lattice animals and network motifs, and we develop their combinatorial properties for sparse and uncorrelated hypergraphs ...
openaire   +3 more sources

Lightweight Hybrid Wafer Defect Pattern Network Based on Feedforward Efficient Attention

open access: yesCAAI Transactions on Intelligence Technology, Volume 11, Issue 1, Page 149-166, February 2026.
ABSTRACT With the increase of semiconductor integration density, in order to cope with the increase of wafer defect complexity and types, especially the low recognition accuracy of overlapping mixed defects and unknown wafer defects, this study proposes a lightweight model for wafer defect detection called LightWMNet.
Zhiqiang Hu, Yiquan Wu
wiley   +1 more source

On Asymmetric Hypergraphs

open access: yes, 2021
In this paper, we prove that for any $k\ge 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 $k\ge 1$, the minimum size of an asymmetric $k$-uniform hypergraph.
Jiang, Yiting, Nešetřil, Jaroslav
openaire   +2 more sources

Nearly Hamilton cycles in sublinear expanders and applications

open access: yesJournal of the London Mathematical Society, Volume 113, Issue 2, February 2026.
Abstract We develop novel methods for constructing nearly Hamilton cycles in sublinear expanders with good regularity properties, as well as new techniques for finding such expanders in general graphs. These methods are of independent interest due to their potential for various applications to embedding problems in sparse graphs.
Shoham Letzter   +2 more
wiley   +1 more source

Colorful Subhypergraphs in Kneser Hypergraphs [PDF]

open access: yesThe Electronic Journal of Combinatorics, 2014
Using a $\mathbb{Z}_q$-generalization of a theorem of Ky Fan, we extend to Kneser hypergraphs a theorem of Simonyi and Tardos that ensures the existence of multicolored complete bipartite graphs in any proper coloring of a Kneser graph. It allows to derive a lower bound for the local chromatic number of Kneser hypergraphs (using a natural definition of
openaire   +3 more sources

Randomized Hypergraph States and Their Entanglement Properties

open access: yesAnnalen der Physik, Volume 538, Issue 1, January 2026.
Randomized hypergraph (RH) states are mixed states that extend the concept of randomized graph states to multi‐qubit hypergraphs subject to probabilistic gate imperfections. By modeling noisy multi‐qubit operations, this work reveals nonmonotonic behavior in bipartite and multipartite entanglement, derives analytical witnesses for specific hypergraph ...
Vinícius Salem   +2 more
wiley   +1 more source

Home - About - Disclaimer - Privacy