0
votes
0answers
97 views
What is “Schreier Graph”? [closed]
On this paper
http://www.math.cornell.edu/~kbrown/6310/computation.pdf
I read :
This makes it easier for you to
draw Schreier graphs as you read, which I encourage you to do. …
0
votes
1answer
32 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 def …
3
votes
0answers
114 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 …
6
votes
0answers
65 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_ …
0
votes
2answers
100 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}}$?
4
votes
2answers
181 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 studyin …
7
votes
1answer
146 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$, simpl …
1
vote
2answers
103 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 con …
5
votes
0answers
74 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-transitive …
2
votes
1answer
155 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 ( …
9
votes
0answers
410 views
Order of products of elements in symmetric groups
New formulation of the question:
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 …
6
votes
0answers
341 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), …
8
votes
3answers
410 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 divi …
4
votes
2answers
125 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 easil …
3
votes
1answer
130 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 $ …

