English
Related papers

Related papers: The Multivariate Schwartz-Zippel Lemma

200 papers

The Jack symmetric polynomials $P_\lambda^{(\alpha)}$ form a class of symmetric polynomials which are indexed by a partition $\lambda$ and depend rationally on a parameter $\alpha$. They reduced to the Schur polynomials when $\alpha=1$, and…

alg-geom · Mathematics 2008-02-03 Hiraku Nakajima

In the late 1980s, A. Premet conjectured that the variety of nilpotent elements of any finite dimensional restricted Lie algebra over an algebraically closed field of characteristic $p>0$ is irreducible. This conjecture remains open, but it…

Rings and Algebras · Mathematics 2019-10-03 Cong Chen

Kim defined a very general combinatorial abstraction of the diameter of polytopes called subset partition graphs to study how certain combinatorial properties of such graphs may be achieved in lower bound constructions. Using Lov\'asz'…

Combinatorics · Mathematics 2012-03-08 Nicolai Hähnle

We study zeros of polynomials in the multivariate skew polynomial ring $D[x_1,\ldots,x_n; \sigma]$, where $\sigma$ is an automorphism of a division ring $D$. We prove a generalization of Alon's celebrated Combinatorial Nullstellensatz for…

Commutative Algebra · Mathematics 2025-08-15 Gil Alon , Angelot Behajaina , Elad Paran

We make a generalization of the type C monomial space of a single variable, which was introduced in the construction of type C N-fold supersymmetry, to several variables. Then, we construct the most general quasi-solvable second-order…

High Energy Physics - Theory · Physics 2007-05-23 Toshiaki Tanaka

We generalize classical triangular Schubert puzzles to puzzles with convex polygonal boundary. We give these puzzles a geometric Schubert calculus interpretation and derive novel combinatorial commutativity statements, using purely…

Combinatorics · Mathematics 2024-06-13 Portia Anderson

Most integers are composite and most univariate polynomials over a finite field are reducible. The Prime Number Theorem and a classical result of Gau{\ss} count the remaining ones, approximately and exactly. For polynomials in two or more…

Commutative Algebra · Mathematics 2014-07-14 Joachim von zur Gathen , Konstantin Ziegler

The usual theory of negative type (and $p$-negative type) is heavily dependent on an embedding result of Schoenberg, which states that a metric space isometrically embeds in some Hilbert space if and only if it has 2-negative type. A…

Functional Analysis · Mathematics 2023-09-29 Gavin Robertson

For a bivariate $P(x,y) \in \mathbb{R}[x,y]\setminus (\mathbb{R}[x] \cup \mathbb{R}[y])$, our first result shows that for all finite $A \subseteq \mathbb{R}$, $|P(A,A)|\geq \alpha|A|^{5/4}$ with $\alpha =\alpha(\mathrm{deg} P) \in…

Logic · Mathematics 2022-12-14 Yifan Jing , Souktik Roy , Chieu-Minh Tran

Let $p$ be a polynomial in the non-commuting variables $(a,x)=(a_1,...,a_{g_a},x_1,...,x_{g_x})$. If $p$ is convex in the variables $x$, then $p$ has degree two in $x$ and moreover, $p$ has the form $p = L + \Lambda ^T \Lambda,$ where $L$…

Functional Analysis · Mathematics 2008-04-07 Damon M. Hay , J. William Helton , Adrian Lim , Scott McCullough

Let $z_1, \dots, z_m$ be $m$ distinct complex numbers, normalized to $|z_k| = 1$, and consider the polynomial $$ p_{m}(z) = \prod_{k=1}^{m}{(z-z_k)}.$$ We define a sequence of polynomials in a greedy fashion, $$ p_{N+1}(z) = p_{N}(z)…

Classical Analysis and ODEs · Mathematics 2021-09-16 Stefan Steinerberger

The geometric and algebraic theory of monomial ideals and multigraded modules is initiated over real-exponent polynomial rings and, more generally, monoid algebras for real polyhedral cones. The main results include the generalization of…

Commutative Algebra · Mathematics 2025-11-11 Ezra Miller

We consider a system of integer polynomials of the same degree with non-singular local zeros and in many variables. Generalising the work of Birch (1962) we find quantitative asymptotics (in terms of the maximum of the absolute value of the…

Number Theory · Mathematics 2020-11-10 Jan-Willem M. van Ittersum

Let D be a masa in B(H) where H is a separable Hilbert space. We find real numbers \eta_0 < \eta_1 < \eta_2 < ... < \eta_6 so that for every bounded, normal D-bimodule map {\Phi} on B(H) either ||\Phi|| > \eta_6, or ||\Phi|| = \eta_k for…

Functional Analysis · Mathematics 2014-06-16 Rupert H. Levene

Let $f(z)$ be a degree $d$ polynomial with zeros $z_i$. For arbitrary $m$ we construct explicit set of fixed points (attractors) of NRS($m$), and prove a factored formula for the Jacobian at these points. We prove that if NRS(2), when…

Combinatorics · Mathematics 2025-09-18 Mario DeFranco

If $\mathcal{P}$ is a lattice polytope (i.e., $\mathcal{P}$ is the convex hull of finitely many integer points in $\mathbb{R}^d$), Ehrhart's famous theorem (1962) asserts that the integer-point counting function $|t \mathcal{P} \cap…

Combinatorics · Mathematics 2026-05-05 Matthias Beck , Thomas Kunze

In this work, we study the Hermite interpolation on $n$-dimensional non-equally spaced, rectilinear grids over a field $\Bbbk $ of characteristic zero, given the values of the function at each point of the grid and the partial derivatives…

Any homogeneous polynomial $P(x, y, z)$ of degree $d$, being restricted to a unit sphere $S^2$, admits essentially a unique representation of the form $\lambda + \sum_{k = 1}^d [\prod_{j = 1}^k L_{kj}]$, where $L_{kj}$'s are linear forms in…

Complex Variables · Mathematics 2007-05-23 Gabriel Katz

We present an exact and complete algorithm to isolate the real solutions of a zero-dimensional bivariate polynomial system. The proposed algorithm constitutes an elimination method which improves upon existing approaches in a number of…

Mathematical Software · Computer Science 2010-10-08 Eric Berberich , Pavel Emeliyanenko , Michael Sagraloff

Root separation bounds play an important role as a complexity measure in understanding the behaviour of various algorithms in computational algebra, e.g., root isolation algorithms. A classic result in the univariate setting is the…

Symbolic Computation · Computer Science 2020-05-19 Vikram Sharma