The following pages link to (Q3524772):
Displayed 25 items.
- Counting permutations with no long monotone subsequence via generating trees and the kernel method (Q536566) (← links)
- Multigraded combinatorial Hopf algebras and refinements of odd and even subalgebras. (Q644683) (← links)
- Quelques identités de l'analyse combinatoire (Q790115) (← links)
- Combinatorics on a family of reduced Kronecker coefficients (Q889473) (← links)
- On the number of 8\(\times 8\) Latin squares (Q908925) (← links)
- Descent polynomials (Q1999732) (← links)
- Lower bounds for superpatterns and universal sequences (Q2037175) (← links)
- Plane partitions of shifted double staircase shape (Q2040495) (← links)
- Turán inequalities for the plane partition function (Q2089663) (← links)
- M2-branes and plane partitions (Q2104591) (← links)
- An insertion algorithm on multiset partitions with applications to diagram algebras (Q2178556) (← links)
- Cyclic sieving for plane partitions and symmetry (Q2217991) (← links)
- Polyhedral omega: a new algorithm for solving linear Diophantine systems (Q2363492) (← links)
- On adding a list of numbers (and other one-dependent determinantal processes) (Q3161732) (← links)
- (Q4958972) (← links)
- (Q5110967) (← links)
- The 𝐬-Eulerian polynomials have only real roots (Q5496636) (← links)
- Counting Linear Extensions of Posets with Determinants of Hook Lengths (Q5854455) (← links)
- Smirnov trees (Q5918945) (← links)
- Bilateral identities of the Rogers–Ramanujan type (Q6050837) (← links)
- Comparing weighted difference and Earth mover's distance via Young diagrams (Q6080126) (← links)
- The 𝐴₂ Andrews–Gordon identities and cylindric partitions (Q6115056) (← links)
- On the \(q\)-enumeration of barely set-valued tableaux and plane partitions (Q6115786) (← links)
- Commuting Eulerian operators (Q6143875) (← links)
- Higher Grassmann codes. II (Q6156925) (← links)