Skip to main content

All Questions

Filter by
Sorted by
Tagged with
3 votes
0 answers
125 views

Short path problem on Cayley graphs as language translation task (from "Permutlandski" to "Cayleylandski"(s) :). Reference/suggestion request

Context: Algorithms to find short paths on Cayley graphs of (finite) groups are of some interest - see below. There can be several approaches to that task. One of ideas coming to my mind - in some ...
Alexander Chervov's user avatar
5 votes
1 answer
365 views

Number of $k$-tuples of elements generating a cyclic group

Let $k$, $m$ be natural numbers, and $C_m:=\mathbb{Z}/ m \mathbb{Z}$ be the cyclic group of order $m$. Let $N_{k, \, m}$ be the cardinality of the following set: $$\{(a_1, \ldots, a_k) \in (C_m)^k \; ...
Francesco Polizzi's user avatar
1 vote
0 answers
80 views

Packing almost-subgroups into a group

We consider a group finite $G$. We say a set $A\subset G$ injects a set $B$ if $|A+B| = |A||B|$, and let $I(B) = \max \{|A| :A\text{ injects } B\}$. For a subgroup $H$, it is well-known that $I(H) = |...
Zach Hunter's user avatar
  • 3,499
5 votes
1 answer
316 views

Connected permutation groups and wreath product

Let $G$ and $H$ be subgroups of the symmetric groups $\mathfrak S_m$ and $\mathfrak S_n$. Assume that $n>1$ and that $H$ is a 'connected' permutation group, that is, there is no non-trivial $H$-...
Martin Rubey's user avatar
  • 5,822
4 votes
2 answers
144 views

Factorizations in terms of characters

I have asked this in math.SE (https://math.stackexchange.com/questions/2698772/factorizations-in-terms-of-characters) but it was barely viewed. I have seen mention in different places that the number ...
thedude's user avatar
  • 1,549
9 votes
2 answers
762 views

Solutions of $x^d=1$ in the symmetric group

L Moser and M Wyman, On solutions of $x^d = 1$ in symmetric groups, Canad. J. Math., 7 (1955), pages 159-168, explored asymptotic behavior of the cardinality of such permutations: $$f_d(n):=\#\{\pi\in\...
T. Amdeberhan's user avatar
8 votes
2 answers
576 views

Two statistics on the permutation group

Let $\mathfrak{S}_n$ be the permutation group on an $n$-element set. For each fixed $k\in\mathbb{N}$, consider the two sets $$A_n(k)=\{\sigma\in\mathfrak{S}_n\vert\,\, \text{$\exists i,\,\, 1\leq i\...
T. Amdeberhan's user avatar
7 votes
1 answer
313 views

Subgroup ranks of the symmetric group

It's well known that every subgroup $G$ of $S_n$ has a generating set of size at most $n-1$ and that this generating set can be found algorithmically (by Jerrum's filter) I have heard many times a ...
Joe Bebel's user avatar
  • 539
2 votes
3 answers
888 views

The number of submodules of $\mathbb{Z}_q^n$

Observe $\mathbb{Z}_q^n = \mathbb{Z}_q \times \cdots \times\mathbb{Z}_q$ as a module over $\mathbb{Z}_q\equiv\mathbb{Z}/q\mathbb{Z}$, for general $q$. I am interested in the following questions: How ...
aleph's user avatar
  • 503
9 votes
0 answers
297 views

An abstract zero-sum problem

I would like to know whether the problem described below has appeared in the literature and/or whether similar questions have been studied. I would be very happy to find some references or, if none ...
monkeymaths's user avatar
  • 1,169
3 votes
0 answers
186 views

Which Dihedral Groups are $\text{CI}$-Groups?

Let $D_{n}$ denotes the dihedral group of order $2n$. Firstly, for self-referencing of the question, I give some definitions which are standard. Let $G$ be a finite group. A subset $S$ of group $G$ ...
Shahrooz's user avatar
  • 4,784
5 votes
1 answer
264 views

Group not leaving subset invariant

Let $Y,X$ be two sets of size n,m. Let $Y\subset X$. What is the maximal group(in size) $G< Sym(X)$ such that gY=Y imply that $g=1$? Here I mean that the only permutation which permutes elements of ...
Klim Efremenko's user avatar