The permutation-groups tag has no wiki summary.

**0**

votes

**2**answers

204 views

### Semiregular subgroups of automorphism group of cayley graphs

Let $\Gamma$ be a Cayley graph over group $K$ and $H$ be a semiregular subgroup of $Aut(\Gamma)$ with two orbits. Then $|K|=2|H|$. Is there any other relation between $H$ and $K$ in general? What ...

**4**

votes

**1**answer

253 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, ...

**8**

votes

**3**answers

528 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 ...

**7**

votes

**1**answer

325 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 ...

**1**

vote

**2**answers

216 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 ...

**2**

votes

**0**answers

248 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 ...

**2**

votes

**2**answers

201 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.

**4**

votes

**1**answer

239 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 ...

**6**

votes

**2**answers

500 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 ...

**11**

votes

**2**answers

377 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 ...

**3**

votes

**1**answer

468 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, ~~~~~~~ ...

**4**

votes

**1**answer

460 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
...

**5**

votes

**1**answer

304 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 ...

**3**

votes

**1**answer

810 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 ...

**2**

votes

**1**answer

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 ...

**11**

votes

**4**answers

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, ...