Related papers: Graver degrees are not polynomially bounded by tru…

We consider the Graver basis, the universal Groebner basis, a Markov basis and the set of the circuits of a toric ideal. Let $A, B$ be any two of these bases such that $A\not \subset B$, we prove that there is no polynomial on the size or…

We prove that for any toric ideal of a graph the degree of any element of Graver basis is bounded above by an exponential function of the maximal degree of a circuit.

The universal Gr\"{o}bner basis of $I$, is a Gr\"{o}bner basis for $I$ with respect to all term orders simultaneously. Let $I_G$ be the toric ideal of a graph $G$. We characterize in graph theoretical terms the elements of the universal…

We give an example where the number of elements of a Groebner basis in a Boolean ring is not polynomially bounded in terms of the bitsize and degrees of the input.

Let $F$ be a non-negatively graded free module over a polynomial ring $\mathbb{K}[x_1,\dots,x_n]$ generated by $m$ basis elements. Let $M$ be a submodule of $F$ generated by elements in $F$ with degrees bounded by $D$ and dim $F/M$=$r$. We…

We study algebras k[x_1,...,x_n]/I which admit a grading by a subsemigroup of N^d such that every graded component is a one-dimensional k-vector space. V.I.~Arnold and coworkers proved that for d = 1 and n <= 3 there are only finitely many…

Suppose $I$ is an ideal of a polynomial ring over a field, $I\subseteq k[x_1,\ldots,x_n]$, and whenever $fg\in I$ with degree $\leq b$, then either $f\in I$ or $g\in I$. When $b$ is sufficiently large, it follows that $I$ is prime.…

It is proved that the universal degree bound for separating polynomial invariants of a finite abelian group (in non-modular characteristic) is strictly smaller than the universal degree bound for generators of polynomial invariants, unless…

We give an explicit upper bound for the degree of a tropical basis of a homogeneous polynomial ideal. As an application f-vectors of tropical varieties are discussed. Various examples illustrate differences between Gr\"obner and tropical…

A universal Gr\"obner basis of an ideal is the union of all its reduced Gr\"obner bases. It is contained in the Graver basis, the set of all primitive elements. Obtaining an explicit description of either of these sets, or even a sharp…

Let $I_A \subset K[x_1,\ldots,x_n]$ be a toric ideal. In this paper, we provide a necessary and sufficient condition for the toric variety $V(I_A)$, over an algebraically closed field, to be expressed as the set-theoretic intersection of…

Let I be a toric ideal. We say I is robust if its universal Groebner basis is a minimal generating set. We show that any robust toric ideal arising from a graph G is also minimally generated by its Graver basis. We then completely…

Let $S=K[x_1,\ldots,x_n]$ be the polynomial ring over the field $K$, and let $I\subset S$ be a graded ideal. It is shown that for $k \gg0$ the postulation number of $I^k$ is bounded by a linear function of $k$, and it is a linear function…

It is proved that for any finite dimensional representation of a prime order group over the field of rational numbers, polynomial invariants of degree at most $3$ separate the orbits. A result providing an upper degree bound for separating…

To any toric ideal $I_A$, encoded by an integer matrix $A$, we associate a matroid structure called {\em the bouquet graph} of $A$ and introduce another toric ideal called {\em the bouquet ideal} of $A$. We show how these objects capture…

We prove that the arithmetic degree of a graded or local ring is bounded above by the arithmetic degree of any of its associated graded rings with respect to ideals $I$ in $A$. In particular, if $Spec (A)$ is equidimensional and has an…

Let $G$ be a finite graph allowing loops, having no multiple edge and no isolated vertex. We associate $G$ with the edge polytope ${\cal P}_G$ and the toric ideal $I_G$. By classifying graphs whose edge polytope is simple, it is proved that…

In this paper, we study toric ideals generated by circuits. For toric ideals which have squarefree quadratic initial ideals, a sufficient condition to be generated by circuits is given. In particular, squarefree Veronese subrings, the…

Given a graded ideal $I$ in a polynomial ring over a field $K$ it is well known, that the number of distinct generic initial ideals of $I$ is finite. While it is known that for a given $d\in\N$ there is a global upper bound for the number…

Two correspondences have been provided that associate any linear code over a finite field with a binomial ideal. In this paper, algorithms for computing their Graver bases and universal Gr\"obner bases are given. To this end, a connection…