Modular Catalan numbers

Nickolas Hein, Jia Huang

Research output: Contribution to journalArticle

2 Citations (Scopus)

Abstract

The Catalan number Cn enumerates parenthesizations of x0∗⋯∗xn where ∗ is a binary operation. We introduce the modular Catalan number Ck,n to count equivalence classes of parenthesizations of x0∗⋯∗xn when ∗ satisfies a k-associative law generalizing the usual associativity. This leads to a study of restricted families of Catalan objects enumerated by Ck,n with emphasis on binary trees, plane trees, and Dyck paths, each avoiding certain patterns. We give closed formulas for Ck,n with two different proofs. For each n≥0 we compute the largest size of k-associative equivalence classes and show that the number of classes with this size is a Catalan number.

Original languageEnglish (US)
Pages (from-to)197-218
Number of pages22
JournalEuropean Journal of Combinatorics
Volume61
DOIs
StatePublished - Mar 1 2017

Fingerprint

Catalan number
Equivalence class
Dyck Paths
Binary operation
Associativity
Binary Tree
Count
Closed

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics

Cite this

Modular Catalan numbers. / Hein, Nickolas; Huang, Jia.

In: European Journal of Combinatorics, Vol. 61, 01.03.2017, p. 197-218.

Research output: Contribution to journalArticle

Hein, Nickolas ; Huang, Jia. / Modular Catalan numbers. In: European Journal of Combinatorics. 2017 ; Vol. 61. pp. 197-218.
@article{cdf29f10c01246d6949abcd7d485b46c,
title = "Modular Catalan numbers",
abstract = "The Catalan number Cn enumerates parenthesizations of x0∗⋯∗xn where ∗ is a binary operation. We introduce the modular Catalan number Ck,n to count equivalence classes of parenthesizations of x0∗⋯∗xn when ∗ satisfies a k-associative law generalizing the usual associativity. This leads to a study of restricted families of Catalan objects enumerated by Ck,n with emphasis on binary trees, plane trees, and Dyck paths, each avoiding certain patterns. We give closed formulas for Ck,n with two different proofs. For each n≥0 we compute the largest size of k-associative equivalence classes and show that the number of classes with this size is a Catalan number.",
author = "Nickolas Hein and Jia Huang",
year = "2017",
month = "3",
day = "1",
doi = "10.1016/j.ejc.2016.11.004",
language = "English (US)",
volume = "61",
pages = "197--218",
journal = "European Journal of Combinatorics",
issn = "0195-6698",
publisher = "Academic Press Inc.",

}

TY - JOUR

T1 - Modular Catalan numbers

AU - Hein, Nickolas

AU - Huang, Jia

PY - 2017/3/1

Y1 - 2017/3/1

N2 - The Catalan number Cn enumerates parenthesizations of x0∗⋯∗xn where ∗ is a binary operation. We introduce the modular Catalan number Ck,n to count equivalence classes of parenthesizations of x0∗⋯∗xn when ∗ satisfies a k-associative law generalizing the usual associativity. This leads to a study of restricted families of Catalan objects enumerated by Ck,n with emphasis on binary trees, plane trees, and Dyck paths, each avoiding certain patterns. We give closed formulas for Ck,n with two different proofs. For each n≥0 we compute the largest size of k-associative equivalence classes and show that the number of classes with this size is a Catalan number.

AB - The Catalan number Cn enumerates parenthesizations of x0∗⋯∗xn where ∗ is a binary operation. We introduce the modular Catalan number Ck,n to count equivalence classes of parenthesizations of x0∗⋯∗xn when ∗ satisfies a k-associative law generalizing the usual associativity. This leads to a study of restricted families of Catalan objects enumerated by Ck,n with emphasis on binary trees, plane trees, and Dyck paths, each avoiding certain patterns. We give closed formulas for Ck,n with two different proofs. For each n≥0 we compute the largest size of k-associative equivalence classes and show that the number of classes with this size is a Catalan number.

UR - http://www.scopus.com/inward/record.url?scp=85002835525&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85002835525&partnerID=8YFLogxK

U2 - 10.1016/j.ejc.2016.11.004

DO - 10.1016/j.ejc.2016.11.004

M3 - Article

AN - SCOPUS:85002835525

VL - 61

SP - 197

EP - 218

JO - European Journal of Combinatorics

JF - European Journal of Combinatorics

SN - 0195-6698

ER -