Combinatorial problems of commutation and rearrangements

DOI10.1007/BFB0079468zbMath0186.30101MaRDI QIDQ2536784

Pierre Cartier, Foata, Dominique

Publication date: 1969

Published in: Lecture Notes in Mathematics (Search for Journal in Brave)

zbMATH Keywords

combinatorics

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Permutations, words, matrices (05A05)

Related Items (only showing first 100 items - show all)

Graph groups are biautomatic ⋮ Combinatorial objects enumerated by \(q\)-Bessel functions ⋮ Asynchronous automata versus asynchronous cellular automata ⋮ Lyndon traces and shuffle algebras ⋮ The proof of Birman's conjecture on singular braid monoids. ⋮ Two optimal parallel algorithms on the commutation class of a word ⋮ Deterministic asynchronous automata for infinite traces ⋮ Two techniques in the area of the star problem in trace monoids ⋮ Undecidability of the trace coding problem and some decidable cases ⋮ Algorithmic problems in right-angled Artin groups: complexity and applications ⋮ Incidence Hopf algebras ⋮ Theorems for a price: Tomorrow's semi-rigorous mathematical culture ⋮ The death of proof? Semi-rigorous mathematics? You've got to be kidding! ⋮ 321-avoiding affine permutations and their many heaps ⋮ Interpretation of a basic hypergeometric identity with Lie characters and Young tableaux ⋮ Binomial identities -- combinatorial and algorithmic aspects ⋮ The Euler-Mahonian distributions over the words ⋮ A note on Möbius functions of upho posets ⋮ On the complementation of asynchronous cellular Büchi automata ⋮ Modular Hecke algebras over Möbius categories ⋮ Honda sequences ⋮ Lyndon heaps: An analogue of Lyndon words in free partially commutative monoids ⋮ Decomposition spaces, incidence algebras and Möbius inversion. I: Basic theory ⋮ Diagram calculus for a type affine \(C\) Temperley-Lieb algebra. II. ⋮ The Hafnian master theorem ⋮ Markovian dynamics of concurrent systems ⋮ Recursive statistics on words ⋮ The code problem for traces -- improving the boundaries ⋮ On the dimension of graded algebras ⋮ Toward uniform random generation in 1-safe Petri nets ⋮ Universal equivalence of partially commutative Lie algebras ⋮ A cut-invariant law of large numbers for random heaps ⋮ Mask formulas for cograssmannian Kazhdan-Lusztig polynomials. ⋮ Universal equivalence of partially commutative metabelian Lie algebras ⋮ The Tutte-Grothendieck group of an alphabetic rewriting system ⋮ Inversion formula for the growth function of a cancellative monoid. ⋮ A Hopf algebra for counting cycles ⋮ Computing the average parallelism in trace monoids. ⋮ Major index for 01-fillings of moon polyominoes ⋮ Solving word equations modulo partial commutations ⋮ Folded Hasse diagrams of combined traces ⋮ The word problem for \(1\mathcal{LC}\) congruences is NP-hard. ⋮ The topology of Mazurkiewicz traces. ⋮ Asymptotic combinatorics of Artin-Tits monoids and of some other monoids ⋮ Non-commutative extensions of the MacMahon Master Theorem ⋮ Combinatorics of sequential dynamical systems ⋮ Incidence bicomodules, Möbius inversion and a Rota formula for infinity adjunctions ⋮ Empilements de segments et \(q\)-énumération de polyominos convexes dirigés. (Heaps of segments and \(q\)-enumeration of directed convex polyominoes) ⋮ Star-free trace languages ⋮ Geometry of convex cones and application to the Euclidean projection on the positive Weyl chamber ⋮ Semicommutations and algebraic languages ⋮ The free partially commutative Lie algebra: Bases and ranks ⋮ Quivers, words and fundamentals ⋮ Decidability of the star problem in \(A^*\times{}\{ b\}^*\) ⋮ The lower central series of the free partially commutative group ⋮ String matching problems over free partially commutative monoids ⋮ Möbius inversion formula for the trace group ⋮ Fully commutative elements in the Weyl and affine Weyl groups. ⋮ Identities in combinatorics. I: On sorting two ordered sets ⋮ Universal enveloping Lie Rota-Baxter algebras of pre-Lie and post-Lie algebras ⋮ On monoids presented by a single relation ⋮ Recognizable subsets of some partially Abelian monoids ⋮ Synchronization of Bernoulli sequences on shared letters ⋮ The incidence comodule bialgebra of the Baez-Dolan construction ⋮ A proof of Andrews' \(q\)-Dyson conjecture. (Reprint) ⋮ Quasideterminants ⋮ Length enumeration of fully commutative elements in finite and affine Coxeter groups ⋮ The unification of certain enumeration problems for sequences ⋮ Right angled Artin groups and partial commutation, old and new ⋮ A spectral property for concurrent systems and some probabilistic applications ⋮ Hopf algebra structure of generalized quasi-symmetric functions in partially commutative variables ⋮ Whitney numbers for poset cones ⋮ Operational semantics with semicommutations ⋮ The shuffle algebra and its derivations ⋮ Möbius functions of directed restriction species and free operads, via the generalised Rota formula ⋮ On the Knuth-Bendix completion for concurrent processes ⋮ An umbral relation between pattern and commutation in strings ⋮ A non-commutative version of Jacobi's equality on the cofactors of a matrix ⋮ The lattices of prefixes and overlaps of traces ⋮ On the fully commutative elements of Coxeter groups ⋮ A weak order approach to group ranking ⋮ Acyclic orientations of random graphs ⋮ A coupling of the spectral measures at a vertex ⋮ Membership problems for regular and context-free trace languages ⋮ Concurrency measure in commutation monoids ⋮ Upper estimate of the cardinality of the set of knots generated by one- and two-dimensional braids ⋮ Acyclic heaps of pieces. I. ⋮ Elements of a theory of computer simulation. I ⋮ Determinants and Möbius functions in trace monoids ⋮ Flag-symmetry of the poset of shuffles and a local action of the symmetric group ⋮ The star problem and the finite power property in trace monoids: Reductions beyond C4 ⋮ Partially commutative Artin-Coxeter groups and their arboreal structure. ⋮ Atomic semicommutations ⋮ Number of prefixes in trace monoids: clique polynomials and dependency graphs ⋮ \(q\)-enumeration of convex polyominoes ⋮ An extension of Kleene's and Ochmański's theorems to infinite traces ⋮ On the support of graph Lie algebras ⋮ A theory of noncommutative determinants and characteristic functions of graphs ⋮ Recognizable trace languages, distributed automata and the distribution problem ⋮ Deterministic concurrent systems

This page was built for publication: Combinatorial problems of commutation and rearrangements