Counting self-conjugate (s,s+1,s+2)-core partitions

DOI10.1007/S11139-020-00300-YzbMATH Open1462.05018arXiv1904.02313OpenAlexW3045580754MaRDI QIDQ829646FDOQ829646

Authors: Hyunsoo Cho, JiSun Huh, Jaebum Sohn 

Publication date: 6 May 2021

Published in: The Ramanujan Journal (Search for Journal in Brave)

Abstract: We are concerned with counting self-conjugate $(s,s+1,s+2)$-core partitions. A Motzkin path of length $n$ is a path from $(0,0)$ to $(n,0)$ which stays above the $x$-axis and consists of the up $U=(1,1)$, down $D=(1,-1)$, and flat $F=(1,0)$ steps. We say that a Motzkin path of length $n$ is symmetric if its reflection about the line $x=n/2$ is itself. In this paper, we show that the number of self-conjugate $(s,s+1,s+2)$-cores is equal to the number of symmetric Motzkin paths of length $s$, and give a closed formula for this number.

Full work available at URL: https://arxiv.org/abs/1904.02313

Recommendations

• Self-conjugate \(( s , s + d , s + 2 d )\)-core partitions and free Motzkin paths
• Self-conjugate \((s,s+d,\dots ,s+pd)\)-core partitions and free Motzkin paths
• Average size of a self-conjugate \((s,t)\)-core partition
• On self-conjugate \((s,s + 1,\dots,s + k)\)-core partitions
• The \((s,s+d,\ldots,s+pd)\)-core partitions and rational Motzkin paths

zbMATH Keywords

core partitionMotzkin pathself-conjugate

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Partitions which are simultaneously \(t_1\)- and \(t_2\)-core
• Lattice points and simultaneous core partitions
• Title not available (Why is that?)
• Results and conjectures on simultaneous core partitions
• Self-conjugate simultaneous \(p\)- and \(q\)-core partitions and blocks of \(A_n\)
• Multi-cores, posets, and lattice paths
• On the enumeration of \((s, s + 1, s + 2)\)-core partitions
• Simultaneous core partitions: parameterizations and sums
• On self-conjugate \((s,s + 1,\dots,s + k)\)-core partitions

Cited In (10)

• ON THE NUMBER OF NEARLY SELF-CONJUGATE PARTITIONS
• Self-conjugate \((s,s+d,\dots ,s+pd)\)-core partitions and free Motzkin paths
• The \((s,s+d,\ldots,s+pd)\)-core partitions and rational Motzkin paths
• The \((s,s+d,\dots,s+pd)\)-core partitions and the rational 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
• Corners of self-conjugate \((s,s + 1)\)-cores and \(( \overline{s}, \overline{s + 1})\)-cores
• On self-conjugate \((s,s + 1,\dots,s + k)\)-core partitions
• Title not available (Why is that?)
• Proof of a conjecture of Nath and Sellers on simultaneous core partitions

Uses Software

• OEIS

This page was built for publication: Counting self-conjugate \((s,s+1,s+2)\)-core partitions

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