Related papers: The varieties generated by 3-hypergraph semirings
We introduce hypergeometric-type sequences. They are linear combinations of interlaced hypergeometric sequences (of arbitrary interlacements). We prove that they form a subring of the ring of holonomic sequences. An interesting family of…
Non-uniform hypergraphs appear in various domains of computer science as in the satisfiability problems and in data analysis. We analyse a general model where the probability for an edge of size $t$ to belong to the hypergraph depends of a…
We show that deciding if a given vector is the degree sequence of a 3-hypergraph is NP-complete.
A ring is a graph $R$ whose vertex set can be partitioned into $k \geq 4$ nonempty sets, $X_1, \dots, X_k$, such that for all $i \in \{1,\dots,k\}$, the set $X_i$ can be ordered as $X_i = \{u_i^1, \dots, u_i^{|X_i|}\}$ so that $X_i…
We propose algorithms for construction and random generation of hypergraphs without loops and with prescribed degree and dimension sequences. The objective is to provide a starting point for as well as an alternative to Markov chain Monte…
Gy\'arf\'as, Gy\H{o}ri and Simonovits proved that if a $3$-uniform hypergraph with $n$ vertices has no linear cycles, then its independence number $\alpha \ge \frac{2n} {5}$. The hypergraph consisting of vertex disjoint copies of a complete…
Graph generation is one of the most challenging tasks in recent years, and its core is to learn the ground truth distribution hiding in the training data. However, training data may not be available due to security concerns or unaffordable…
The zero-divisor graph of a finite commutative ring with unity is the graph whose vertex set is the set of zero-divisors in the ring, with $a$ and $b$ adjacent if $ab=0$. We show that the class of zero-divisor graphs is universal, in the…
In this work, we introduce a novel evaluation framework for generative models of graphs, emphasizing the importance of model-generated graph overlap (Chanpuriya et al., 2021) to ensure both accuracy and edge-diversity. We delineate a…
In this paper, we develop some foundations for a theory of algebraic varieties of congruences on commutative semirings. By studying the structure of congruences, firstly, we show that the spectrum $ \text{Spec}^{c}(A) $ consisting of prime…
We establish a sufficient condition for an additively idempotent semiring to be nonfinitely based. Applying this condition, we prove that the six-element additively idempotent semiring $SR_6$ has no finite basis for its identity.…
In the paper we describe the group $\mathbf{Aut}\left(\mathscr{C}_{\mathbb{Z}}\right)$ of automorphisms of the extended bicyclic semigroup $\mathscr{C}_{\mathbb{Z}}$ and study the variants $\mathscr{C}_{\mathbb{Z}}^{m,n}$ of the extended…
Let $n$ be a positive integer. The main result of this manuscript is a construction of a filtration on the cohomology ring of a regular nilpotent Hessenberg variety in $GL(n,{\mathbb{C}})/B$ such that its associated graded ring has graded…
Let $n$ be a fixed positive integer and $h: \{1,2,...,n\} \rightarrow \{1,2,...,n\}$ a Hessenberg function. The main result of this manuscript is to give a systematic method for producing an explicit presentation by generators and relations…
Graph product structure theory expresses certain graphs as subgraphs of the strong product of much simpler graphs. In particular, an elegant formulation for the corresponding structural theorems involves the strong product of a path and of…
In this paper we present the notion of arithmetic variety for numerical semigroups. We study various aspects related to these varieties such as the smallest arithmetic that contains a set of numerical semigroups and we exhibit the root…
Hierarchical structure and repetition are prevalent in graphs originating from nature or engineering. These patterns can be represented by a class of parametric-structure graphs, which are defined by templates that generate structure by way…
The concept of hypergroup is generalization of group, first was introduced by Marty [9]. This theory had applications to several domains. Marty had applied them to groups, algebraic functions and rational functions. M. Krasner has studied…
For a fixed graph $H$ on $k$ vertices, and a graph $G$ on at least $k$ vertices, we write $G\rightarrow H$ if in any vertex-coloring of $G$ with $k$ colors, there is an induced subgraph isomorphic to $H$ whose vertices have distinct colors.…
The aim of this paper is to generalize the notion of the coloring complex of a graph to hypergraphs. We present three different interpretations of those complexes -- a purely combinatorial one and two geometric ones. It is shown, that most…