English
Related papers

Related papers: Enumeration on polyominoes determined by Catalan w…

200 papers

An and/or tree is usually a binary plane tree, with internal nodes labelled by logical connectives, and with leaves labelled by literals chosen in a fixed set of k variables and their negations. In the present paper, we introduce the first…

Combinatorics · Mathematics 2014-04-28 Antoine Genitrini , Cécile Mailler

The goal of this paper is to introduce and study noncommutative Catalan numbers $C_n$ which belong to the free Laurent polynomial algebra in $n$ generators. Our noncommutative numbers admit interesting (commutative and noncommutative)…

Quantum Algebra · Mathematics 2019-10-09 Arkady Berenstein , Vladimir Retakh

A parking function of length n is a sequence (b_1, b_2,..., b_n) of nonnegative integers whose nondecreasing rearrangement (a_1, a_2,...,a_n) has the property that a_i < i for every i. A well-known result about parking functions is that the…

Combinatorics · Mathematics 2007-05-23 Dimitrije Kostic , Catherine Yan

We construct subsets of Euclidean space of large Hausdorff dimension and full Minkowski dimension that do not contain nontrivial patterns described by the zero sets of functions. The results are of two types. Given a countable collection of…

Classical Analysis and ODEs · Mathematics 2018-04-18 Robert Fraser , Malabika Pramanik

Motivated by Vassiliev's knot invariants, Stoimenow introduced a special class of matchings, now known as Stoimenow matchings. These matchings have since been linked to various combinatorial structures enumerated by the Fishburn numbers. In…

Combinatorics · Mathematics 2025-09-17 Shuzhen Lv , Sergey Kitaev

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

We consider Tuenter polynomials as linear combinations of descending factorials and show that coefficients of these linear combinations are expressed via a Catalan triangle of numbers. We also describe a triangle of coefficients in terms of…

Combinatorics · Mathematics 2016-06-15 Andrei K. Svinin

Motzkin excursions and meanders are revisited. This is considered in the context of forbidden patterns. Previous work by Asinowski, Banderier, Gittenberger, and Roitner is continued. Motzkin paths of bounded height are considered, leading…

Combinatorics · Mathematics 2023-11-21 Helmut Prodinger

We introduce a kind of $(p, q, t)$-Catalan numbers of Type A by generalizing the Jacobian type continued fraction formula, we proved that the corresponding expansions could be expressed by the polynomials counting permutations on…

Combinatorics · Mathematics 2023-05-09 Bin Han , Qiongqiong Pan

We show that matchings avoiding certain partial patterns are counted by the 3-Catalan numbers. We give a characterization of 12312-avoiding matchings in terms of restrictions on the corresponding oscillating tableaux. We also find a…

Combinatorics · Mathematics 2007-05-23 William Y. C. Chen , Toufik Mansour , Sherry H. F. Yan

This article introduces and investigates a refinement of alternating sign trapezoids by means of Catalan objects and Motzkin paths. Alternating sign trapezoids are a generalisation of alternating sign triangles, which were recently…

Combinatorics · Mathematics 2019-05-24 Florian Aigner

This paper is about counting the number of distinct (scattered) subwords occurring in a given word. More precisely, we consider the generalization of the Pascal triangle to binomial coefficients of words and the sequence $(S(n))_{n\ge 0}$…

Combinatorics · Mathematics 2017-05-24 Julien Leroy , Michel Rigo , Manon Stipulanti

The existence of apparently coincidental equalities (also called Wilf-equivalences) between the enumeration sequences, or generating functions, of various hereditary classes of combinatorial structures has attracted significant interest. We…

Combinatorics · Mathematics 2014-08-01 Michael Albert , Mathilde Bouvel

Let $W^c(A_n)$ be the set of fully commutative elements in the $A_n$-type Coxeter group. Using only the settings of their canonical form, we recount $W^c(A_n)$ by the recurrence that is taken as a definition of the Catalan number $C_{n+1}$…

Combinatorics · Mathematics 2024-01-18 Sadek Al Harbat

In this paper, we study congruences on sums of products of binomial coefficients that can be proved by using properties of the Jacobi polynomials. We give special attention to polynomial congruences containing Catalan numbers, second-order…

Number Theory · Mathematics 2015-12-21 Khodabakhsh Hessami Pilehrood , Tatiana Hessami Pilehrood

We introduce the notion of a Mahonian pair. Consider the set, P^*, of all words having the positive integers as alphabet. Given finite subsets S,T of P^*, we say that (S,T) is a Mahonian pair if the distribution of the major index, maj,…

Combinatorics · Mathematics 2011-11-03 Bruce E. Sagan , Carla D. Savage

We prove that the class of permutations generated by passing an ordered sequence $12\dots n$ through a stack of depth 2 and an infinite stack in series is in bijection with an unambiguous context-free language, where a permutation of length…

Combinatorics · Mathematics 2014-08-05 Murray Elder , Geoffrey Lee , Andrew Rechnitzer

We introduce a family of univariate polynomials indexed by integer partitions. At prime powers, they count the number of subspaces in a finite vector space that transform under a regular diagonal matrix in a specified manner. This…

Combinatorics · Mathematics 2024-09-17 Amritanshu Prasad , Samrith Ram

We construct (q,t)-Catalan polynomials and q-Fuss-Catalan polynomials for any irreducible complex reflection group W. The two main ingredients in this construction are Rouquier's formulation of shift functors for the rational Cherednik…

Combinatorics · Mathematics 2009-12-09 Iain Gordon , Stephen Griffeth

We prove a conjecture of Guo and Poznanovi\'{c} concerning chains in certain 01-fillings of moon polyominoes. A key ingredient of our proof is a correspondence between words $w$ and pairs $(\mathcal{W}(w), \mathcal{M}(w))$ of increasing…

Combinatorics · Mathematics 2023-11-14 Jonathan S. Bloom , Dan Saracino