Skip to main content

All Questions

Filter by
Sorted by
Tagged with
4 votes
0 answers
88 views

Diameters of permutation groups with transitive generators

Suppose that for a permutation puzzle on $n$ elements we have a subroutine to place any $m>3$ elements in arbitrary positions (possibly scrambling the rest). Can we solve the puzzle (if it is ...
Dmytro Taranovsky's user avatar
2 votes
1 answer
114 views

If $n=2m$, what is the order of the permutation $\sigma(k)=2k , \quad \sigma(m+k)=2k-1$

Let $n=2m$. What is the order of the following permutation $\sigma$? $$1\leq k\leq m \Rightarrow \sigma(k)=2k , \quad \sigma(m+k)=2k-1$$
ABB's user avatar
  • 4,058
0 votes
1 answer
213 views

A particular permutation on $\mathbb{Z}_n$

Let us consider $\mathbb{Z}_N=\{0,1,\cdots N-1\}$. Does there exist any permutation $\sigma$ on $\mathbb{Z}_N$ satisfying : $$\exists p,q\in\mathbb{N}, ~~p,q\neq0 (mod~N) ~~\forall i,j\in \mathbb{Z}...
ABB's user avatar
  • 4,058
5 votes
3 answers
498 views

Generation of permutation groups by fixed elements subgroups

Suppose $(H,X)$ is a permutation group (with $H$ a group acting faithfully on the set $X$). Under what circumstances is $H$ generated by its subgroups $H_x$, where $H_x$ is the subgroup of $H$ fixing $...
THC's user avatar
  • 4,547
7 votes
1 answer
344 views

For which $n$ can $S_n$ act transitively on $n+k$ elements?

It is known that the symmetric group $S_n$ can act transitively on $n+1$ elements if and only if $n=5$. Are there similar classifications for $S_n$ acting transitively on $n+k$ elements, where $k$ is ...
M. Winter's user avatar
  • 13.6k
11 votes
1 answer
248 views

How many steps are required for double transitivity?

Let $A$ be a set of generators of $S_n$, or of a doubly transitive subgroup of $S_n$. Assume $e\in A$, $A=A^{-1}$. What is the least $k$ such that $A^k$ is doubly transitive as a set? That is, what is ...
H A Helfgott's user avatar
  • 20.2k
4 votes
1 answer
152 views

Diameter for permutations of bounded support

Let $S\subset \textrm{Sym}(n)$ be a set of permutations each of which is of bounded support, that is, each $\sigma\in S$ moves $O(1)$ elements of $\{1,2,\dotsc,n\}$. Let $\Gamma$ be the graph whose ...
H A Helfgott's user avatar
  • 20.2k
3 votes
1 answer
506 views

A permutation with reflection property

Consider permutations $\pi$ of the set $\{1,\dots,n\}$ having the symmetry property $\pi \pi^* \pi = \pi^*$, where $\pi^*$ is the "reflection" $k \mapsto n+1-k$. Are there references or other ...
Dirk Werner's user avatar
  • 1,848
3 votes
2 answers
338 views

Length of composition series in a primitive group

Let $G$ be a primitive group acting on a set $\Omega$ with $n$ elements. By Cameron/Liebeck (essentially a consequence of the Classification + O'Nan-Scott), there are two possibilities: (a) $G$ has a ...
H A Helfgott's user avatar
  • 20.2k
1 vote
0 answers
54 views

Set of vectors closed under restricted permutation operations

Let $V=\{v_1,\cdots v_k\}$ a set of non zero different norm one vectors in $R^d$, $k>2$. I am trying to demonstrate that if $Q=\{P_i\in R^{k\times k},i=1,\cdots,k\}$ is a set of permutations such ...
Fabio's user avatar
  • 329
6 votes
1 answer
462 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 $2$-...
H A Helfgott's user avatar
  • 20.2k
6 votes
2 answers
623 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 ...
Maxime's user avatar
  • 397