scientific article
From MaRDI portal
Publication:3754627
zbMath0618.05008MaRDI QIDQ3754627
Publication date: 1986
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Introduction to Probabilistic Concurrent Systems, Left cells containing a fully commutative element., The random generation of directed animals, Binomial identities -- combinatorial and algorithmic aspects, Combinatorial Hopf algebras from PROs, Lyndon heaps: An analogue of Lyndon words in free partially commutative monoids, From steady-state TASEP model with open boundaries to 1D Ising model at negative fugacity, Diagram calculus for a type affine \(C\) Temperley-Lieb algebra. II., Ising model observables and non-backtracking walks, On recognizable subsets of free partially commutative monoids, Loop-erased random walk as a spin system observable, Counting walks by their last erased self-avoiding polygons using sieves, Deformations of the braid arrangement and trees, Elliptic enumeration of nonintersecting lattice paths, New enumerative results on two-dimensional directed animals, Counting acyclic digraphs by sources and sinks, Markovian dynamics of concurrent systems, Bijections between directed animals, multisets and Grand-Dyck paths, Uniform Generation in Trace Monoids, Some structural properties of acyclic heaps of pieces, Toward uniform random generation in 1-safe Petri nets, Balance constants for Coxeter groups, On rank functions for heaps, A combinatorial proof of Aldous–Broder theorem for general Markov chains, Bijective combinatorics of positive braids, A combinatorial construction for simply-laced Lie algebras, The \(1/3-2/3\) Conjecture for Coxeter groups, Interview with Xavier Viennot, A cut-invariant law of large numbers for random heaps, Ungarian Markov chains, Almost triangular Markov chains on \(\mathbb{N}\), Minuscule posets from neighbourly graph sequences, Models of random subtrees of a graph, The Tutte-Grothendieck group of an alphabetic rewriting system, Weakly directed self-avoiding walks, String execution time for finite languages: max is easy, min is hard, Computing the average parallelism in trace monoids., The geometry of tensor calculus. I, Asymptotic combinatorics of Artin-Tits monoids and of some other monoids, Non-commutative extensions of the MacMahon Master Theorem, Uniform and Bernoulli measures on the boundary of trace monoids, The active bijection for graphs, Uniform measures on braid monoids and dual braid monoids, On the length of fully commutative elements, Differential (Monoid) Algebra and More, A domain for concurrent termination a generalization of Mazurkiewicz traces, Quivers, words and fundamentals, Animaux et arbres guingois. (Animals and guingois trees), Lyndon bases of free partially commutative Lie algebras, The nil Temperley-Lieb algebra of type affine \(C\), Möbius inversion formula for the trace group, Cambrian acyclic domains: counting \(c\)-singletons, Fully commutative elements in the Weyl and affine Weyl groups., Characteristic polynomials of nonnegative real square matrices and generalized clique polynomials, Deciding unambiguity and sequentiality from a finitely ambiguous max-plus automaton, Sequential?, Synchronization of Bernoulli sequences on shared letters, A note on the enumeration of directed animals via gas considerations, On the Bessel functions, Acyclic orientations and the chromatic polynomial, Homogeneous representations of Khovanov-Lauda algebras., Counting domino tilings of rectangles via resultants, Quantum crystals and spin chains, Asymptotic behavior in a heap model with two pieces, A spectral property for concurrent systems and some probabilistic applications, Hopf algebra structure of generalized quasi-symmetric functions in partially commutative variables, Heaps and two exponential structures, Combinatorics of fully commutative involutions in classical Coxeter groups, Involution pipe dreams, Integrability of graph combinatorics via random walks and heaps of dimers, Word problems over traces which are solvable in linear time, An umbral relation between pattern and commutation in strings, A non-commutative version of Jacobi's equality on the cofactors of a matrix, On the fully commutative elements of Coxeter groups, Block number, descents and Schur positivity of fully commutative elements in \(B_n\), Average site perimeter of directed animals on the two-dimensional lattices, 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., Exactly Solved Models, Activity preserving bijections between spanning trees and orientations in graphs, Graph colorings and related symmetric functions: ideas and applications: A description of results, interesting applications, and notable open problems., Graphs and free partially commutative monoids, On the average Cartier-Foata height of traces, Number of prefixes in trace monoids: clique polynomials and dependency graphs, Deterministic concurrent systems
