Factors in finite groups and well-covered graphs
Fuente:
arXiv
Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866908817996906496 |
|---|---|
| author | Kabenyuk, Mikhail |
| author_facet | Kabenyuk, Mikhail |
| contents | We study a combinatorial property of subsets in finite groups that is analogous to the notion of independence in graphs. Given a group $G$ and a non-empty subset $A\subset G$, we define a (right) $s$-factor as a subset $B\subset G$ satisfying the following conditions:
(i) Every element of $AB$ can be written uniquely as $ab$ with $a\in A$ and $b\in B$.
(ii) $B$ is maximal (with respect to inclusion) with this property.
For a finite group $G$, the upper and lower indices of $A$ are the sizes of the largest and smallest $s$-factors associated with $A$. A subset is called stable if its upper and lower indices coincide. A group is called stable if all its subsets are stable.
We then explore the connection between $s$-factors in groups and maximal independent sets in graphs. Specifically, we show that $s$-factors in $G$ associated with $A$ correspond to maximal independent sets in a Cayley graph Cay($G$, $S$), where $S=A^{-1}A\setminus\{e\}$. Consequently, the upper and lower indices of $A$ are equal to the independence number and the independent domination number of the associated Cayley graph.
The concepts of $s$-factors, subset indices in groups, stable subsets, and stable groups (under different names) were introduced by Hooshmand in 2020. Later, Hooshmand and Yousefian-Arani classified stable groups using computer calculations.
Using the connection with graphs, we compute the upper and lower indices for various groups and their subsets. Furthermore, we prove a classification theorem describing all stable groups without relying on computer calculations. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2602_06770 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Factors in finite groups and well-covered graphs Kabenyuk, Mikhail Group Theory Combinatorics 20D60 (Primary) 05C25, 05C69 (Secondary) I.1.2; G.2.2; G.2.1 We study a combinatorial property of subsets in finite groups that is analogous to the notion of independence in graphs. Given a group $G$ and a non-empty subset $A\subset G$, we define a (right) $s$-factor as a subset $B\subset G$ satisfying the following conditions: (i) Every element of $AB$ can be written uniquely as $ab$ with $a\in A$ and $b\in B$. (ii) $B$ is maximal (with respect to inclusion) with this property. For a finite group $G$, the upper and lower indices of $A$ are the sizes of the largest and smallest $s$-factors associated with $A$. A subset is called stable if its upper and lower indices coincide. A group is called stable if all its subsets are stable. We then explore the connection between $s$-factors in groups and maximal independent sets in graphs. Specifically, we show that $s$-factors in $G$ associated with $A$ correspond to maximal independent sets in a Cayley graph Cay($G$, $S$), where $S=A^{-1}A\setminus\{e\}$. Consequently, the upper and lower indices of $A$ are equal to the independence number and the independent domination number of the associated Cayley graph. The concepts of $s$-factors, subset indices in groups, stable subsets, and stable groups (under different names) were introduced by Hooshmand in 2020. Later, Hooshmand and Yousefian-Arani classified stable groups using computer calculations. Using the connection with graphs, we compute the upper and lower indices for various groups and their subsets. Furthermore, we prove a classification theorem describing all stable groups without relying on computer calculations. |
| title | Factors in finite groups and well-covered graphs |
| topic | Group Theory Combinatorics 20D60 (Primary) 05C25, 05C69 (Secondary) I.1.2; G.2.2; G.2.1 |
| url | https://arxiv.org/abs/2602.06770 |