Pages that link to "Item:Q2536784"
From MaRDI portal
The following pages link to Combinatorial problems of commutation and rearrangements (Q2536784):
Displaying 50 items.
- Un modèle asynchrone pour les systèmes distribués. (An asynchronous model of distributed systems) (Q914365) (← links)
- Word problems over traces which are solvable in linear time (Q914395) (← links)
- Extension of Brzozowski's derivation calculus of rational expressions to series over the free partially commutative monoids (Q930924) (← links)
- The Poisson-Furstenberg boundary of the locally free group (Q937860) (← links)
- Characteristic polynomials of nonnegative real square matrices and generalized clique polynomials (Q972787) (← links)
- The enumeration of fully commutative affine permutations (Q976156) (← links)
- Leading coefficients of Kazhdan-Lusztig polynomials for Deodhar elements. (Q1016152) (← links)
- Factors of binomial sums from the Catalan triangle (Q1038488) (← links)
- A proof of Andrews' \(q\)-Dyson conjecture (Q1058634) (← links)
- A direct combinatorial proof of a positivity result (Q1065801) (← links)
- Integrité des algèbres de séries formelles sur un alphabet partiellement commutatif (Q1072712) (← links)
- A bijective proof of the q-Saalschütz theorem (Q1075331) (← links)
- Square-free words on partially commutative free monoids (Q1076163) (← links)
- On some equations in free partially commutative monoids (Q1084189) (← links)
- A combinatorial approach to matrix algebra (Q1086566) (← links)
- A decision procedure on partially commutative free monoids (Q1086682) (← links)
- Semi-commutations (Q1094144) (← links)
- On regular trace languages (Q1097040) (← links)
- Bijective proofs of basic hypergeometric series identities (Q1099307) (← links)
- Mixed product and asynchronous automata (Q1099643) (← links)
- A \(q\)-Foata proof of the \(q\)-Saalschütz identity (Q1101450) (← links)
- A formula for iterated derivatives along trajectories of nonlinear systems (Q1104901) (← links)
- Theory of traces (Q1107296) (← links)
- On lexicographic semi-commutations (Q1108811) (← links)
- On recognizable subsets of free partially commutative monoids (Q1111703) (← links)
- Théorèmes de transfert pour les polynômes partiellement commutatifs. (Transfer theorems for partially commutative polynomials) (Q1113985) (← links)
- Applications of the theory of automata in enumeration (Q1122575) (← links)
- Algebraic and multiple integral identities (Q1123859) (← links)
- Concurrency and atomicity (Q1124366) (← links)
- Counting acyclic digraphs by sources and sinks (Q1126301) (← links)
- Graph algebras (Q1138003) (← links)
- The combinatorial interpretation of the Jacobi identity from Lie algebras (Q1141652) (← links)
- Homology of certain algebras defined by graphs (Q1144591) (← links)
- An algebraic theory of sequence enumeration (Q1146674) (← links)
- Categories de Möbius et fonctorialites: un cadre général pour l'inversion de Möbius (Q1147150) (← links)
- The enumeration of sequences with respect to structures on a bipartition (Q1150369) (← links)
- Expansion formulas. I: A general method (Q1156801) (← links)
- An exact sequence for rings of polynomials in partly commuting indeterminates (Q1157378) (← links)
- Chain algebras (Q1160126) (← links)
- Algebraic methods for permutations with prescribed patterns (Q1166524) (← links)
- Une théorie combinatoire des séries formelles (Q1167168) (← links)
- A combinatorial proof of Dyson's conjecture (Q1167729) (← links)
- Graph monoids (Q1170209) (← links)
- Un modèle symétrique pour l'identité de Al-Salam-Fields. (A symmetric model for the identity of Al-Salam-Fields) (Q1173635) (← links)
- The geometry of tensor calculus. I (Q1175729) (← links)
- Recognizable closures and submonoids of free partially commutative monoids (Q1178709) (← links)
- The symbiotic relationship of combinatorics and matrix theory (Q1183182) (← links)
- Event structures and trace monoids (Q1183599) (← links)
- Generalized semigroup semirings which are zero-divisor-free or multiplicatively left-cancellative (Q1184997) (← links)
- Two recognizable string-matching problems over free partially commutative monoids (Q1190454) (← links)
