Combinatorics on bounded free Motzkin paths and its applications
Summary: 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.
- Self-conjugate \((s,s+d,\dots ,s+pd)\)-core partitions and free Motzkin paths
- Bijections between bar-core and self-conjugate core partitions
- Self-conjugate \(( s , s + d , s + 2 d )\)-core partitions and free Motzkin paths
- The (s,s+d,,s+pd)-core partitions and the rational Motzkin paths
- The \((s,s+d,\ldots,s+pd)\)-core partitions and rational Motzkin paths
- Between Broadway and the Hudson: A Bijection of Corridor Paths
- Combinatorics on lattice paths in strips
- Corners of self-conjugate \((s,s + 1)\)-cores and \(( \overline{s}, \overline{s + 1})\)-cores
- Counting paths in corridors using circular Pascal arrays
- scientific article; zbMATH DE number 3771876 (Why is no real title available?)
- Self-conjugate \((s,s+d,\dots ,s+pd)\)-core partitions and free Motzkin paths
- Self-conjugate simultaneous \(p\)- and \(q\)-core partitions and blocks of \(A_n\)
- Statistics on bargraphs viewed as cornerless Motzkin paths
- The (s,s+d,,s+pd)-core partitions and the rational Motzkin paths
- The corners of core partitions
- The on-line encyclopedia of integer sequences
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 Q2699641)