Related papers: Stronger bounds on the cost of computing Groebner …
We give an explicit upper bound for the number of equivalence classes of binary forms with rational integral coefficients of given degree and given discriminant, and with given splitting field. Further, we give an explicit upper bound for…
The algebraic form of Hilbert's 13th Problem asks for the resolvent degree $\text{rd}(n)$ of the general polynomial $f(x) = x^n + a_1 x^{n-1} + \ldots + a_n$ of degree $n$, where $a_1, \ldots, a_n$ are independent variables. The resolvent…
Two models were recently proposed to explore the robust hardness of Gr\"obner basis computation. Given a polynomial system, both models allow an algorithm to selectively ignore some of the polynomials: the algorithm is only responsible for…
For any finite field $\mathbb{F}$ and any positive integer $n$ we count the number of monic polynomials of degree $n$ over $\mathbb{F}$ with nonzero constant coefficient and a self-reciprocal factor of any specified degree. An application…
Over finite fields, if the image of a polynomial map is not the entire field, then its cardinality can be bounded above by a significantly smaller value. Earlier results bound the cardinality of the value set using the degree of the…
In this paper, we characterized the relationship between Groebner bases and u-bases: any minimal Groebner basis of the syzygy module for n univariate polynomials with respect to the term-over-position monomial order is its u-basis.…
Current methods for the classification of number fields with small regulator depend mainly on an upper bound for the discriminant, which can be improved by looking for the best possible upper bound of a specific polynomial function over an…
We prove that for any graph $G$ of maximum degree at most $\Delta$, the zeros of its chromatic polynomial $\chi_G(z)$ (in $\mathbb{C}$) lie outside the disk of radius $5.02 \Delta$ centered at $0$. This improves on the previously best known…
In this paper, we obtain several new factorization results for certain classes of polynomials having integer coefficients. In doing so, we use the information about prime factorization of the value taken up by such polynomials and their…
The approximate degree of a Boolean function $f(x_{1},x_{2},\ldots,x_{n})$ is the minimum degree of a real polynomial that approximates $f$ pointwise within $1/3$. Upper bounds on approximate degree have a variety of applications in…
We improve upon the upper bounds for the cardinality of the value set of a multivariable polynomial map over a finite field using the polytope of the polynomial. This generalizes earlier bounds only dependent on the degree of a polynomial.
We provide a new complexity bound for the computation of grevlex Gr\"obner bases in the generic zero-dimensional case, relying on Moreno-Soc\'ias' conjecture. We first formalize a property of regular sequences that implies a well-known…
We provide a uniform bound for the index of cohomology classes in $H^i(F, \mu_\ell^{\otimes i-1})$ when $F$ is a semiglobal field (i.e., a one-variable function field over a complete discretely valued field $K$). The bound is given in terms…
This article presents a technique for proving problems hard for classes of the polynomial hierarchy or for PSPACE. The rationale of this technique is that some problem restrictions are able to simulate existential or universal quantifiers.…
The purpose of this paper is twofold. In the first part we concentrate on hyperplane sections of algebraic schemes, and present results for determining when Gr\"obner bases pass to the quotient and when they can be lifted. The main…
We give results on the question of code optimality for linear codes over finite Frobenius rings for the homogeneous weight. This article improves on the existing Plotkin bound derived in an earlier paper, and suggests a version of a…
We present upper bounds on the bit-size of coefficients of non-radical lexicographical Groebner bases in purely triangular form (triangular sets) of dimension zero. This extends a previous work [Dahan-Schost, Issac'2004], constrained to…
The main goal of this paper is to size up the minimal graded free resolution of a homogeneous ideal in terms of its generating degrees. By and large, this is too ambitious an objective. As understood, sizing up means looking closely at the…
A new efficient algorithm is proposed for factoring polynomials over an algebraic extension field. The extension field is defined by a polynomial ring modulo a maximal ideal. If the maximal ideal is given by its Groebner basis, no extra…
We study finiteness (and vanishing) properties of the higher order degrees associated to complements of complex affine plane curves with mild singularities at infinity. Our results impose new obstructions on the class of groups that can be…