相关论文: Hook length biases for self-conjugate partitions a…

Partition theory abounds with bijections between different types of partitions. One of the most famous partition bijections maps each self-conjugate partition of a positive integer $n$ to a partition of $n$ into distinct odd parts, and vice…

We give a bijection between the set of self-conjugate partitions and that of ordinary partitions. Also, we show the relation between hook lengths of self conjugate partition and corresponding partition via the bijection. As a corollary, we…

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…

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…

In a paper by the author, Hemmer, Hopkins, and Keith the concept of a fixed point in a sequence was applied to the sequence of first column hook lengths of a partition. In this paper we generalize this notion to fixed hook lengths in an…

Motivated by the many roles that hook lengths play in mathematics, we study the distribution of the number of $t$-hooks in the partitions of $n$. We prove that the limiting distribution is normal with mean $\mu_t(n)\sim…

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…

The combinatorial properties of partitions with various restrictions on their hooksets are explored. A connection with numerical semigroups extends current results on simultaneous s/t-cores. Conditions that suffice for a partition to…

In 2009, the first author proved the Nekrasov-Okounkov formula on hook lengths for integer partitions by using an identity of Macdonald in the framework of type $\widetilde A$ affine root systems, and conjectured that some summations over…

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…

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)$…

It is well-known that two conjugate partitions have the same hook multiset. But two different partitions with the same hook multiset may not be conjugate to each other. In $1977$, Herman and Chung proposed the following question: What are…

The Nekrasov--Okounkov hook length formula provides a fundamental link between the theory of partitions and the coefficients of powers of the Dedekind eta function. In this paper we examine three conjectures presented by Amdeberhan. The…

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…

The symplectic/orthogonal contents of partitions are related to the dimensions of irreducible representations of symplectic/orthogonal groups. In 2012, motivated by Nekrasov--Okounkov's hook-length formula and Stanley's hook-content…

This article is an extensive study of partitions with fixed number of odd and even-indexed odd parts. We use these partitions to generalize recent results of C. Savage and A. Sills. Moreover, we derive explicit formulas for generating…

In this paper, we present, given a odd integer $d$, a decomposition of the multiset of bar lengths of a bar partition $\lambda$ as the union of two multisets, one consisting of the bar lengths in its $\bar{d}$-core partition…

The set of hook lengths of an integer partition $\lambda$ is the complement of some numerical semigroup $S$. There has been recent interest in studying the number of partitions with a given set of hook lengths. Very little is known about…

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…

A {\em pointed partition} of $n$ is a pair $(\lambda, v)$ where $\lambda\vdash n$ and $v$ is a cell in its Ferrers diagram. We construct an involution on pointed partitions of $n$ exchanging "hook length" and "part length". This gives a…