Related papers: Stable characters from permutation patterns

A set of permutations is called sign-balanced if the set contains the same number of even permutations as odd permutations. Let $S_n(\sigma_1, \sigma_2, \ldots, \sigma_r)$ be the set of permutations in the symmetric group $S_n$ which avoids…

The inner plethysm of symmetric functions corresponds to the $\lambda$-ring operations of the representation ring $R({\mathfrak S}_n)$ of the symmetric group. It is known since the work of Littlewood that this operation possesses stability…

We show that the homology of modules for Hurwitz spaces stabilizes and compute its stable value. As one consequence, we compute the moments of Selmer groups in quadratic twist families of abelian varieties over suitably large function…

We prove that the irreducible decomposition of the permutation representation of GL(n,q) on GL(n,q)/GL(n-m,q) stabilizes for large n. We deduce, as a consequence, a representation stability theorem for finitely generated VIC-modules.

For each integer k >= 2, let F(k) denote the largest n for which there exists a permutation \sigma \in S_n, all of whose patterns of length k are distinct. We prove that F(k) = k + \lfloor \sqrt{2k-3} \rfloor + e_k, where e_k \in {-1,0} for…

Informed by our understanding of the tt-geometry of permutation modules, we investigate the proper definition of the `stable permutation category' of a finite group. Then we prove that this category decomposes over cyclic and generalized…

In this text, we consider random permutations which can be written as free words in several independent random permutations: firstly, we fix a non trivial word $w$ in letters $g_1,g_1^{-1},..., g_k,g_k^{-1}$, secondly, for all $n$, we…

A Young subgroup of the symmetric group $\mathcal{S}_{N}$, the permutation group of $\{ 1,2,\dots,N\} $, is generated by a subset of the adjacenttranspositions $\{ ( i,i+1) \mid 1\leq i < N\}$. Such a group is realized as the stabilizer…

A family of symmetric functions $\tilde{s}_\lambda$ was introduced in [OZ], and independently in [AS]. The $\tilde{s}_\lambda$ encode many stability properties of representations of symmetric groups (e.g. when multiplied, the structure…

We introduce the notion of stable representations, -- it is a new class of the representations of a certain class of groups which defined with positive definite functions which generalize the classical notion of the characters (or trace).…

We give explicit multiplicities and formulas for multiplicities of characters appearing in the decomposition of the induced character Ind^{S_{2n}}_{C_{S_{2n}}({\sigma})} 1_C, where {\sigma} is an n-cycle, C_{S_{2n}}({\sigma}) is the…

Let $\sigma$ be a permutation of a nonempty finite or countably infinite set $X$ and let $F_X\left( \sigma^k\right)$ count the number of fixed points of the $k$th power of $\sigma$. This paper explains how the arithmetic function $k \mapsto…

Fix a partition $\mu=(\mu_1,\dotsc,\mu_m)$ of an integer $k$ and positive integer $d$. For each $n>k$, let $\chi^\lambda_\mu$ denote the value of the irreducible character of $S_n$ at a permutation with cycle type…

Given permutations $\pi \in S_n$ and $\sigma \in S_k$, let $N_\sigma(\pi)$ denote the number of occurrences of $\sigma$ in $\pi$. While pattern avoidance and the distribution of pattern occurrences in permutations have been extensively…

We find that a wide variety of families of partition statistics stabilize in a fashion similar to $p_k(n)$, the number of partitions of n with k parts, which satisfies $p_k(n) = p_{k+1}(n + 1), k \geq n/2$. We bound the regions of…

We develop a comprehensive theory of the stable representation categories of several sequences of groups, including the classical and symmetric groups, and their relation to the unstable categories. An important component of this theory is…

A D-permutation is a permutation of $[2n]$ satisfying $2k-1 \le \sigma(2k-1)$ and $2k \ge \sigma(2k)$ for all $k$; they provide a combinatorial model for the Genocchi and median Genocchi numbers. We find Stieltjes-type and Thron-type…

In 2010, the first author of this paper introduced the notion of $\sigma$--stability for a nonempty subset of an $L^0(\mathcal{F},K)$--module in [T.X. Guo, Relations between some basic results derived from two kinds of topologies for a…

Although the conjugacy classes of the general linear group are known, it is not obvious (from the canonic form of matrices) that two permutation matrices are similar if and only if they are conjugate as permutations in the symmetric group,…

Let $\mathcal D_n$ denote the average number of iterations of West's stack-sorting map $s$ that are needed to sort a permutation in $S_n$ into the identity permutation $123\cdots n$. We prove that…