相关论文: Subgroups of symmetric groups: enumeration and asy…

We consider the probability $p(S_n)$ that a pair of random permutations generates either the alternating group $A_n$ or the symmetric group $S_n$. Dixon (1969) proved that $p(S_n)$ approaches $1$ as $n\to\infty$ and conjectured that…

We compute the asymptotic probability that a random pair of Sylow 2-subgroups in $S_n$ or $A_n$ intersects trivially. This calculation complements recent work of Diaconis, Giannelli, Guralnick, Law, Navarro, Sambale, and Spink (see…

In this paper, we prove that the dimension of the space spanned by the characters of the symmetric powers of the standard n-dimensional representation of the symmetric group S_n is asymptotic to n^2/2. This is proved by using generating…

Let $\gamma(S_n)$ be the minimum number of proper subgroups $H_i$ of the symmetric group $S_n$ such that each element in $S_n$ lies in some conjugate of one of the $H_i.$ In this paper we conjecture that…

Let $G$ be a finite nilpotent group and $n\in \{3,4, 5\}$. Consider $S_n\times G$ as a subgroup of $S_n\times S_{|G|}\subset S_{n|G|}$, where $G$ embeds into the second factor of $S_n\times S_{|G|}$ via the regular representation. Over any…

We show that every finite group $G$ of size at least $3$ has a nilpotent subgroup of class at most $2$ and size at least $|G|^{1/32\log\log|G|}$. This answers a question of Pyber, and is essentially best possible.

We prove that the symmetric group $S_n$ has a unique minimal cover $\mathcal{M}$ by maximal nilpotent subgroups, and we obtain an explicit and easily computed formula for the order of $\mathcal{M}$. In addition, we prove that the order of…

In this paper we investigate the minimum number of maximal subgroups H_i for i=1 ...k of the symmetric group S_n (or the alternating group A_n) such that each element in the group S_n (respectively A_n) lies in some conjugate of one of the…

In 2001 Liebeck and Pyber showed that a finite simple group of Lie type is a product of $ 25 $ carefully chosen unipotent Sylow subgroups. Later, in a series of works it was shown that $ 4 $ unipotent Sylow subgroups suffice. We prove that…

We study the asymptotic behavior of two statistics defined on the symmetric group S_n when n tends to infinity: the number of elements of S_n having k records, and the number of elements of S_n for which the sum of the positions of their…

Denoting by Sigma(S) the set of subset sums of a subset S of a finite abelian group G, we prove that |Sigma(S)| >= |S|(|S|+2)/4-1 whenever S is symmetric, |G| is odd and Sigma(S) is aperiodic. Up to an additive constant of 2 this result is…

We show that the probability for a finitely generated subgroup of the modular group, of size $n$, to be almost malnormal or non-parabolic, tends to 0 as $n$ tends to infinity -- where the notion of the size of a subgroup is based on a…

A numerical semigroup is called cyclotomic if its corresponding numerical semigroup polynomial $P_S(x)=(1-x)\sum_{s\in S}x^s$ is expressable as the product of cyclotomic polynomials. Ciolan, Garc\'ia-S\'anchez, and Moree conjectured that…

Let $S_n$ denote the symmetric group of order $n$. Say that two subsets $x, y\subseteq S_n$ are \emph{equivalent} if there exist permutations $g_1, g_2\in S_n$ such that $g_1xg_2=y$, where multiplication is understood elementwise. Recently,…

We show that every quasitrivial n-ary semigroup is reducible to a binary semigroup, and we provide necessary and sufficient conditions for such a reduction to be unique. These results are then refined in the case of symmetric n-ary…

We prove a conjecture dating back to a 1978 paper of D.R.\ Musser~\cite{musserirred}, namely that four random permutations in the symmetric group $\mathcal{S}_n$ generate a transitive subgroup with probability $p_n > \epsilon$ for some…

Suppose $\left\{x_1, \dots, x_n\right\} \subset \mathbb{R}^2$ is a set of $n$ points in the plane with diameter $\leq 1$, meaning $|x_i - x_j| \leq 1$ for all $1 \leq i,j \leq n$. We show that the ratio of the number of ``neighbors''…

Given a subset $S\subseteq\mathbb{P}$, let $\Pa(S;n)$ be the number of permutations in the symmetric group of ${1,2,...,n}$ that have peak set $S$. We prove a recent conjecture due to Billey, Burdzy and Sagan, which determines the sets that…

We take an approach toward counting the number of n for which the curves E_n: y^2=x^3-n^2x have 2-Selmer groups of a given size. This question was also discussed in a pair of Invent. Math. papers by Roger Heath-Brown. We discuss the…

This paper is a continuation of the paper "Numerical Semigroups: Ap\'ery Sets and Hilbert Series". We consider the general numerical AA-semigroup, i.e., semigroups consisting of all non-negative integer linear combinations of relatively…