English
Related papers

Related papers: Boolean-Narayana numbers

200 papers

Recent work of the first author, Negut and Rasmussen, and of Oblomkov and Rozansky in the context of Khovanov--Rozansky knot homology produces a family of polynomials in $q$ and $t$ labeled by integer sequences. These polynomials can be…

Combinatorics · Mathematics 2020-08-26 Eugene Gorsky , Graham Hawkes , Anne Schilling , Julianne Rainbolt

A sequence $\{z_n\}_{n\geq0}$ is called ratio log-convex in the sense that the ratio sequence $\{\frac{z_{n+1}}{z_n}\}_{n\geq0}$ is log-convex. Based on a three-term recurrence for sequences, we develop techniques for dealing with the ratio…

Combinatorics · Mathematics 2013-10-01 Bao-Xuan Zhu

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 a class of strongly q-log-convex polynomials based on a triangular recurrence relation with linear coefficients, and we show that the Bell polynomials, the Bessel polynomials, the Ramanujan polynomials and the Dowling…

Combinatorics · Mathematics 2019-08-15 William Y. C. Chen , Larry X. W. Wang , Arthur L. B. Yang

Univariate polynomial root-finding is a classical subject, still important for modern computing. Frequently one seeks just the real roots of a polynomial with real coefficients. They can be approximated at a low computational cost if the…

Symbolic Computation · Computer Science 2017-04-14 Victor Y. Pan , Liang Zhao

We introduce and study a generalization of the Narayana numbers $N_d(n,k) = \frac{1}{n+1} \binom{n+1}{k+1} \binom{ n + (n-k)(d-2)+1}{k}$ for integers $d \geq 2$ and $n,k \geq 0$. This two-parameter array extends the classical Narayana…

Combinatorics · Mathematics 2025-12-10 Yu Hin Au , Murray R. Bremner

Building upon a recent formula for $(3,m)$-Catalan polynomials, we describe a formula for $(3,m)$-Hikita polynomials in terms related to Catalan polynomials. This formula shows a surprising relation among coefficients of Hikita polynomials…

Combinatorics · Mathematics 2016-12-14 Ryan Kaliszewski , Debdut Karmakar

The Raney numbers $R_{p,r}(k)$ are a two-parameter generalization of the Catalan numbers. In this paper, we obtain a recurrence relation for the Raney numbers which is a generalization of the recurrence relation for the Catalan numbers.…

Combinatorics · Mathematics 2015-12-29 Robin DaPao Zhou

We present an algorithmic mapping from permutations of length dn to labeled n-node d-ary trees and back again. Given such a bijection, one can interpret each of the factorials in the formula for the Catalan numbers as a count of…

Combinatorics · Mathematics 2007-05-23 Bennet Vance

We introduce a class of sequences, defined by means of partial Bell polynomials, that contains a basis for the space of linear recurrence sequences with constant coefficients as well as other well-known sequences like Catalan and Motzkin.…

Number Theory · Mathematics 2015-12-31 Daniel Birmajer , Juan B. Gil , Michael D. Weiner

We introduce and study a `level two' generalization of the poly-Bernoulli numbers, which may also be regarded as a generalization of the cosecant numbers. We prove a recurrence relation, two exact formulas, and a duality relation for…

Number Theory · Mathematics 2019-08-01 Masanobu Kaneko , Maneka Pallewatta , Hirofumi Tsumura

We show that the Catalan-Schroeder convolution recurrences and their higher order generalizations can be solved using Riordan arrays and the Catalan numbers. We investigate the Hankel transforms of many of the recurrence solutions, and…

Combinatorics · Mathematics 2019-10-03 Paul Barry

This article is motivated by the following satisfiability question: pick uniformly at random an and/or Boolean expression of length n, built on a set of k_n Boolean variables. What is the probability that this expression is satisfiable?…

Combinatorics · Mathematics 2015-07-31 Antoine Genitrini , Cécile Mailler

In this lecture notes we try to familiarize the audience with the theory of Bernoulli polynomials; we study their properties, and we give, with proofs and references, some of the most relevant results related to them. Several applications…

Classical Analysis and ODEs · Mathematics 2016-02-10 Omran Kouba

A new $q$-analogue of Appell polynomial sequences and their generalizations are introduced and their main characterizations are proved. As consequences new $q$-analogue of Bernoulli and Euler polynomials and numbers is introduced, their…

Classical Analysis and ODEs · Mathematics 2018-01-29 P. Njionou Sadjang

We establish some new Tur\'an's type inequalities for orthogonal polynomials defined by a three-term recurrence with monotonic coefficients. As a corollary we deduce asymptotic bounds on the extreme zeros of orthogonal polynomials with…

Classical Analysis and ODEs · Mathematics 2011-01-18 Ilia Krasikov

In this note we prove combinatorially some new formulas connecting poly-Bernoulli numbers with negative indices to Eulerian numbers.

Combinatorics · Mathematics 2018-12-10 Beata Benyi , Peter Hajnal

We study matrix three term relations for orthogonal polynomials in two variables constructed from orthogonal polynomials in one variable. Using the three term recurrence relation for the involved univariate orthogonal polynomials, the…

Classical Analysis and ODEs · Mathematics 2016-03-24 Misael Marriaga , Teresa E. Pérez , Miguel A. Piñar

We define the notion of a Catalan pair (which is a pair of binary relations (S,R) satisfying certain axioms) with the aim of giving a common language to most of the combinatorial interpretations of Catalan numbers. We show, in particular,…

Combinatorics · Mathematics 2009-01-23 Filippo Disanto , Luca Ferrari , Renzo Pinzani , Simone Rinaldi

We derive new matrix representation for higher-order changhee numbers and polynomials. This helps us to obtain simple and short proofs of many previous results on higher-order changhee numbers and polynomials. Moreover, we obtain recurrence…

Combinatorics · Mathematics 2019-09-16 Beih S. El-Desouky , Abdelfattah Mustafa , Nenad P. Cakic
‹ Prev 1 4 5 6 7 8 10 Next ›