Related papers: The $\s$-Eulerian polynomials have only real roots
The probability that a zero of a random real polynomial of increasing degree is real tends to zero. However, passing from polynomials to Laurent polynomials yields a surprising result: the probability that a root is real tends not to zero,…
The Eulerian numbers count permutations according to the number of descents. The two-sided Eulerian numbers count permutations according to number of descents and the number of descents in the inverse permutation. Here we derive some…
In this paper, Euler gives the general trionomial coefficient as a sum of the binomial coefficients, the general quadrinomial coefficient as a sum of the binomial and trinomial coefficients, the general quintonomial coefficient as a sum of…
We prove the B. and M. Shapiro conjecture that says that if the Wronskian of a set of polynomials has real roots only, then the complex span of this set of polynomials has a basis consisting of polynomials with real coefficients. This in…
Generalized Euler polynomials ${{\alpha }_{n}}\left( x \right)={{\left( 1-x \right)}^{n+1}}\sum\nolimits_{m=0}^{\infty }{{{p}_{n}}}\left( m \right){{x}^{m}}$, where ${{p}_{n}}\left( x \right)$ is the polynomial of degree $n$, are the…
For every positive integer $n$, consider the linear operator $\U_{n}$ on polynomials of degree at most $d$ with integer coefficients defined as follows: if we write $\frac{h(t)}{(1 - t)^{d + 1}} = \sum_{m \geq 0} g(m) t^{m}$, for some…
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$…
In this paper we use probabilistic methods to derive some results on the generalized Bernoulli and generalized Euler polynomials. Our approach is based on the properties of Appell polynomials associated with uniformly distributed and…
By using the elementary symmetric polynomials and some results of number theory, we solve the well known problem of Lehmer on Euler's totient function. As application, we obtain a new characterization of prime numbers.
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…
We discuss in some detail the general problem of computing averages of convergent Euler products, and apply this to examples arising from singular series for the $k$-tuple conjecture and more general problems of polynomial representation of…
In any cubic polynomial, the average of the slopes at the $3$ roots is the negation of the slope at the average of the roots. In any quartic, the average of the slopes at the $4$ roots is twice the negation of the slope at the average of…
The main purpose of this paper is to introduce and investigate a new class of generalized Bernoulli polynomials and Euler polynomials based on the q-integers. The q-analogues of well-known formulas are derived. The q-analogue of the…
Generalized polynomials are mappings obtained from the conventional polynomials by the use of operations of addition, multiplication and taking the integer part. Extending the classical theorem of H. Weyl on equidistribution of polynomials,…
The coefficients of the chain polynomial of a finite poset enumerate chains in the poset by their number of elements. It has been a challenging open problem to determine which posets have real-rooted chain polynomials. Two new classes of…
We present a Suffridge-like extension of the Grace-Szeg\"o convolution theorem for polynomials and entire functions with only real zeros. Our results can also be seen as a $q$-extension of P\'olya's and Schur's characterization of…
For each $\alpha \in (0, 1)$, we construct a bounded monotone deterministic sequence $(c_k)_{k \geq 0}$ of real numbers so that the number of real roots of the random polynomial $f_n(z) = \sum_{k=0}^n c_k \varepsilon_k z^k$ is $n^{\alpha +…
Theorem 1 is a formula expressing the mean number of real roots of a random multihomogeneous system of polynomial equations as a multiple of the mean absolute value of the determinant of a random matrix. Theorem 2 derives closed form…
The generalized Euler number E_{n|k} counts the number of permutations of {1,2,...,n} which have a descent in position m if and only if m is divisible by k. The classical Euler numbers are the special case when k=2. In this paper, we study…
We consider a generalization of Eulerian numbers which count the number of placements of $cn$ "rooks" on an $n\times n$ board where there are exactly $c$ rooks in each row and each column, and exactly $k$ rooks below the main diagonal. The…