Related papers: Counting (skew-)reciprocal Littlewood polynomials …
The article proves an assertion analogous to the Littlewood-Paley theorem for the orthoprojectors onto mutually orthogonal subspaces of piecewise polynomial functions on the cube $ I^d. $ This assertion provides an upper estimate for the…
We study the asymptotic properties of monic orthogonal polynomials (OPs) with respect to some Freud weights when the degree of the polynomial tends to infinity, including the asymptotics of the recurrence coefficients, the nontrivial…
This is a survey article on the Hardy-Littlewood conjecture about primes in quadratic progressions. We recount the history and quote some results approximating this hitherto unresolved conjecture.
This note is an extended abstract of my talk at the workshop on Representation Theory and Symmetric Functions, MSRI, April 14, 1997. We discuss the problem of finding an explicit description of the semigroup $LR_r$ of triples of partitions…
We derive an asymptotic expansion for the distribution of a compound sum of independent random variables, all having the same light-tailed subexponential distribution. The examples of a Poisson and geometric number of summands serve as an…
Asymptotic expansions are derived for Gegenbauer (ultraspherical) polynomials for large order $n$ that are uniformly valid for unbounded complex values of the argument $z$, including the real interval $0 \leq z \leq 1$ in which the zeros in…
Littlewood raised the question of how slowly the L_4 norm ||f||_4 of a Littlewood polynomial f (having all coefficients in {-1,+1}) of degree n-1 can grow with n. We consider such polynomials for odd square-free n, where \phi(n)…
A fundamental problem in the representation theory of the symmetric group, Sn, is to describe the coefficients in the decomposition of a tensor product of two simple representations. These coefficients are known in the literature as the…
The eigenvalue probability density function for symplectic invariant random matrix ensembles can be generalised to discrete settings involving either a linear or exponential lattice. The corresponding correlation functions can be expressed…
We establish the asymptotic zero distribution for polynomials generated by a four-term recurrence relation with varying recurrence coefficients having a particular limiting behavior. The proof is based on ratio asymptotics for these…
We show that if a real trigonometric polynomial has few real roots, then the trigonometric polynomial obtained by writing the coefficients in reverse order must have many real roots. This is used to show that a class of random trigonometric…
Most integers are composite and most univariate polynomials over a finite field are reducible. The Prime Number Theorem and a classical result of Gau{\ss} count the remaining ones, approximately and exactly. For polynomials in two or more…
We consider asymptotics of planar orthogonal polynomials $P_{n,N}$ (where $\mathrm{deg}P_{n,N}=n$) with respect to the weight $$\frac{|z-w|^{2NQ_1}}{(1+|z|^2)^{N(1+Q_0+Q_1)+1}}, \quad(Q_0,Q_1 > 0)$$ in the whole complex plane. With $n,…
Let p(t) be a trigonometric polynomial, non-negative on the unit circle. We say that a measure \sigma belongs to a polynomial Szego class, if the logarithm of its density is summable over the circle with the weight p(t). For the associated…
Defining a family of recurrences, we generalize Comtet's formula for the generating function of the enumeration of indecomposable permutations. Consequently, we generalize Panaitopol's asymptotic expansion for the prime counting function,…
This work provides explicit characterizations and formulae for the minimal polynomials of a wide variety of structured $4\times 4$ matrices. These include symmetric, Hamiltonian and orthogonal matrices. Applications such as the complete…
Let $M_n$ denote a random symmetric $n$ by $n$ matrix, whose upper diagonal entries are iid Bernoulli random variables (which take value -1 and 1 with probability 1/2). Improving the earlier result by Costello, Tao and Vu, we show that…
Newell-Littlewood coefficients $n_{\mu,\nu}^{\lambda}$ are the multiplicities occurring in the decomposition of products of universal characters of the orthogonal and symplectic groups. They may also be expressed, or even defined directly…
Let $f \in \mathbb{Z}[y]$ be a polynomial such that $f(\mathbb{N}) \subseteq \mathbb{N}$, and let $p_{\mathcal{A}_{f}}(n)$ denote number of partitions of $n$ whose parts lie in the set $\mathcal{A}_f:=\{f(n):n \in \mathbb{N}\}$. Under…
The plethysms of the Weyl characters associated to a classical Lie group by the symmetric functions stabilize in large rank. In the case of a power sum plethysm, we prove that the coefficients of the decomposition of this stabilized form on…