The tag has no usage guidance.

learn more… | top users | synonyms

2
votes
1answer
184 views

Is there a formula for the number of elements in $S_n$ having length $k$ with respect to the generators taken to be the transpositions?

Define the length of a permutation as the minimum number of adjacent transpositions needed to describe it. We know that there is only one element of length $0$ in $S_n$ and $n-1$ elements of length ...
5
votes
6answers
466 views

Transitive permutation groups which all of their proper subgroups are intransitive

Let $G$ be a transitive permutation group on a finite set $\Omega$. It is clear that if $G$ is regular, then every proper subgroup of $G$ is intransitive. Is there any other class of groups with this ...
2
votes
1answer
162 views

2-closure of a permutation group

Let $G$ be a group acting on a set $\Omega$ faithfully. Then 2-closure of $G$ denoted by $G^{(2)}$ is the largest subgroup of the symmetric group of $\Omega$ with the same orbits as $G$ on ...
2
votes
1answer
102 views

Intransitive finite irreducible linear groups whose orbits are all large

I am interested in intransitive irreducible linear subgroups $G\subseteq\mathrm{GL}_n(\mathbb{F}_p)$ acting on $V-\{0\}=\mathbb{F}_p^n-\{0\}$ in the natural way, such that all of the orbits are very ...
5
votes
1answer
182 views

Hyperoctahedral group acting on a special permutation

Let $[n]=\{1,...,n\}$ and $[\hat n]=\{\hat 1,...,\hat n\}$. Realize the hyperoctahedral group $H_n$ as the centralizer of the permutation $(1\hat 1)\cdots (n \hat n)$. It has $2^n n!$ elements. Let ...
5
votes
1answer
106 views

A sum over characters of $S_{2n}$ and zonal spherical functions of $(S_{2n},H_n)$

The hyperoctahedral group $H_n$ can be seen as the centralizer of the permutation $(12)(34)\cdots (2n-1\,2n)$ in $S_{2n}$. It has $2^nn!$ elements. The quantities $$ ...
-1
votes
1answer
117 views

Can someone explain how Sims's algorithm works on a permutation group with a simple example? [closed]

Can someone explain how Sims's algorithm works on a permutation group with a simple example? The book "Permutation group algorithms" by Seress is a pretty hard read with a whole bunch of confusing ...
11
votes
1answer
273 views

A sum over characters of the symmetric group

Let $C_\mu$ be the size of the conjugacy class in $S_n$ of permutations whose cycletype is the partition $\mu\vdash n$. Let $\chi$ be the characters of the irreducible representations of $S_n$. Let ...
6
votes
1answer
247 views

number of maximal subgroups of the symmetric group

What is the asymptotics of the number of the maximal subgroups of $S_n$ (as a function of $n$)? This must be written down somewhere... EDIT I am actually more interested in the number of conjugacy ...
15
votes
2answers
434 views

Minimal maximal subgroup of the symmetric group

The question is pretty much in the title: What is the maximal subgroup of $S_d$ of maximal index (so minimal size)? A slight variant (I am not sure if it leads to a different answer) is: what if we ...
0
votes
1answer
164 views

Reference Request: Irreducibles of the regular representation of the permutation group is absolutely irreducible

I am writing a paper(physics) where I am using the fact that the irreducible's of the regular representations of the permutation group are absolutely irreducible in the following sense. If $V$ is an ...
5
votes
2answers
184 views

Group acting on two different sets, can isomorphisms be computed efficiently?

For the permutation group isomorphism problem, a permutational isomorphism between two permutation groups is sought. A closely related but seemingly easier problem arises, if an isomorphism between ...
5
votes
1answer
113 views

What is the criterion for a matrix containing vectors and their permutations being invertible?

Consider the matrix $A\in\mathbb{R}^{m\times 2m}$. Let any arbitrary choice of $m$ columns of $A$ be linearly independent. Together with a permutation $P\in\mathcal{P_{2m}}$, one can build the matrix ...
6
votes
2answers
317 views

Can every permutation group be realized as the automorphism group of a graph (acting on a subset of the vertices)?

By Frucht's theorem, every finite group can be realized as the automorphism group of a finite undirected graph. Because a permutation group is a finite group, it is clear that every permutation group ...
3
votes
1answer
203 views

variance of the number of fixed points for a permutation group

It is reasonably well-known that the variance of the number of fixed points for $S_n$ equals $1.$ Now, what about other transitive permutation groups on $\{1, \dotsc, n\}?$ Presumably much is known. I ...
4
votes
0answers
127 views

Application of finding shortest paths on Cayley graphs

For a fixed integer number $m$, Consider Cayley graph defined by all m-cycles in Symmetric group $Sym(n)$. I know that for $m=2$, there are some applications of finding shortest paths (or distance ...
1
vote
0answers
164 views

What is the definition of plethysm in the representation theory of permutation groups

Let $s_\lambda \circ s_\mu$ be a plethysm. Here let $\lambda, \mu$ be $m,n$ box Young diagrams. I have seen the definition of plethysms in symmetric functions. I would like to understand the ...
42
votes
1answer
1k views

Transitivity on $\mathbb{N}_0$ — a 42 problem

Let $r(m)$ denote the residue class $r+m\mathbb{Z}$, where $0 \leq r < m$. Given disjoint residue classes $r_1(m_1)$ and $r_2(m_2)$, let the class transposition $\tau_{r_1(m_1),r_2(m_2)}$ be the ...
1
vote
0answers
166 views

Are the finite groups inclusions, almost all relatively cyclic?

Definition: An inclusion of finite groups $(A \subset B)$ is relatively cyclic if $\exists b \in B$ such that $\langle A,b \rangle = B$. Definition: Two inclusions of finite groups are equivalent, ...
0
votes
0answers
112 views

Subgroups of powers of the alternating group on 5 elements

Definition: Let $G$ be a group, and let $H \leq G$ be a subgroup. We say that $H$ is big in $G$ if for every intermediate subgroup $H \leq L \leq G$ there exists some $x \in L$ such that $\langle H ...
4
votes
0answers
128 views

Young Tableau Box Correlations

Let $T$ be a uniformly random Standard Young Tableau (SYT) of shape $\lambda=(\lambda_1,\cdots,\lambda_k)$ with $|\lambda|=n$. Let $T_{ij}$ denote the value in box $(i,j)$. I'm interested in what can ...
15
votes
2answers
421 views

Explicit permutation representation of the Thompson sporadic simple group?

The Thompson group Th of order $90745943887872000$ is one of the sporadic simple groups occurring in the classification of finite simple groups. Its maximal subgroups are known (see ...
10
votes
0answers
327 views

Solving a set of equations in a finite symmetric group

A standard way to find solutions to a finite set of equations in a finite symmetric group ${\rm S}_n$ is to take the equations as relators of a finitely presented group, to use the low index subgroups ...
3
votes
2answers
259 views

If d(“G/H”) < d(G) = 2, must H contain a primitive element?

Let $G$ be a finite group that can be generated by $2$ elements, and let $H \leq G$ be a (not necessarily normal) subgroup for which there exists some $g \in G$ such that $H \langle g\rangle = G$. ...
2
votes
0answers
127 views

Special sets of involutions generating ${\rm S}_n$

For which positive integers $k$ and $r$ are there involutions $g_{n,i} \in {\rm S}_n$ $(n \in \mathbb{N}, \ i = 1, \dots, k)$ such that the following hold?: for any $n$, the $g_{n,i}$ $(i = 1, ...
7
votes
1answer
118 views

Covering a set with images of a transversal

Let $G$ be a permutation group on a finite set $\Omega$ with orbits $\Omega_1,\ldots,\Omega_k$. By a transversal we mean a set $\lbrace\omega_1,\ldots,\omega_k\rbrace$ with $\omega_j\in\Omega_j$ for ...
1
vote
1answer
167 views

Does the hyperoctahedral group have only 3 maximal normal subgroups?

An hyperoctahedral group $G$ is the wreath product of $S_2$ and $S_n$, where $S_{n}$ is the symmetric group on $n$ letters, or in other words the semi-direct product $G=S_2^n\rtimes S_n$, w.r.t. the ...
4
votes
1answer
406 views

Generalization of a property of $A_n; n\geq 5$

Let $H$ and $K$ be two proper non-trivial subgroups of the alternating group $A_n; n\geq 5$. Then there exists a maximal subgroup $M$ of $A_n$ such that $H\not\leq M$ and $K\not\leq M$. To see this ...
9
votes
2answers
265 views

Vertex-primitive graphs with two vertices having almost the same neighbourhood

Hypothesis: Let $\Gamma$ be a vertex-primitive graph with two vertices $u$ and $v$ such that $$|N(u) \cap N(v)|=|N(v)|-1$$ Question: Is it true that $\Gamma$ must either be a complete graph or have ...
1
vote
1answer
233 views

Does Schur's Lemma hold in this case? Regular representations of $S_n$ over $\mathbb R$

Warning I am a physicist and I am not familiar with a lot of the machinary of representation theory. I consider the regular representation of $\mathbb S_n$ over reals $\mathbb R$ ($\mathbb R \mathbb ...
8
votes
1answer
379 views

Center of one-point stabilizer in 2-transitive groups

In this MO question it was mentioned that the following fact seems to be true: If $G$ is doubly transitive on $X$ and the one-point stabilizer $G_x$ has a non-trivial center, then $G$ is of ...
5
votes
1answer
284 views

Minimum word length for an unusual set of generators of the symmetric group

Problem. Let $n\geq 2$ and let $T$ be the set of all permutations in $S_n$ of the form $$t_k:=\prod_{1\leq i\leq k/2}(i,k-i) \qquad \hbox{for $k=3,4,\ldots,n+1$}.$$ Find the least integer ...
2
votes
1answer
208 views

Classification of indecomposable inclusions $(H \subset G)$ with $G$ decomposable

Definition: A group $G$ is indecomposable if: $G = G_1 \times G_2 \Rightarrow \exists i \ G_i = 1$. We can generalize the notion of indecomposable from groups to inclusion of groups as ...
5
votes
0answers
106 views

Uniqueness of the direct product decomposition of inclusions of finite groups

This post is a generalization of Uniqueness of the direct product decomposition of finite groups. Here we look inclusions of finite groups $(H \subset G)$ instead of just finite groups. Definition: ...
3
votes
0answers
272 views

What's the ratio of inclusions of finite groups with a distributive lattice?

Definition: Two inclusions of finite groups are equivalent, $(A \subset B) \sim (C \subset D)$, if: $(A/A_B \subset B/A_B) \simeq (C/C_D \subset D/C_D)$ with $A_B$ the normal core of $A$ in $B$. ...
6
votes
1answer
303 views

Generalization of Frobenius groups

Frobenius group is a transitive permutation group on a finite set, such that no non-trivial element fixes more than one point and some non-trivial element fixes a point. In other words, if in a ...
2
votes
1answer
308 views

When is the product of two permutations cyclic?

Call a subset $H \subset S_n$ "simple" if for every $q \in S_n$, there is some $p \in H$ such that $pq$ is cyclic (i.e. consists of a single cycle of length $n$). Is there some characterization known ...
4
votes
0answers
142 views

Does this class of groups contain finitely generated infinite periodic groups?

Let $r(m)$ denote the residue class $r+m\mathbb{Z}$, where $0 \leq r < m$. Given disjoint residue classes $r_1(m_1)$ and $r_2(m_2)$, let the class transposition $\tau_{r_1(m_1),r_2(m_2)}$ be the ...
27
votes
3answers
1k views

When is $S_n \times S_m$ a subgroup of $S_p$?

I asked the following question on math.stackexchange several months ago: Let $n,m,p>1$ be such that $S_n \times S_m \hookrightarrow S_p$. Does it imply that $p \geq n+m$? Derek Holt gave a ...
9
votes
1answer
279 views

Question about doubly transitive groups with an n-cycle

Let $G$ be a doubly transitive subgroup of $S_n$ which contains an $n$-cycle, and let $G_{12}$ be the subgroup of $G$ consisting of all elements $g\in G$ for which $g(1)=1$ and $g(2)=2$. Then ...
0
votes
0answers
126 views

Orbits of stabilizer of two points in a 2-transitive permutation group

I was doing something which needs to know sizes of all orbits of the stabilizer of two points in a 2-transitive permutation group. Since all 2-transitive permutation groups are known ans so are their ...
6
votes
1answer
275 views

Primitive, non-2-transitive groups with very large orbitals?

Let $G$ be a transitive permutation group on a set $X$ with $n$ elements. Assume that $G$ is primitive, i.e., $G$ preserves no non-trivial partition of $X$. Assume as well that $G$ is not ...
3
votes
0answers
92 views

Double coset relation for unique intermediate subgroup (with homogeneity)

Let $G$ be a group and $H$ a subgroup such that there is a unique (non-trivial) intermediate subgroup $K$ (i.e. $H < S < G$ implies $S=K$) and $(H \subset K) \sim (K \subset G)$ (homogeneity) ...
2
votes
0answers
145 views

A section from subfactors to transitive groups

A finite group-subgroup subfactor is a subfactor $(N \subset M)$ isomorphic to $(R^G \subset R^H)$ with $(H \subset G)$ an inclusion of finite groups acting as outer automorphism on the hyperfinite ...
3
votes
1answer
339 views

Permutation groups transitive on partitions into ordered pairs

The following came up in a problem on graph reconstruction. It isn't very important, but I thought some people here might find it interesting and not too trivial (I'm not a group theorist). Take a ...
3
votes
0answers
149 views

Largest permutation groups without “non-mixing” subgroups

We say that a subgroup of ${\rm Sym}(\mathbb{N})$ has sparse orbit representatives if it has infinitely many orbits on $\mathbb{N}$, but the set of smallest orbit representatives has natural density 0 ...
14
votes
1answer
489 views

Does O'Nan-Scott depend on CFSG?

My question is in the title. Some context: there are two versions of the O'Nan-Scott theorem. The first, weaker version, is due to O'Nan and Scott (independently) and gives the structure of the ...
6
votes
1answer
488 views

Permutation Group Question

A question about permutation groups: I wonder if someone who is expert in permutation group theory could answer the following question. Let $x \in S_n$ (the symmetric group) be an involution which ...
4
votes
1answer
253 views

Doubly primitive groups with simple socle

The classification of doubly transitive groups with simple socle is known. A good account of such classification can be found for example in this paper: Cameron, Peter J. Finite permutation groups ...
5
votes
1answer
222 views

How hard is it to compute the diameter and the growth function of a finite permutation group of small degree?

Let $G \leq {\rm S}_n$ be a finite permutation group, and let $S = \{g_1, \dots, g_k\}$ be a generating set for $G$ which is closed under inversion and which does not contain the identity. The growth ...