English
Related papers

Related papers: Distribution results on polynomials with bounded r…

200 papers

Let $\mathcal{E}_d^{(s)}$ denote the set of coefficient vectors $(a_1,\dots,a_d)\in \mathbb{R}^d$ of contractive polynomials $x^d+a_1x^{d-1}+\dots+a_d\in \mathbb{R}[x]$ that have exactly $s$ pairs of complex conjugate roots and let…

Number Theory · Mathematics 2014-05-08 Peter Kirschenhofer , Mario Weitzer

The Ehrhart polynomial of a convex lattice polytope counts integer points in integral dilates of the polytope. We present new linear inequalities satisfied by the coefficients of Ehrhart polynomials and relate them to known inequalities. We…

Combinatorics · Mathematics 2007-05-23 M. Beck , J. A. De Loera , M. Develin , J. Pfeifle , R. P. Stanley

Schur studied limits of the arithmetic means $A_n$ of zeros for polynomials of degree $n$ with integer coefficients and simple zeros in the closed unit disk. If the leading coefficients are bounded, Schur proved that $\limsup_{n\to\infty}…

Number Theory · Mathematics 2013-07-23 Igor E. Pritsker

Let $S$ be a finite set of primes. The $S$-part $[m]_S$ of a non-zero integer $m$ is the largest positive divisor of $m$ that is composed of primes from $S$. In 2013, Gross and Vincent proved that if $f(X)$ is a polynomial with integer…

Number Theory · Mathematics 2023-09-19 Yann Bugeaud , Jan-Hendrik Evertse , Kálmán Győry

We prove that there is a universal constant $C>0$ so that for every $d \in \mathbb N$, every centered subgaussian distribution $\mathcal D$ on $\mathbb R^d$, and every even $p \in \mathbb N$, the $d$-variate polynomial $(Cp)^{p/2} \cdot…

Data Structures and Algorithms · Computer Science 2024-10-29 Ilias Diakonikolas , Samuel B. Hopkins , Ankit Pensia , Stefan Tiegel

Univariate polynomials are called stable with respect to a domain $D$ if all of their roots lie in $D$. We study linear slices of the space of stable univariate polynomials with respect to a half-plane. We show that a linear slice always…

Algebraic Geometry · Mathematics 2025-08-07 Sebastian Debus , Cordian Riener , Robin Schabert

Consider a $d\times d$ matrix $M$ whose rows are independent centered non-degenerate Gaussian vectors $\xi_1,...,\xi_d$ with covariance matrices $\Sigma_1,...,\Sigma_d$. Denote by $\mathcal{E}_i$ the location-dispersion ellipsoid of…

Probability · Mathematics 2012-06-05 Zakhar Kabluchko , Dmitry Zaporozhets

We show that the Schur polynomials in all primitive $n$th roots of unity are $1$, $0$, or $-1$, if $n$ has at most two distinct odd prime factors. This result can be regarded as a generalization of properties of the coefficients of the…

Combinatorics · Mathematics 2025-09-16 Masaki Hidaka , Minoru Itoh

In this paper, we prove the existence of full dimensional tori for $d$-dimensional nonlinear Schr$\ddot{\mbox{o}}$dinger equation with periodic boundary conditions \begin{equation*}\label{L1} \sqrt{-1}u_{t}+\Delta u+V*u\pm\epsilon…

Analysis of PDEs · Mathematics 2021-06-25 Hongzi Cong , Xiaoqing Wu , Yuan Wu

We investigate Newton's method for complex polynomials of arbitrary degree $d$, normalized so that all their roots are in the unit disk. For each degree $d$, we give an explicit set $\mathcal{S}_d$ of $3.33d\log^2 d(1 + o(1))$ points with…

Dynamical Systems · Mathematics 2016-03-18 Todor Bilarev , Magnus Aspenberg , Dierk Schleicher

Let X be an algebraic curve, defined over a perfect field, and G a divisor on X. If X has sufficiently many points, we show how to construct a divisor D on X such that l(2D-G)=0, of essentially any degree such that this is compatible the…

Algebraic Geometry · Mathematics 2011-03-25 Hugues Randriam

Schur studied limits of the arithmetic means $s_n$ of zeros for polynomials of degree $n$ with integer coefficients and simple zeros in the closed unit disk. If the leading coefficients are bounded, Schur proved that $\limsup_{n\to\infty}…

Number Theory · Mathematics 2013-07-23 Igor E. Pritsker

A beautiful result of Br\"ocker and Scheiderer on the stability index of basic closed semi-algebraic sets implies, as a very special case, that every $d$-dimensional polyhedron admits a representation as the set of solutions of at most…

Metric Geometry · Mathematics 2007-05-23 Martin Grötschel , Martin Henk

We show that for every finite symetric set S of integer vectors, every real trigonometric polynomial on the d dimensional torus with spectrum in S has a zero in every closed ball of diameter D, where D is the sum over S of 1 over 4 times…

Classical Analysis and ODEs · Mathematics 2007-05-23 Gady Kozma , Ferenc Oravecz

The conjecture on roots of Ehrhart polynomials, stated by Matsui et al. \cite[Conjecture 4.10]{MHNOH}, says that all roots $\alpha$ of the Ehrhart polynomial of a Gorenstein Fano polytope of dimension $d$ satisfy $-\frac{d}{2} \leq…

Combinatorics · Mathematics 2012-11-16 Akihiro Higashitani

We prove a result on the representation of squares by second degree polynomials in the field of $p$-adic meromorphic functions in order to solve positively B\"uchi's $n$ squares problem in this field (that is, the problem of the existence…

Complex Variables · Mathematics 2010-03-10 Hector Pasten

We study the zero distribution of non-orthogonal polynomials attached to $g(n)=s(n)=n^2$: \begin{equation*} Q_n^g(x)= x \sum_{k=1}^n g(k) \, Q_{n-k}^g(x), \quad Q_0^g(x):=1. \end{equation*} It is known that the case $g=id$ involves…

Classical Analysis and ODEs · Mathematics 2021-07-13 Bernhard Heim , Markus Neuhauser

This is a short survey about the theory of stable polynomials and its applications. It gives self-contained proofs of two theorems of Schrijver. One of them asserts that for a $d$--regular bipartite graph $G$ on $2n$ vertices, the number of…

Combinatorics · Mathematics 2021-03-15 Péter Csikvári , Ádám Schweitzer

Burkill and Mirsky, and Kalmanson, prove independently that, for every $r\ge 2, n\ge 1$, there is a sequence of $r^{2^n}$ vectors in $\mathbb R^n$, which does not contain a subsequence of $r+1$ vectors $v^1, v^2,\dots,v^{r+1}$ such that,…

Combinatorics · Mathematics 2021-04-20 Lyuben Lichev

In 2015, Guth proved that if $S$ is a collection of $n$ $g$-dimensional semi-algebraic sets in $\mathbb{R}^d$ and if $D\geq 1$ is an integer, then there is a $d$-variate polynomial $P$ of degree at most $D$ so that each connected component…

Computational Geometry · Computer Science 2026-01-13 Pankaj K. Agarwal , Boris Aronov , Esther Ezra , Joshua Zahl
‹ Prev 1 2 3 10 Next ›