English
Related papers

Related papers: Roots of random polynomials whose coefficients hav…

200 papers

This paper deals with sequences of random variables $X_n$ only taking values in $\{0,\ldots,n\}$. The probability generating functions of such random variables are polynomials of degree $n$. Under the assumption that the roots of these…

Probability · Mathematics 2024-01-18 Benedikt Rednoß , Christoph Thäle

Let $c_1(x),c_2(x),f_1(x),f_2(x)$ be polynomials with rational coefficients. With obvious exceptions, there can be at most finitely many roots of unity among the zeros of the polynomials $c_1(x)f_1(x)^n+c_2(x)f_2(x)^n$ with $n=1,2\ldots$.…

Number Theory · Mathematics 2020-11-24 Yuri Bilu , Florian Luca

In this paper, we discuss the convergence rate of empirical processes of Gaussian processes for a large class of function families. Our main goal is to show that the tail of the uniform norm of the empirical processes can be dominated by…

Probability · Mathematics 2023-03-22 Wen Huo , Yasutaka Shimizu

We study monic univariate polynomials whose coefficients are analytic functions of a real variable and whose roots lie in a specified analytic curve. These include characteristic polynomials of unitary and hermitian matrices whose entries…

Algebraic Geometry · Mathematics 2012-03-01 Wayne Lawton

We analyze the density of roots of random polynomials where each complex coefficient is constructed of a random modulus and a fixed, deterministic phase. The density of roots is shown to possess a singular component only in the case for…

chao-dyn · Physics 2016-08-31 D. Braun , M. Kus , K. Zyczkowski

It turned out that the partial sums $g_n(z) = \sum_{k=0}^n \frac{(a_1)_k ... (a_p)_k}{(b_1)_k ... (b_q)_k} \frac{z^k}{k!}$, of the generalized hypergeometric series ${}_p F_q(a_1,...,a_p; b_1,...,b_q;z)$, with parameters…

Classical Analysis and ODEs · Mathematics 2021-01-13 Sergey M. Zagorodnyuk

We introduce a new type of Krasnoselskii's result. Using a simple differentiability condition, we relax the nonexpansive condition in Krasnoselskii's theorem. More clearly, we analyze the convergence of the sequence…

Functional Analysis · Mathematics 2022-06-07 Hassan Khandani , Farshid Khojasteh

The exact expression for the probability density $p_{_N}(x)$ for sums of a finite number $N$ of random independent terms is obtained. It is shown that the very tail of $p_{_N}(x)$ has a Gaussian form if and only if all the random terms are…

Probability · Mathematics 2013-05-29 Michael I. Tribelsky

We investigate Newton's method for complex polynomials of arbitrary degree $d$, normalized so that all their roots are in the unit disk. For each degree $d$, we give an explicit set $\mathcal{S}_d$ of $3.33d\log^2 d(1 + o(1))$ points with…

Dynamical Systems · Mathematics 2016-03-18 Todor Bilarev , Magnus Aspenberg , Dierk Schleicher

As showed in (Fiedler, 1990), any polynomial can be expressed as a characteristic polynomial of a complex symmetric arrowhead matrix. This expression is not unique. If the polynomial is real with only real distinct roots, the matrix can be…

Numerical Analysis · Mathematics 2015-09-22 Nevena Jakovcevic Stor , Ivan Slapnicar

The well-known mathematical instrument for detection common roots for pairs of polynomials and multiple roots of polynomials are resultants and discriminants. For a pair of polynomials $f$ and $g$ their resultant $R(f,g)$ is a function of…

Classical Analysis and ODEs · Mathematics 2024-04-15 Mikhail Chernyavsky , Andrei Lebedev , Yurii Trubnikov

We study the spatial distribution of the positive, negative and non-real complex roots $z_n $ of the sequence the $(n+1)$th degree polynomial equation $$ z^{n+1}=(1+z)^n,\quad n \in \mathbb{N}.$$ We establish asymptotic approximations to…

Complex Variables · Mathematics 2025-08-25 Hailu Bikila Yadeta

Concentration inequalities for subgraph counts in random geometric graphs built over Poisson point processes are proved. The estimates give upper bounds for the probabilities $\mathbb{P}(N\geq M +r)$ and $\mathbb{P}(N\leq M - r)$ where $M$…

Probability · Mathematics 2015-04-29 Sascha Bachmann , Matthias Reitzner

This paper presents a stochastic approach to theorems concerning the behavior of iterations of the Bernstein operator $B_n$ taking a continuous function $f \in C[0,1]$ to a degree-$n$ polynomial when the number of iterations $k$ tends to…

Probability · Mathematics 2016-01-19 Takis Konstantopoulos , Linglong Yuan , Michael A. Zazanis

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…

Combinatorics · Mathematics 2025-10-13 Om Prakash , Vikram Sharma

Consider a random trigonometric polynomial $X_n: \mathbb R \to \mathbb R$ of the form $$ X_n(t) = \sum_{k=1}^n \left( \xi_k \sin (kt) + \eta_k \cos (kt)\right), $$ where $(\xi_1,\eta_1),(\xi_2,\eta_2),\ldots$ are independent identically…

Probability · Mathematics 2016-05-17 Alexander Iksanov , Zakhar Kabluchko , Alexander Marynych

In recent years, a number of papers have been devoted to the study of roots of period polynomials of modular forms. Here, we study cohomological analogues of the Eichler-Shimura period polynomials corresponding to higher $L$-derivatives. We…

Number Theory · Mathematics 2017-04-11 Nikolaos Diamantis , Larry Rolen

This work is divided into three parts. The first part concerns polynomials in one variable with all real roots. We consider linear transformations that preserve real rootedness, as well as matrices that preserve interlacing. The second part…

Classical Analysis and ODEs · Mathematics 2008-03-11 Steve Fisk

Suppose $p$ is a prime, $t$ is a positive integer, and $f\!\in\!\mathbb{Z}[x]$ is a univariate polynomial of degree $d$ with coefficients of absolute value $<\!p^t$. We show that for any fixed $t$, we can compute the number of roots in…

Number Theory · Mathematics 2019-02-13 Qi Cheng , Shuhong Gao , J. Maurice Rojas , Daqing Wan

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…

Data Structures and Algorithms · Computer Science 2015-03-17 Michael Sagraloff