English
Related papers

Related papers: A Note on Generalized Narayana Numbers

200 papers

Dispersed Dyck paths are Dyck paths, with possible flat steps on level 0. We revisit and augment questions about them from the Encyclopedia of Integer Sequences, in a systematic way that uses generating functions and the kernel method.

Combinatorics · Mathematics 2024-02-21 Helmut Prodinger

We provide a formula for the $n^{th}$ term of the $k$-generalized Fibonacci-like number sequence using the $k$-generalized Fibonacci number or $k$-nacci number, and by utilizing the newly derived formula, we show that the limit of the ratio…

Number Theory · Mathematics 2015-04-08 Jerico B. Bacani , Julius Fergy T. Rabago

We study Babai numbers and Babai $k$-spectra of paths and cycles. We completely determine the Babai numbers of paths $P_n$ for $n>1$ and $1 \leq k \leq n-1$, and the Babai $k$-spectra for $P_n$ when $1 \leq k \leq n/2$. We also completely…

Combinatorics · Mathematics 2024-09-10 Peter Johnson , Celalettin Kaya , Ryan W. Matzke

We give a shorter proof of the recurrence relation for the domination polynomial $\gamma (P_{n},t)$ and for the number $\gamma _{k}(P_{n})$ of dominating $k$-sets of the path with $n$ vertices. For every positive integers $n$ and $k,$…

Combinatorics · Mathematics 2016-01-07 Jorge L. Arocha , Bernardo Llano

Linear recursions of degree $k$ are determined by evaluating the sequence of Generalized Fibonacci Polynomials, $\{F_{k,n}(t_1,...,t_k)\}$ (isobaric reflects of the complete symmetric polynomials) at the integer vectors $(t_1,...,t_k)$. If…

Number Theory · Mathematics 2007-12-17 Trueman MacHenry , Kieh Wong

In this paper, we consider a two-parameter polynomial generalization, denoted by G_{a,b}(n,k;r), of the r-Lah numbers which reduces to these recently introduced numbers when a=b=1. We present several identities for G_{a,b}(n,k;r) that…

Combinatorics · Mathematics 2014-12-31 Mark Shattuck

Narayana's sequence is a ternary recurrent sequence defined by the recurrence relation $\mathcal{N}_n=\mathcal{N}_{n-1}+\mathcal{N}_{n-3}$ with initial terms $\mathcal{N}_0=0$ and $\mathcal{N}_1=\mathcal{N}_2=\mathcal{N}_3=1$. Let…

Generalized Jacobi polynomials are orthogonal polynomials related to a weight function which is smooth and positive on the whole interval of orthogonality up to a finite number of points, where algebraic singularities occur. The influence…

Classical Analysis and ODEs · Mathematics 2016-09-06 Alphonse P. Magnus

We give bijective results between several variants of lattice paths of length $2n$ (or $2n-2$) and integer compositions of n, all enumerated by the seemingly innocuous formula $4^{n-1}$. These associations lead us to make new connections…

Combinatorics · Mathematics 2024-06-25 Manosij Ghosh Dastidar , Michael Wallner

We study the global dimension of Nakayama algebras. In the case of linear Nakayama algebras, which are in canonical bijection to Dyck paths, we show that the global dimension has the same distribution as the height of Dyck paths. For cyclic…

Combinatorics · Mathematics 2025-03-25 Viktória Klász , René Marczinzik , Anton Mellit , Martin Rubey , Christian Stump

Let $G$ be a 2-connected graph of order $n$ and let $c$ be the circumference - the order of a longest cycle in $G$. In this paper we present a sharp lower bound for the circumference based on minimum degree $\delta$ and $p$ - the order of a…

Combinatorics · Mathematics 2014-07-21 Zh. G. Nikoghosyan

The enumeration of k-Dyck paths ending at level j after m up-steps, where the last step is an up-step, is given as a sum, improving on a previous formula given by Deng and Mansour.

Combinatorics · Mathematics 2020-10-20 Helmut Prodinger

The generalized Narayana polynomials $N_{n,m}(x)$ arose from the study of infinite log-concavity of the Boros-Moll polynomials. The real-rootedness of $N_{n,m}(x)$ had been proved by Chen, Yang and Zhang. They also showed that when $n\geq…

Combinatorics · Mathematics 2021-08-10 James J. Y. Zhao

We relate the combinatorics of periodic generalized Dyck and Motzkin paths to the cluster coefficients of particles obeying generalized exclusion statistics, and obtain explicit expressions for the counting of paths with a fixed number of…

Mathematical Physics · Physics 2022-10-17 Li Gan , Stéphane Ouvry , Alexios P. Polychronakos

In this note, by employing a nice property of semicircular distributions, we derive some identities for the Narayana polynomial and its derivatives.

Combinatorics · Mathematics 2022-06-22 Nguyen Tien Dung

In the present paper we generate binary pseudorandom sequences using generalized polynomials. A generalized polynomial is a function in whose description we not only allow addition and product (as it is the case in usual polynomials) but…

Number Theory · Mathematics 2025-09-25 Manfred G. Madritsch , Robert F. Tichy

Linear recursions of degree $k$ are determined by evaluating the sequence of Generalized Fibonacci Polynomials, $\{F_{k,n}(t_1,...,t_k)\}$ (isobaric reflects of the complete symmetric polynomials) at the integer vectors $(t_1,...,t_k)$. If…

Number Theory · Mathematics 2007-05-23 Trueman MacHenry , Kieh Wong

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

A recurrence relation of the generating function of the dimer model of Fibonacci type gives a functional relation for formal power series associated to lattice paths such as a Dyck, Motzkin and Schr\"oder path. In this paper, we generalize…

Combinatorics · Mathematics 2023-01-02 Keiichi Shigechi

We introduce a simple, rank-based algorithm for inverting the sweep map on (2n,n)-Dyck paths.

Combinatorics · Mathematics 2016-04-12 Erin Milne