English
Related papers

Related papers: Narayana numbers and Schur-Szego composition

200 papers

In this paper, we show that there are only finitely many Narayana's numbers which can be written as product of three repdigits in base $g$ with $g \geq 2$. Moreover, for $2 \leq g \leq 10$, we determine all these numbers.

General Mathematics · Mathematics 2023-07-14 Pagdame Tiebekabe , K. R. Kakanou , H. Ben Yakkou

We consider the sequence of polynomials $W_n(x)$ defined by the recursion $W_n(x)=(ax+b)W_{n-1}(x)+dW_{n-2}(x)$, with initial values $W_0(x)=1$ and $W_1(x)=t(x-r)$, where $a,b,d,t,r$ are real numbers, $a,t>0$, and $d<0$. We show that every…

Classical Analysis and ODEs · Mathematics 2015-03-19 J. L. Gross , T. Mansour , T. W. Tucker , D. G. L. Wang

Narayana's cows sequence satisfies the third-order linear recurrence relation $N_n=N_{n-1}+N_{n-3}$ for $n \geq 3$ with initial conditions $N_0=0$ and $N_1=N_2=1$. In this paper, we study $b$-repdigits which are sums of two Narayana…

Number Theory · Mathematics 2020-10-14 Jhon J. Bravo , Pranabesh Das , Sergio Guzmán

We show that an identity of Kreweras for the Narayana numbers counts Dyck paths with a given number of peaks by number of peak plateaus, where a peak plateau is a run of consecutive peaks that is immediately preceded by an upstep and…

Combinatorics · Mathematics 2012-03-20 David Callan

In this paper we study the number of humps (peaks) in Dyck, Motzkin and Schr\"{o}der paths. Recently A. Regev noticed that the number of peaks in all Dyck paths of order $n$ is one half of the number of super Dyck paths of order $n$. He…

Combinatorics · Mathematics 2011-09-14 Yun Ding , Rosena R. X. Du

Using Schur positivity and the principal specialization of Schur functions, we provide a proof of a recent conjecture of Liu and Wang on the $q$-log-convexity of the Narayana polynomials, and a proof of the second conjecture that the…

Combinatorics · Mathematics 2008-06-11 William Y. C. Chen , Larry X. W. Wang , Arthur L. B. Yang

A sequence of coefficients appearing in a recurrence for the Narayana polynomials is generalized. The coefficients are given a probabilistic interpretation in terms of beta distributed random variables. The recurrence established by M.…

Number Theory · Mathematics 2012-03-21 T. Amdeberhan , V. H. Moll , C. Vignat

It is known that both the number of Dyck paths with $2n$ steps and $k$ peaks, and the number of Dyck paths with $2n$ steps and $k$ steps at odd height follow the Narayana distribution. In this paper we present a bijection which explicitly…

Combinatorics · Mathematics 2014-01-27 Paul R. G. Mortimer , Thomas Prellberg

In this paper, we prove the real-rootedness of two classes of generalized Narayana polynomials: one arising as the $h$-polynomials of the generalized associahedron associated to the finite Weyl groups, the other arising in the study of the…

Combinatorics · Mathematics 2016-03-01 Herman Z. Q. Chen , Arthur L. B. Yang , Philip B. Zhang

This paper investigates the number of monic integer polynomials of degree $n$ whose roots are all real and positive. We establish an asymptotic formula for the case of fixed trace by estimating the number of integer sequences satisfying…

Number Theory · Mathematics 2025-09-19 Pavlo Yatsyna , Błażej Żmija

Schur-Szego composition of polynomials of degree N introduces an interesting semigroup structure on polynomial spaces. In this note we show how it interacts with the stratification of polynomials according to the multiplicity of their zeros…

Classical Analysis and ODEs · Mathematics 2007-05-23 V. Kostov , B. Shapiro

We give a counting formula for the set of rectangular increasing tableaux in terms of generalized Narayana numbers. We define small $m$-Schr\"oder paths and give a bijection between the set of increasing rectangular tableaux and small…

Combinatorics · Mathematics 2018-08-20 Timothy Pressey , Anna Stokke , Terry Visentin

We show that Narayana polynomials are a specialization of row Hall-Littlewood symmetric functions. Using lambda-ring calculus, we generalize to Narayana polynomials the formulas of Koshy and Jonah for Catalan numbers.

Combinatorics · Mathematics 2012-10-26 Michel Lassalle

Let $\{N_m\}_{m\ge0}$ be the Narayana's cows sequence given by $N_0=0$, $N_1=1=N_2=1$ and \[ N_{m+3}=N_{m+2}+N_m,\quad \text{ for }\; m\geq 0 \] and let $\{F_n\}_{n\ge0}$ be the Fibonacci sequence. In this paper we solve explicitely the…

Number Theory · Mathematics 2025-08-06 Japhet Odjoumani

Let $w_{n,k,m}$ be the number of Dyck paths of semilength $n$ with $k$ occurrences of $UD$ and $m$ occurrences of $UUD$. We establish in two ways a new interpretation of the numbers $w_{n,k,m}$ in terms of plane trees and internal nodes.…

Combinatorics · Mathematics 2024-03-04 Shishuo Fu , Jie Yang

Given a natural number $n \geq 4$ we show that there exists infinitely many polynomials $f_{n}(x):= \prod_{i=1}^{n} (x^{2} - a_{i})$ such that (i) $f_{n}(x)$ has a root modulo every positive integer, (ii) $f_{n}(x)$ has no rational roots,…

Number Theory · Mathematics 2022-07-19 Bhawesh Mishra

This note is motivated by an old result of Kronecker on monic polynomials with integer coefficients having all their roots in the unit disc. We call such polynomials Kronecker polynomials for short. Let $k(n)$ denote the number of Kronecker…

Number Theory · Mathematics 2015-07-10 Pantelis A. Damianou

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 +…

Probability · Mathematics 2024-04-08 Marcus Michelen , Sean O'Rourke

In this paper, we study the root distribution of some univariate polynomials $W_n(z)$ satisfying a recurrence of order two with linear polynomial coefficients over positive numbers. We discover a sufficient and necessary condition for the…

Combinatorics · Mathematics 2017-12-19 David G. L. Wang , Jiarui Zhang

We examine the behavior of the coefficients of powers of polynomials over a finite field of prime order. Extending the work of Allouche-Berthe, 1997, we study a(n), the number of occurring strings of length n among coefficients of any power…

Combinatorics · Mathematics 2013-04-18 Kevin Garbe