English
Related papers

Related papers: Counting and testing dominant polynomials

200 papers

We show that the number of real roots of random trigonometric polynomials with i.i.d. coefficients, which are either bounded or satisfy the logarithmic Sobolev inequality, satisfies an exponential concentration of measure.

Probability · Mathematics 2019-12-30 Hoi H. Nguyen , Ofer Zeitouni

A Newman polynomial has all the coefficients in $\{ 0,1\}$ and constant term 1, whereas a Littlewood polynomial has all coefficients in $\{-1,1\}$. We call $P(X)\in\mathbb{Z}[X]$ a Borwein polynomial if all its coefficients belong to $\{…

Number Theory · Mathematics 2016-09-26 Paulius Drungilas , Jonas Jankauskas , Jonas Šiurys

We study the set of algebraic objects known as vanishing polynomials (the set of polynomials that annihilate all elements of a ring) over general commutative rings with identity. These objects are of special interest due to their close…

Commutative Algebra · Mathematics 2023-09-19 Matvey Borodin , Ethan Liu , Justin Zhang

Given a simple graph $G$ on $n$ vertices, a subset of vertices $U \subseteq V(G)$ is dominating if every vertex of $V(G)$ is either in $U$ or adjacent to a vertex of $U$. The domination polynomial of $G$ is the generating function whose…

Combinatorics · Mathematics 2021-10-05 Amanda Burcroff , Grace O'Brien

We consider a dominance order on positive vectors induced by the elementary symmetric polynomials. Under this dominance order we provide conditions that yield simple proofs of several monotonicity questions. Notably, our approach yields a…

Classical Analysis and ODEs · Mathematics 2017-06-26 Suvrit Sra

Let $f(x) = (x^{2}+1)^{n} - a x^{n} \in \mathbb{Z}[x]$ and assume $f(x)$ is irreducible. Let $\theta$ be a root of $f(x)$, set $K= \mathbb{Q}(\theta)$, and denote by $\mathbb{Z}_{K}$ the ring of integers of $K$. The index of $f$, denoted…

Number Theory · Mathematics 2026-02-18 Rupam Barman , Anuj Narode , Vinay Wagh

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

We study Laurent polynomials in any number of variables that are sums of at most $k$ monomials. We first show that the Mahler measure of such a polynomial is at least $h/2^{k-2}$, where $h$ is the height of the polynomial. Next, restricting…

Number Theory · Mathematics 2017-01-24 Edward Dobrowolski , Chris Smyth

A polynomial with coefficients in the ring of integers $\mathcal{O}_{K}$ of a global field $K$ is called intersective if it has a root modulo every finite-indexed subgroup of $\mathcal{O}_{K}$. We prove two criteria for a polynomial…

Number Theory · Mathematics 2022-07-19 Bhawesh Mishra

Let $G$ be a simple graph of order $n$. The domination polynomial of $G$ is the polynomial $D(G, x)=\sum_{i=\gamma(G)}^{n} d(G,i) x^{i}$, where $d(G,i)$ is the number of dominating sets of $G$ of size $i$ and $\gamma(G)$ is the domination…

Combinatorics · Mathematics 2014-07-23 S. Jahari , S. Alikhani

We consider random polynomials whose coefficients are independent and uniform on {-1,1}. We prove that the probability that such a polynomial of degree n has a double root is o(n^{-2}) when n+1 is not divisible by 4 and asymptotic to…

Probability · Mathematics 2017-03-14 Ron Peled , Arnab Sen , Ofer Zeitouni

A polynomial with integer coefficients yields a family of dynamical systems indexed by primes as follows: for any prime $p$, reduce its coefficients mod $p$ and consider its action on the field $\mathbb{F}_p$. The questions of whether and…

Dynamical Systems · Mathematics 2021-04-01 Andrew Bridy , Derek Garton

In this paper, we provide a new method to find all zeros of polynomials with quaternionic coefficients located on only one side of the powers of the variable (these polynomials are called simple polynomials). This method is much more…

Rings and Algebras · Mathematics 2011-09-14 Lianggui Feng , Kaiming Zhao

It is shown that the polynomial \[p(t) = \text{Tr}[(A+tB)^m]\] has positive coefficients when $m = 6$ and $A$ and $B$ are any two 3-by-3 complex Hermitian positive definite matrices. This case is the first that is not covered by prior,…

Mathematical Physics · Physics 2007-07-06 Christopher J. Hillar , Charles R. Johnson

In this paper we investigate the factorization behaviour of the binomial polynomials $\binom{x}{n} = \frac{x(x-1)\cdots (x-n+1)}{n!}$ and their powers in the ring of integer-valued polynomials $\operatorname{Int}(\mathbb{Z})$. While it is…

Commutative Algebra · Mathematics 2022-02-09 Roswitha Rissner , Daniel Windisch

Let \psi(x) be a polynomial with rational coefficients. Suppose that \psi has the positive leading coefficient and zero constant term. Let A be a set of positive integers with the positive upper density. Then there exist x,y\in A and a…

Number Theory · Mathematics 2007-11-08 Hongze Li , Hao Pan

This article presents some interesting and novel results concerning the average modulus of random polynomials on the unit circle and the unit disc, with coefficients distributed as standard normal variates. The paper also introduces new…

Complex Variables · Mathematics 2026-05-19 Sajad A. Sheikh , Mohd. Ibrahim Mir

It is shown that if two hyperbolic polynomials have a particular factorization into quadratics, then their roots satisfy a power majorization relation whenever key coefficients in their factorizations satisfy a corresponding majorization…

Classical Analysis and ODEs · Mathematics 2022-01-20 Minghua Lin , Gord Sinnamon

We study continuity of the roots of nonmonic polynomials as a function of their coefficients using only the most elementary results from an introductory course in real analysis and the theory of single variable polynomials. Our approach…

Classical Analysis and ODEs · Mathematics 2021-12-30 Anthony Stefan , Aaron Welters

We give an algorithm for computing all roots of polynomials over a univariate power series ring over an exact field $\mathbb{K}$. More precisely, given a precision $d$, and a polynomial $Q$ whose coefficients are power series in $x$, the…

Symbolic Computation · Computer Science 2017-05-31 Vincent Neiger , Johan Rosenkilde , Eric Schost