English
Related papers

Related papers: On degree bounds for the sparse Nullstellensatz

200 papers

Understanding bounds for the effective differential Nullstellensatz is a central problem in differential algebraic geometry. Recently, several bounds have been obtained using Dicksonian and antichains sequences (with a given growth rate).…

Commutative Algebra · Mathematics 2020-11-17 Omar León Sánchez , Alexey Ovchinnikov

When we consider the action of a finite group on a polynomial ring, a polynomial unchanged by the action is called an invariant polynomial. A famous result of Noether states that in characteristic zero the maximal degree of a minimal…

Commutative Algebra · Mathematics 2021-08-05 Francesca Gandini

Let $K$ be a number field of degree $n$ with ring of integers $O_K$. By means of a criterion of Gilmer for polynomially dense subsets of the ring of integers of a number field, we show that, if $h\in K[X]$ maps every element of $O_K$ of…

Number Theory · Mathematics 2018-10-03 Giulio Peruginelli

We show that there exists a saturated graded ideal in a standard graded polynomial ring which has the largest total Betti numbers among all saturated graded ideals for a fixed Hilbert polynomial.

Commutative Algebra · Mathematics 2016-01-20 Giulio Caviglia , Satoshi Murai

We prove that for polynomials $f, g, h \in \mathbb{Z}[x]$ satisfying $f = gh$ and $f(0) \neq 0$, the $\ell_2$-norm of the cofactor $h$ is bounded by $\|h\|_2 \leq \|f\|_1 \cdot\left( \widetilde{O}\left(\|g\|_0^3 \frac{\text{deg…

Symbolic Computation · Computer Science 2026-04-01 Ido Nahshon , Amir Shpilka

This paper establishes Noether's classical degree bound $\beta(G) \le |G|$ for finite and linearly reductive group schemes. On the other hand, we provide examples of infinitesimal group schemes where $\beta(G)$ is unbounded. We also…

Commutative Algebra · Mathematics 2025-06-02 Gregor Kemper , Christian Liedtke , Christiane Ott

We compute the Hilbert coefficients of a graded module with pure resolution and discuss lower and upper bounds for these coefficients for arbitrary graded modules.

Commutative Algebra · Mathematics 2007-06-05 Juergen Herzog , Xinxian Zheng

The degree of a point configuration is defined as the maximal codimension of its interior faces. This concept is motivated from a corresponding Ehrhart-theoretic notion for lattice polytopes and is related to neighborly polytopes and the…

Combinatorics · Mathematics 2013-08-28 Benjamin Nill , Arnau Padrol

We improve Mahler's lower bound for the Mahler measure in terms of the discriminant and degree for a specific class of polynomials: complex monic polynomials of degree $d\geq 2$ such that all roots with modulus greater than some fixed value…

Number Theory · Mathematics 2023-09-19 Murray Child , Martin Widmer

We extend previous results about Putinar's Positivstellensatz for cylinders of type $S \times {\mathbb R}$ to sets of type $S \times {\mathbb R}^r$ in some special cases taking into account $r$ and the degree of the polynomial with respect…

Algebraic Geometry · Mathematics 2021-05-20 Paula Escorcielo , Daniel Perrucci

The paper deals with the {\it infinitesimal Hilbert 16th problem}: to find an upper estimate of the number of zeros of an Abelian integral regarded as a function of a parameter. In more details, consider a real polynomial $ H$ of degree $…

Dynamical Systems · Mathematics 2007-05-23 A. A. Glutsyuk , Yu. S. Ilyashenko

The solving degree is an important parameter for estimating the complexity of solving a system of polynomial equations. In this paper, we provide an upper bound for the solving degree in terms of the degree of regularity. We also show that…

Commutative Algebra · Mathematics 2023-04-27 Flavio Salizzoni

The conjecture of Kalai, Kleinschmidt, and Lee on the number of empty simplices of a simplicial polytope is established by relating it to the first graded Betti numbers of the polytope. The proof allows us to derive explicit optimal bounds…

Commutative Algebra · Mathematics 2007-05-23 Uwe Nagel

We give an explicit upper bound for the algebraic degree and an explicit lower bound for the absolute value of the minimum of a polynomial function on a compact connected component of a basic closed semialgebraic set when this minimum is…

Algebraic Geometry · Mathematics 2011-12-05 Gabriela Jeronimo , Daniel Perrucci , Elias Tsigaridas

For each $n$, let $\text{RD}(n)$ denote the minimum $d$ for which there exists a formula for the general polynomial of degree $n$ in algebraic functions of at most $d$ variables. In 1945, Segre called for a better understanding of the large…

Algebraic Geometry · Mathematics 2021-07-20 Alexander J. Sutherland

We prove nilpotency results for Lie algebras over an arbitrary field admitting a derivation, which satisfies a given polynomial identity $r(t)=0$. For the polynomial $r=t^n-1$ we obtain results on the nilpotency of Lie algebras admitting a…

Rings and Algebras · Mathematics 2021-03-09 D. Burde , W. A. Moens

We obtain tight bounds for the minimal number of generators of an ideal with bounded-degree generators in a polynomial ring $K[X_1,\dots,X_n],$ as well as a sharp quantification of the maximum possible size of a minimal generating set of…

Commutative Algebra · Mathematics 2025-09-23 Andrei Mandelshtam

In this paper we give a version of Krivine-Stengle's Positivstellensatz, Schweighofer's Positivstellensatz, Scheiderer's local-global principle, Scheiderer's Hessian criterion and Marshall's boundary Hessian conditions for polynomial…

Algebraic Geometry · Mathematics 2019-02-19 Công-Trình Lê

We obtain polylogarithmic bounds in the polynomial Szemer\'{e}di theorem when the polynomials have distinct degrees and zero constant terms. Specifically, let $P_1, \dots, P_m \in \mathbb Z[y]$ be polynomials with distinct degrees, each…

Number Theory · Mathematics 2025-11-12 Xuancheng Shao , Mengdi Wang

One of the biggest open problems in computational algebra is the design of efficient algorithms for Gr{\"o}bner basis computations that take into account the sparsity of the input polynomials. We can perform such computations in the case of…

Symbolic Computation · Computer Science 2018-06-22 Matías Bender , Jean-Charles Faugère , Elias Tsigaridas
‹ Prev 1 4 5 6 7 8 10 Next ›