All Questions
27 questions
7
votes
1
answer
224
views
Generating set of permutation group such that generators do not "contain" other group elements
Let $(G, X)$ be a permutation group with domain $X$. Let $O=\{o_1,\dots,o_m\}$ be the set of orbits of $G$. I am interested in generating sets $S$ with the following property:
Let $g\in S$ be a ...
- 5,822
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 \; ...
- 66.3k
3
votes
0
answers
233
views
A bridge between the algebraic / differential geometry of $\frak{sl}_2(\mathbb{C})$ and the Sheffer-Appell calculus and combinatorics
In "Four examples of Beilinson-Bernstein localization", Anna Romanov introduces the basis
$m_k = \frac{(-1)^k}{k!} \partial^k \delta $
on p. 9, where $\partial$ is a partial derivative and $\...
- 10.5k
2
votes
0
answers
126
views
Almost subgroups of $\mathbb S^1$
Suppose $X\subset \mathbb S^1$ is a finite subset of the group $\mathbb S^1$ such that $|X+X|<(1+c )|X|$ for a sufficiently small $c\in(0,1)$. I believe that in such case there exists a subgroup $G=...
- 14.3k
4
votes
1
answer
225
views
Integer-valued polynomials from Pólya counting
Let finite group $G$ act on a finite set $X$ and hence on colorings $Y^X$, where $Y=\{1,2,\ldots,k\}$ is a set of colors. The Burnside-Pólya-Redfield-etc. counting theorem says that the number of ...
- 24.2k
4
votes
1
answer
197
views
Moment integrals and determinants
Let $USp(2n)$ be the compact symplectic group of size $2n$, $dA$ its Haar measure
of total mass one, and $\det(1−A)$ being computed for the standard representation of
$A\in USp(2n)$ as a matrix of ...
- 43.2k
2
votes
0
answers
161
views
Monotonicity of the cycle index polynomial under restriction
The cycle index (polynomial) of the symmetric group $\mathfrak{S}_n$ is given by the formula:
$$Z(\mathfrak{S}_n)(x_1,\dots,x_n)=\sum_{1j_1+2j_2+\cdots+nj_n=n}\prod_{k=1}^n\frac{x_k^{j_k}}{k^{j_k}j_k!}...
- 43.2k
7
votes
2
answers
713
views
Total sum of squares of characters of the symmetric group $\mathfrak{S}_n$
In my earlier MO post, I proposed the double sum $\sum_{\mu\vdash n}\sum_{\lambda\vdash n}\chi_{\mu}^{\lambda}$ regarding characters of the symmetric group $\mathfrak{S}_n$. Soon after, I started ...
- 43.2k
5
votes
1
answer
201
views
An Indepth Look at Isoperimetry in the Cayley Graph Generated by All Transpositions
Let $\Omega_n$ denote the symmetric/permutation group on $n$ objects.
Let $T_n \subseteq \Omega_n$ denote the set of transpositions.
Drop the $n$-subscripts.
Define the Cayley graph $G = (\Omega, E)$ ...
- 560
2
votes
1
answer
181
views
Generators of sandpile groups of wheel graphs
In the paper "On the Sandpile Group of a Graph" by Cori and Rossin one can find a result related to the structure of the sandpile group of $W_n$. Is there a way to provide a set of ...
- 298
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$-...
- 5,822
7
votes
2
answers
415
views
Graph which do not satisfy a pseudo-Poincaré inequality
Say that an infinite (connected) graph (with vertices of bounded degree) satisfies a $\ell_1$-pseudo-Poincaré inequality if there is a constant $C>0$ so that for any $n \in \mathbb{N}$ for any ...
- 4,432
3
votes
4
answers
654
views
A generalization of Landau's function
For a given $n > 0$ Landau's function is defined as $$g(n) := \max\{ \operatorname{lcm}(n_1, \ldots, n_k) \mid n = n_1 + \ldots + n_k \mbox{ for some $k$}\},$$
the least common multiple of all ...
- 798
2
votes
1
answer
847
views
Why Triangle of Mahonian numbers T(n,k) forms the rank of the vector space?
I am looking for an explanation of why Triangle of Mahonian numbers T(n,k) form the rank of the vector space $H^k(GL_n/B)$?
With respect to the property of Kendall-Mann numbers where the statement ...
10
votes
1
answer
269
views
Edge-transitive Cayley graphs of $S_n$
I came across the following question which I haven't seen before:
Question. Fix $k\ge 3$. For infinitely many $n$, does there exists a generating set $\langle R_n \rangle = S_n$, $|R_n|=k$, such ...
- 17k
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\...
- 43.2k
2
votes
1
answer
255
views
Polya-MacMahon-Burnside's generating function at "-1"
$\mathbb{Z}_n$, as a cyclic subgroup of symmetric group $\mathfrak{S}_n$, acts on $[n] :=\{1, 2,\dots,n\}$. Hence $\Bbb{Z}_n$ permutes the elements of the Boolean algebra $2^{[n]}$ of all subsets of $[...
- 43.2k
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 ...
- 539
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$ ...
- 4,784
16
votes
2
answers
818
views
Decomposing $(\mathbb C^n)^{\otimes m}$ as a representation of $S_n\times S_m$
$V=\mathbb C^n$ is a $\mathbb CS_n$-module, where $S_n$ is the symmetric group of degree $n$, via the representation sending a permutation to the corresponding permutation matrix. The tensor power $V^...
- 38.6k
2
votes
1
answer
364
views
Totally aperiodic sequence
Let $A$ be a finite set. Let $A^k$ be the set of words in the alphabet $A$ of length $k$ and $A^*$ be the set of infinite words. I was looking for an element $a = \lbrace a_n \rbrace_{n \in \mathbb{N}}...
- 4,432
18
votes
3
answers
745
views
Number of primitive $n$th roots with positive versus negative real parts
Does anyone know a reference to the following results, which I can prove, but I suspect may be known. Let $R(n)$ denote the number of primitive $n$th roots of unity with positive real part, and $L(n)$ ...
- 1,991
5
votes
1
answer
889
views
A generalized Burnside's lemma
Let $G$ be a finite group acting on a set $X$, and let $S\subseteq G$ be a union of conjugacy classes. Then I believe I can prove:
$$ \sum_{[x]\in X/G} \frac{|G_x \cap S|}{|G_x|} = \sum_{g\in S} \...
- 66.8k
9
votes
3
answers
947
views
Where was it first stated that there are no 4-transitive finite groups other than symmetric, alternating and Mathieu groups?
It seems to be well-known that the six-transitive finite groups are the symmetric and alternating groups, and the only other four-transitive finite groups are the Mathieu groups (the statement can be ...
- 96.4k
1
vote
2
answers
557
views
Is there formula name and proof for this theorem ? [closed]
The formula answers: how many tuples $(\sigma_1,\sigma_2,...,\sigma_n)$ of elements of a given group G such that
(1) $\sigma_i\in C_i$ , where $C_i$ stands for conjugacy class.
(2) $\sigma_1\...
- 11
2
votes
1
answer
397
views
Counting Nearest Neighbors that Stay Nearest Neighbors after Random Rearrangements
Imagine we are making necklaces with $n$ beads, each bead is a different color from all others. Let's say we make one necklace. If we make another necklace with the same $n$ differently colored ...
- 161
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 ...
- 2,179