The tag has no wiki summary.

learn more… | top users | synonyms

18
votes
3answers
608 views

Is there a way of canonically labelling permutation groups?

When working with large numbers of graphs, a canonical labelling routine is essential as, after the initial cost of canonically labelling each graph, it permits isomorphism checks to be replaced with ...
14
votes
2answers
348 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 ...
0
votes
0answers
31 views

Number of ways you can form pairs with a group of people when certain people cannot be paired with each other [migrated]

Let's say you have a group of eight people and you want to form them into pairs for group projects. There are 8!/(4!*2!) ways to do it. (8! Is the total ...
7
votes
1answer
109 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 ...
10
votes
0answers
213 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
249 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$. ...
7
votes
1answer
380 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 ...
8
votes
1answer
304 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 ...
9
votes
2answers
238 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 ...
3
votes
3answers
252 views

Mclaughlin Graph

how can i construct a strongly regular graph with parameter $(275,112,30,56)$(Mclaughlin Graph), (105,32,4,12)? I need adjacency matrix of them? I know they are unique.
2
votes
0answers
117 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, ...
2
votes
0answers
138 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 ...
1
vote
1answer
141 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
394 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 ...
10
votes
4answers
2k views

An easy proof that S(n) does not embed into A(n+1)?

Rotman's book An Introduction to the Theory of Groups (Fourth Edition) asks, on page 22, Exercise 2.8, to show that S(n) cannot be embedded in A(n+1), where S(n) = the symmetric group on n elements, ...
1
vote
1answer
182 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 ...
4
votes
1answer
241 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 ...
3
votes
0answers
256 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$. ...
5
votes
0answers
86 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: ...
2
votes
1answer
187 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 ...
6
votes
1answer
254 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
231 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 ...
20
votes
1answer
1k views

Order of products of elements in symmetric groups

Let $n \in \mathbb{N}$. Is it true that for any $a, b, c \in \mathbb{N}$ satisfying $1 < a, b, c \leq n-2$ the symmetric group ${\rm S}_n$ has elements of order $a$ and $b$ whose product has order ...
11
votes
0answers
402 views

Possible orders of products of 2 involutions which interchange disjoint residue classes of the integers

Definition / Question Definition: 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 ...
4
votes
0answers
138 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 ...
1
vote
1answer
147 views

simple graphs of degree 16 with a semiregular normal subgroup isomorphic to the quaternion group $Q_8$

Is there any simple graph $\Gamma$ with 16 vertices with full automorphism group $G$ such that $H\cong Q_8$ be a semiregular normal subgroup of $G$?
8
votes
1answer
250 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 ...
3
votes
0answers
89 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) ...
7
votes
1answer
534 views

Permutation character of the symmetric group on subsets of certain size

The symmetric group $S_n$ acts on $[n]:=\{1,\ldots,n\}$, thereby inducing an action on the set $$\wp_k(n)=\{\: A\subseteq[n] \::\: \#A=k \:\}$$ of subsets of cardinality $k$, simply by $$(g,A)\mapsto ...
0
votes
0answers
109 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
252 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
1answer
272 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
144 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 ...
13
votes
1answer
402 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 ...
4
votes
1answer
222 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 ...
11
votes
0answers
532 views

Groups generated by 3 involutions

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 ...
4
votes
3answers
406 views

automorphisms of graphs and finite permutation groups

I am interested in automorphisms of graphs and in using tools from permutation groups (especially such as in Wielandt's text on finite permutation groups, which I have been studying). What are some ...
5
votes
1answer
197 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 ...
2
votes
5answers
255 views

Equivalence relations not associated with a group

This is a vague question; so vague that I wonder if anyone will get it. Many, perhaps most, equivalence relations that are regularly used in mathematics correspond to the orbits of some group action ...
4
votes
2answers
225 views

Palfy's theorem for nilpotent groups?

P. P. Palfy proved that a primitive solvable subgroup of $S_n$ has order bounded by $24^{-1/3} n^{3.24399\dots}$ (in: Pálfy, P. P. A polynomial bound for the orders of primitive solvable groups. J. ...
4
votes
0answers
176 views

Permutations with all cycles odd

I have recently needed to compute the number of permutations in $S_n$ with all cycles odd, and while this is easy using Flajolet-Sedgewick theory (the exponential generating function seems to be ...
1
vote
1answer
189 views

Group with 2 orbits on the nonnegative integers — description of the orbits

Definition: 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 ...
4
votes
2answers
642 views

Transitive subgroup of $S_p$ containing a $p$-cycle and a double transposition

Let $p$ be a prime other than 5 or 7. Are $A_p$ and $S_p$ the only subgroups of $S_p$ that contains a $p$-cycle and a double transposition? As for $p = 5$, the dihedral group $D_{10}$ contains a ...
8
votes
1answer
289 views

Permutations of prescribed cycle types that multiply to the identity

Suppose that $\lambda_1,\lambda_2,\lambda_3$ are partititions of $n$. When do there exist permutations $\sigma_1,\sigma_2,\sigma_3 \in S_n$ such that (1) $\sigma_1\sigma_2\sigma_3$ is the identity; ...
1
vote
1answer
56 views

Transformation terminology question

Given a transformation $t$ from the transformation semigroup $T_{n}$, if you take powers of $t$ under composition you get a length $s$ stem followed by a cycle. Permutations by definition have a ...
0
votes
2answers
132 views

the symmetric group $S_{2^{r−1}}$

Is there any routine technique to find a set of permutations which generate a Sylow 2-subgroup of the symmetric group $S_{2^{r−1}}$?
8
votes
3answers
539 views

partly obscured Rubik's cube

I just came back from a beach which features a large Rubik's cube (2m high). The base of the cube is not visible and the top is not coloured. The four vertical sides are each divided $3\times 3$ into ...
5
votes
0answers
112 views

Information about permutation character from local action

Let $G$ be a finite permutation group acting transitively, but not regularly, on a set $V$. Let $H$ be the stabilizer of some point $v\in V$, and suppose that $H$ acts 2-transitively on one of its ...
3
votes
1answer
216 views

Classification of generously transitive groups

A permutation group $G \lt S_n$ is called generously transitive, if for each $i,j$ there exists a permutation that interchanges them. Is there a reasonable classification of such (finite) groups?