609 problems
Let be a positive integer, and let be integers with . For representations of , write when is isomorphic…
Let be a graph, and let denote its total oriented chromatic quasisymmetric function. Say that cycles of are edge-disjoint when no two cycles share an edge. S…
For , write the Chern class in the Schur basis as … and expand each coefficient in the binomial basis: … A polynomial is binomially positive when all its binomial-basis coeffi…
Let be the superspace coinvariant ring obtained from by quotienting by the ideal…
For every integer and every pair of distinct Young diagrams , if and are the corresponding Garsia–Haiman m…
For every integer , every partition , and every permutation , the polynomial obtained by evaluating the monomial character ind…
For partitions and of the same integer, define the transition coefficients by … where denotes the Hall–Littlewood -function…
For every pair of positive integers and every partition , the symmetric function is -positive; equivalently, there exist coe…
Let be the diagonal-harmonics module and let denote the associated symmetric-function object. Bergeron's conjectures assert that, for every…
For all positive integers , the corrected rectangular square-path identity of Iraci, Pagaria, Paolini, and Vanden Wyngaerd holds: writing and with …
For every permutation , the Schubert polynomial can be written as a product of elementary symmetric polynomials in initial alphabets,…
Prove the six affine Jacobi–Trudi identities conjectured by Ole Warnaar for the relevant specialisations of multiparameter Hall–Littlewood polynomials of types ,…
For every positive integer and every -bounded partition , the --Schur function is a nonnegative integer linear combination o…
For every partition , specialize the Koornwinder moment indexed by to , normalize it as in Rains' formulation, and write the resulting rational function in…
Let be the chromatic symmetric function of a graph , and let denote its specialization to variables. A polynomial is SNP (has a saturated Newton…
Stanley--Gasharov conjecture (1998). Every claw-free graph is Schur-positive.
This entry tracks Operator b-positivity conjecture for Jack characters. The operator formulation would strengthen Jack-character positivity and connect it to integrable algebraic s…
This entry tracks Anti-ribbon decomposition conjecture. It gives a tableau-level decomposition linking Schur functions and Schur multiple zeta functions. Latest development The ter…
The conjecture concerns a determinantal expression for a related antisymmetrizer arising in the study of symmetric functions and alternating-sign-matrix enumeration. The supplied s…
Let be a simple graph, and let denote its chromatic symmetric function. A graph is claw-free if it has no induced subgraph isomorphic to the claw graph …
Schur positivity conjecture. The coefficients are nonnegative integer polynomials in .
Let be a unit interval graph, with its vertices in the natural order. Define its chromatic quasisymmetric function by … where the sum is over proper colorings and…
For each positive integer , let be the Hall–Littlewood polynomial used in the paper, and for define … Let . The q-Foul…
Let be a positive integer, let be a partition, and let denote the corresponding monomial trace. For an matrix , write…
Let be a partition and let be the Jack-character coefficient defined by the paper, with . Let denote the number o…