Combinatorics on bounded free Motzkin paths and its applications

DOI10.37236/11375MaRDI QIDQ6400634arXivFDO

Authors Hyunsoo Cho, JiSun Huh, Hayan Nam, Jaebum Sohn

Publication date 31 May 2022

Exact enumeration problems, generating functions (05A15) Combinatorial aspects of partitions of integers (05A17) Combinatorial identities, bijective combinatorics (05A19)

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

t

-core partitions, and a set of bounded cornerless symmetric Motzkin paths and a set of self-conjugate

t

-core partitions. As an application, we get explicit formulas for the number of ordinary and self-conjugate

t

-core partitions with a fixed number of corners.

This page was built for publication: Combinatorics on bounded free Motzkin paths and its applications

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6400634)