Related papers: Finite groups in which there are only two possible…

We investigate the structure of finite groups whose non-central real class sizes have the same $2$-part. In particular, we prove that such groups are solvable and have $2$-length one. As a consequence, we show that a finite group is…

Thompson's theorem stated that a finite group $G$ is solvable if and only if every $2$-generated subgroup of $G$ is solvable. In this paper, we prove some new criteria for both solvability and nilpotency of a finite group using certain…

A group is Artinian if there is no infinite strictly descending chain of subgroups. Ol'shanskii has asked whether there are Artinian groups of arbitrarily large cardinality. We show that this problem is essentially the same as an analogous…

A Coxeter group W is called reflection independent if its reflections are uniquely determined by W only, independently on the choice of the generating set. We give a new sufficient condition for the reflection independence, and examine this…

We show that on an arbitrary finitely generated non virtually solvable linear group, any two independent random walks will eventually generate a free subgroup. In fact, this will hold for an exponential number of independent random walks.

For a group $G$ and a natural number $m$, a subset $A$ of $G$ is called $m$-thin if, for each finite subset $F$ of $G$, there exists a finite subset $K$ of $G$ such that $|Fg\cap A|\leqslant m$ for every $g\in G\setminus K$. We show that…

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…

Let $T$ be a (first order complete) dependent theory, ${\mathfrak{C}}$ a $\bar\kappa$-saturated model of $T$ and $G$ a definable subgroup which is abelian. Among subgroups of bounded index which are the union of $<\bar\kappa$ type definable…

We study the intersection lattice of the arrangement $\mathcal{A}^G$ of subspaces fixed by subgroups of a finite linear group $G$. When $G$ is a reflection group, this arrangement is precisely the hyperplane reflection arrangement of $G$.…

For a finite group G, we denote by v(G) the number of conjugacy classes of subgroups of G not in CD(G). In this paper, we determine the finite groups G such that v(G)=1,2,3.

Invariable generation is a topic that has predominantly been studied for finite groups. In 2014, Kantor, Lubotzky, and Shalev produced extensive tools for investigating invariable generation for infinite groups. Since their paper, various…

Let $\mathcal{C}$ be a class of finite groups closed for subgroups, quotients groups and extensions. Let $\Gamma$ be a finite simplicial graph and $G = G_{\Gamma}$ be the corresponding pro-$\mathcal C$ RAAG. We show that if $N$ is a…

Let R be a unitary ring of finite cardinality P^k, where p is a prime number and $p\nmid k$. We show that if the group of units of $R$ has at most one subgroup of order $p$, then $R\cong A\bigoplus B,$ where $B$ is a finite ring of order…

Let $G=(V,E)$ be a simple graph. A dominating set of $G$ is a subset $S\subseteq V$ such that every vertex not in $S$ is adjacent to at least one vertex in $S$. The cardinality of a smallest dominating set of $G$, denoted by $\gamma(G)$, is…

We discuss whether finiteness properties of a profinite group $G$ can be deduced from the probabilistic zeta function $P_G(s)$. In particular we prove that if $P_G(s)$ is rational and all but finitely many nonabelian composition factors of…

Let $X$ be a set and let $S$ be an inverse semigroup of partial bijections of $X$. Thus, an element of $S$ is a bijection between two subsets of $X$, and the set $S$ is required to be closed under the operations of taking inverses and…

This $2^{nd}$-edition article is intended to be an up-to-date archive of the current state of the questions: Which finitely generated groups $G$: have semistable fundamental group at infinity; are simply connected at infinity; are such that…

We prove that a countable semigroup $S$ is locally finite if and only if the Arens-Michael envelope of its semigroup algebra is a $(DF)$-space. This is a counterpart to a recent result of the author, which asserts that $S$ is finitely…

We consider the problem of deciding the satisfiability of quantifier-free formulas in the theory of finite sets with cardinality constraints. Sets are a common high-level data structure used in programming; thus, such a theory is useful for…

William W. Boone and Graham Higman proved that a finitely generated group has soluble word problem if and only if it can be embedded in a simple group that can be embedded in a finitely presented group. We prove the exact analogue for…