Enumerative theory for the Tsetlin library

DOI10.1016/J.JALGEBRA.2023.08.009MaRDI QIDQ6565648

Persi Diaconis, Sourav Chatterjee, Gene B. Kim

Publication date: 2 July 2024

Published in: Journal of Algebra (Search for Journal in Brave)

zbMATH Keywords

Markov chainTsetlin libraryenumerative combinatoricsLuce model

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Symmetric groups (20B30) Combinatorial aspects of simplicial complexes (05E45)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Edge flipping in the complete graph
• Edge flipping in graphs
• Limits and rates of convergence for the distribution of search cost under the move-to-front rule
• Size-biased permutation of a finite sequence with independent and identically distributed terms
• Exchangeable pairs and Poisson approximation
• Successive sampling in large finite populations
• Trailing the dovetail shuffle to its lair
• The choice axiom after twenty years
• The relationship between Luce's choice axiom, Thurstone's theory of comparative judgment, and the double exponential distribution
• Random walks and hyperplane arrangements
• Semigroups, rings, and Markov chains
• Weighted sampling without replacement
• Leading the field: fortune favors the bold in Thurstonian choice models
• The ubiquitous Ewens sampling formula
• Limits of permutation sequences
• A combinatorial description of the spectrum for the Tsetlin library and its generalization to hyperplane arrangements
• Limit distributions and random trees derived from the birthday problem with unequal probabilities
• Statistical enumeration of groups by double cosets
• Gambler's ruin and the ICM
• Tensor product Markov chains
• Optimal strong stationary times for random walks on the chambers of a hyperplane arrangement
• Tests of significance for samples of the \(\chi^2\)-population with two degrees of freedom.
• Random matrix theory over finite fields
• Monoidal Functors, Species and Hopf Algebras
• On adding a list of numbers (and other one-dependent determinantal processes)
• The heaps process, libraries, and size-biased permutations
• On the matrix occurring in a linear search problem
• Stability in modules for classical Lie algebras—a constructive approach
• Topics in Hyperplane Arrangements
• Patterns in eigenvalues: the 70th Josiah Willard Gibbs lecture
• The cutoff phenomenon in finite Markov chains.
• Cell complexes, poset topology and the representation theory of algebras arising in algebraic combinatorics and discrete geometry
• Semantic limits of dense combinatorial objects
• Bimonoids for Hyperplane Arrangements
• Asymptotic Theory for Successive Sampling with Varying Probabilities Without Replacement, I
• A Generalization of Sampling Without Replacement From a Finite Universe

This page was built for publication: Enumerative theory for the Tsetlin library

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6565648)