Search arXivSearch

arXiv · 2503.12040

On the distribution of $t$-hooks of doubled distinct partitions

Abstract

Recently, Griffin, Ono, and Tsai examined the distribution of the number of $t$-hooks in partitions of $n$, which was later followed by the work of Craig, Ono, and Singh on the distribution of the number of $t$-hooks in self-conjugate partitions of $n$. Motivated by these studies, in this paper, we further investigate the number of $t$-hooks in some subsets of partitions. More specifically, we obtain the generating functions for the number of $t$-hooks in doubled distinct partitions and the number of $t$-shifted hooks in strict partitions. Based on these generating functions, we prove that the number of $t$-hooks in doubled distinct partitions and the number of $t$-shifted hooks in strict partitions are both asymptotically normally distributed.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Hyunsoo Cho, Byungchan Kim, Eunmi Kim, Ae Ja Yee. 2025-03-15. On the distribution of $t$-hooks of doubled distinct partitions. https://arxiv.org/abs/2503.12040

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO