Open AccessBook
A super-class walk on upper-triangular matrices
Ery Arias-Castro,Persi Diaconis,Richard P. Stanley +2 more
- 01 Jan 2003
TL;DR: In this article, the character theory of Andre, Carter, and Yan is applied to analyze a natural random walk based on adding or subtracting a random row from the row above.
read more
Abstract: Let G be the group of n × n upper-triangular matrices with elements in a finite field and ones on the diagonal. This paper applies the character theory of Andre, Carter, and Yan to analyze a natural random walk based on adding or subtracting a random row from the row above.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
The Markov chain Monte Carlo revolution
TL;DR: The use of simulation for high dimensional intractable computations has revolutionized applied mathematics and design, improving and understanding the new tools leads to fascinating mathematics.
Introduction to Probability and its Applications
TL;DR: Scheaffer as discussed by the authors presents an introduction to Probability and its applications, with a discussion of the application of probabilistic models in the field of computer science. PWS-Kent, Boston, 1990.
243
Supercharacters, symmetric functions in noncommutingvariables, and related Hopf algebras
Marcelo Aguiar,Vidya Venkateswaran +1 more
- 01 Mar 2012
TL;DR: In this article, the authors identify two seemingly disparate structures: supercharacters, a useful way of doing Fourier analysis on the group of unipotent uppertriangular matrices with coefficients in a finite field, and the ring of symmetric functions in noncommuting variables.
56
Supercharacter formulas for pattern groups
TL;DR: In this article, a character formula for a supercharacter evaluated at a superclass for pattern groups and more generally for algebra groups is given, where the character is a set of characters which are constant on superclasses.
•Posted Content
Representations of Finite Unipotent Linear Groups by the Method of Clusters
TL;DR: In this paper, the authors introduce a natural variant of the orbit method, in which the central role is played by certain clusters of coadjoint orbits, which leads to the construction of a subring in the representation ring of U(n, F_q) that is rich in structure but pleasantly comprehensible.
49
References
The Art in Computer Programming
Andrew Hunt,Dave Thomas +1 more
- 01 Jan 2001
TL;DR: Here the authors haven’t even started the project yet, and already they’re forced to answer many questions: what will this thing be named, what directory will it be in, what type of module is it, how should it be compiled, and so on.
Glassy dynamics of kinetically constrained models
Felix Ritort,Peter Sollich +1 more
TL;DR: In this article, the authors review the use of kinetically constrained models (KCMs) for the study of dynamics in glassy systems, including spin-facilitated (Ising) models, constrained lattice gases, models inspired by cellular structures such as soap froths, models obtained via mappings from interacting systems without constraints, and related models such as urn, oscillator, tiling and needle models.