English
Related papers

Related papers: Hook lengths in self-conjugate partitions

200 papers

Simultaneous core partitions have been widely studied in the past 20 years. In 2013, Amdeberhan gave several conjectures on the number, the average size, and the largest size of $(t,t+1)$-core partitions with distinct parts, which was…

Combinatorics · Mathematics 2025-03-04 Huan Xiong , Lihong Yang

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…

Number Theory · Mathematics 2018-10-09 Bernhard Heim , Markus Neuhauser

We study the complexity of computing Kronecker coefficients $g(\lambda,\mu,\nu)$. We give explicit bounds in terms of the number of parts $\ell$ in the partitions, their largest part size $N$ and the smallest second part $M$ of the three…

Combinatorics · Mathematics 2015-02-25 Igor Pak , Greta Panova

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

An alternative generating function is proposed to enumerate row-convex polyominoes without internal holes on a discrete grid. The approach is based on integer partitions of the total area, where each partition corresponds to a sequence of…

Combinatorics · Mathematics 2026-05-06 Vincenzo M. Scarrica

We classify the connection between $t$-cores and self-conjugate $t$-cores to sums of squares. To do so, we provide explicit maps between $t$-core partitions and self-conjugate $t$-core partitions of a positive integer $n$ to representations…

Combinatorics · Mathematics 2022-04-20 Joshua Males , Zack Tripp

In the $1970$s Nicolas proved that the coefficients $p_d(n)$ defined by the generating function \begin{equation*} \sum_{n=0}^{\infty} p_d(n) \, q^n = \prod_{n=1}^{\infty} \left( 1- q^n\right)^{-n^{d-1}} \end{equation*} are log-concave for…

Combinatorics · Mathematics 2022-06-23 Bernhard Heim , Markus Neuhauser

We use the hook lengths of a partition to define two rectangular tableaux. We prove these tableaux have equal multisets of entries, first by elementary combinatorial arguments, and then using Stanley's Hook Content Formula and symmetric…

Combinatorics · Mathematics 2019-04-19 Mark Wildon

We give a closed formula for the number of partitions $\lambda$ of $n$ such that the corresponding irreducible representation $V_\lambda$ of $S_n$ has non-trivial determinant. We determine how many of these partitions are self-conjugate and…

Representation Theory · Mathematics 2017-03-22 Arvind Ayyer , Amritanshu Prasad , Steven Spallone

Let $p(n)$ be the number of all integer partitions of the positive integer $n$ and let $\lambda$ be a partition, selected uniformly at random from among all such $p(n)$ partitions. It is known that each partition $\lambda$ has a unique…

Combinatorics · Mathematics 2019-12-06 Ljuben Mutafchiev

It is observed that the conjugacy growth series of the infinite fini-tary symmetric group with respect to the generating set of transpositions is the generating series of the partition function. Other conjugacy growth series are computed,…

Group Theory · Mathematics 2016-06-16 Roland Bacher , Pierre De La Harpe

MacMahon's classic generating function of random plane partitions, which is related to Schur polynomials, was recently extended by Vuletic to a generating function of weighted plane partitions that is related to Hall-Littlewood polynomials,…

Mathematical Physics · Physics 2010-03-26 O Foda , M Wheeler

The enumeration of standard Young tableaux (SYTs) of shape {\lambda} can be easily computed by the hook-length formula. In 1981, Amitai Regev proved that the number of SYTs having at most three rows with n entries equals the nth Motzkin…

Combinatorics · Mathematics 2011-07-21 Jong Hyun Kim

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

We prove that the partition function $p(n)$ is log-concave for all $n>25$. We then extend the results to resolve two related conjectures by Chen. The proofs are based on Lehmer's estimates on the remainders of the Hardy--Ramanujan and the…

Combinatorics · Mathematics 2014-07-07 Stephen DeSalvo , Igor Pak

A tremendous amount of research has been done in the last two decades on $(s,t)$-core partitions when $s$ and $t$ are positive integers with no common divisor. Here we change perspective slightly and explore properties of $(s,t)$-core and…

Combinatorics · Mathematics 2024-05-31 Jean-Baptiste Gramain , Rishi Nath , James A. Sellers

Given a partition $\lambda$, we write $e_j(\lambda)$ for the $j^{\textrm{th}}$ elementary symmetric polynomial $e_j$ evaluated at the parts of $\lambda$ and $e_jp_A(n)$ for the sum of $e_j(\lambda)$ as $\lambda$ ranges over the set of…

Combinatorics · Mathematics 2024-08-27 Cristina Ballantine , George Beck , Mircea Merca

We study generating functions which count the sizes of $t$-cores of partitions, and, more generally, the sizes of higher rows in $t$-core towers. We then use these results to derive an asymptotic for the average size of the $t$-defect of…

Number Theory · Mathematics 2015-09-23 Larry Rolen

The rook numbers are fairly well-studied in the literature. In this paper, we study the max-rook number of the Ferrers boards associated to integer partitions. We show its connections with the Durfee triangle of the partitions. The max-rook…

Combinatorics · Mathematics 2025-07-29 N. Guru Sharan

We compute the generating function of column-strict plane partitions with parts in {1,2,...,n}, at most c columns, p rows of odd length and k parts equal to n. This refines both, Krattenthaler's ["The major counting of nonintersecting…

Combinatorics · Mathematics 2007-05-23 Ilse Fischer
‹ Prev 1 3 4 5 6 7 10 Next ›