Related papers: Investigating transversals as generating sets for …

We explore transversals of finite index subgroups of finitely generated groups. We show that when $H$ is a subgroup of a rank $n$ group $G$ and $H$ has index at least $n$ in $G$ then we can construct a left transversal for $H$ which…

Let $G$ be a finite group and $H$ a core-free subgroup of $G$. We will show that if there exists a solvable, generating transversal of $H$ in $G$, then $G$ is a solvable group. Further, if $S$ is a generating transversal of $H$ in $G$ and…

Let $G$ be a finite group and $H$ a subgroup of $G$. Each left transversal (with identity) of $H$ in $G$ has a left loop (left quasigroup with identity) structure induced by the binary operation of $G$. We say two left transversals are…

Let $G$ be a finite group, and let $H$ be a subgroup of $G$. We compute the probability, denoted by $P_G(H)$, that a left transversal of $H$ in $G$ is also a right transversal, thus a two-sided one. Moreover, we define, and denote by…

Let $G$ be a finite group and $H$ be a subgroup of $G$. In this paper, we prove that if $G$ is a finite nilpotent group and $H$ a subgroup of $G$, then $H$ is normal in $G$ if and only if all normalized right transversals of $H$ in $G$ are…

A finite group $G$ is called *uniformly generated*, if whenever there is a (strictly ascending) chain of subgroups $1<\langle x_1\rangle<\langle x_1,x_2\rangle <\cdots<\langle x_1,x_2,\dots,x_d\rangle=G$, then $d$ is the minimal number of…

Schreier formula for the rank of a subgroup of finite index of a finitely generated free group $F$ is generalized to an arbitrary (even infinitely generated) subgroup $H$ through the Schreier transversals of $H$ in $F$. The rank formula may…

The rank of a point-line geometry G is usually defined as the generating rank of G, namely the minimal cardinality of a generating set. However, when the subspace lattice of G satisfies the Exchange Property we can also try a different…

The generating graph encodes how generating pairs are spread among the elements of a group. For more than ten years it has been conjectured that this graph is connected for every finite group. In this paper, we give evidence supporting this…

In this note, a necessary and sufficient condition for the normalizer of a core-free subgroup $H$ of a finite group $G$ to be normal in $G$ is obtained. Also, a known result of finite groups is obtained through transversal.

We show that an infinite residually finite boundedly generated group has an infinite chain of finite index subgroups with ranks uniformly bounded, and give (sublinear) upper bounds on the ranks of arbitrary finite index subgroups of…

A subset S of a group G invariably generates G if G = <s^(g(s)) | s in S> for each choice of g(s) in G, s in S. In this paper we study invariable generation of infinite groups, with emphasis on linear groups. Our main result shows that a…

Given a collection of graphs $\mathbf{G}=(G_1, \ldots, G_m)$ with the same vertex set, an $m$-edge graph $H\subset \cup_{i\in [m]}G_i$ is a transversal if there is a bijection $\phi:E(H)\to [m]$ such that $e\in E(G_{\phi(e)})$ for each…

Let G be a group and H a subgroup of G of finite index. In this article, it is proved that if the number of isomorphism classes of right transversals of H in G is 5, then the index of H in G is 6 and the permutation representation of G on…

We consider groups defined by non-empty balanced presentations with the property that each relator is of the form R(x,y), where x and y are distinct generators and R(.,.) is determined by some fixed cyclically reduced word R(a,b) that…

A subset S of a finite group G invariably generates G if G = <hsg(s) j s 2 Si > for each choice of g(s) 2 G; s 2 S. We give a tight upper bound on the minimal size of an invariable generating set for an arbitrary finite group G. In response…

Suppose that G is a linearly reductive group. We study the minimal free resolution of the invariant ring. If G is a finite linearly reductive group, then the ring of invariants is generated in degree at most |G|, the group order. We prove…

In this paper we explore the structure and properties of C-groups. We define a C-group as a group $G$ with $rk(G) < rk(Z(G))$ (where $rk(G)$ is the minimal cardinal of a generating set for a group $G$). Using GAP (a group theory program)…

Let G be a group and H be a subgroup of G. We say that H is left relatively convex in G if the left G-set G/H has at least one G-invariant order; when G is left orderable, this holds if and only if H is convex in G under some left ordering…

For a group $G$ and a finite set $A$, denote by $\text{End}(A^G)$ the monoid of all continuous shift commuting self-maps of $A^G$ and by $\text{Aut}(A^G)$ its group of units. We study the minimal cardinality of a generating set, known as…