scientific article; zbMATH DE number 568838
From MaRDI portal
Publication:4294630
zbMath0792.05012MaRDI QIDQ4294630
Publication date: 17 May 1994
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Algebraic Combinatorics on Trace Monoids: Extending Number Theory to Walks on Graphs, Higher-order Airy scaling in deformed Dyck paths, 321-avoiding affine permutations and their many heaps, Linear sequential dynamical systems, incidence algebras, and Möbius functions, Generalised chromatic polynomials of graphs from heaps of pieces, Theory of traces, Kazhdan-Lusztig polynomials for maximally-clustered hexagon-avoiding permutations., On the enumeration of \(k\)-omino towers, Counting walks by their last erased self-avoiding polygons using sieves, Concurrency and atomicity, 321-avoiding affine permutations, heaps, and periodic parallelogram polyominoes, Realizable cycle structures in digraphs, A study on free roots of Borcherds-Kac-Moody Lie superalgebras, Rhombic tilings and Bott–Samelson varieties, Mask formulas for cograssmannian Kazhdan-Lusztig polynomials., Word problems over traces which are solvable in linear time, The enumeration of maximally clustered permutations, From generalized directed animals to the asymmetric simple exclusion process, 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), Braid moves in commutation classes of the symmetric group, Kazhdan-Lusztig polynomials for 321-hexagon-avoiding permutations, The enumeration of fully commutative affine permutations, Length enumeration of fully commutative elements in finite and affine Coxeter groups, On the entropy of \(\mathsf{LEGO}^{\circledR}\), Chromatic symmetric function of graphs from Borcherds algebras, Leading coefficients of Kazhdan-Lusztig polynomials for Deodhar elements., A coupling of the spectral measures at a vertex, Explicit enumeration of 321, hexagon-avoiding permutations, Elements of a theory of computer simulation. I, Combinatorial reciprocity for the chromatic polynomial and the chromatic symmetric function, \(q\)-enumeration of convex polyominoes
