Related papers: Limit law for root separation in random polynomial…

Hayes equivalence is defined on monic polynomials over a finite field $\fq$ in terms of the prescribed leading coefficients and the residue classes modulo a given monic polynomial $Q$. We study the distribution of the number of zeros in a…

It was shown by Burchard and Fortier that the expected $L^1$ distance between $f^*$ and $n$ random polarizations of an essentially bounded function $f$ with support in a ball of radius $L$ is bounded by $2dm(B_{2L})||f||_{\infty}n^{-1}$.…

We consider self-loops and multiple edges in the configuration model as the size of the graph tends to infinity. The interest in these random variables is due to the fact that the configuration model, conditioned on being simple, is a…

This paper seeks to further explore the distribution of the real roots of random polynomials with non-centered coefficients. We focus on polynomials where the typical values of the coefficients have power growth and count the average number…

Let $F_n$ denote the distribution function of the normalized sum $Z_n = (X_1 + \dots + X_n)/\sigma\sqrt{n}$ of i.i.d. random variables with finite fourth absolute moment. In this paper, polynomial rates of convergence of $F_n$ to the normal…

We construct parametric families of (monic) reducible polynomials having two roots very close to each other.

Motivated by applications in medical bioinformatics, Khayatian et al. (2024) introduced a family of metrics on Cayley trees (the $k$-RF distance, for $k=0, \ldots, n-2$) and explored their distribution on pairs of random Cayley trees via…

In this article, we investigate the statistical distribution and asymptotic behavior of the family of monic integer polynomials of degree $n$ having at least one root in a fixed number field $K$. Although the framework of thin sets implies…

Let P and Q be two probability distributions which differ only for values with non-zero probability. We show that the variational distance between the n-fold product distributions P^n and Q^n cannot grow faster than the square root of n.

For a system of Laurent polynomials f_1,..., f_n \in C[x_1^{\pm1},..., x_n^{\pm1}] whose coefficients are not too big with respect to its directional resultants, we show that the solutions in the algebraic n-th dimensional complex torus of…

Let $f(x)=x^n+a_{n-1}x^{n-1}+\dots+a_0$ be an irreducible polynomial with integer coefficients. For a prime $p$ for which $f(x)$ is fully splitting modulo $ p$, we consider $n$ roots $r_i$ of $f(x)\equiv 0\bmod p$ with $0 \le r_1\le\dots\le…

Let $p_n$ be a polynomial of degree $n$ having all its roots on the real line distributed according to a smooth function $u(0,x)$. One could wonder how the distribution of roots behaves under iterated differentation of the function, i.e.…

We introduce a new approach to isolate the real roots of a square-free polynomial $F=\sum_{i=0}^n A_i x^i$ with real coefficients. It is assumed that each coefficient of $F$ can be approximated to any specified error bound. The presented…

We consider the sequence of polynomials $W_n(x)$ defined by the recursion $W_n(x)=(ax+b)W_{n-1}(x)+dW_{n-2}(x)$, with initial values $W_0(x)=1$ and $W_1(x)=t(x-r)$, where $a,b,d,t,r$ are real numbers, $a,t>0$, and $d<0$. We show that every…

In this paper we consider the normalized lengths of the factors of some factorizations of random words. First, for the \emph{Lyndon factorization} of finite random words with $n$ independent letters drawn from a finite or infinite totally…

Let $\mu$ be a probability measure on $\mathbb C$, and let $P_n$ be the random polynomial whose zeros are sampled independently from $\mu$. We study the asymptotic distribution of zeros of high-order derivatives of $P_n$. We show that, for…

We prove that the distribution density of any non-constant polynomial $f(\xi_1,\xi_2,\ldots)$ of degree $d$ in independent standard Gaussian random variables $\xi$ (possibly, in infinitely many variables) always belongs to the…

We consider polynomials on the unit circle defined by the recurrence relation \Phi_{k+1}(z) = z \Phi_{k} (z) - \bar{\alpha}_{k} \Phi_k^{*}(z) for k \geq 0 and \Phi_0=1. For each n we take \alpha_0, \alpha_1, ...,\alpha_{n-2} i.i.d. random…

For a given monic integral polynomial $f(x)$ of degree $n$, we define local roots $r_i$ of $f(x)$ for a completely decomposable prime $p$ by $r_i \in \mathbb{Z}$, $f(r_i) \equiv 0 \bmod p$ and $0 \le r_1 \le r_2 \le \dots \le r_n < p$. With…

A random geometric graph $G(\mathcal{X}_n, r_n)$ is formed by taking a binomial process $\mathcal{X}_n$ as the set of vertices and joining any two distinct points with an edge if they lie within distance $r_n$ of each other. We investigate…