English
Related papers

Related papers: Recursions for rational q,t-Catalan numbers

200 papers

In this paper, we construct three binary linear codes $C(SO^{-}(2,q))$, $C(O^{-}(2,q))$, $C(SO^{-}(4,q))$, respectively associated with the orthogonal groups $SO^{-}(2,q)$, $O^{-}(2,q)$, $SO^{-}(4,q)$, with $q$ powers of two. Then we obtain…

Number Theory · Mathematics 2008-08-25 Dae San Kim

We provide some variations on the Greene-Krammer's identity which involve q-Catalan numbers. Our method reveals a curious analogy between these new identities and some congruences modulo a prime.

Combinatorics · Mathematics 2009-05-26 Roberto Tauraso

It is shown that a SU(1,1) algebra may be used to provide a unified description of the simple hamonic oscillator and the angular momentum algebras and a class of other semi-infinite algebras. A normal ordered representation of a Unitary…

Mathematical Physics · Physics 2018-09-14 C. V. Sukumar

The article is devoted to the investigation of representation of rational numbers by Cantor series. Necessary and sufficient conditions for a rational number to be representable by a positive Cantor series are formulated for the case of an…

Number Theory · Mathematics 2019-04-23 Symon Serbenyuk

The linking number of an oriented two-component link is an invariant indicating how intertwined the two components are. Tuler proved that the linking number of a two-component rational $\frac{p}{q}$-link is $$\sum^{\frac{|p|}{2}}_{k=1}…

Geometric Topology · Mathematics 2024-03-19 Hyoungjun Kim , Sungjong No , Hyungkee Yoo

This paper examines the recursive sequence of polynomials $p_n(x)$, defined by $p_0(x) = x^2 - 2$ and $p_n(x) = p_{n-1}(x)^2 - 2$ for $n \geq 1$. It describes the field-theoretic motivations behind this sequence, derives a recursive formula…

Combinatorics · Mathematics 2025-01-24 Sophie Marques , Elizabeth Mrema

We give two trees allowing to represent all positive rational numbers. These trees can be seen as ternary and quinary analogues of the Calkin-Wilf tree. For each of these two trees, we give recurrence formulas allowing to compute the…

Number Theory · Mathematics 2018-03-26 Lionel Ponton

Using generalized binomial coefficient identities and some results of John Dougall, we derive some families of series involving the cubes of Catalan numbers. We also establish a family of series containing fourth powers of Catalan numbers.…

Number Theory · Mathematics 2026-04-03 Kunle Adegoke

We describe how the reversion of a series is related to convolutional recurrence relations for the series, and we place this relationship in the context of Riordan arrays. As an example of the approach, we give new recurrence relations for…

Combinatorics · Mathematics 2017-03-14 Thomas M. Richardson

In this note we introduce several instructive examples of bijections found between several different combinatorially defined sequences of sets. Each sequence has cardinalities given by the Catalan numbers. Our results answer some questions…

Combinatorics · Mathematics 2013-03-01 Stefan Forcey , Mohammadmehdi Kafashan , Mehdi Maleki , Michael Strayer

We introduce a refinement of Boolean-Catalan numbers and call them Boolean-Narayana numbers. We provide an explicit formula for these numbers, and prove unimodality, log-concavity, and real-roots-only results for their sequences. We also…

Combinatorics · Mathematics 2026-04-14 Miklos Bona

We recast homogeneous linear recurrence sequences with fixed coefficients in terms of partial Bell polynomials, and use their properties to obtain various combinatorial identities and multifold convolution formulas. Our approach relies on a…

Combinatorics · Mathematics 2014-12-17 Daniel Birmajer , Juan B. Gil , Michael D. Weiner

The higher $q,t$-Catalan polynomial $C^{(m)}_n(q,t)$ can be defined combinatorially as a weighted sum of lattice paths contained in certain triangles, or algebraically as a complicated sum of rational functions indexed by partitions of $n$.…

Combinatorics · Mathematics 2019-11-01 Kyungyong Lee , Li Li , Nicholas A. Loehr

Let $M_{d,n}(q)$ denote the number of monic irreducible polynomials in $\mathbb{F}_q[x_1, x_2, \ldots , x_n]$ of degree $d$. We show that for a fixed degree $d$, the sequence $M_{d,n}(q)$ converges $q$-adically to an explicitly determined…

Number Theory · Mathematics 2018-09-10 Trevor Hyde

The HOMFLY polynomial of the $(m,n)$ torus knot $T_{m,n}$ can be extracted from the doubly graded character of the finite-dimensional representation $\mathrm{L}_{\frac{m}{n}}$ of the type $A_{n-1}$ rational Cherednik algebra as observed by…

Representation Theory · Mathematics 2024-03-01 Xinchun Ma

For every complex number $x$, let $\Vert x\Vert_{\mathbb{Z}}:=\min\{|x-m|:\ m\in\mathbb{Z}\}$. Let $K$ be a number field, let $k\in\mathbb{N}$, and let $\alpha_1,\ldots,\alpha_k$ be non-zero algebraic numbers. In this paper, we completely…

Number Theory · Mathematics 2015-11-30 Avinash Kulkarni , Niki Myrto Mavraki , Khoa D. Nguyen

We solve two open problems in Coxeter-Catalan combinatorics. First, we introduce a family of rational noncrossing objects for any finite Coxeter group, using the combinatorics of distinguished subwords. Second, we give a type-uniform proof…

Combinatorics · Mathematics 2022-08-02 Pavel Galashin , Thomas Lam , Minh-Tâm Quang Trinh , Nathan Williams

In this paper we shall survey the various methods of evaluating Hankel determinants and as an illustration we evaluate some Hankel determinants of a q-analogue of Catalan numbers. Here we consider $\frac{(aq;q)_{n}}{(abq^{2};q)_{n}}$ as a…

Combinatorics · Mathematics 2010-10-14 Masao Ishikawa , Hiroyuki Tagawa , Jiang Zeng

For each $p>0$ we define by recurrence a triangle $T^p(n,k)$ whose rows sum to the Fuss-Catalan numbers $ \frac{1}{p n+1}\binom{pn+1}{n}$, generalizing the known Catalan triangle corresponding to the case $p=2$. (In fact, $T^p(n,k)$ has an…

Combinatorics · Mathematics 2024-02-26 Francesca Aicardi

In this note, we present some basic properties of $q$-Fibonacci numbers and their relationship to the $q$-golden ratio and Catalan numbers. We then use this relationship to give a short proof of a combinatorial identity.

Combinatorics · Mathematics 2021-08-12 Kevin Carde
‹ Prev 1 3 4 5 6 7 10 Next ›