中文
相关论文

相关论文: Fixed points of non-uniform permutations and repre…

200 篇论文

The number of fixed points of a random permutation of 1,2,...,n has a limiting Poisson distribution. We seek a generalization, looking at other actions of the symmetric group. Restricting attention to primitive actions, a complete…

组合数学 · 数学 2007-08-21 Persi Diaconis , Jason Fulman , Robert Guralnick

We consider statistics on permutations chosen uniformly at random from fixed parabolic double cosets of the symmetric group. We show that the distribution of fixed points is asymptotically Poisson and establish central limit theorems for…

概率论 · 数学 2023-04-20 J. E. Paguyo

Let $G_{k,n}$ be a group of permutations of $kn$ objects which permutes things independently in disjoint blocks of size $k$ and then permutes the blocks. We investigate the probabilistic and/or enumerative aspects of random elements of…

概率论 · 数学 2025-04-29 Persi Diaconis , Nathan Tung

In a uniform random permutation \Pi of [n] := {1,2,...,n}, the set of elements k in [n-1] such that \Pi(k+1) = \Pi(k) + 1 has the same distribution as the set of fixed points of \Pi that lie in [n-1]. We give three different proofs of this…

概率论 · 数学 2014-04-29 Persi Diaconis , Steven N. Evans , Ron Graham

We prove limit theorems for the number of fixed points occurring in a random pattern-avoiding permutation distributed according to a one-parameter family of biased distributions. The bias parameter exponentially tilts the distribution…

概率论 · 数学 2026-03-11 Aksheytha Chelikavada , Hugo Panzo

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,…

组合数学 · 数学 2007-10-23 Yona Cherniavsky , Mishael Sklarz

We describe the distribution of the number and location of the fixed points of permu- tations that avoid the pattern 321 via a bijection with rooted plane trees on n + 1 vertices. Using the local limit theorem for Galton-Watson trees, we…

组合数学 · 数学 2019-04-02 Christopher Hoffman , Douglas Rizzolo , Erik Slivken

In this paper we consider permutations of sequences of partitions, obtaining a result which parallels von Neumann's theorem on permutations of dense sequences and uniformly distributed sequences of points.

泛函分析 · 数学 2009-02-12 Ingrid Carbone , Aljosa Volcic

The number of peaks of a random permutation is known to be asymptotically normal. We give a new proof of this and prove a central limit theorem for the distribution of peaks in a fixed conjugacy class of the symmetric group. Our technique…

组合数学 · 数学 2019-02-05 Jason Fulman , Gene B. Kim , Sangchul Lee

Selecting N random points in a unit square corresponds to selecting a random permutation. By putting 5 types of symmetry restrictions on the points, we obtain subsets of permutations : involutions, signed permutations and signed…

组合数学 · 数学 2007-05-23 Jinho Baik , Eric M. Rains

We prove limit theorems for the number of fixed points, descents, and inversions of iterated random-to-top shuffles in two asymptotic regimes. Our proofs are analytic, and they utilize new combinatorial decompositions that represent each…

概率论 · 数学 2026-04-10 Alexander Clay

We use moment method to understand the cycle structure of the composition of independent invariant permutations. We prove that under a good control on fixed points and cycles of length 2, the limiting joint distribution of the number of…

组合数学 · 数学 2019-10-10 Mohamed Slim Kammoun , Mylène Maïda

In this paper we study the inverse of so-called unfair permutations, and explore various properties of them. Our investigation begins with comparing this class of permutations with uniformly random permutations, and showing that they behave…

概率论 · 数学 2018-06-01 İlker Arslan , Ümit Işlak , Cihan Pehlivan

We give a new interpretation of the derangement numbers d_n as the sum of the values of the largest fixed points of all non-derangements of length n-1. We also show that the analogous sum for the smallest fixed points equals the number of…

组合数学 · 数学 2009-04-21 Emeric Deutsch , Sergi Elizalde

We use representation theory of $S_n$ to analyze the mixing of permutation cycle type statistics $a_j(\sigma) = ${# of $j$-cycles of $\sigma$} for any fixed $j$ and $\sigma$ resulting from a random $i$-cycle walk on $S_n$. We also derive…

组合数学 · 数学 2025-12-17 Dominic Arcona

In this paper we prove that among the permutations of length n with i fixed points and j excedances, the number of 321-avoiding ones equals the number of 132-avoiding ones, for all given i,j<=n. We use a new technique involving diagonals of…

组合数学 · 数学 2007-05-23 Sergi Elizalde

We consider two families X_n of varieties on which the symmetric group S_n acts: the configuration space of n points in C and the space of n linearly independent lines in C^n. Given an irreducible S_n-representation V, one can ask how the…

几何拓扑 · 数学 2014-08-12 Thomas Church , Jordan S. Ellenberg , Benson Farb

The distribution of descents in fixed conjugacy classes of $S_n$ has been studied, and it is shown that its moments have interesting properties. Fulman proved that the descent numbers of permutations in conjugacy classes with large cycles…

组合数学 · 数学 2018-03-29 Gene B. Kim , Sangchul Lee

The classical Poisson theorem says that if $\xi_1,\xi_2,...$ are i.i.d. 0--1 Bernoulli random variables taking on 1 with probability $p_n\equiv \la/n$ then the sum $S_n=\sum_{i=1}^n\xi_i$ is asymptotically in $n$ Poisson distributed with…

概率论 · 数学 2011-10-11 Yuri Kifer

Given a subgroup H of a finite group G, we begin a systematic study of the partial representations of G that restrict to global representations of H. After adapting several results from [DEP00] (which correspond to the case where H is…

表示论 · 数学 2022-05-25 Michele D'Adderio , William Hautekiet , Paolo Saracco , Joost Vercruysse
‹ 上一页 1 2 3 10 下一页 ›