Related papers: Markov complexity of monomial curves

It follows from known results that every regular tripartite hypergraph of positive degree, with $n$ vertices in each class, has matching number at least $n/2$. This bound is best possible, and the extremal configuration is unique. Here we…

In this paper we show that each non-zero ideal of a twisted generalized Weyl algebra (TGWA) $A$ intersects the centralizer of the distinguished subalgebra $R$ in $A$ non-trivially. We also provide a necessary and sufficient condition for…

A numerical semigroup is said to be universally free if it is free for any possible arrangement of its minimal generating set. In this work, we establish that toric ideals associated with universally free numerical semigroups can be…

Let $\mathcal{A}$ be the class of unital separable simple amenable $C$*-algebras $A$ which satisfy the Universal Coefficient Theorem for which $A\otimes M_{\texttt{P}}$ has tracial rank zero for some supernatural number $\texttt{p}$ of…

Let the complexity of a closed manifold M be the minimal number of simplices in a triangulation of M. Such a quantity is clearly submultiplicative with respect to finite coverings, and by taking the infimum on all finite coverings of M…

Let $R$ be a commutative Noetherian ring and let ${\bf x} :=x_1,\ldots,x_d$ be a regular $R$-sequence contained in the Jacobson radical of $R$. An ideal $I$ of $R$ is said to be a monomial ideal with respect to ${\bf x}$ if it is generated…

We explore resolutions of monomial ideals supported by simplicial trees. We argue that since simplicial trees are acyclic, the criterion of Bayer, Peeva and Sturmfels for checking if a simplicial complex supports a free resolution of a…

We estimate the Boolean complexity of multiplication of structured matrices by a vector and the solution of nonsingular linear systems of equations with these matrices. We study four basic most popular classes, that is, Toeplitz, Hankel,…

Using three different approaches, we analyze the complexity of various birational maps constructed from simple operations (inversions) on square matrices of arbitrary size. The first approach consists in the study of the images of lines,…

For a graph $G$, Postnikov-Shapiro \cite{PS04} construct two ideals $I_G$ and $J_G.$ $I_G$ is a monomial ideal and $J_G$ is generated by powers of linear forms. They proved the equality of their Hilbert series and conjectured that the…

In this paper, we consider two infinite parametric families of elliptic curves defined over $\mathbb{Q}$ given by the equations $E_{a,b} : y^{2} = x^{3} - a^{2}x + b^{2}$ and $E^{\prime}_{a,b} : y^{2} = x^{3} - a^{2}x + b^{6}$, where $a,b…

We study almost complete intersection ideals in a polynomial ring, generated by powers of all the variables together with a power of their sum. Our main result is an explicit description of the reduced Gr\"obner bases for these ideals under…

We establish necessary and sufficient conditions for an arbitrary polynomial of degree $n$, especially with only real roots, to be trivial, i.e. to have the form a(x-b)^n. To do this, we derive new properties of polynomials and their roots.…

We will find a lower bound on the recognition complexity of the theories that are nontrivial relative to some equivalence relation (this relation may be equality), namely, each of these theories is consistent with the formula, whose sense…

In this article, we study the topological complexity of manifolds with a lower scalar curvature bound. We introduce a small scale index theorem to establish an upper bound for Gromov's simplicial norm of the Poincar\'e dual of the A-hat…

We show that a nontrivial graph isomorphism problem of two undirected graphs, and more generally, the permutation similarity of two given $n\times n$ matrices, is equivalent to equalities of volumes of the induced three convex bounded…

It is known that any finite idempotent algebra that satisfies a nontrivial Maltsev condition must satisfy the linear one-equality Maltsev condition (a variant of the term discovered by M. Siggers and refined by K. Kearnes, P. Markovi\'c,…

Several types of graphs with different conditional independence interpretations --- also known as Markov properties --- have been proposed and used in graphical models. In this paper we unify these Markov properties by introducing a class…

This paper is concerned with the topological invariant of a graph given by the maximum degree of a Markov basis element for the corresponding graph model for binary contingency tables. We describe a degree four Markov basis for the model…

In this paper we show that polyomino ideal of a simple polyomino coincides with the toric ideal of a weakly chordal bipartite graph and hence it has a quadratic Gr\"obner basis with respect to a suitable monomial order.