English
Related papers

Related papers: Narayana numbers and Schur-Szego composition

200 papers

Let $Q_n(x)=\sum_{i=0}^{n} A_{i}x^{i}$ be a random polynomial where the coefficients $A_0,A_1,... $ form a sequence of centered Gaussian random variables. Moreover, assume that the increments $\Delta_j=A_j-A_{j-1}$, $j=0,1,2,...$ are…

Probability · Mathematics 2007-06-13 S. Rezakhah , S. Shemehsavar

The fact that Schubert polynomials are the weighted counting functions for reduced RC-graphs, also known as reduced pipe dreams, was established using their generating functions inside an appropriate Demazure algebra. Here we investigate…

Combinatorics · Mathematics 2024-11-14 Noah Cape , Shaul Zemel

For $n=0,1,2,\ldots$ let $d_n^{(r)}(x)=\sum_{k=0}^n\binom{x+r+k}k\binom{x-r}{n-k}$. In this paper we illustrate the connection between $\{d_n^{(r)}(x)\}$ and Meixner polynomials. New formulas and recurrence relations for $d_n^{(r)}(x)$ are…

Classical Analysis and ODEs · Mathematics 2018-02-06 Zhi-Hong Sun

Let $L_{n}$ be the molecular graph of linear $[n]$phenylene, and $L'_{n}$ the graph obtained by attaching 4-membered cycles to terminal hexagons of $L_{n-1}$. Thus, $L'_{n}$ is the molecular graph of the $\alpha,\omega$ - dicyclobutadieno…

Combinatorics · Mathematics 2020-08-12 Abdul Rauf Nizami , Muhammad Aslam Malik , Zahid Mahmood

We consider polynomials $p_n^{\omega}(x)$ that are orthogonal with respect to the oscillatory weight $w(x)=e^{i\omega x}$ on $[-1,1]$, where $\omega>0$ is a real parameter. A first analysis of $p_n^{\omega}(x)$ for large values of $\omega$…

Classical Analysis and ODEs · Mathematics 2014-07-09 Alfredo Deaño

Suppose we have a Nikishin system of $p$ measures with the $k$th generating measure of the Nikishin system supported on an interval $\Delta_k\subset\er$ with $\Delta_k\cap\Delta_{k+1}=\emptyset$ for all $k$. It is well known that the…

Classical Analysis and ODEs · Mathematics 2023-08-30 Steven Delvaux , Abey López García , Guillermo López Lagomasino

Let A be any set of positive integers and n a positive integer. A composition of n with parts in A is an ordered collection of one or more elements in A whose sum is n. We derive generating functions for the number of compositions of n with…

Combinatorics · Mathematics 2007-05-23 S. Heubach , T. Mansour

We deduce Narayana's formula for the number of lattice paths that fit in a Young diagram as a direct consequence of the Gessel-Viennot theorem on non-intersecting lattice paths.

Combinatorics · Mathematics 2016-02-08 Mihai Ciucu

For a sequence of polynomials $\{p_k(t)\}$ in one real or complex variable, where $p_k$ has degree $k$, for $k\ge 0$, we find explicit expressions and recurrence relations for infinite matrices whose entries are the coefficients $d(n,m,k)$,…

Rings and Algebras · Mathematics 2023-04-27 Luis Verde-Star

Let D be a masa in B(H) where H is a separable Hilbert space. We find real numbers \eta_0 < \eta_1 < \eta_2 < ... < \eta_6 so that for every bounded, normal D-bimodule map {\Phi} on B(H) either ||\Phi|| > \eta_6, or ||\Phi|| = \eta_k for…

Functional Analysis · Mathematics 2014-06-16 Rupert H. Levene

We give a high precision polynomial-time approximation scheme for the supremum of any honest n-variate (n+2)-nomial with a constant term, allowing real exponents as well as real coefficients. Our complexity bounds count field operations and…

Algebraic Geometry · Mathematics 2010-11-09 Philippe Pebay , J. Maurice Rojas , David C. Thompson

Let $(r_{A,n}(x))_{n \in \mathbb{N}}$ be a sequence of polynomials with coefficients from a field $K$ satisfying the recurrence relation $r_{A,n}(x)= \sum_{|\alpha|\leq m} t_{\alpha,n}(x)\textbf{r}_{A,n}^\alpha(x)$ of order $d+1 \in…

Number Theory · Mathematics 2022-04-26 Joanna Turaj

Let $q\geqslant 2$ be a fixed prime power. We prove an asymptotic formula for counting the number of monic polynomials that are of degree $n$ and have exactly $k$ irreducible factors over the finite field $\mathbb{F}_q$. We also compare our…

Number Theory · Mathematics 2022-09-12 Arghya Datta

We opt to study the convergence of maximal real roots of certain Fibonacci-type polynomials given by $G_n=x^kG_{n-1}+G_{n-2}$. The special cases $k=1$ and $k=2$ are found in [4] and [7], respectively.

Number Theory · Mathematics 2008-12-16 Tewodros Amdeberhan

We propose a new definition of characteristic polynomials of tensors based on a partition function of Grassmann variables. This new notion of characteristic polynomial addresses general tensors including totally antisymmetric ones, but not…

Mathematical Physics · Physics 2025-10-07 Nicolas Delporte , Giacomo La Scala , Naoki Sasakura , Reiko Toriumi

The matching polynomial of a graph encodes rich combinatorial information through its roots. We determine the maximum multiplicity of a non-zero matching polynomial root and characterize all graphs attaining the bound. We also generalize…

Combinatorics · Mathematics 2025-09-30 Leyou Xu

New sequences of orthogonal polynomials with respect to the weight functions $e^{-x} \rho_\nu(x),\ e^{- 1/x} x^{-1} \rho_{\nu} (x), \rho_{\nu}(x)= 2 x^{\nu/2} K_\nu(2\sqrt x),\ x >0, \nu \in \mathbb{R}$, where $K_\nu(z)$ is the modified…

Classical Analysis and ODEs · Mathematics 2019-02-19 Semyon Yakubovich

The Springer numbers are defined in connection with the irreducible root systems of type $B_n$, which also arise as the generalized Euler and class numbers introduced by Shanks. Combinatorial interpretations of the Springer numbers have…

Combinatorics · Mathematics 2010-09-14 William Y. C. Chen , Neil J. Y. Fan , Jeffrey Y. T. Jia

We reconsider the two related problems: distribution of the diagonal elements of a Hermitian n x n matrix of known eigenvalues (Schur) and determination of multiplicities of weights in a given irreducible representation of SU(n) (Kostka).…

Representation Theory · Mathematics 2020-01-23 Robert Coquereaux , Jean-Bernard Zuber

A composition of a nonnegative integer (n) is a sequence of positive integers whose sum is (n). A composition is palindromic if it is unchanged when its terms are read in reverse order. We provide a generating function for the number of…

Combinatorics · Mathematics 2007-05-23 Sergey Kitaev , Tyrrell B. McAllister , T. Kyle Petersen
‹ Prev 1 8 9 10 Next ›