English
Related papers

Related papers: Narayana numbers and Schur-Szego composition

200 papers

Let $\mu$ be a probability measure on $\mathbb C$, and let $P_n$ be the random polynomial whose zeros are sampled independently from $\mu$. We study the asymptotic distribution of zeros of high-order derivatives of $P_n$. We show that, for…

Probability · Mathematics 2026-01-06 Jürgen Angst , Oanh Nguyen , Guillaume Poly

We study $k$-point correlators of characteristic polynomials in non-Hermitian ensembles of random matrices, focusing on the real, complex and quaternion $N \times N$ Ginibre ensembles. Our approach is based on the technique of character…

Mathematical Physics · Physics 2024-07-15 Alexander Serebryakov , Nick Simm

A Dyck path is a lattice path in the plane integer lattice $\mathbb{Z}\times\mathbb{Z}$ consisting of steps (1,1) and (1,-1), which never passes below the x-axis. A peak at height k on a Dyck path is a point on the path with coordinate y=k…

Combinatorics · Mathematics 2007-05-23 T. Mansour

When a Catalan number or a Narayana number is a (non-trivial) perfect power? For Catalan numbers, we show that the answer is "never". However, we prove that for every b, the Narayana number N(a,b) is a (non-trivial) perfect square for…

Number Theory · Mathematics 2013-06-26 Sara Checcoli , Michele D'Adderio

For any positive integer n, a new family of periodic functions in power series form and of period n is used to solve in closed form a class of polynomial equation of order n. The n roots are the values of the appropriate function from that…

Classical Analysis and ODEs · Mathematics 2007-06-28 Marc Artzrouni

The classical Chung-Feller theorem [2] tells us that the number of Dyck paths of length $n$ with $m$ flaws is the $n$-th Catalan number and independent on $m$. In this paper, we consider the refinements of Dyck paths with flaws by four…

Combinatorics · Mathematics 2008-12-16 Jun Ma , Yeong-Nan Yeh

Double negacirculant (DN) codes are the analogues in odd characteristic of double circulant codes. Self-dual DN codes of odd dimension are shown to be consta-dihedral. Exact counting formulae are derived for DN codes. The special class of…

Information Theory · Computer Science 2016-06-03 Adel Alahmadi , Hatoon Shohaib , Patrick Solé

In 2008, M. Marshall settled a long-standing open problem by showing that if f(x,y) is a polynomial that is non-negative on the strip [0,1] x R, then there exist sums of squares s(x,y) and t(x,y) such that f(x,y) = s(x,y) + (x - x^2)…

Algebraic Geometry · Mathematics 2010-09-21 Ha Nguyen , Victoria Powers

We prove new bounds for how often Dirichlet polynomials can take large values. This gives improved estimates for a Dirichlet polynomial of length $N$ taking values of size close to $N^{3/4}$, which is the critical situation for several…

Number Theory · Mathematics 2026-04-09 Larry Guth , James Maynard

We consider random walk polynomial sequences $(P_n(x))_{n\in\mathbb{N}_0}\subseteq\mathbb{R}[x]$ given by recurrence relations of the form $P_0(x)=1$, $P_1(x)=x$ and $x P_n(x)=a_n P_{n+1}(x)+c_n P_{n-1}(x)\;(n\in\mathbb{N})$, where $a_n$…

Classical Analysis and ODEs · Mathematics 2026-03-19 Stefan Kahler , Josef Obermaier

We give an elementary account of generalized Fibonacci and Lucas polynomials whose moments are Narayana polynomials of type A and type B.

Combinatorics · Mathematics 2016-11-17 Johann Cigler

We show that sequences of skew Schur polynomials obtained from stretched semi-standard Young tableaux satisfy a linear recurrence, which we give explicitly. Using this, we apply this to finding certain asymptotic behavior of these Schur…

Combinatorics · Mathematics 2015-12-14 Per Alexandersson

For positive integers $n$ and $k$, the dendrimer $T_{n, k}$ is defined as the rooted tree of radius $n$ whose all vertices at distance less than $n$ from the root have degree $k$. The dendrimers are higly branched organic macromolecules…

We prove new bijections between different variants of Dyck paths and integer compositions, which give combinatorial explanations of their simple counting formula $4^{n-1}$. These give relations between different statistics, such as the…

Combinatorics · Mathematics 2024-03-11 Manosij Ghosh Dastidar , Michael Wallner

Let $N=2n^2-1$ or $N=n^2+n-1$, for any $n\ge 2$. Let $M=\frac{N-1}{2}$. We construct families of prime knots with Jones polynomials $(-1)^M\sum_{k=-M}^{M} (-1)^kt^k$. Such polynomials have Mahler measure equal to $1$. If $N$ is prime, these…

Geometric Topology · Mathematics 2021-02-23 Maciej Mroczkowski

In this paper, we give some counting results on integer polynomials of fixed degree and bounded height whose distinct non-zero roots are multiplicatively dependent. These include sharp lower bounds, upper bounds and asymptotic formulas for…

Number Theory · Mathematics 2018-02-06 Arturas Dubickas , Min Sha

In this paper, we study a class of orthogonal polynomials defined by a three-term recurrence relation with periodic coefficients. We derive explicit formulas for the generating function, the associated continued fraction, the orthogonality…

Classical Analysis and ODEs · Mathematics 2025-07-01 Dan Dai , Mourad E. H. Ismail , Xiang-Sheng Wang

We analyze the Krawtchouk polynomials K(n,x,N,p,q) asymptotically. We use singular perturbation methods to analyze them for N large with appropriate scalings of the two variables x and n. In particular, the WKB method and asymptotic…

Classical Analysis and ODEs · Mathematics 2007-05-23 Diego Dominici

Consider a non-negative sequence $c_n = h(n) \cdot n^{\alpha-1} \cdot \rho^{-n}$, where $h$ is slowly varying, $\alpha>0$, $0<\rho<1$ and $n\in\mathbb{N}$. We investigate the coefficients of $G(x,y) = \prod_{k\ge1}(1-x^ky)^{-c_k}$, which is…

Probability · Mathematics 2022-03-30 Konstantinos Panagiotou , Leon Ramzews

By applying the Newton-Gregory expansion to the polynomial associated with the sum of powers of integers $S_k(n) = 1^k + 2^k + \cdots + n^k$, we derive a couple of infinite families of explicit formulas for $S_k(n)$. One of the families…

Number Theory · Mathematics 2022-12-06 José L. Cereceda