English
Related papers

Related papers: Upper Bounds on Polynomial Root Separation

200 papers

Let $f(t,y,y')=\sum_{i=0}^n a_i(t,y)y'^i=0$ be an irreducible first order ordinary differential equation with polynomial coefficients. Eremenko in 1998 proved that there exists a constant $C$ such that every rational solution of…

Classical Analysis and ODEs · Mathematics 2022-01-28 Shuang Feng , Li-Yong Shen

In this paper we partially settle our conjecture from [1] (math.SP/0701143) on roots of eigenpolynomials for degenerate exactly-solvable operators. Namely, for any such operator, we establish a lower bound (which supports our conjecture)…

Spectral Theory · Mathematics 2007-05-23 Tanja Bergkvist , Jan-Erik Bjork

Univariate polynomial root-finding is a classical subject, still important for modern computing. Frequently one seeks just the real roots of a real coefficient polynomial. They can be approximated at a low computational cost if the…

Numerical Analysis · Mathematics 2015-06-16 Victor Y. Pan , Liang Zhao

Let $R$ be a polynomial ring over a field and $M= \bigoplus_n M_n$ a finitely generated graded $R$-module, minimally generated by homogeneous elements of degree zero with a graded $R$-minimal free resolution $\mathbf{F}$. A Cohen-Macaulay…

Commutative Algebra · Mathematics 2021-01-01 Sabine El Khoury , Manoj Kummini , Hema Srinivasan

Given a model of a system and an objective, the model-checking question asks whether the model satisfies the objective. We study polynomial-time problems in two classical models, graphs and Markov Decision Processes (MDPs), with respect to…

Data Structures and Algorithms · Computer Science 2016-02-09 Krishnendu Chatterjee , Wolfgang Dvořák , Monika Henzinger , Veronika Loitzenbauer

Let $\mathbb{F}_q$ be a finite field with $q$ elements, $f \in \mathbb{F}_q[x_1, \dots, x_n]$ a polynomial in $n$ variables and let us denote by $N(f)$ the number of roots of $f$ in $\mathbb{F}_q^n$. %Many authors, such as Wei Cao and Kung…

Number Theory · Mathematics 2023-12-08 José Gustavo Coelho , Fabio Enrique Brochero Martínez

P\'olya's Positivstellensatz on the $1$-simplex says that if $P(x)$ is a real polynomial such that $P(x)>0$ whenever $x \ge 0$, then all the coefficients of $(1+x)^mP(x)$ are positive whenever $m$ is large. Powers-Reznick gave a complexity…

Algebraic Geometry · Mathematics 2018-02-09 Ze Kang Tan

Let $f \in C^n(\mathbb{R})$ be such that $\Vert f^{(n)} \Vert_\infty < \infty$. Let $f^{[n]} \in C(\mathbb{R}^{n+1})$ be the $n$th order divided difference. A special case of our main result states that for $1 < p < \infty$ we have \[\Vert…

Functional Analysis · Mathematics 2026-03-20 Martijn Caspers , Jesse Reimann

This note deals with some effective results in Mahler's method. In a recent work, we used a theorem of Philippon to show that given a Mahler function $f(z)$ in ${\bf k}\{z\}$, where ${\bf k}$ denotes a number field, and an algebraic number…

Number Theory · Mathematics 2016-10-31 Boris Adamczewski , Colin Faverjon

In this note, we prove an irreducibility criterion for the polynomial of the form $f(x) = a_{n}x^{n} + a_{n-1}x^{n-1} + \cdots + a_{m}x^{m} + p^{u} \in \mathbb{Z}[x]$, where $p$ is a prime number, $u \geqslant 1$, $\gcd(u, m) = 1$, $p \nmid…

Number Theory · Mathematics 2023-03-08 Zhang Weilin , Yuan Pingzhi

We show that an oracle A that contains either 1/4 or 3/4 of all strings of length n can be used to separate EQP from the counting classes MOD_{p^k}P. Our proof makes use of the degree of a representing polynomial over the finite field of…

Quantum Physics · Physics 2007-05-23 M. de Graaf , P. Valiant

We obtain various irreducibility criteria for pairs of polynomials $(f(X),g(X))$ with integer coefficients whose resultant $Res(f,g)$ is a prime number, or is divisible by a sufficiently large prime number, and also for some of their linear…

Number Theory · Mathematics 2025-04-25 Nicolae Ciprian Bonciocat

We give a lower bound for the degree of an irreducible factor of a given polynomial. This improves and generalizes the results obtained in [4, On the irreducible factors of a polynomial, Proc. Amer. Math. Soc., 148 (2020] 1429 -- 1437].

Number Theory · Mathematics 2020-08-03 Anuj Jakhar , Srinivas Koytada

In 2006, Arveson resolved a long-standing problem by showing that for any element $x$ of a separable self-adjoint unital subspace $S\subseteq B(H)$, $\|x\|=\sup\|\pi(x)\|$, where $\pi$ runs over the boundary representations for $S$. Here we…

Operator Algebras · Mathematics 2011-10-20 Craig Kleski

In this note we aim to give a new, elementary proof of a statement that was first proved by Timofte. It says that a symmetric real polynomial $F$ of degree $d$ in $n$ variables is positive on $\R^n$ (on $\R^{n}_{\geq 0}$) if and only if it…

Algebraic Geometry · Mathematics 2013-03-22 Cordian Riener

The Schm\"udgen's Positivstellensatz gives a certificate to verify positivity of a strictly positive polynomial $f$ on a compact, basic, semi-algebraic set $\mathbf{K} \subset \mathbb{R}^n$. A Positivstellensatz of this type is called…

Optimization and Control · Mathematics 2024-12-19 Etienne de Klerk , Juan Vera Lizcano

Let $U^N = (U_1^N,\dots, U^N_p)$ be a d-tuple of $N\times N$ independent Haar unitary matrices and $Z^{NM}$ be any family of deterministic matrices in $\mathbb{M}_N(\mathbb{C})\otimes \mathbb{M}_M(\mathbb{C})$. Let $P$ be a self-adjoint…

Probability · Mathematics 2021-10-01 Félix Parraud

We prove an improvement on Schmidt's upper bound on the number of number fields of degree $n$ and absolute discriminant less than X for $6 \leq n \leq 94$. We carry this out by improving and applying a uniform bound on the number of monic…

Number Theory · Mathematics 2022-10-04 Manjul Bhargava , Arul Shankar , Xiaoheng Wang

Let $p$ be a prime. Suppose that integers $r$, $e$, $d$ such that $r \ge 2$, $e \ge 0$, $0 \le d \le p$ are given. Let $f(x)=s_0 x^r + s_1 x^{r-1} + \cdots + s_r$ be a generic polynomial of degree $r$ in characteristic $p$. We put…

Number Theory · Mathematics 2026-05-29 Akira Kurihara

The goal of this paper is to present a lower bound for the Mahler volume of at least 4-dimensional symmetric convex bodies. We define a computable dimension dependent constant through a 2-dimensional variational (max-min) procedure and…

Metric Geometry · Mathematics 2018-05-08 Yashar Memarian