Related papers: On the theorem of Rubinstein
A partition polynomial is a refinement of the partition number p(n) whose coefficients count some special partition statistic. Just as partition numbers have useful asymptotics so do partition polynomials. In fact, their asymptotics…
We study the density of complex zeros of a system of real random SO($m+1$) polynomials in several variables. We show that the density of complex zeros of this random polynomial system with real coefficients rapidly approaches the density of…
We prove the classical result, which goes back at least to Fourier, that a polynomial with real coefficients has all zeros real and distinct if and only if the polynomial and also all of its nonconstant derivatives have only negative minima…
In this article we study asymptotic behavior of the probability that a random monic polynomial with integer coefficients is irreducible over the integers. We consider the cases where the coefficients grow together with the degree of the…
Locating the zeros of quaternionic polynomials is a fundamental problem with significant implications across scientific and engineering disciplines, yet the noncommutative nature of quaternion multiplication makes it fundamentally more…
In this article, we give an account of some recent irreducibility testing criteria for polynomials having integer coefficients over the field of rational numbers.
We generalize Coincidence theorem due to Walsh for symmetric and linear polynomial in n complex variables, that is linear in each of them having total degre n. We discuss case when total degree is smaller then n. This case has been already…
Using the formalism of polynomials with positive coefficients, the fact that exactly half of all subsets of a finite set have even cardinality can be generalized asymptotically.
Let $\mathbb{F}_q$ denote the finite field of characteristic $p$ and order $q$. Let $\mathbb{Z}_q$ denote the unramified extension of the $p$-adic rational integers $\mathbb{Z}_p$ with residue field $\mathbb{F}_q$. Given two positive…
In this paper, we study properties of polynomials over division rings. Moreover, we present formulas for finding roots of some polynomials
In this paper we give a factorization theorem for the ring of exponential polynomials in many variables over an algebraically closed field of characteristic 0 with an exponentiation. This is a generalization of the factorization theorem due…
In a companion paper [On semiclassical orthogonal polynomials via polynomial mappings, J. Math. Anal. Appl. (2017)] we proved that the semiclassical class of orthogonal polynomials is stable under polynomial transformations. In this work we…
Condition numbers of random polynomial systems have been widely studied in the literature under certain coefficient ensembles of invariant type. In this note we introduce a method that allows us to study these numbers for a broad family of…
In this paper, we obtain several new classes of irreducible polynomials having integer coefficients whose zeros lie inside an open disk around the origin or outside a closed annular region in the complex plane. Such irreducible polynomials…
We develop a new kind of nonnegativity certificate for univariate polynomials on an interval. In many applications, nonnegative Bernstein coefficients are often used as a simple way of certifying polynomial nonnegativity. Our proposed…
A theorem of Kushnirenko and Bernstein shows that the number of isolated roots of a system of polynomials in a torus is bounded above by the mixed volume of the Newton polytopes of the given polynomials, and this upper bound is generically…
A complete intersection of n polynomials in n indeterminates has only a finite number of zeros. In this paper we address the following question: how do the zeros change when the coefficients of the polynomials are perturbed? In the first…
We study asymptotic zero distribution of random Laurent polynomials whose support are contained in dilates of a fixed integral polytope $P$ as their degree grow. We consider a large class of probability distributions including the ones…
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…
Numerical study of the distribution of the Riemann zeros differences following the work [1] shows the significance of the function for which the prime sum expression is proposed. Computational results related to this definition explored…