English

Combinatorics on bounded free Motzkin paths and its applications

Combinatorics 2022-06-01 v1

Abstract

In this paper, we construct a bijection from a set of bounded free Motzkin paths to a set of bounded Motzkin prefixes that induces a bijection from a set of bounded free Dyck paths to a set of bounded Dyck prefixes. We also give bijections between a set of bounded cornerless Motzkin paths and a set of tt-core partitions, and a set of bounded cornerless symmetric Motzkin paths and a set of self-conjugate tt-core partitions. As an application, we get explicit formulas for the number of ordinary and self-conjugate tt-core partitions with a fixed number of corners.

Keywords

Cite

@article{arxiv.2205.15554,
  title  = {Combinatorics on bounded free Motzkin paths and its applications},
  author = {Hyunsoo Cho and JiSun Huh and Hayan Nam and Jaebum Sohn},
  journal= {arXiv preprint arXiv:2205.15554},
  year   = {2022}
}

Comments

19 pages, 8 figures, 2 tables

R2 v1 2026-06-24T11:34:03.502Z