English
Related papers

Related papers: Hook lengths and shifted parts of partitions

200 papers

In this note, we will give a short proof of an identity for cubic partitions.

Number Theory · Mathematics 2015-03-17 Xinhua Xiong

In this paper, we extend the work of Andrews, Beck and Hopkins by considering partitions and compositions with bounded gaps between each pair of consecutive parts. We show that both their generating functions and two matrices determined by…

Combinatorics · Mathematics 2021-08-11 George Beck , Shane Chern

The Macdonald symmetric functions are used to define measures on the set of all partitions of all integers. Probabilistic algorithms are given for growing partitions according to these measures. The case of Hall-Littlewood polynomials is…

Combinatorics · Mathematics 2007-05-23 Jason Fulman

In this article, we provide partition-theoretic interpretations for some new truncated pentagonal number theorem and identities of Gauss. Also, we deduce few inequalities for some partition functions.

Combinatorics · Mathematics 2022-08-11 D. S. Gireesh , B. Hemanthkumar

Using previous work by Merca, we show the partition function involving parts of k different magnitudes, shifted by the triangular numbers, equals the self convolution of the unrestricted partition function. We also provide a combinatorial…

Number Theory · Mathematics 2018-06-22 Saud Hussein

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

Recently, a new weighted generalization of the branching rule for the hook lengths, equivalent to the hook formula, was proved. In this paper, we generalize the complementary branching rule, which can be used to prove Burnside's formula. We…

Combinatorics · Mathematics 2010-06-10 Matjaz Konvalinka

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

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

Alternative novel measures of the distance between any two partitions of a n-set are proposed and compared, together with a main existing one, namely 'partition-distance' D(.,.). The comparison achieves by checking their restriction to…

Discrete Mathematics · Computer Science 2011-06-24 Giovanni Rossi

For fixed $t = 2$ or $3$, we investigate the statistical properties of $\{Y_t(n)\}$, the sequence of random variables corresponding to the number of hook lengths divisible by $t$ among the partitions of $n$. We characterize the support of…

Number Theory · Mathematics 2022-11-15 Hannah Lang , Hamilton Wan , Nancy Xu

We study integral ratios of hook products of quotient partitions. This question is motivated by an analogous question in number theory concerning integral factorial ratios. We prove an analogue of a theorem of Landau that already applied in…

Combinatorics · Mathematics 2011-11-28 Paul-Olivier Dehaye

We prove two identities of Hall-Littlewood polynomials, which appeared recently in a paper by two of the authors. We also conjecture, and in some cases prove, new identities which relate infinite sums of symmetric polynomials and partition…

Combinatorics · Mathematics 2015-09-18 D. Betea , M. Wheeler , P. Zinn-Justin

Partition functions of certain classes of "spin glass" models in statistical physics show strong connections to combinatorial graph invariants. Also known as homomorphism functions they allow for the representation of many such invariants,…

Computational Complexity · Computer Science 2010-04-08 Marc Thurley

We give another proof for the (-1)-enumeration of self-complementary plane partitions with at least one odd side-length by specializing a certain Schur function identity. The proof is analogous to Stanley's proof for the ordinary…

Combinatorics · Mathematics 2007-05-23 Theresia Eisenkölbl

In the paper, we give partition-theoretic results for the coefficients of some mock theta functions and prove their congruence properties. Some recurrence relations connecting the coefficients of the mock theta functions with certain…

Number Theory · Mathematics 2024-02-28 Sabi Biswas , Nipen Saikia

In a recent work, Andrews gave analytic proofs of two conjectures concerning some variations of two combinatorial identities between partitions of a positive integer into odd parts and partitions into distinct parts discovered by Beck.…

Combinatorics · Mathematics 2018-10-09 Jane Y. X. Yang

Let $b_{t,i}(n)$ denote the total number of $i$-hooks in $t$-regular partitions of $n$. Singh and Barman conjectured that $b_{t+1,2}(n) \geq b_{t,2}(n)$ holds for all $t\ge 3$ and $n\ge 0$. This conjecture was known to hold for $t=3$ due to…

Combinatorics · Mathematics 2025-11-20 Hongshu Lin , Wenston J. T. Zang

In this paper we go on to discuss about Stanley's theorem in Integer partitions. We give two different versions for the proof of the generalization of Stanley's theorem illustrating different techniques that may be applied to profitably…

Combinatorics · Mathematics 2016-10-07 Suprokash Hazra

The generating function of reverse plane partitions of a fixed shape factors into a product featuring the hook-lengths of this shape. This result, which was first obtained by Stanley, can be explained bijectively using the Hillman-Grassl…

Combinatorics · Mathematics 2017-01-25 Robin Sulzgruber