Related papers: The varieties generated by 3-hypergraph semirings

Hypergraphs naturally represent group interactions, which are omnipresent in many domains: collaborations of researchers, co-purchases of items, joint interactions of proteins, to name a few. In this work, we propose tools for answering the…

Semigraphoids are combinatorial structures that arise in statistical learning theory. They are equivalent to convex rank tests and to polyhedral fans that coarsen the reflection arrangement of the symmetric group. We resolve two problems on…

A mixed hypergraph is a triple $H=(V,\mathcal{C},\mathcal{D})$, where $V$ is a set of vertices, $\mathcal{C}$ and $\mathcal{D}$ are sets of hyperedges. A vertex-coloring of $H$ is proper if $C$-edges are not totally multicolored and…

We study the 2-offer semirandom 3-uniform hypergraph model on $n$ vertices. At each step, we are presented with 2 uniformly random vertices. We choose any other vertex, thus creating a hyperedge of size 3. We show a strategy that constructs…

For each uniformity $k \geq 3$, we construct $k$-uniform linear hypergraphs $G$ with arbitrarily large maximum degree $\Delta$ whose independence polynomial $Z_G$ has a root $\lambda$ with $\lvert\lambda\rvert = O\left(\frac{\log…

We introduce supergroup analogues of 3-manifold invariants $\hat{Z}$, also known as homological blocks, which were previously considered for ordinary compact semisimple Lie groups. We focus on superunitary groups, and work out the case of…

We generalize the study of higher-form-symmetries to theories with supersymmetry. Using a supergeometry formulation, we find that ordinary higher-form-symmetries nicely combine with supersymmetry to give rise to a much larger spectrum of…

We study a family of subrings, indexed by the natural numbers, of the mod-p cohomology of a finite group G. These subrings are based on a family of v_n-periodic complex oriented cohomology theories and are constructed as rings of…

A graph $H$ is an induced subgraph of a graph $G$ if a graph isomorphic to $H$ can be obtained from $G$ by deleting vertices. Recently, there has been significant interest in understanding the unavoidable induced subgraphs for graphs of…

Random hypergraphs extend the classical notion of random graphs by allowing hyperedges to join more than two vertices, making them well-suited for modeling higher-order interactions in complex systems. Despite their broad applicability,…

For a 3-uniform hypergraph (3-graph) $F$, let $r(F,n)$ be the smallest $N$ such that any $N$-vertex $F$-free 3-graph has an independent set of size $n$. We construct a $3$-graph $H_2$ with six vertices and five edges such that…

In this paper, we introduce a class of graphs which we call average hereditary graphs. Many graphs that occur in the usual graph theory applications belong to this class of graphs. Many popular types of graphs fall under this class, such as…

A sequence of nonnegative integers $\pi$ is {\it graphic} if it is the degree sequence of some graph $G$. In this case we say that $G$ is a \textit{realization} of $\pi$, and we write $\pi=\pi(G)$. A graphic sequence $\pi$ is {\it…

We develop an algebraic and operational framework for quantum isomorphisms of hypergraphs, using tools from compact quantum group theory. We introduce a new synchronous version of the hypergraph isomorphism game whose game algebra uniformly…

Given an $r$-uniform hypergraph $H$, the multicolor Ramsey number $r_k(H)$ is the minimum $n$ such that every $k$-coloring of the edges of the complete $r$-uniform hypergraph $K_n^r$ yields a monochromatic copy of $H$. We investigate…

In this paper, we study the homology of the cyclic coloring complex of three different types of $k$-uniform hypergraphs. For the case of a complete $k$-uniform hypergraph, we show that the dimension of the $(n-k-1)^{st}$ homology group is…

For a subvariety of a smooth projective variety, consider the family of smooth hypersurfaces of sufficiently large degree containing it, and take the quotient of the middle cohomology of the hypersurfaces by the cohomology of the ambient…

Let $H$ be a 3-uniform hypergraph. A tournament $T$ defined on $V(T)=V(H)$ is a realization of $H$ if the edges of $H$ are exactly the 3-element subsets of $V(T)$ that induce 3-cycles. We characterize the 3-uniform hypergraphs that admit…

In this paper, we show that the largest signless Laplacian H-eigenvalue of a connected $k$-uniform hypergraph $G$, where $k \ge 3$, reaches its upper bound $2\Delta(G)$, where $\Delta(G)$ is the largest degree of $G$, if and only if $G$ is…

In this paper we use character variety methods to study homomorphisms between the fundamental groups of 3-manifolds, in particular those induced by non-zero degree maps. A {\it knot manifold} is a compact, connected, irreducible, orientable…