Related papers: C-Groups

A primary covering of a finite group $G$ is a family of proper subgroups of $G$ whose union contains the set of elements of $G$ having order a prime power. We denote with $\sigma_0(G)$ the smallest size of a primary covering of $G$, and…

We introduce the notion of weakly (strongly) infinite real rank for unital $C^{\ast}$-algebras. It is shown that a compact space $X$ is weakly (strongly) infine-dimensional if and only if $C(X)$ has weakly (strongly) infinite real rank.…

The question on connection between the structure of a finite group $G$ and the properties of the indices of elements of $G$ has been a popular research topic for many years. The $p$-index $|x^G|_p$ of an element $x$ of a group $G$ is the…

A \emph{finite cover} of a group $G$ is a finite collection $\mathcal{C}$ of proper subgroups of $G$ with the property that $\bigcup \mathcal{C} = G$. A finite group admits a finite cover if and only if it is noncyclic. More generally, it…

For a finite group $G$ denote by $\gamma(L(G))$ the genus of the subgroup graph of $G.$ We prove that $\gamma(L(G))$ tends to infinity as either the rank of $G$ or the number of prime divisors of $|G|$ tends to infinity.

For a finite group $G$, let $d(G)$ denote the minimal number of elements required to generate $G$. In this paper, given a finite almost simple group $G$ and any maximal subgroup $H$ of $G$, we determine a precise upper bound for $d(H)$. In…

Fix $\varepsilon > 0$. We say that a finite group $G$ is $\varepsilon$-quasirandom if every nontrivial irreducible complex representation of $G$ has degree at least $|G|^\varepsilon$. In this paper, we give a structure theorem for large…

Let $\mathcal{C}:=\mathcal{C}(G,\omega,H,\psi)$ be a finite group scheme-theoretical category over an algebraically closed field of characteristic $p\ge 0$ as defined by the first author. For any indecomposable exact module category over…

We study finite groups $G$ with elements $g$ such that $\lvert \mathbf{C}_G(g)\rvert = \lvert G:G' \rvert$. (Such elements generalize fixed-point-free automorphisms of finite groups.) We show that these groups have a unique conjugacy class…

In this paper we survey a new criteria for solvability of finite groups in terms of number of supersolvable (also known as polycyclic) and non-supersolvable subgroups. In particular, we present original examples of supersolvable groups such…

The classification of the finite subgroups of $\mathrm{GL}_n(\mathbb{C})$ and $\mathrm{PGL}_n(\mathbb{C})$ is a classical problem in the field of finite group theory, dating back to the late 19th century with authors like Klein, Jordan,…

A $P_4$-free graph is called a cograph. In this paper we partially characterize finite groups whose power graph is a cograph. As we will see, this problem is a generalization of the determination of groups in which every element has prime…

We introduce a new framework linking group theory and formal language theory which generalizes a number of ways these topics have been linked in the past. For a language class C in the Chomsky hierarchy, we say a group is epiC if it admits…

We obtain a classification of the finite two-generated cyclic-by-abelian groups of prime-power order. For that we associate to each such group $G$ a list $\inv(G)$ of numerical group invariants which determines the isomorphism type of $G$.…

There are a variety of ways to associate directed or undirected graphs to a group. It may be interesting to investigate the relations between the structure of these graphs and characterizing certain properties of the group in terms of some…

We study topological groups having all closed subgroups (totally) minimal and we call such groups c-(totally) minimal. We show that a locally compact c-minimal connected group is compact. Using a well-known theorem of Hall and Kulatilaka…

This is a major update of the previous version. The methods of the paper are now fully constructive and the style is "formalization ready" with the emphasis on the possibility of formalization both in type theory and in constructive set…

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…

We define the notion of a semicharacter of a group G : A function from the group to C*, whose restriction to any abelian subgroup is a homomorphism. We conjecture that for any finite group, the order of the group of semicharacters is…

We prove that there exists a constant $k$ with the property: if $\calC$ is a conjugacy class of a finite group $G$ such that every $k$ elements of $\calC$\ generate a solvable subgroup then $\calC$ generates a solvable subgroup. In…