Results 31 to 40 of about 418 (155)
Almost Self-Complementary 3-Uniform Hypergraphs
Discussiones Mathematicae Graph Theory, 2017 It is known that self-complementary 3-uniform hypergraphs on n vertices exist if and only if n is congruent to 0, 1 or 2 modulo 4. In this paper we define an almost self-complementary 3-uniform hypergraph on n vertices and prove that it exists if and ...
Kamble Lata N. +2 more
doaj +1 more source
Non-Abelian Topological Approach to Non-Locality of a Hypergraph State
Entropy, 2015 We present a theoretical study of new families of stochastic complex information modules encoded in the hypergraph states which are defined by the fractional entropic descriptor.
Vesna Berec
doaj +1 more source
International Journal of Mathematics and Mathematical Sciences, 2005 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
Degree and Regularity of Eulerian Ideals of Hypergraphs
The Electronic Journal of Combinatorics, 2022 We define the Eulerian ideal of a $k$-uniform hypergraph and study its degree and Castelnuovo-Mumford regularity. The main tool is a Gröbner basis of the ideal obtained combinatorially from the hypergraph. We define the notion of parity join in a hypergraph and show that the regularity of the Eulerian ideal is equal to the maximum cardinality of such a
Jorge Neves, Gonçalo Varejão
openaire +3 more sources
Two-regular subgraphs of hypergraphs
Journal of Combinatorial Theory, Series B, 2009 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Dhruv Mubayi, Jacques Verstraëte
openaire +2 more sources
Decomposition of regular hypergraphs [PDF]
Journal of Combinatorics, 2018 An r-block is a 0, 1-matrix in which every row has sum r. Let Sn be the set of pairs (k, l) such that the columns of any (k+l)-block with n rows split into a k-block and an l-block. We determine Sn for n ≤ 5. In particular, S3 = {(k, l) : 2 | kl}, S4 = {(k, l) : (6 | k or l) and (1 / ∈ {k, l})}, and S5 = {(k, l) : 11 6= min{k, l} > 7 and each value in {
Jeong Ok Choi, Douglas B. West
openaire +1 more source
3D-Via Driven Partitioning for 3D VLSI Integrated Circuits
CLEI Electronic Journal, 2010 A 3D circuit is the stacking of regular 2D circuits. The advances on the fabrication and packaging technologies allowed interconnecting stacked 2D circuits by using 3D vias.
Sandro Sawicki +3 more
doaj +1 more source
Topology‐Aware Deep Learning on Higher‐Order Structures for Drug Response Prediction
Advanced Science, EarlyView.We present TopDr, a topology‐aware deep learning framework that encodes both drugs and cell lines as multiscale simplicial complexes, capturing interactions at the 0‐, 1‐, and 2‐simplex levels. By jointly integrating local higher‐order neighborhoods and global topological structures, TopDr generates enriched representations for sensitivity prediction ...
Cong Shen +3 more
wiley +1 more source
Advanced Intelligent Discovery, EarlyView.This article investigates how persistent homology, persistent Laplacians, and persistent commutative algebra reveal complementary geometric, topological, and algebraic invariants or signatures of real‐world data. By analyzing shapes, synthetic complexes, fullerenes, and biomolecules, the article shows how these mathematical frameworks enhance ...
Yiming Ren, Guo‐Wei Wei
wiley +1 more source
Density Conditions for k $k$ Vertex‐Disjoint Triangles in Tripartite Graphs
Journal of Graph Theory, EarlyView.ABSTRACT Let n , k $n,k$ be positive integers such that n ≥ k $n\ge k$ and G $G$ be a tripartite graph with parts A , B , C $A,B,C$ such that ∣ A ∣ = ∣ B ∣ = ∣ C ∣ = n $| A| =| B| =| C| =n$. Denote the edge densities of G [ A , B ] , G [ A , C ] $G[A,B],G[A,C]$ and G [ B , C ] $G[B,C]$ by α , β $\alpha ,\beta $ and γ $\gamma $, respectively.
Mingyang Guo, Klas Markström
wiley +1 more source