Related papers: Discriminant and root separation of integral polyn…

Let $D$ be a subset of a finite commutative ring $R$ with identity. Let $f(x)\in R[x]$ be a polynomial of positive degree $d$. For integer $0\leq k \leq |D|$, we study the number $N_f(D,k,b)$ of $k$-subsets $S\subseteq D$ such that…

Let $D_n(x;a)$ and $E_n(x;a)\in\mathbb F_q[x]$ be Dickson polynomials of first and second kind respectively, where $\mathbb F_q$ is a finite field with $q$ elements. In this article we show explicitly the irreducible factors these…

Let $(a_n), (b_n)$ be linear recursive sequences of integers with characteristic polynomials $A(X),B(X)\in \mathbb{Z}[X]$ respectively. Assume that $A(X)$ has a dominating and simple real root $\alpha$, while $B(X)$ has a pair of conjugate…

This article studies separating invariants for the ring of multisymmetric polynomials in $m$ sets of $n$ variables over an arbitrary field $\mathbb{K}$. We prove that in order to obtain separating sets it is enough to consider polynomials…

We consider random polynomials whose coefficients are independent and identically distributed on the integers. We prove that if the coefficient distribution has bounded support and its probability to take any particular value is at most…

Let $(G_n(x))_{n=0}^\infty$ be a $d$-th order linear recurrence sequence having polynomial characteristic roots, one of which has degree strictly greater than the others. Moreover, let $m\geq 2$ be a given integer. We ask for…

Let $G$ be a simple graph of order n. The domination polynomial of G is the polynomial D(G,x) =\sum d(G, i)x^i, where d(G,i) is the number of dominating sets of G of size i. Every root of D(G,x) is called the domination root of G. It is…

Let $G_1,..., G_n \in \Fp[X_1,...,X_m]$ be $n$ polynomials in $m$ variables over the finite field $\Fp$ of $p$ elements. A result of {\'E}. Fouvry and N. M. Katz shows that under some natural condition, for any fixed $\varepsilon$ and…

We study the number of irreducible polynomials over $\mathbf{F}_{q}$ with some coefficients prescribed. Using the technique developed by Bourgain, we show that there is an irreducible polynomial of degree $n$ with $r$ coefficients…

A homogeneous polynomial S(x_1, ..., x_n) of degree r in n variables posesses a discriminant D_{n|r}(S), which vanishes if and only if the system of equations dS/dx_i = 0 has non-trivial solutions. We give an explicit formula for…

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…

It is well known that a polynomial $\phi(X)\in \mathbb{Z}[X]$ of given degree $d$ factors into at most $d$ factors in $\mathbb{F}_p$ for any prime $p$. We prove in this paper the existence of infinitely many primes $q$ so that the given…

For a commutative ring $R$, a polynomial $f\in R[x]$ is called separable if $R[x]/f$ is a separable $R$-algebra. We derive formulae for the number of separable polynomials when $R = \mathbb{Z}/n$, extending a result of L. Carlitz. For…

Let $X_1,X_2,\ldots$ be independent and identically distributed random variables in $\mathbb{C}$ chosen from a probability measure $\mu$ and define the random polynomial $$ P_n(z)=(z-X_1)\ldots(z-X_n)\,. $$ We show that for any sequence $k…

We start with a random polynomial $P^{N}(z)$ of degree $N$ with independent coefficients. We then consider a new polynomial $P_{t}^{N}$ obtained by $\lceil Nt\rceil$ applications of a fractional differential operator of the form $z^{a}…

We determine the minimal number of separating invariants for the invariant ring of a matrix group $G < \mathrm{GL}_n(\mathbb{F}_q)$ over the finite field $\mathbb{F}_q$. We show that this minimal number can be obtained with invariants of…

A pair of probability distributions over $\{0,1\}^n$ is said to be $(k,\delta)$-wise indistinguishable if all of the size $k$ marginals are within statistical distance at most $\delta$. Previous works introduced this concept and study when…

By the Chinese remainder theorem, the canonical map \[\Psi_n: R[X]/(X^n-1)\to \oplus_{d|n} R[X]/\Phi_d(X)\] is an isomorphism when $R$ is a field whose characteristic does not divide $n$ and $\Phi_d$ is the $d$th cyclotomic polynomial. When…

In this paper we derive aggregate separation bounds, named after Davenport-Mahler-Mignotte (\dmm), on the isolated roots of polynomial systems, specifically on the minimum distance between any two such roots. The bounds exploit the…

Every binomial coefficient aficionado knows that the greatest common divisor of the binomial coefficients $\binom n1,\binom n2,\dots,\binom n{n-1}$ equals $p$ if $n=p^i$ for some $i>0$ and equals 1 otherwise. It is less well known that the…