The tag has no wiki summary.

learn more… | top users | synonyms

27
votes
3answers
955 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 ...
18
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 ...
13
votes
1answer
316 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 ...
11
votes
2answers
374 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 ...
11
votes
0answers
396 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 ...
11
votes
0answers
505 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 ...
8
votes
3answers
513 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 ...
8
votes
1answer
222 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; ...
8
votes
1answer
225 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 ...
7
votes
1answer
310 views

Maximal subgroups of a certain finite 2-group

The following came up in a problem on reconstruction of digraphs. I determined enough about the answer to satisfy the application completely, but still I am curious to know what the complete solution ...
7
votes
1answer
395 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 ...
6
votes
2answers
497 views

Two groups acting on a set.

Suppose we are given a set S of points on which two different groups G and G' (given by sets of generating permutations) act. Is there an efficient algorithm for finding generators the largest pair ...
6
votes
1answer
209 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 ...
6
votes
1answer
230 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 ...
6
votes
0answers
202 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 ...
5
votes
2answers
407 views

Permuting Racked Pool Balls with a Single Break

Given reasonable physical assumptions (on friction, collisions, etc.), would it be possible to "break" in a pool game such that when all the balls come to rest, the only difference is that the racked ...
5
votes
1answer
299 views

Counting the (additive) decompositions of a quadratic, symmetric, empty-diagonal and constant-line matrix into permutation matrices

Dear community, I have the following combinatorial question which I will explain in short first and then with some more detail. At the end you will find a very simple example. Short version Le $A ...
5
votes
1answer
166 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 ...
5
votes
0answers
106 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 ...
4
votes
2answers
478 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 ...
4
votes
1answer
243 views

polycirculant conjecture

By the polycirculant conjecture, every vertex-transitive graph is a polycirculant graph (D. Marusic 1981 and D. Jordan 1988). There are two papers that claim to prove this conjecture: 1. A. Golubchik, ...
4
votes
2answers
151 views

Maximal order of a metacyclic transitive permutation group of degree $n$

What is the maximal order $f(n)$ of a metacyclic (metacyclic group is the extension of a cyclic group by a cyclic group) transitive permutation group of degree $n$? It can be easily proved that ...
4
votes
1answer
429 views

Symplectic groups Sp_{2m}(2) as 2-transitive permutation (i.e. Galois) groups

Hello, I am looking for information about the symplectic groups $Sp_{2m}(2)$ as permutation group acting on quadratic forms. Consider the block matrices ...
4
votes
3answers
348 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 ...
4
votes
1answer
237 views

Cardinals of transitive permutation groups acting on $\{1,\dots,n\}$

Is there a nice description of all divisors of $n!$ which can be realized as cardinals of permutation groups acting transitively on $\{1,\dots,n\}$? A necessary condition is of course that such a ...
4
votes
2answers
210 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
104 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 ...
4
votes
0answers
172 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 ...
4
votes
0answers
151 views

A conjecture on Zassenhaus groups

In a 1995 paper by Ali Nesin, "Permutation groups of finite Morley rank", the following conjecture is mentioned: Conjecture 5 An infinite Zassenhaus group $G$ of finite Morley rank is isomorphic ...
3
votes
1answer
199 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?
3
votes
1answer
732 views

The number of orbits of a permutation action

Let $G$ be a finite group acting on a finite set $\Omega$. A general question is to determine the sequence $o_k(\Omega)$, where $o_k(\Omega)$ is the number of orbits on $G$ for the natural action of ...
3
votes
1answer
451 views

Alternative Definition of the Quantum Determinant?

Let $M_q(n)$ be the standard quantum matrices (over the complex numbers) with generators $u^i_j$ for $i,j = 1, \ldots ,N$, and reations $$ u^i_ju^k_j = qu^k_ju^i_j, \text{ for } i < k, ~~~~~~~ ...
3
votes
1answer
184 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
1answer
217 views

automorphism group of orbital graphs

Let $G$ be a transitive group on $\Omega$. Every orbits of $G$ on its natural action on $\Omega\times\Omega$ is called an orbital of $G$ on $\Omega$. For each orbital $\Delta$ of $G$ on $\Omega$, the ...
3
votes
0answers
81 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) ...
3
votes
0answers
133 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 ...
2
votes
2answers
196 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
5answers
252 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 ...
2
votes
1answer
180 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 ...
2
votes
1answer
82 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 ...
2
votes
1answer
152 views

Name for a certain kind of 'weakly primitive' permutation group

I have found it necessary to define the following property: Consider a finite set $X$ and a group $H$ of permutations of $X$. Suppose for every normal subgroup $K$ of $H$ that $K$ acts faithfully on ...
2
votes
1answer
225 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 ...
2
votes
0answers
104 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 ...
2
votes
2answers
180 views

Is there any relation between automorphism group of a Cayley graph over a group and over its subgroup?

Let $\Gamma=Cay(G,S)$ be a Cayley graph over a group $G$, $H$ be a proper subgroup of $G$ and $\Sigma=Cay(H,T)$ where $S$ and $T$ are inversed-closed subsets of $G$ and $H$ not containing idendity, ...
2
votes
0answers
208 views

Characterization of the elements of an infinite simple group

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 ...
2
votes
0answers
244 views

Does probability of a derangement go up under passing to subgroups? [closed]

This is prompted by my attempts to work on this question. Let $H \subset G \subseteq S_d$ be transitive permutation groups. Recall that an element of $S_d$ is called a derangement if it has no fixed ...
1
vote
2answers
211 views

Identifying Subgroups of the Modular Group via Permutation Representations on Cosets

Suppose we have a known group G and an unknown subgroup H. The permutation representation of G on the cosets of H gives a permutation group C, which is known. Is it possible to identify the generators ...
1
vote
1answer
138 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$?
1
vote
1answer
178 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 ...
1
vote
1answer
54 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 ...