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

In this article, we disprove a conjecture of F. Alarc\'on and D. Anderson and give a complete classification of the prime ideals in the one variable polynomial semiring with coefficients in Boolean semifield. We group the prime ideals of…

Bounds for the maximal degree of certain Gr\"obner bases of simplicial toric ideals are given. These bounds are close to the bound stated in Eisenbud-Goto's Conjecture on the Castelnuovo-Mumford regularity.

In this paper, we study ideals spanned by polynomials or overconvergent series in a Tate algebra. With state-of-the-art algorithms for computing Tate Gr{\"o}bner bases, even if the input is polynomials, the size of the output grows with the…

Let $A$ be a finite dimensional real algebra with a division grading by a finite abelian group $G$. In this paper we provide finite basis for the $T_G$-ideal of graded identities and for the $T_G$-space of graded central polynomials for…

This article concerns commutative algebras over a field $k$ of characteristic zero which are finite dimensional as vectorspaces, and particularly those of such algebras which are graded. Here the term graded is applied to non-negatively…

For each 3-dimensional non-Lie Leibniz algebra over the complex numbers, we describe the algebra of polynomial invariants and determine its group of automorphisms. As a consequence, we establish that any two non-nilpotent 3-dimensional…

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 the higher iterated Hilbert coefficients of the graded $S$-modules $\Tor_i^S(M,I^k)$ and $\Ext^i_S(M,I^k)$ are…

In this paper we give an Immerman's Theorem for real-valued computation. We define circuits operating over real numbers and show that families of such circuits of polynomial size and constant depth decide exactly those sets of vectors of…

Suppose a graph has no large balanced bicliques, but has large minimum degree. Then what can we say about its induced subgraphs? This question motivates the study of degree-boundedness, which is like $\chi$-boundedness but for minimum…

Let $E\supseteq F$ be a field extension and $M$ a graded Lie algebra of maximal class over $E$. We investigate the $F$-subalgebras $L$ of $M$, generated by elements of degree $1$. We provide conditions for $L$ being either ideally…

Assume $R$ is a polynomial ring over a field and $I$ is a homogeneous Gorenstein ideal of codimension $g\ge3$ and initial degree $p\ge2$. We prove that the number of minimal generators $\nu(I_p)$ of $I$ that are in degree $p$ is bounded…

We study minimal reductions of edge ideals of graphs and determine restrictions on the coefficients of the generators of these minimal reductions. We prove that when $I$ is not basic, then $\core{I}\subset \m I$, where $I$ is an edge ideal…

Let K be a field and let S = K[x_1, ..., x_n] be a polynomial ring. Consider a homogenous ideal I in S. Let t_i denote reg(Tor_i (S/I, K)), the maximal degree of an ith syzygy of S/I. We prove bounds on the numbers t_i for i > n/2 purely in…

Given a trivially graded polynomial ring $A=K[a_1,\dots,a_m]$ over a field $K$ and a positively graded polynomial ring $P=A[x_1,\dots,x_k]$, we study graded rings $R=P/I$, where $I$ is a homogeneous ideal in $P$ such that $I\cap A = \{0\}$.…

Using the Gr\"obner basis of an ideal generated by a family of polynomials we prove that every planar graph is 4-colorable. Here we also use the fact that the complete graph of 5 vertices is not included in any planar graph.

We present examples which show that in dimension higher than one or codimension higher than two, there exist toric ideals I_A such that no binomial ideal contained in I_A and of the same dimension is a complete intersection. This result has…

Let $I\supsetneq J$ be two squarefree monomial ideals of a polynomial algebra over a field generated in degree $\geq d$, resp. $\geq d+1$ . Suppose that $I$ is generated by three monomials of degrees $d$. If the Stanley depth of $I/J$ is…

We prove that the number of limit cycles generated by a small non-conservative perturbation of a Hamiltonian polynomial vector field on the plane, is bounded by a double exponential of the degree of the fields. This solves the long-standing…

Assuming that no family of polynomial-size Boolean circuits can factorize a constant fraction of all products of two $n$-bit primes, we show that the bounded arithmetic theory $\text{PV}_1$, even when augmented by the sharply bounded choice…

We obtain a polynomial upper bound in the finite-field version of the multidimensional polynomial Szemer\'{e}di theorem for distinct-degree polynomials. That is, if $P_1, ..., P_t$ are nonconstant integer polynomials of distinct degrees and…