English
Related papers

Related papers: Strength and slice rank of forms are generically e…

200 papers

In this short note we show that every connected reductive simply-connected algebraic group of rank $>1$ over the complex numbers has infinitely many pairs of irreducible representations which are not related by an automorphism of the…

Representation Theory · Mathematics 2026-02-24 Frank Lübeck

We give an effective criterion for the identifiability of additive decompositions of homogeneous forms of degree $d$ in a fixed number of variables. Asymptotically for large $d$ it has the same order of the Kruskal's criterion adapted to…

Algebraic Geometry · Mathematics 2018-11-06 Edoardo Ballico

We study identities of finite dimensional algebras over a field of characteristic zero, graded by an arbitrary groupoid $\Gamma$. First we prove that its graded colength has a polynomially bounded growth. For any graded simple algebra $A$…

Rings and Algebras · Mathematics 2017-01-09 Dušan D. Repovš , Mikhail V. Zaicev

We evaluate the number of monic polynomials (of arbitrary degree $N$) the zeros of which equal their coefficients when these are allowed to take arbitrary complex values. In the following, we call polynomials with this property {\em…

Mathematical Physics · Physics 2017-06-13 Francesco Calogero , Francois Leyvraz

This paper is dedicated to the classification of uniform vector bundles of rank $d+1$ over the Grassmannian $G(d,n)$ ($d\le n-d$) over an algebraically closed field in characteristic $0$. Specifically, we show that all uniform vector…

Algebraic Geometry · Mathematics 2024-03-19 Rong Du , Yuhang Zhou

An important conjecture in additive combinatorics, number theory, and algebraic geometry posits that the partition rank and analytic rank of tensors are equal up to a constant, over any finite field. We prove the conjecture up to a…

Combinatorics · Mathematics 2024-11-04 Guy Moshkovitz , Daniel G. Zhu

In this note, we present an elementary proof of the fact that the slice rank of a trilinear form over a finite field is bounded above by a linear expression in the analytic rank. The existing proofs by Adiprasito-Kazhdan-Ziegler and…

Combinatorics · Mathematics 2025-10-09 Amichai Lampert

Let $K$ be a number field, let $g \geq 1$ be an integer and let $f(x) = (x - a_1) \cdots (x - a_{2g + 1}) \in O_K[x]$ be a polynomial that splits into $2g + 1$ distinct linear factors. Write $C$ for the hyperelliptic curve given by $C: y^2…

Number Theory · Mathematics 2025-09-30 Peter Koymans , Adam Morgan

Suppose $f(x,y)$ is a binary form of degree $d$ with coefficients in a field $K \subseteq \mathbb C$. The $K$-rank of $f$ is the smallest number of $d$-th powers of linear forms over $K$ of which $f$ is a $K$-linear combination. We prove…

Algebraic Geometry · Mathematics 2016-08-31 Bruce Reznick , Neriman Tokcan

We consider a quaternionic analogue of the univariate complex Hermite polynomials and study some of their analytic properties in some detail. We obtain their integral representation as well as the operational formulas of exponential and…

Complex Variables · Mathematics 2018-03-28 Amal El Hamyani , Allal Ghanmi

Heged\H{u}s's lemma is the following combinatorial statement regarding polynomials over finite fields. Over a field $\mathbb{F}$ of characteristic $p > 0$ and for $q$ a power of $p$, the lemma says that any multilinear polynomial $P\in…

Computational Complexity · Computer Science 2023-06-22 Srikanth Srinivasan

In this paper, we resurrect a long-forgotten notion of equivalence for univariate polynomials with integral coefficients introduced by Hermite in the 1850s. We show that the Hermite equivalence class of a polynomial has a very natural…

We prove the existence of complex polynomials $p(z)$ of degree $n$ and $q(z)$ of degree $m<n$ such that the harmonic polynomial $ p(z) + \overline{q(z)}$ has at least $\lceil n \sqrt{m} \rceil$ many zeros. This provides an array of new…

Complex Variables · Mathematics 2023-09-01 Erik Lundberg

We study a question with connections to linear algebra, real algebraic geometry, combinatorics, and complex analysis. Let $p(x,y)$ be a polynomial of degree $d$ with $N$ positive coefficients and no negative coefficients, such that $p=1$…

Complex Variables · Mathematics 2010-05-26 Jiri Lebl , Daniel Lichtblau

We investigate structural properties of the cone of roots of relative Steiner polynomials of convex bodies. We prove that they are closed, monotonous with respect to the dimension, and that they cover the whole upper half-plane, except the…

Metric Geometry · Mathematics 2011-12-21 Martin Henk , María A. Hernández Cifre , Eugenia Saorín

In this paper, we study polynomial-like elements in vector spaces equipped with group actions. We first define these elements via iterated difference operators. In the case of a full rank lattice acting on an Euclidean space, these…

Analysis of PDEs · Mathematics 2018-08-13 Minh Kha , Vladimir Lin

We are concerned with the problem of the stability of the syzygy bundles associated to base point free vector spaces of forms of the same degree d on the projective space of dimension n. We deduce directly, from Mark Green's vanishing…

Algebraic Geometry · Mathematics 2009-09-30 Iustin Coanda

We are interested by holomorphic $d$-webs $W$ of codimension one in a complex $n$-dimensional manifold $M$. If they are ordinary, i.e. if they satisfy to some condition of genericity (whose precise definition is recalled), we proved in [CL]…

Differential Geometry · Mathematics 2017-03-13 Jean Paul Dufour , Daniel Lehmann

We give a conditional proof of the Uniform Boundedness Conjecture of Morton and Silverman in the case of polynomials over number fields, assuming a standard conjecture in arithmetic geometry. Our technique simultaneously yields a dynamical…

Number Theory · Mathematics 2025-12-23 Nicole R. Looper

In this paper, two structural results concerning low degree polynomials over finite fields are given. The first states that over any finite field $\mathbb{F}$, for any polynomial $f$ on $n$ variables with degree $d \le \log(n)/10$, there…

Computational Complexity · Computer Science 2014-04-03 Gil Cohen , Avishay Tal