Markov Chains for Promotion Operators
From MaRDI portal
Publication:5112365
DOI10.1007/978-1-4939-0938-4_13zbMath1434.60177arXiv1307.7499OpenAlexW1498166880MaRDI QIDQ5112365
Steven Klee, Anne Schilling, Arvind Ayyer
Publication date: 29 May 2020
Published in: Algebraic Monoids, Group Embeddings, and Algebraic Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1307.7499
Combinatorics of partially ordered sets (06A07) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Groups and semigroups of linear operators (47D03) Graph theory (05C99)
Related Items (5)
The Tamari block lattice: an order on saturated chains in the Tamari lattice ⋮ Unified theory for finite Markov chains ⋮ Random walks on rings and modules ⋮ Combinatorial Markov chains on linear extensions ⋮ Character theory of monoids over an arbitrary field.
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A recurrence for linear extensions
- Stochastic rearrangement rules for self-organizing data structures
- Cyclic sieving, promotion, and representation theory
- Functions of random walks on hyperplane arrangements
- Promotion and evacuation
- Note: random-to-front shuffles on trees
- Chaînes de Markov sur les permutations
- Dual equivalence with applications, including a conjecture of Proctor
- Random walks and hyperplane arrangements
- Evacuation of labelled graphs
- Promotion des morphismes d'ensembles ordonnes
- Semigroups, rings, and Markov chains
- Affine type A crystal structure on tensor products of rectangles, Demazure characters, and nilpotent varieties
- An exact formula for the move-to-front rule for self-organizing lists
- A combinatorial description of the spectrum for the Tsetlin library and its generalization to hyperplane arrangements
- Combinatorial Markov chains on linear extensions
- Directed nonabelian sandpile models on trees
- Möbius functions and semigroup representation theory. II: Character formulas and multiplicities.
- Möbius functions and semigroup representation theory.
- On the structure of semigroups
- The heaps process, libraries, and size-biased permutations
- On the matrix occurring in a linear search problem
- Random Walks, Arrangements, Cell Complexes, Greedoids, and Self-Organizing Libraries
- An extension of a theorem concerning an interesting Markov chain
- FINITE AUTOMATA AND MODELS OF SIMPLE FORMS OF BEHAVIOUR
- The stationary distribution of an interesting Markov chain
This page was built for publication: Markov Chains for Promotion Operators