All Questions
Tagged with finite-groups co.combinatorics
190 questions
6
votes
1
answer
251
views
Subsets of a group with special property
Let $G$ be a finite group. We say a subset $A$ of $G$, $|A|=m$, is $(m,i)$-good, $m\geq 1$ and $0\leq i\leq m$, if there exist $g_A\in G$ such that we have $|gA\cap A|=m-i$.
I need some groups such ...
3
votes
1
answer
153
views
On decomposition of finite Abelian groups
It is easy to see that for any finite Abelian group $G$ and any numbers $a,b$ with $|G|=ab$ there exist a subgroup $A\subset G$ and a subset $B\subset G$ such that $|A|=a$, $|B|=b$ and $G=A+B$, where $...
7
votes
1
answer
332
views
Conjectured combinatorial non-equality
Let $n,k,\ell$ be integers for which $0\leq k<\ell \leq n-6$. For a fixed $n$, think of $k,\ell$ as being allowed to vary. I believe the values
$$(n-k-5)(k+1)(k+2)\binom n{k+3}~~~\text{and}~~~(n-...
0
votes
1
answer
283
views
Is any abelian subgroup of a semidirect product isomorphic to a direct product of abelian subgroups? [closed]
Let $H$ and $K$ be groups and $V$ an abelian subgroup of the semidirect
product $\ H\rtimes K$. Do there exist abelian subgroups $H^{\prime }\leq H$
\ and $K^{\prime }\leq K$ \ such that $V\cong H^{\...
2
votes
0
answers
78
views
Width of symmetric groups
MSE crosspost
For any (finite) group $G$ its length $l(G)$ is the length of maximal chain of proper subgroups (it's known and pretty widely used invariant). But we can also define width function $w_G(...
3
votes
2
answers
423
views
Finite groups with small God's numbers
Let $G$ be a finite group and $S$ be generating set it. Now given all words with alphabet $S$, then there exists a minimum word length $N(S,G)$ such that all group elements are represented by a word ...
2
votes
0
answers
84
views
A lattice ordered by inclusion and isomorphic to the lattice of quotient groups of a finite group
Let $G$ be a finite group. Consider the lattice $$L=\{ G/N:\text{$ N $ is a normal subgroup of $G $}\},$$ where $G/N \leq G/K$ if and only if $K\leq N$. The lattice operations ∧ and ∨ on quotient ...
3
votes
1
answer
314
views
Probability in $GL_2(\mathbb{Z}/p^{r}\mathbb{Z})$
My question may be not interesting or easy to answer ! but I am really not familiar with proba.
Let $p$ be an odd prime number. and let $r\geq1$ an integer. choose an element $A\in\mathrm{GL}_2(\...
12
votes
2
answers
1k
views
Graph automorphism group
Let $A_w$ denote such set of positive integer $n$ that: for any two permutations $\pi_0,\pi_1\in S_n$, if $\pi_1$ is not a power of $\pi_0$, then there exists a (labeled non oriented) graph $G$ of ...
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 ...
2
votes
0
answers
85
views
Permutation factorizations according to number of generated orbits
Let $\pi$ be a permutation in $S_n$ with cycle type $\lambda$.
How many factorizations into two factors $\pi=\sigma_1\sigma_2$ are there, such that the subgroup $\langle \sigma_1,\sigma_2\rangle$ ...
5
votes
2
answers
245
views
Counting transitive generators according to coset type
Let $\sigma=(1\;2)(3\;4)\cdots (n-1\; n)$ be a fixed-point-free involution in $S_{2n}$. I want to count permutations $\pi$ such that the group $\langle \pi,\sigma\rangle$ generated by $\pi$ and $\...
4
votes
1
answer
171
views
Are descents in alternating subgroup counted by $h$-vector?
Consider the alternating subgroup $A_n$ of the symmetric group $S_n$ (or in general any Coxeter Group). Is there a simplicial complex whose $h$-vector $h_i$ equals the number of elements of $A_n$ with ...
2
votes
0
answers
186
views
Sum of reciprocals in finite fields
Let $p$ be an odd prime number which large enough. I am interested in the study of the sums of reciprocals in the field $\mathbb{F}_p$.
In particular, I have the following question:
which primes $p$ ...
6
votes
2
answers
493
views
Finite lattice representation problem checking
[Grätzer and Schmidt 1963] proves that every algebraic lattice is isomorphic to the congruence lattice of a universal algebra. A finite lattice is algebraic. The finite lattice representation problem ...
1
vote
0
answers
242
views
Counting elements having a given cycle structure in maximal subgroups of a generalized symmetric group
Let $G$ be the wreath product $C_7\wr S_{18}$, where $C_7$ is the cyclic group of order 7 and $S_{18}$ is the symmetric group on 18 symbols. Consider $G$ to be embedded in the group $S_{126}=S_{7\cdot ...
2
votes
0
answers
140
views
About the eigenvectors of a matrix related to a Cayley graph
In some papers about the cayley graphs of finite groups the behaviour of the eigenvalues and eigenvectors of $\phi$ were discussed when $\phi=\sum_{g\in G} \lambda_G(g)$ and $\lambda_G(g)$ is defined ...
2
votes
0
answers
110
views
How many symmetric strings a permutation fixes
Let $A$ be an alphabet of $N$ symbols. Let $S_n$ be the group of permutations of $n$ symbols. A permutation acts on a string of letters from $A$ in the obvious way.
If I ask, given a permutation $\pi\...
3
votes
1
answer
157
views
On the Upper Density of $C_2$ in finite groups
We define the upper density $\rho (G)$ of a finite group $G$ as the ratio of the number of finite groups of order $<n$ which contain a subgroup isomorphic to $G$ to the number of groups of order $&...
1
vote
1
answer
139
views
Is an Eulerian subgroup lattice boolean?
Let $G$ be a finite group and $\mu$ the Möbius function of the subgroup lattice $\mathcal{L}(G)$.
The reduced Euler characteristic of the order complex of the coset poset $\{ Kg \ | \ K<G, \ g \...
16
votes
1
answer
1k
views
Tensor power of the natural representation of Sn
The symmetric group $S_n$ acts over $V=\mathbb{R}^n$ by permuting the canonical basis.
So it acts over $V^{\otimes p}$ with a diagonal action (acts the same over each element of the tensor product).
...
1
vote
0
answers
285
views
Classification of transitive subgroups of finite symmetric groups generated by double transpositions
I want to classify (up to isomorphism) all transitive subgroups of symmetric group $S_n$ which are generated by double transpositions (product of two transpositions). Is there a characterization for ...
3
votes
0
answers
79
views
Groups with maximal density of the set of orders of elements
Based on the answer to this question, I am wondering:
Let $n>8$ and $G$ a finite group for which all orders of its elements are contained in $\{1,\dotsc,n\}$ (denote the set of all such groups by $\...
15
votes
1
answer
679
views
Submodules of $({\mathbb Z}/6{\mathbb Z})^n$ intersecting $\{0,1\}^n$ trivially
$\newcommand{\F}{{\mathbb F}}$
$\newcommand{\Z}{{\mathbb Z}}$
Suppose that $\F$ is a finite field of prime order $p:=|\F|$, and let $n$ be a positive integer. I consider the regime where $\F$ is ...
13
votes
2
answers
1k
views
Number of commuting pairs (triples, n-tuples) in GL_n(F_q) (and other groups)?
Question 1 What is the number of pairs of commuting elements in GL_n(F_q) ?
I am aware of many results concerning commuting elements in Mat_n(F_q), but I am interested in GL i.e. non-degenerate ...
20
votes
1
answer
586
views
$q$-(and other)-analogs for counting index-$n$ subgroups in terms of Homs to $S_n$?
The following formula of astonishing beauty and power (imho):
$$ \sum_{n \ge 0} \frac{| \mathrm{Hom}(G,S_n) | }{n! } z^n = \exp\left( \sum_{n \ge 1} \frac{|\text{Index}~n~\text{subgroups of}~ G|}nz^...
3
votes
2
answers
293
views
An optimization problem in finite groups
Let $G$ be a finite group, say, of order $n$. I ran into the following problem (where $|A|$ denotes the cardinality of a set $A$):
To determine the minimum of $|A|+|B|$ for sets $A, B \subset G$ such ...
8
votes
0
answers
88
views
Is recognizing if a Latin square is isotopic to its transpose more efficient than computing its symmetry group?
Ihrig and Ihrig (2007) described a mathematical method for determining if a Latin square is isotopic to its transpose (where isotopic Latin squares vary by permuting the rows, columns and symbols). ...
8
votes
2
answers
618
views
sum-sets in a finite field
Let $\mathbb{F}_p$ be a finite field, $A=\{a_1,\dots,a_k\}\subset\mathbb{F}_p^*$ a $k$-element set, for $k<p$. $\mathfrak{S}_k=$permutation gp.
Question. Is it true there is always a $\pi\in\...
13
votes
1
answer
651
views
The Möbius number of the nonabelian finite simple groups
Let $L$ be a finite lattice with minimum $\hat{0}$ and maximum $\hat{1}$. The Möbius function $\mu$ for $L$ is defined recursively by: for $\forall a,b \in L$ with $a<b$, $\mu(b,b) = 1$ and $\mu(...
5
votes
1
answer
503
views
does this set of permutations form a group? And more
Consider the group of $mn\times mn$ permutation matrices $\mathfrak{S}_{mn}$ and partition each such matrix $P$ into $n^2$ blocks of $m\times m$ matrices $Q_{i,j}$. Now, transpose each $Q_{i,j}$ (...
5
votes
0
answers
241
views
Counting the number of orbits finite groups of "diagonal type"
Let $n$, $k$, $r_1, \dots, r_k$ be positive integers.
For each $i \in [k]:=\{1,\dots,k\}$, suppose we are given $n$ permutations of the the set $[r_i]$, that is $f_1^{(i)}, \dots, f_n^{(i)}$ in $\...
3
votes
0
answers
226
views
$S_n$ action on the sequences of transpositions
It is well-known, that any element $\rho$ of the symmetric group $S_n$ with $n-p$ cycles admits a unique presentation as a product of a sequence of transpositions $\{(a_i\,b_i)\}_{i = 1}^p$ with $a_i &...
13
votes
2
answers
1k
views
The exceptional isomorphism between PGL(3,2) and PSL(2,7): geometric origin?
It is well-known there is an isomorphism between $GL(3,2)=PGL(3,2)$, the automorphism group of the Fano plane (i.e. the projective plane over the finite field with two elements), and $PSL(2,7)$, which ...
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\...
12
votes
2
answers
660
views
On shifted symmetric power sums
The functions $p^*_k(x)=\sum_{i=1}^N ((x_i-i)^k-(-i)^k)$ are analogues of power sum symmetric functions, called shifted symmetric by Okounkov and Olshanski. Define $p^*_{(k_1,k_2,...)}=p^*_{k_1}p^*_{...
3
votes
4
answers
610
views
Factorization in the group algebra of symmetric groups
Let $S_n$ be the symmetric group on $\{1, \ldots, n\}$. Let
\begin{align}
T=\sum_{g\in S_n} g.
\end{align}
Are there some references about the factorization of $T$?
In the case of $n=3$, we have
\...
3
votes
1
answer
173
views
Is there an atom K of [H,G]≃B2 with |K:H|≡|G:H|(mod 2)?
Let $[H,G]$ be a rank $2$ boolean interval of finite groups.
Statement 1: There is an atom $K$ of $[H,G]$ such that $|K:H|≡|G:H|($mod $ 2)$.
The following picture illustrates the statement.
...
1
vote
3
answers
1k
views
primes dividing binomial coefficients
Dear All,
I am considering maximal subgroups of odd index in Alternating and Symmetric groups, and this leeds me to some questions on binomial coefficients that I presently do not know and that I ...
6
votes
1
answer
341
views
Sum of Young symmetrisers of a given shape
Preliminaries and notation:
Let $n\in \mathbb{Z}_{>0}$ and $\lambda=(\lambda_1,\lambda_2,\dots,\lambda_s)\vdash n$ be a partition. Given a Young diagram of shape $\lambda$, we can associate it ...
2
votes
0
answers
97
views
Is the bounded coset poset of a boolean interval of finite groups, Cohen-Macaulay?
Let $[H,G]$ be a boolean interval of finite groups and let $\hat{C}(H,G)$ be its bounded coset poset (i.e. the poset of cosets $Kg$ with $K \in [H,G]$, bounded below by $\emptyset$ and bounded above ...
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 ...
2
votes
0
answers
154
views
Nonvanishing of the dual Euler totient on boolean intervals of finite groups
The rank $n$ boolean lattice $B_n$, is the subset lattice of $\{1,2, \dotsm n \}$.
Let $[H,G]$ be a boolean interval of finite groups. Its Euler totient is defined by $$\varphi(H,G):=\sum_{K \in ...
6
votes
1
answer
629
views
Positivity of the alternating sum of indices for boolean interval of finite groups
Let $G$ be a finite group and $H$ a subgroup such that the interval $[H,G]$ is a boolean lattice.
Let $L_1, \dots , L_n$ be the maximal subgroups of $G$ containing $H$.
Let the alternative sum ...
3
votes
1
answer
184
views
Is there a characterization of CI-groups of order less than 100?
We know some benefit criterion in articles such as:
C. H. Li, On isomorphisms of finite Cayley graphs-a survey, Discrete Math., 256 (2002) 301-334.
C. H. Li, Z. P. Lu, P. P....
1
vote
0
answers
81
views
An optimal lower bound related to generators in a boolean interval of finite groups
Let $[H,G]$ be a rank $n$ boolean interval of finite groups (i.e. $[H,G] \simeq B_n$ as lattice).
Let the set $E = \{ g \in G \ | \ \langle H,g \rangle = G \}$
Remark: If $g \in E$ then $Hg \...
2
votes
1
answer
137
views
Intransitive finite irreducible linear groups whose orbits are all large
I am interested in intransitive irreducible linear subgroups $G\subseteq\mathrm{GL}_n(\mathbb{F}_p)$ acting on $V-\{0\}=\mathbb{F}_p^n-\{0\}$ in the natural way, such that all of the orbits are very ...
5
votes
1
answer
204
views
A decomposition of $w_0$ which is similar to the reduced decomposition
Some basic definitions about reduced decomposition:
In the symmetric group $S_n$, let $s_i$ denote the adjacent transposition $(i,i+1),i\in \{1,2,\cdots,n-1\}.$ Since $S_n$ is generated by adjacent ...
5
votes
2
answers
330
views
sum of squares of Schur polynomials indexed over partition valued functions on a set
Fix a finite set $X$ and two natural numbers $d$ and $n$.
For a partition $\lambda$ and a number $d$ denote by $s_\lambda^d(x_1,\dots,x_d)$ the Schur polynomial in $d$-many variables $x_1,\dots,x_d$. ...
6
votes
1
answer
332
views
Zero-sum sets in union-closed families
The Davenport constant $D(G)$ of a finite abelian group $G$ is the minimum integer $n$ such that whenever $a_1, \ldots, a_n \in G$ (not necessarily distinct), there is a non-empty $I \subseteq [n]$ ...