Combinatorial problems of commutation and rearrangements

DOI10.1007/BFB0079468zbMATH Open0186.30101MaRDI QIDQ2536784FDOQ2536784

Authors: Pierre Cartier, Dominique Foata 

Publication date: 1969

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

zbMATH Keywords

combinatorics

Mathematics Subject Classification ID

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

Cited In (only showing first 100 items - show all)

• The Poisson-Furstenberg boundary of the locally free group
• On the complementation of Büchi asynchronous cellular automata
• Concurrency measure in commutation monoids
• Counting acyclic digraphs by sources and sinks
• Notes on finite asynchronous automata
• Entropy and the clique polynomial
• The free partially commutative Lie algebra: Bases and ranks
• A fast algorithm for proving terminating hypergeometric identities. (Reprint)
• The shuffle algebra and its derivations
• Finite transducers for divisibility monoids
• Uniform generation in trace monoids
• A proof of Andrews' \(q\)-Dyson conjecture. (Reprint)
• Trace monoids with idempotent generators and measure-only quantum automata
• Geometry and Combinatorics via Right-Angled Artin Groups
• Acyclic orientations of random graphs
• A combinatorial proof of Dyson's conjecture
• Random ballistic growth and diffusion in symmetric spaces
• \(q\)-enumeration of convex polyominoes
• Factors of binomial sums from the Catalan triangle
• Acyclic orientations and the chromatic polynomial
• Empilements de segments et \(q\)-énumération de polyominos convexes dirigés. (Heaps of segments and \(q\)-enumeration of directed convex polyominoes)
• The geometry of tensor calculus. I
• New Euler-Mahonian statistics on permutations and words
• A non-commutative version of Jacobi's equality on the cofactors of a matrix
• SOLVABILITY OF EQUATIONS IN GRAPH GROUPS IS DECIDABLE
• Clique polynomials have a unique root of smallest modulus
• WORD EQUATIONS OVER GRAPH PRODUCTS
• Major index for 01-fillings of moon polyominoes
• Elements of a theory of computer simulation. I
• Undecidability of the trace coding problem and some decidable cases
• LOGICAL ASPECTS OF CAYLEY-GRAPHS: THE MONOID CASE
• A combinatorial approach to matrix algebra
• APPROXIMATING THE MEAN SPEEDUP IN TRACE MONOIDS
• Characterizations of the decidability of some problems for regular trace languages
• Logical definability on infinite traces
• Identities in combinatorics. I: On sorting two ordered sets
• Incidence Hopf algebras
• The death of proof? Semi-rigorous mathematics? You've got to be kidding!
• Categories de Möbius et fonctorialites: un cadre général pour l'inversion de Möbius
• On recognizable subsets of free partially commutative monoids
• Möbius monoids and their connection to inverse monoids.
• Bijective combinatorics of positive braids
• Two recognizable string-matching problems over free partially commutative monoids
• The enumeration of fully commutative affine permutations
• Quantum groups with partial commutation relations
• Fixed points of endomorphisms of trace monoids.
• Determinants and Möbius functions in trace monoids
• An extension of Kleene's and Ochmański's theorems to infinite traces
• Möbius functions and confluent semi-commutations
• The lower central series of the free partially commutative group
• Mixtures of classical and free independence
• Dependence polynomials
• A proof of Andrews' \(q\)-Dyson conjecture
• Combinatorics of sequential dynamical systems
• Event structures and trace monoids
• Membership problems for regular and context-free trace languages
• Combinatorial topology and the global dimension of algebras arising in combinatorics
• Relations between connected and self-avoiding hikes in labelled complete digraphs
• A theory of noncommutative determinants and characteristic functions of graphs
• Binomial identities -- combinatorial and algorithmic aspects
• Transformations of sequential specifications into concurrent specifications by synchronization guards
• Average site perimeter of directed animals on the two-dimensional lattices
• On graph products of monoids
• Mixed product and asynchronous automata
• On the fully commutative elements of Coxeter groups
• A fast algorithm for proving terminating hypergeometric identities
• Recognizable subsets of some partially Abelian monoids
• Growth rates of geometric grid classes of permutations
• Théorèmes de transfert pour les polynômes partiellement commutatifs. (Transfer theorems for partially commutative polynomials)
• Une théorie combinatoire des séries formelles
• Uniform and Bernoulli measures on the boundary of trace monoids
• Quivers, words and fundamentals
• Algebraic properties of Manin matrices. I
• Quasideterminants
• Uniform measures on braid monoids and dual braid monoids
• ON ASYNCHRONOUS CELLULAR AUTOMATA
• Generalized semigroup semirings which are zero-divisor-free or multiplicatively left-cancellative
• Mind the gap: expanding communication options in decentralized discrete-event control
• Semi-commutations
• A Combinatorial Proof of Bass’s Evaluations of the Ihara-Selberg Zeta Function for Graphs
• On the multigraded Hilbert and Poincaré-Betti series and the Golod property of monomial rings
• Note on the smallest root of the independence polynomial
• The topology of Mazurkiewicz traces.
• On lexicographic semi-commutations
• Computing the average parallelism in trace monoids.
• Semicommutations and algebraic languages
• Title not available (Why is that?)
• Partition and composition matrices
• Graph algebras
• Homology of certain algebras defined by graphs
• Graph monoids
• Solving word equations modulo partial commutations
• The proof of Birman's conjecture on singular braid monoids.
• Graphs and free partially commutative monoids
• Short proofs of Saalschütz's and Dixon's theorems
• Groups assembled from free and direct products
• Animaux et arbres guingois. (Animals and guingois trees)
• Lyndon bases of free partially commutative Lie algebras
• The poset of infinitary traces
• Partial commutations and faithful rational transductions

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2536784)