2000 character limit reached
Combinatorics on bounded free Motzkin paths and its applications
Published 31 May 2022 in math.CO | (2205.15554v1)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.