Related papers: Discriminant and root separation of integral polyn…

For $G=G_{n, 1/2}$, the Erd\H{o}s--Renyi random graph, let $X_n$ be the random variable representing the number of distinct partitions of $V(G)$ into sets $A_1, \ldots, A_q$ so that the degree of each vertex in $G[A_i]$ is divisible by $q$…

Given a subset $\mathcal{S}\subseteq \mathbb{F}_q[x]$ and fixed integers $n,m\in \mathbb{N}$, we study the distribution of the smallest denominator $Q\in \mathcal{S}$ for which there exists $\mathbf{P}\in \mathbb{F}_q[x]^m$ such that…

We characterize the limiting distributions of random variables of the form $P_n\left( (X_i)_{i \ge 1} \right)$, where: (i) $(P_n)_{n \ge 1}$ is a sequence of multivariate polynomials, each potentially involving countably many variables;…

We show that the proportion of polynomials of degree $n$ over the finite field with $q$ elements, which have a divisor of every degree below $n$, is given by $c_q n^{-1} + O(n^{-2})$. More generally, we give an asymptotic formula for the…

Let $f \in { \mathbb R} ( t) [x]$ be given by $ f(t, x) = x^n + t \cdot g(x) $ and $\beta_1 < \dots < \beta_m$ the distinct real roots of the discriminant $\Delta_{(f, x)} (t)$ of $f(t, x)$ with respect to $x$. Let $\gamma$ be the number of…

The absolute separation of a polynomial is the minimum nonzero difference between the absolute values of its roots. In the case of polynomials with integer coefficients, it can be bounded from below in terms of the degree and the height…

Consider a random polynomial $G_n(z)=\xi_nz^n+...+\xi_1z+\xi_0$ with i.i.d. complex-valued coefficients. Suppose that the distribution of $\log(1+\log(1+|\xi_0|))$ has a slowly varying tail. Then the distribution of the complex roots of…

For the family $P:=x^n+a_1x^{n-1}+\cdots +a_n$ of complex polynomials in the variable $x$ we study its {\em discriminant} $R:=$Res$(P,P',x)$, $R\in \mathbb{C}[a]$, $a=(a_1,\ldots ,a_n)$. When $R$ is regarded as a polynomial in $a_k$, one…

Denote by $x$ a random infinite path in the graph of Pascal's triangle (left and right turns are selected independently with fixed probabilities) and by $d_n(x)$ the binomial coefficient at the $n$'th level along the path $x$. Then for a…

Let $P_n(x) = \sum_{k=0}^{n} \xi_k x^k$ be a Kac random polynomial, where the coefficients $\xi_k$ are i.i.d.\ copies of a given random variable $\xi$. Based on numerical experiments, it has been conjectured that if $\xi$ has mean zero,…

A polynomial is expansive if all of its roots lie outside the unit circle. We define some special determinants involving the coefficients of a real polynomial and formulate necessary and sufficient conditions for expansivity using these…

In this paper, the discriminant of homogeneous polynomials is studied in two particular cases: a single homogeneous polynomial and a collection of n-1 homogeneous polynomials in n variables. In these two cases, the discriminant is defined…

For a given set of integers $\mathcal{S}$, let $\mathcal{R}_n^*(\mathcal{S})$ denote the set of reducible polynomials $f(X)=a_nX^n+a_{n-1}X^{n-1}+\cdots+a_1X+a_0$ over $\mathbb{Z}[X]$ with $a_i\in\mathcal{S}$ and $a_0a_n\ne 0$. In this…

We consider a primitive distance-regular graph $\Gamma$ with diameter at least $3$. We use the intersection numbers of $\Gamma$ to find a positive semidefinite matrix $G$ with integer entries. We show that $G$ has determinant zero if and…

The independence polynomial of a graph $G$ is the generating polynomial corresponding to its independent sets of different sizes. More formally, if $a_k(G)$ denotes the number of independent sets of $G$ of size $k$ then \[I(G,z) \as…

We classify the discriminantly separable polynomials of degree two in each of three variables, defined by a property that all the discriminants as polynomials of two variables are factorized as products of two polynomials of one variable…

Let $G$ be a simple graph of order $n$. An independent set in a graph is a set of pairwise non-adjacent vertices. The independence polynomial of $G$ is the polynomial $I(G,x)=\sum_{k=0}^{n} s(G,k) x^{k}$, where $s(G,k)$ is the number of…

Let $H_{m}(z)$ be a sequence of polynomials whose generating function $\sum_{m=0}^{\infty}H_{m}(z)t^{m}$ is the reciprocal of a bivariate polynomial $D(t,z)$. We show that in the three cases $D(t,z)=1+B(z)t+A(z)t^{2}$,…

Let $n\in\mathbb{N}$ be fixed, $Q>1$ be a real parameter and $\mathcal{P}_n(Q)$ denote the set of polynomials over $\mathbb{Z}$ of degree $n$ and height at most $Q$. In this paper we investigate the following counting problems regarding…

In this paper we investigate the uniform distribution properties of polynomials in many variables and bounded degree over a fixed finite field F of prime order. Our main result is that a polynomial P : F^n -> F is poorly-distributed only if…