scientific article; zbMATH DE number 568838
From MaRDI portal
Publication:4294630
Cited in
(33)- Leading coefficients of Kazhdan-Lusztig polynomials for Deodhar elements.
- Theory of traces
- Concurrency and atomicity
- Probabilistic estimation of the number of prefixes of a trace
- Empilements de segments et q-énumération de polyominos convexes dirigés. (Heaps of segments and q-enumeration of directed convex polyominoes)
- Elements of a theory of computer simulation. I
- \(q\)-enumeration of convex polyominoes
- 321-avoiding affine permutations and their many heaps
- Linear sequential dynamical systems, incidence algebras, and Möbius functions
- 321-avoiding affine permutations, heaps, and periodic parallelogram polyominoes
- Length enumeration of fully commutative elements in finite and affine Coxeter groups
- Acyclic heaps of pieces. I.
- Explicit enumeration of 321, hexagon-avoiding permutations
- Mask formulas for cograssmannian Kazhdan-Lusztig polynomials.
- Chromatic symmetric function of graphs from Borcherds algebras
- Generalised chromatic polynomials of graphs from heaps of pieces
- A coupling of the spectral measures at a vertex
- On the enumeration of \(k\)-omino towers
- On the entropy of \(\mathsf{LEGO}^{\circledR}\)
- Higher-order Airy scaling in deformed Dyck paths
- Kazhdan-Lusztig polynomials for maximally-clustered hexagon-avoiding permutations.
- Counting walks by their last erased self-avoiding polygons using sieves
- From generalized directed animals to the asymmetric simple exclusion process
- Rhombic tilings and Bott-Samelson varieties
- Braid moves in commutation classes of the symmetric group
- Algebraic combinatorics on trace monoids: extending number theory to walks on graphs
- Kazhdan-Lusztig polynomials for 321-hexagon-avoiding permutations
- Realizable cycle structures in digraphs
- A study on free roots of Borcherds-Kac-Moody Lie superalgebras
- The enumeration of maximally clustered permutations
- Combinatorial reciprocity for the chromatic polynomial and the chromatic symmetric function
- Word problems over traces which are solvable in linear time
- The enumeration of fully commutative affine permutations
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4294630)