Related papers: Vertex cover algebras of unimodular hypergraphs
A hypergraph is linear if each pair of distinct vertices appears in at most one common edge. We say $\varGamma=(V,E)$ is an associated graph of a linear hypergraph $\mathcal{H}=(V, X)$ if for any $x\in X$, the induced subgraph…
We prove that two finite-dimensional commutative algebras over an algebraically closed field are isomorphic if and only if they give rise to isomorphic representations of the category of finite sets and surjective maps.
We explore properties of $3$-uniform hypergraphs $H$ without linear cycles. Our main results are that these hypergraphs must contain a vertex of strong degree at most two and must have independent sets of size at least ${2|V(H)|\over 5}$.
Let $\AAutH (X)$ be the subgroup of the group $\AutH (X)$ of holomorphic automorphisms of a normal affine algebraic surface $X$ generated by elements of flows associated with complete algebraic vector fields. Our main result is a…
A graph is universally $k$-edge-weightable if for every $k$-element set $Q\subset\mathbb{R}$, it admits a proper $Q$-edge weighting. The settled 1-2-3 conjecture implies that for any arithmetic progression $\{a,b,c\}$, every nice regular…
We find a natural $L_{\omega_1,\omega}$-axiomatisation $\Sigma$ of a structure on the upper half-plane $\mathbb{H}$ as the covering space of modular curves. The main theorem states that $\Sigma$ has a unique model in every uncountable…
Vertex algebras that arise from four-dimensional, $\mathcal{N}=2$ superconformal field theories inherit a collection of novel structural properties from their four-dimensional ancestors. Crucially, when the parent SCFT is unitary, the…
We classify gradings on matrix algebras by a finite abelian group. A grading is called good if all elementary matrices are homogeneous. For cyclic groups, all gradings on a matrix algebra over an algebraically closed field are good. We can…
Let A be a finitely generated connected graded k-algebra defined by a finite number of monomial relations. Then there is a finite directed graph, Q, the Ufnarovskii graph of A, for which the categories QGr(A) and QGr(kQ) are equivalent:…
Vertex algebras in higher dimensions provide an algebraic framework for investigating axiomatic quantum field theory with global conformal invariance. We develop further the theory of such vertex algebras by introducing formal calculus…
A necessary and sufficient condition for an operator space to support a multiplication making it completely isometric and isomorphic to a unital operator algebra is proved. The condition involves only the holomorphic structure of the Banach…
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…
A graph is said to be globally rigid in $d$-dimensional space if almost all of its embeddings are unique up to isometries. If a graph has enough automorphisms to send any of its vertices into any other, then it is called vertex-transitive.…
A polynomial is said to be unimodal if its coefficients are non-decreasing and then non-increasing. The domination polynomial of a graph $G$ is the generating function of the number of domination sets of each cardinality in $G$, and its…
A graph is 1-planar if it can be drawn on a plane so that each edge is crossed by at most one other edge. In this paper, we first give a useful structural theorem for 1-planar graphs, and then apply it to the list edge and list total…
We classify and explicitly describe homomorphisms of Verma modules for conformal Galilei algebras $\mathfrak{cga}_\ell(d,{\mathbb C})$ with $d=1$ for any integer value $\ell \in \mathbb{N}$. The homomorphisms are uniquely determined by…
Vertex algebras in higher dimensions correspond to models of quantum field theory with global conformal invariance. Any vertex algebra in dimension D admits a restriction to a vertex algebra in any lower dimension and, in particular, to…
Universal algebra uniformly captures various algebraic structures, by expressing them as equational theories or abstract clones. The ubiquity of algebraic structures in mathematics and related fields has given rise to several variants of…
Covering arrays are combinatorial objects that have been successfully applied in the design of test suites for testing systems such as software, circuits and networks, where failures can be caused by the interaction between their…
In this paper, we prove the conjectures of Gharakhloo and Welker (2023) that the positive matching decomposition number (pmd) of a $3$-uniform hypergraph is bounded from above by a polynomial of degree $2$ in terms of the number of…