2000 character limit reached
Two Propositions Involving the Standard Representation of $S_n$
Published 10 Feb 2013 in math.RT, math.CO, and math.PR | (1302.2310v1)
Abstract: We present here two standalone results from a forthcoming work on the analysis of Markov chains using the representation theory of $S_n$. First, we give explicit formulas for the decompositions of tensor powers of the defining and standard representations of $S_n$. Secondly, we prove that any Markov chain on $S_n$ starting with one fixed point and whose increment distributions are class measures will always average exactly one fixed point.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.