English
Related papers

Related papers: Hook-Length Biases in $t$-regular partitions

200 papers

Recently, Blecher and Knopfmacher applied the notion of fixed points to integer partitions. This has already been generalized and refined in various ways such as $h$-fixed points for an integer parameter $h$ by Hopkins and Sellers. Here, we…

Combinatorics · Mathematics 2024-12-25 Philip Cuthbertson , David J. Hemmer , Brian Hopkins , William J. Keith

In a previous paper of the second author with K. Ono, surprising multiplicative properties of the partition function were presented. Here, we deal with $k$-regular partitions. Extending the generating function for $k$-regular partitions…

Number Theory · Mathematics 2014-09-11 Olivia Beckwith , Christine Bessenrodt

Motivated by a recent paper of Straub, we study the distribution of integer partitions according to the length of their largest hook, instead of the usual statistic, namely the size of the partitions. We refine Straub's analogue of Euler's…

Combinatorics · Mathematics 2016-04-15 Shishuo Fu , Dazhao Tang

We confirm the speculation that the distribution of $t$-hooks among unrestricted integer partitions essentially descends to self-conjugate partitions. Namely, we prove that the number of hooks of length $t$ among the size $n$ self-conjugate…

Combinatorics · Mathematics 2025-04-11 William Craig , Ken Ono , Ajit Singh

Let $p_t(a,b;n)$ denote the number of partitions of $n$ such that the number of $t$ hooks is congruent to $a \bmod{b}$. For $t\in \{2, 3\}$, arithmetic progressions $r_1 \bmod{m_1}$ and $r_2 \bmod{m_2}$ on which $p_t(r_1,m_1; m_2 n + r_2)$…

Number Theory · Mathematics 2022-06-22 Eleanor Mcspirit , Kristen Scheckelhoff

The hook length formula for $d$-complete posets states that the $P$-partition generating function for them is given by a product in terms of hook lengths. We give a new proof of the hook length formula using $q$-integrals. The proof is done…

Combinatorics · Mathematics 2019-02-18 Jang Soo Kim , Meesue Yoo

We give relations between the joint distributions of multiple hook lengths and of frequencies and part sizes in partitions, extending prior work in this area. These results are discovered by investigating truncations of the…

Combinatorics · Mathematics 2019-01-01 Emily E. Anible , William J. Keith

This paper proves a generalization of a conjecture of Guoniu Han, inspired originally by an identity of Nekrasov and Okounkov. The main result states that certain sums over partitions p of n, involving symmetric functions of the squares of…

Combinatorics · Mathematics 2009-04-10 Richard P. Stanley

We examine "partition zeta functions" analogous to the Riemann zeta function but summed over subsets of integer partitions. We prove an explicit formula for a family of partition zeta functions already shown to have nice properties -- those…

Number Theory · Mathematics 2021-05-12 Robert Schneider , Andrew V. Sills

In 2019, Andrews investigated integer partitions in which all parts of a given parity are smaller than those of the opposite parity and introduced eight partition functions based on the parity of the smaller parts and parts of a given…

Combinatorics · Mathematics 2025-12-01 Yan Fan , Ernest X. W. Xia

There is a well-studied correspondence by Jaclyn Anderson between partitions that avoid hooks of length s or t and certain binary strings of length s+t. Using this map, we prove that the total size of a random partition of this kind…

Combinatorics · Mathematics 2021-09-14 Chaim Even-Zohar

We exactly determine the maximum possible hook length of $(s,t)$-core partitions with $d$-distinct parts when there are finitely many such partitions. Moreover, we provide an algorithm to construct a $d$-distinct $(s,t)$-core partition with…

Combinatorics · Mathematics 2022-09-22 Ethan Pesikoff , Benjamin Przybocki , Janabel Xia

The concept of $t$-difference operator for functions of partitions is introduced to prove a generalization of Stanley's theorem on polynomiality of Plancherel averages of symmetric functions related to contents and hook lengths. Our…

Combinatorics · Mathematics 2017-03-21 Paul-Olivier Dehaye , Guo-Niu Han , Huan Xiong

A new algorithm for inserting rim-hooks into reverse plane partitions is presented. The insertion is used to define a bijection between reverse plane partitions of a fixed shape and multi-sets of rim-hooks. In turn this yields a bijective…

Combinatorics · Mathematics 2018-05-22 Robin Sulzgruber

In 2011, Han and Ji proved addition-multiplication theorems for integer partitions, from which they derived modular analogues of many classical identities involving hook-length. In the present paper, we prove addition-multiplication…

Combinatorics · Mathematics 2022-09-08 David Wahiche

This paper shows that the number of hooks of length k contained in all partitions of n equals k times the number of parts of length k in all partitions of n. It contains also formulas for the moments (under uniform distribution) of k-th…

Combinatorics · Mathematics 2007-05-23 Roland Bacher , Laurent Manivel

The classical hook length formula of enumerative combinatorics expresses the number of standard Young tableaux of a given partition shape as a single fraction. In recent years, two generalizations of this formula have emerged: one by Pak…

Combinatorics · Mathematics 2023-10-30 Darij Grinberg , Nazar Korniichuk , Kostiantyn Molokanov , Severyn Khomych

The paper is concerned with the asymptotic analysis of a family of Boltzmann (multiplicative) distributions over the set $\check{\varLambda}^{q}$ of strict integer partitions (i.e., with unequal parts) into perfect $q$-th powers. A…

Probability · Mathematics 2024-07-24 Jean C. Peyen , Leonid V. Bogachev , Paul P. Martin

We consider weighted generating functions of trees where the weights are products of functions of the sizes of the subtrees. This work begins with the observation that three different communities, largely independently, found substantially…

Combinatorics · Mathematics 2014-12-19 Bradley R. Jones , Karen Yeats

In this paper, we present, for any integer d, a description of the set of hooks in a d-symbol. We then introduce generalized hook length functions for a d-symbol, and prove a general result about them, involving the core and quotient of the…

Combinatorics · Mathematics 2013-01-09 Christine Bessenrodt , Jorn B. Olsson , Jean-Baptiste Gramain