Ungarian Markov chains
From MaRDI portal
Publication:6136831
DOI10.1214/23-ejp1056arXiv2301.08206OpenAlexW4389351736MaRDI QIDQ6136831
Publication date: 17 January 2024
Published in: Electronic Journal of Probability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2301.08206
Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Structure theory of lattices (06B05) Other generalizations of distributive lattices (06D75) Combinatorial aspects of groups and algebras (05E16)
Cites Work
- A recursion on maximal chains in the Tamari lattices
- The number of intervals in the \(m\)-Tamari lattices
- An analogue of distributivity for ungraded lattices
- Sortable elements and Cambrian lattices.
- Cambrian fans.
- 2N noncollinear points determine at least 2N directions
- The local limit of random sorting networks
- Local statistics for random domino tilings of the Aztec diamond
- On the wildness of Cambrian lattices
- Counting smaller elements in the Tamari and \(m\)-Tamari lattices
- Random sorting networks
- The representation of the symmetric group on \(m\)-Tamari intervals
- Higher trivariate diagonal harmonics via generalized Tamari posets
- Cambrian lattices.
- Rings of sets
- The pop-stack-sorting operator on Tamari lattices
- A stack and a pop stack in series
- The Surprising Mathematics of Longest Increasing Subsequences
- Chains of maximum length in the Tamari lattice
- On the maximum and its uniqueness for geometric random samples
- Clusters, Coxeter-sortable elements and noncrossing partitions
- Noncrossing partitions and representations of quivers
- Non-equilibrium behaviour of a many particle process: Density profile and local equilibria
- Essential Chains and Homotopy Type of Posets
- The Directions Determined by n Points in the Plane
- Geometry of $\nu $-Tamari lattices in types $A$ and $B$
- Pop-stack-sorting for Coxeter groups
- The Archimedean limit of random sorting networks
- Two-stack-sorting with pop stacks
- Rowmotion in slow motion
- Circular support in random sorting networks
- On the Sets of Directions Determined by n Points
- Combinatorial Frameworks for Cluster Algebras
- The enumeration of generalized Tamari intervals
- Enumerating permutations sortable by \(k\) passes through a pop-stack
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Ungarian Markov chains