A combinatorial problem

Cited in

(41)

The Hillman-Grassl correspondence and the enumeration of reverse plane partitions
Hook, line and sinker: a bijective proof of the skew shifted hook-length formula
On polynomial-like functions
Enumeration of Gelfand-Cetlin type reduced words
Pattern-avoiding polytopes
Enumeration of standard barely set-valued tableaux of shifted shapes
Paths towards synchronization: analytical treatment of completely connected networks
Chains of maximum length in the Tamari lattice.
Quantum cohomology of Hilb\(_n(\mathbb C^2)\) and the weighted hook walk on Young diagrams
Free hyperplane arrangements between \(A_{n-1}\) and \(B_ n\)
Ranking patterns of unfolding models of codimension one
The weighted hook length formula
Similar constructions for Young tableaux and involutions, and their application to shiftable tableaux
On an inclusion-exclusion formula based on the reflection principle
Polynomial approach to explicit formulae for generalized binomial coefficients
On root arrangements for hyperbolic polynomial-like functions and their derivatives
Corners of self-conjugate \((s,s + 1)\)-cores and \(( \overline{s}, \overline{s + 1})\)-cores
Pattern-avoiding polytopes
Generalized rank functions and quilts of alternating sign matrices
Balanced shifted tableaux
The character generator of SU(n)
The Degree Formula for the Skew-Representations of the Symmetric Group
Bijecting hidden symmetries for skew staircase shapes
Skew hook formula for \(d\)-complete posets via equivariant \(K\)-theory
On arrangements of roots for a real hyperbolic polynomial and its derivatives
On random shifted standard Young tableaux and 132-avoiding sorting networks
New hook-content formulas for strict partitions
Balanced shifted tableaux
Tableaux and chains in a new partial order of \(S_ n\)
The CDE property for minuscule lattices
Generalized Pitman-Stanley polytope: vertices and faces
Extensions of Rolle's theorem
A marvellous embedding of the Lagrangian Grassmannian
Counting linear extensions of posets with determinants of hook lengths
On counting and constructing all admissible orders of the non-empty intervals in any finite chain
A study of one-factor copula models from a tail dependence perspective
On the \(q\)-enumeration of barely set-valued tableaux and plane partitions
Polynomiality of Plancherel averages of hook-content summations for strict, doubled distinct and self-conjugate partitions
Enumeration of standard Young tableaux of shifted strips with constant width
Combinatorics of patience sorting monoids
A new method for solving a class of ballot problems

This page was built for publication: A combinatorial problem

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