Search Results
Search type | Search syntax |
---|---|
Tags | [tag] |
Exact | "words here" |
Author |
user:1234 user:me (yours) |
Score |
score:3 (3+) score:0 (none) |
Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
Views | views:250 |
Code | code:"if (foo != bar)" |
Sections |
title:apples body:"apples oranges" |
URL | url:"*.example.com" |
Saves | in:saves |
Status |
closed:yes duplicate:no migrated:no wiki:no |
Types |
is:question is:answer |
Exclude |
-[tag] -apples |
For more details on advanced search visit our help page |
Enumerative combinatorics, graph theory, order theory, posets, matroids, designs and other discrete structures. It also includes algebraic, analytic and probabilistic combinatorics.
10
votes
Subgroups of S_n consisting of elements having each less than 2 fixed points
The sharply $k$-transitive groups of finite degree $n$ ($k$-transitive of order $n(n-1)\cdots (n-k+1)$) were investigated by Zassenhaus in the 1930s. You can find a modern account for example in Chapt …
19
votes
Order of elements
It is not hard in practice, at least for reasonably small values of $m,n,k$, to find permutations with the required property, and I did once convince myself that I could find a systematic way of doing …
3
votes
about fixed points of permutations
Let me have a go at this one. We want to show that for any finite set $W$ of reduced words in $a,b$, we can find a subgroup $G = \langle a,b \rangle$ of some symmetric group $S_k$ such that all words …
5
votes
Explicit permutation representation of the Schur double cover of the symmetric group
According to my calculations, the minimal permutation degrees of $2.A_n$ for $n=5,\ldots, 24$ are as follows. In each case $H$ is a core-free subgroup of $2.A_n$ of largest order. The minimal permutat …
7
votes
What are the odds two permutations in S_n do NOT generate the whole group?
Concerning the second part of the OP's question:
Also, how can you efficiently find the size of the subgroup $\langle a,b \rangle$ in
$S_n$ ? My crude tests consists of randomly multiplying the …
3
votes
Embedding of a "quotient graph"
The following seems to be a counterexample, verified by a Magma calcualtion. The vertex set is $\{1,2,\ldots,16\}$ and the edge set is $E$. The quotient graph is the complete graph on four vertices an …
3
votes
Word length in the symmetric group
I think we can get all transpositions with words at length at most 5 over $\Sigma_n$, which will give an upper bound of $5(2^n-1)$. This can easily be improved slightly - for example, you can use elem …
17
votes
Number of isomorphism types of finite groups
It is proved in
Holt, D. F.,
Enumerating perfect groups.
J. London Math. Soc. (2) 39 (1989), no. 1, 67–78
that
$n^{2l(n)^2/27−dl(n)} \le F(n) \le n^{l(n)^2/6+l(n)}$
for some constant $d$, where $l …
8
votes
fixed points of permutation groups
I generally agree with Geoff that the question is too broad, and that you should tell us what types of families of subgroups you are most interested in.
I don't know of any proven results in this dir …
16
votes
Accepted
Largest permutation group without 2-cycles or 3-cycles
I can do a bit better! For even $n=2m$ there is a subgroup of order $2^{m-1}m!$ with no 2-cycles or 3-cycles. Let $W$ be the wreath product of a cyclic group of order 2 with $S_m$. In other words, $W …
5
votes
On the number of structure of $F_p[G]$-modules
There is a large number of distinct (up to module isomorphism) ${\mathbb F}_pG$-modules, even in small dimensions, and I don't think you can hope for any kind of reasonable classification.
I did some …
40
votes
How many square roots can a non-identity element in a group have?
I am just turning my comment into an answer. The answer to the question is no. I think the highest possible value of $r_2(g)$ with $g \ne 1$ is $r_2(g) = 3/4$ for the central element $g$ of $Q_8$, but …
22
votes
Accepted
Number of positions of Rubik's cube grows with multiplier 13 with the distance - what are ex...
This is a very crude attempt to explain the growth rate of $13$, can be almost certainly be improved upon.
In the situation where $20$ is the diameter, there are $18$ moves (or monoid generators), w …
3
votes
Accepted
Connected permutation groups and wreath product
I am afraid that I would have no idea where to look for a reference for this statement, but here is a very rough sketch proof. I can fill in details if necessary.
Let $A_1,\ldots,A_s$ be the orbits o …
21
votes
Does the symmetric group $S_{10}$ factor as a knit product of symmetric subgroups $S_6$ and ...
As has been pointed out in comments, the only subgroups $G$ and $H$ of $S_{10}$ isomorphic to $S_7$ and $S_6$ that could possibly have trivial intersections are the copy of $S_7$ that lies in $A_{10}$ …