Related papers: Improved Debordering of Waring Rank

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…

A 1993 result of Alon and F\"uredi gives a sharp upper bound on the number of zeros of a multivariate polynomial over an integral domain in a finite grid, in terms of the degree of the polynomial. This result was recently generalized to…

For a subset $D$ of boxes in an $n\times n$ square grid, let $\chi_{D}(x)$ denote the dual character of the flagged Weyl module associated to $D$. It is known that $\chi_{D}(x)$ specifies to a Schubert polynomial (resp., a key polynomial)…

In this note we show that the complete symmetric polynomials are dual generators of compressed artinian Gorenstein algebras satisfying the Strong Lefschetz Property. This is the first example of an explicit dual form with these properties.…

The permanent vs. determinant problem is one of the most important problems in theoretical computer science, and is the main target of geometric complexity theory proposed by Mulmuley and Sohoni. The current best lower bound for the…

We obtain a new lower bound on the size of value set f(F_p) of a sparse polynomial f in F_p[X] over a finite field of p elements when p is prime. This bound is uniform with respect of the degree and depends on some natural arithmetic…

Waring problem for homogeneus forms asks for additive decomposition of a form $f$ into powers of linear forms. A classical problem is to determine when such a decomposition is unique. In this note I refine the work in arXiv:math/0406288v1…

Cilleruelo conjectured that for an irreducible polynomial $f \in \mathbb{Z}[X]$ of degree $d \geq 2$, denoting $$L_f(N)=\mathrm{lcm}(f(1),f(2),\ldots f(N))$$ one has $$\log L_f(n)\sim(d-1)N\log N.$$ He proved it in the case $d=2$ but it…

In this paper, we are interested in the problem of scattering by strictly convex obstacles in the plane. We provide an upper bound for the number $N(r,\gamma)$ of resonances in the box $\{r \le \Re(\lambda) \le r + 1$; $\Im(\lambda) \ge -…

We prove that all polynomials in several variables can be decomposed as the sums of $k$th powers: $P(x_1,...,x_n) = Q_1(x_1,...,x_n)^k+...+ Q_s(x_1,...,x_n)^k$, provided that elements of the base field are themselves sums of $k$th powers.…

We give an upper bound for the cactus rank of any multi-homogeneous polynomial.

We determine the Waring rank of the fundamental skew invariant of any complex reflection group whose highest degree is a regular number. This includes all irreducible real reflection groups.

In this paper, we give sharp upper and lower bounds for the number of degenerate monic (and arbitrary, not necessarily monic) polynomials with integer coefficients of fixed degree $n \ge 2$ and height bounded by $H \ge 2$. The polynomial is…

We provide explicit and polynomial bounds for the Homogeneous Wall Lemma which occurred for the first time implicitly in the $13$th entry of Robertson and Seymour's Graph Minors Series [JCTB 1990] and has since become a cornerstone in the…

Apolarity is an important tool in commutative algebra and algebraic geometry which studies a form, $f$, by the action of polynomial differential operators on $f$. The quotient of all polynomial differential operators by those which…

We prove that $\mathrm{deg}(f) \leq \widetilde{O}(\mathrm{rdeg}(f)^3)$ for every Boolean function $f$, where $\mathrm{deg}(f)$ is the degree of $f$ and $\mathrm{rdeg}(f)$ is the rational degree of $f$. This resolves the second of the three…

We prove new combinatorial results about polynomial configurations in large subsets of finite fields. Bergelson--Leibman--McCutcheon (2005) showed that for any polynomial $P(x) \in \mathbb{Z}[x]$ with $P(0) = 0$, if $A \subseteq…

We provide conditions on the coefficients of a ternary cubic form that determine its Waring rank.

The second author proved that the set of post-critically finite polynomials of given degree is a set of bounded height, up to change of variables. Motivated by an observation about unicritical polynomials, we complement this by proving that…

The determinantal complexity of a polynomial $P \in \mathbb{F}[x_1, \ldots, x_n]$ over a field $\mathbb{F}$ is the dimension of the smallest matrix $M$ whose entries are affine functions in $\mathbb{F}[x_1, \ldots, x_n]$ such that $P =…