Related papers: Thin subsets of groups

Let $H$ be a finite abelian (commutative) group of order $n \geq 2$, and $m >1$ be an integer. We define the $m$-graph of $H$, denoted by $m-G(H)$, as a simple undirected graph with vertex set $H$, and two distinct vertices, $a, b \in H$,…

Let $g$ be an element of a group $G$. For a positive integer $n$, let $E_n(g)$ be the subgroup generated by all commutators $[...[[x,g],g],\dots ,g]$ over $x\in G$, where $g$ is repeated $n$ times. We prove that if $G$ is a profinite group…

It is proved to be consistent relative to a measurable cardinal that there is a uniform ultrafilter on the real numbers which is generated by fewer than the maximum possible number of sets. It is also shown to be consistent relative to a…

For an element $g$ of a group $G$, an Engel sink is a subset $\mathscr{E}(g)$ such that for every $ x\in G $ all sufficiently long commutators $ [x,g,g,\ldots,g] $ belong to $\mathscr{E}(g)$. Let $q$ be a prime, let $m$ be a positive…

Let G be a finite group and S a subset of G\{0}. We call S an additive basis of G if every element of G can be expressed as a sum over a nonempty subset in some order. Let cr(G) be the smallest integer t such that every subset of G\{0} of…

A number of properties of spherical Artin groups extend to Garside groups, defined as the groups of fractions of monoids where least common multiples exist, there is no nontrivial unit, and some additional finiteness conditions are…

We call a group $G$ {\it algorithmically finite} if no algorithm can produce an infinite set of pairwise distinct elements of $G$. We construct examples of recursively presented infinite algorithmically finite groups and study their…

We investigate structural properties of non-sofic groups, assuming that such groups exist. We introduce and study two classes: minimal non-sofic groups and $\omega$-non-sofic groups. For minimal non-sofic groups, we establish strong…

Let $\sigma =\{\sigma_{i} | i\in I\}$ be some partition of the set of all primes $\Bbb{P}$, $G$ a finite group and $\sigma (G) =\{\sigma_{i} |\sigma_{i}\cap \pi (G)\ne \emptyset \}$. A set ${\cal H}$ of subgroups of $G$ is said to be a…

Let $G$ be a graph on $n$ vertices. We call a subset $A$ of the vertex set $V(G)$ \emph{$k$-small} if, for every vertex $v \in A$, $\deg(v) \le n - |A| + k$. A subset $B \subseteq V(G)$ is called \emph{$k$-large} if, for every vertex $u \in…

In a group $G$, a weak Sierpi\'nski subset is a subset $E$ such that for some $g,h\in G$ and $a\neq b\in E$, we have $gE=E\smallsetminus \{a\}$ and $hE=E\smallsetminus \{b\}$. In this setting, we study the subgroup generated by $g$ and $h$,…

A common fixed point property for semigroups is applied to show that the group algebra $L^1(G)$ of a locally compact group $G$ is $2m$-weakly amenable for each integer $m\geq 1$.

We introduce the notion of the depth of a finite group $G$, defined as the minimal length of an unrefinable chain of subgroups from $G$ to the trivial subgroup. In this paper we investigate the depth of (non-abelian) finite simple groups.…

In 1995 in Kourovka notebook the second author asked the following problem: it is true that for each partition $G=A_1\cup\dots\cup A_n$ of a group $G$ there is a cell $A_i$ of the partition such that $G=FA_iA_i^{-1}$ for some set $F\subset…

For a finite group $G$, we define the inclusion graph of subgroups of $G$, denoted by $\mathcal I(G)$, is a graph having all the proper subgroups of $G$ as its vertices and two distinct vertices $H$ and $K$ in $\mathcal I(G)$ are adjacent…

A class of subsets designated as very thin subsets of natural numbers has been studied and seen that theory of convergence may be rediscovered if very thin sets are given to play main role instead of thin or finite sets which removes some…

A group $G$ is invariably generated (IG) if there is a subset $S \subseteq G$ such that for every subset $S' \subseteq G$, obtained from $S$ by replacing each element with a conjugate, $S'$ generates $G$. $G$ is finitely invariably…

Given an infinite group $G$ and a subset $A$ of $G$ we let $\Delta(A) = \{g \in G \,:\, |gA \cap A| =\infty\}$ (this is sometimes called the \emph{combinatorial derivation} of $A$). A subset $A$ of $G$ is called: \emph{large} if there…

This paper deals with combinatorial aspects of finite covers of groups by cosets or subgroups. Let $a_1G_1,...,a_kG_k$ be left cosets in a group $G$ such that ${a_iG_i}_{i=1}^k$ covers each element of $G$ at least $m$ times but none of its…

Let $\sigma =\{\sigma_{i} | i\in I\}$ be a partition of the set of all primes $\Bbb{P}$ and $G$ a finite group. A set ${\cal H}$ of subgroups of $G$ is said to be a \emph{complete Hall $\sigma $-set} of $G$ if every member $\ne 1$ of ${\cal…