Combinatorial problems of commutation and rearrangements

Cited in

(only showing first 100 items - show all)

Leading coefficients of Kazhdan-Lusztig polynomials for Deodhar elements.
Factors of binomial sums from the Catalan triangle
A proof of Andrews' \(q\)-Dyson conjecture
A direct combinatorial proof of a positivity result
Integrité des algèbres de séries formelles sur un alphabet partiellement commutatif
A bijective proof of the q-Saalschütz theorem
Square-free words on partially commutative free monoids
On some equations in free partially commutative monoids
A combinatorial approach to matrix algebra
A decision procedure on partially commutative free monoids
Semi-commutations
On regular trace languages
Bijective proofs of basic hypergeometric series identities
Mixed product and asynchronous automata
A q-Foata proof of the q-Saalschütz identity
A formula for iterated derivatives along trajectories of nonlinear systems
Theory of traces
On lexicographic semi-commutations
On recognizable subsets of free partially commutative monoids
Théorèmes de transfert pour les polynômes partiellement commutatifs. (Transfer theorems for partially commutative polynomials)
Applications of the theory of automata in enumeration
Algebraic and multiple integral identities
Concurrency and atomicity
Counting acyclic digraphs by sources and sinks
Graph algebras
The combinatorial interpretation of the Jacobi identity from Lie algebras
Homology of certain algebras defined by graphs
An algebraic theory of sequence enumeration
Categories de Möbius et fonctorialites: un cadre général pour l'inversion de Möbius
The enumeration of sequences with respect to structures on a bipartition
Expansion formulas. I: A general method
An exact sequence for rings of polynomials in partly commuting indeterminates
Chain algebras
Algebraic methods for permutations with prescribed patterns
Une théorie combinatoire des séries formelles
A combinatorial proof of Dyson's conjecture
Graph monoids
Un modèle symétrique pour l'identité de Al-Salam-Fields. (A symmetric model for the identity of Al-Salam-Fields)
The geometry of tensor calculus. I
Recognizable closures and submonoids of free partially commutative monoids
The symbiotic relationship of combinatorics and matrix theory
Event structures and trace monoids
Generalized semigroup semirings which are zero-divisor-free or multiplicatively left-cancellative
Two recognizable string-matching problems over free partially commutative monoids
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
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
Identities in combinatorics. I: On sorting two ordered sets
On monoids presented by a single relation
The unification of certain enumeration problems for sequences
The shuffle algebra and its derivations
On the Knuth-Bendix completion for concurrent processes
Acyclic orientations of random graphs
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
Atomic semicommutations
\(q\)-enumeration of convex polyominoes
An extension of Kleene's and Ochmański's theorems to infinite traces
A theory of noncommutative determinants and characteristic functions of graphs
Recognizable trace languages, distributed automata and the distribution problem
Graph groups are biautomatic
Combinatorial objects enumerated by q-Bessel functions
Asynchronous automata versus asynchronous cellular automata
Lyndon traces and shuffle algebras
Deterministic asynchronous automata for infinite traces
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!
Interpretation of a basic hypergeometric identity with Lie characters and Young tableaux
Binomial identities -- combinatorial and algorithmic aspects
On the complementation of asynchronous cellular Büchi automata
The code problem for traces -- improving the boundaries
On the dimension of graded algebras
Computing the average parallelism in trace monoids.
The word problem for \(1\mathcal{LC}\) congruences is NP-hard.
The topology of Mazurkiewicz traces.
Upper estimate of the cardinality of the set of knots generated by one- and two-dimensional braids
On the support of graph Lie algebras
Algorithmic problems in right-angled Artin groups: complexity and applications
321-avoiding affine permutations and their many heaps
Modular Hecke algebras over Möbius categories
Decomposition spaces, incidence algebras and Möbius inversion. I: Basic theory
Diagram calculus for a type affine \(C\) Temperley-Lieb algebra. II.
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
A Hopf algebra for counting cycles
Asymptotic combinatorics of Artin-Tits monoids and of some other monoids
Quivers, words and fundamentals
Möbius inversion formula for the trace group
Fully commutative elements in the Weyl and affine Weyl groups.
Quasideterminants
Length enumeration of fully commutative elements in finite and affine Coxeter groups
An umbral relation between pattern and commutation in strings

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)