Hook length formula and geometric combinatorics

From MaRDI portal
Revision as of 00:58, 30 January 2024 by Import240129110155 (talk | contribs) (Created automatically from import240129110155)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:5947966

zbMath0982.05109MaRDI QIDQ5947966

Igor Pak

Publication date: 8 November 2001

Published in: Séminaire Lotharingien de Combinatoire (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/121696

File on IPFS




Related Items (25)

Interview with Igor PakAsymptotic analysis of expectations of plane partition statisticsSkew shape asymptotics, a case-based introductionHook formulas for skew shapes. IV: Increasing tableaux and factorial Grothendieck polynomialsPartition bijections, a surveyA \(q\)-Robinson-Schensted-Knuth algorithm and a \(q\)-polymerHook formulas for skew shapes. I: \(q\)-analogues and bijectionsAn asymptotic scheme for analysis of expectations of plane partition statisticsYoung tableaux with periodic walls: counting with the density methodHook Formulas for Skew Shapes II. Combinatorial Proofs and Enumerative ApplicationsQuantum cohomology of Hilb\(_n(\mathbb C^2)\) and the weighted hook walk on Young diagramsMacMahon’s statistics on higher-dimensional partitionsRogers-Ramanujan identities and the Robinson-Schensted-Knuth correspondenceEnumeration of plane partitions by descentsThe weighted hook length formulaPolytopes and Large CounterexamplesOn an identity of Glass and Ng concerning the hook length formulaMinuscule reverse plane partitions via quiver representationsUnnamed ItemExistence of unimodular triangulations — positive resultsMinuscule reverse plane partitions via quiver representationsFriends and strangers walking on graphsGreene-Kleitman invariants for Sulzgruber insertionPeriodic Pólya urns, the density method and asymptotics of Young tableauxSpin \(q\)-Whittaker polynomials and deformed quantum Toda







This page was built for publication: Hook length formula and geometric combinatorics