On the maximum number of k-hooks of partitions of n

zbMATH Open1295.05031arXiv1212.3505MaRDI QIDQ396759FDOQ396759

Authors: Anna R. B. Fan, Harold R. L. Yang, Rebecca T. Yu 

Publication date: 14 August 2014

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Abstract: Let $alph{a}_k(lambda)$ denote the number of $k$-hooks in a partition $lambda$ and let $b(n,k)$ be the maximum value of $alph{a}_k(lambda)$ among partitions of $n$. Amdeberhan posed a conjecture on the generating function of $b(n,1)$. We give a proof of this conjecture. In general, we obtain a formula that can be used to determine $b(n,k)$. This leads to a generating function formula for $b(n,k)$. We introduce the notion of nearly $k$-triangular partitions. We show that for any $n$, there is a nearly $k$-triangular partition which can be transformed into a partition of $n$ that attains the maximum number of $k$-hooks. The operations for the transformation enable us to compute the number $b(n,k)$.

Full work available at URL: https://arxiv.org/abs/1212.3505

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Recommendations

• Hooks and powers of parts in partitions
• Maximal degrees for Young diagrams in the \((k,l)\) hook
• A Generating Function for Triangular Partitions
• On the number of partitions with a fixed largest part
• Partitions with prescribed hook differences

zbMATH Keywords

partitionhook lengthnearly \(k\)-triangular partition

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorial aspects of partitions of integers (05A17)

Cites Work

• Title not available (Why is that?)
• Partition bijections, a survey
• Title not available (Why is that?)
• The Nekrasov-Okounkov hook length formula: refinement, elementary proof, extension and applications
• Ramanujan's Lost Notebook
• Two symmetry problems in potential theory

Cited In (4)

• On multisets of hook lengths of partitions
• ON THE NUMBER OF 2-HOOKS AND 3-HOOKS OF INTEGER PARTITIONS
• Some Conjectures and Open Problems on Partition Hook Lengths
• Some combinatorial properties of hook lengths, contents, and parts of partitions

This page was built for publication: On the maximum number of \(k\)-hooks of partitions of \(n\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q396759)