Signed combinatorial interpretations in algebraic combinatorics
Schubert polynomialssymmetric functionscombinatorial interpretationquasisymmetric functionsstructure constants\(\# \mathsf{P}\)\(\mathsf{GapP}\)
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Symmetric functions and generalizations (05E05) Combinatorial aspects of representation theory (05E10) Classical problems, Schubert calculus (14N15) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Combinatorial aspects of algebraic geometry (05E14)
- scientific article; zbMATH DE number 1601795 (Why is no real title available?)
- scientific article; zbMATH DE number 3886117 (Why is no real title available?)
- scientific article; zbMATH DE number 3861335 (Why is no real title available?)
- scientific article; zbMATH DE number 5544145 (Why is no real title available?)
- scientific article; zbMATH DE number 3766017 (Why is no real title available?)
- scientific article; zbMATH DE number 3779503 (Why is no real title available?)
- scientific article; zbMATH DE number 15435 (Why is no real title available?)
- scientific article; zbMATH DE number 14020 (Why is no real title available?)
- scientific article; zbMATH DE number 3552764 (Why is no real title available?)
- scientific article; zbMATH DE number 1072530 (Why is no real title available?)
- scientific article; zbMATH DE number 1503622 (Why is no real title available?)
- scientific article; zbMATH DE number 3895079 (Why is no real title available?)
- scientific article; zbMATH DE number 5238369 (Why is no real title available?)
- scientific article; zbMATH DE number 3315265 (Why is no real title available?)
- A Littlewood-Richardson rule for Koornwinder polynomials
- A Littlewood-Richardson rule for Macdonald polynomials
- A Schensted algorithm for rim hook tableaux
- A bijection between \(K\)-Kohnert diagrams and reverse set-valued tableaux
- A bijection proving orthogonality of the characters of \(S_ n\)
- A class of lattices with Möbius function \(\pm 1,0\)
- A combinatorial formula for Macdonald polynomials
- A combinatorial interpretation of the inverse \(t\)-Kostka matrix.
- A combinatorial interpretation of the inverse kostka matrix
- A combinatorial interpretation of the noncommutative inverse Kostka matrix
- A computational and combinatorial exposé of plethystic calculus
- A lift of the Schur and Hall-Littlewood bases to non-commutative symmetric functions
- A new approach to representation theory of symmetric groups
- A new class of symmetric functions
- A plethysm formula for \(p_ \mu(\underline x)\circ h_ \lambda(\underline x)\)
- An algorithm for computing plethysm coefficients
- An explicit construction of type A Demazure atoms
- Asymptotic bounds on graphical partitions and partition comparability
- Asymptotics of characters of symmetric groups related to Stanley character formula
- Bounds on Kronecker coefficients via contingency tables
- Chains in the Bruhat order
- Characters of symmetric groups: sharp bounds and applications.
- Combinatorial Inequalities
- Combinatorial rules for three bases of polynomials
- Computing multiplicities of Lie group representations
- Confirming two conjectures about the integer partitions
- Cyclic Inclusion-Exclusion
- Cyclic sieving, skew Macdonald polynomials and Schur positivity
- Deciding positivity of Littlewood-Richardson coefficients
- Equality cases of the Alexandrov-Fenchel inequality are not in the polynomial hierarchy
- From quasisymmetric expansions to Schur expansions via a modified inverse Kostka matrix
- Galleries, Hall-Littlewood polynomials, and structure constants of the spherical Hecke algebra
- Hecke algebras, difference operators, and quasi-symmetric functions
- Kostant polynomials and the cohomology ring for \(G/B\)
- LLT polynomials, elementary symmetric functions and melting lollipops
- Longest chains in the lattice of integer partitions ordered by majorization
- Longest increasing subsequences of random colored permutations
- Möbius functions of lattices
- On lattices with Möbius function \(\pm 1,0\)
- On quasisymmetric power sums
- On the Computation of Clebsch–Gordan Coefficients and the Dilation Effect
- On the complexity of computing Kronecker coefficients
- On the inverse Kostka matrix
- On the largest Kronecker and Littlewood-Richardson coefficients
- On vanishing of Kronecker coefficients
- Orthogonality of the characters of \(S_ n\)
- Plethysm, categories and combinatorics
- Positivity in the Grothendieck group of complex flag varieties.
- Positivity of the symmetric group characters is as hard as the polynomial time hierarchy
- Quasisymmetric Schur functions
- RC-Graphs and Schubert Polynomials
- Ribbon tableaux, Hall–Littlewood functions, quantum affine algebras, and unipotent varieties
- Ribbon tile invariants
- Schubert calculus and quiver varieties
- Schubert polynomials, slide polynomials, Stanley symmetric functions and quasi-Yamanouchi pipe dreams
- Some combinatorial properties of Schubert polynomials
- Strict unimodality of \(q\)-binomial coefficients
- The Möbius function of a composition poset
- The q,t-Catalan numbers and the space of diagonal harmonics. With an appendix on the combinatorics of Macdonald polynomials
- The complexity of computing Kronecker coefficients
- The complexity theory companion
- The computational complexity of plethysm coefficients
- The honeycomb model of GL_n(\mathbb C) tensor products I: Proof of the saturation conjecture
- The lattice of integer partitions
- The partial order of dominant weights
- The shuffle conjecture
- Towards the geometry of double Hurwitz numbers
- Transition of Grothendieck polynomials.
- Upper bound on the characters of the symmetric groups
- What is in \(\#\mathsf{P}\) and what is not?
- P-partition power sums
- \(P\)-partitions with flags and back stable quasisymmetric functions
This page was built for publication: Signed combinatorial interpretations in algebraic combinatorics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6989547)