Related papers: Polynomials Arising from Sorted Binomial Coefficie…
Let $f = \sum_{k=0}^n \varepsilon_k z^k$ be a random polynomial, where $\varepsilon_0,\ldots ,\varepsilon_n$ are iid standard Gaussian random variables, and let $\zeta_1,\ldots,\zeta_n$ denote the roots of $f$. We show that the point…
Let $Q_n(x)=\sum_{i=0}^{n} A_{i}x^{i}$ be a random polynomial where the coefficients $A_0,A_1,... $ form a sequence of centered Gaussian random variables. Moreover, assume that the increments $\Delta_j=A_j-A_{j-1}$, $j=0,1,2,...$ are…
We give a characterization of common zeros of a sequence of univariate polynomials $W_n(z)$ defined by a recurrence of order two with polynomial coefficients, and with $W_0(z)=1$. Real common zeros for such polynomials with real…
Let $F_n(x)$ be the partition polynomial $\sum_{k=1}^n p_k(n) x^k$ where $p_k(n)$ is the number of partitions of $n$ with $k$ parts. We emphasize the computational experiments using degrees up to $70,000$ to discover the asymptotics of…
This paper investigates coefficients of cyclotomic polynomials theoretically and experimentally. We prove the following result. {{\em If $n=p_1\ldots p_k$ where $p_i$ are odd primes and $p_1<p_2<\ldots<p_r<p_1+p_2<p_{r+1}<\ldots<p_t$ with…
Let $p_n$ be the number of partitions of an integer $n$. For each of the partition statistics of counting their parts, ranks, or cranks, there is a natural family of integer polynomials. We investigate their asymptotics and the limiting…
In a recent work, the combinatorial interpretation of the polynomial alpha(n;k1,k2,...,kn) counting the number of Monotone Triangles with bottom row k1 < k2 < ... < kn was extended to weakly decreasing sequences k1 >= k2 >= ... >= kn. In…
This paper discusses the location of zeros of polynomials in a polynomial sequence $\{P_n(z)\}$ generated by a three-term recurrence relation of the form $P_n(z)+ B(z)P_{n-1}(z) +A(z) P_{n-k}(z)=0$ with $k>2$ and the standard initial…
We introduce a new problem on the elementary symmetric polynomials $\sigma_k$, stemming from the constraint equations of some modified gravity theory. For which coefficients is a linear combination of $\sigma_k$ $1/p$-concave, with $0 \leq…
We will show that the roots of a polynomial equation in one variable of degree n are related to the solutions of a symmetric quadratic form in n-1 variables with constant positive integer coefficients. The classic polynomial notation will…
The close relationship among the polynomial functions and Fibonacci numerical sequences is shown in this paper. These numerical sequences are defined by the recurrence equation $x_{k + n} = \displaystyle\sum_{j = 0}^{n-1}\alpha_j x_{k +…
We introduce a family of real random polynomials of degree n whose coefficients a_k are symmetric independent Gaussian variables with variance <a_k^2> = e^{-k^\alpha}, indexed by a real \alpha \geq 0. We compute exactly the mean number of…
Given a permutation $\pi=\pi_1\pi_2\cdots \pi_n \in \mathfrak{S}_n$, we say an index $i$ is a peak if $\pi_{i-1} < \pi_i > \pi_{i+1}$. Let $P(\pi)$ denote the set of peaks of $\pi$. Given any set $S$ of positive integers, define…
To prove that a polynomial is nonnegative on R^n one can try to show that it is a sum of squares of polynomials (SOS). The latter problem is now known to be reducible to a semidefinite programming (SDP) computation much faster than…
Let $ p_n(x) $ be a random polynomial of degree $n$ and $\{Z^{(n)}_j\}_{j=1}^n$ and $\{X^{n, k}_j\}_{j=1}^{n-k}, k<n$, be the zeros of $p_n$ and $p_n^{(k)}$, the $k$th derivative of $p_n$, respectively. We show that if the linear statistics…
It has been shown by Ibragimov and Zaporozhets [In Prokhorov and Contemporary Probability Theory (2013) Springer] that the complex roots of a random polynomial $G_n(z)=\sum_{k=0}^n\xi_kz^k$ with i.i.d. coefficients $\xi_0,\ldots,\xi_n$…
We study the regularity of the roots of multiparameter families of complex univariate monic polynomials $P(x)(z) = z^n + \sum_{j=1}^n (-1)^j a_j(x) z^{n-j}$ with fixed degree $n$ whose coefficients belong to a certain subring $\mathcal C$…
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…
Our goal is to find asymptotic formulas for orthonormal polynomials $P_{n}(z)$ with the recurrence coefficients slowly stabilizing as $n\to\infty$. To that end, we develop spectral theory of Jacobi operators with long-range coefficients and…
For every polynomial f of degree n with no double roots, there is an associated family C(f) of harmonic algebraic curves, fibred over the circle, with at most n-1 singular fibres. We study the combinatorial topology of C(f) in the generic…