Related papers: The probability of generating a uniserial group

We prove the following extension of Tits' simplicity theorem. Let $k$ be an infinite field, $G$ an algebraic group defined and quasi-simple over $k,$ and $G(k)$ the group of $k$-rational points of $G.$ Let $G(k)^+$ be the subgroup of $G(k)$…

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…

A brick is a $3$-connected graph such that the graph obtained from it by deleting any two distinct vertices has a perfect matching. A brick $G$ is near-bipartite if it has a pair of edges $\alpha$ and $\beta$ such that $G-\{\alpha,\beta\}$…

Let $\mathfrak C$ be a class of finite groups which is closed for subgroups, quotients and direct products. Given a profinite group $G$ and an element $x\in G$, we denote by $P_{\mathfrak{C}}(x,G)$ the probability that $x$ and a randomly…

Consider a compact connected Lie group $G$ and the corresponding Lie algebra $\cal L$. Let $\{X_1,...,X_m\}$ be a set of generators for the Lie algebra $\cal L$. We prove that $G$ is uniformly finitely generated by $\{X_1,...,X_m\}$. This…

Let G be a locally compact Hausdorff group in which every element is of finite order, and let P(G) denote the class of all regular probability measures on G. In this note, it is observed that a characterization of algebraically regular…

A $k$-free like group is a $k$-generated group $G$ with a sequence of $k$-element generating sets $Z_n$ such that the girth of $G$ relative to $Z_n$ is unbounded and the Cheeger constant of $G$ relative to $Z_n$ is bounded away from 0. By a…

A 2-covering for a finite group $G$ is a set of proper subgroups of $G$ such that every pair of elements of $G$ is contained in at least one subgroup in the set. The minimal number of subgroups needed to 2-cover a group $G$ is called the…

Let $G$ be a transitive permutation group on $\Omega$ containing two points $\alpha, \beta$ such that $G_{\alpha}\cap G_{\beta}=1$. The Saxl graph $\Sigma(G)$ of $(G, \Omega)$ is defined as the graph with vertex set $\Omega$, where two…

The following problem was originally posed by B.H. Neumann and H. Neumann. Suppose that a group $G$ can be generated by $n$ elements and that $H$ is a homomorphic image of $G$. Does there exist, for every generating $n$-tuple $(h_1,\ldots,…

If $G$ is a finite group, then the spectrum $\omega(G)$ is the set of all element orders of $G$. The prime spectrum $\pi(G)$ is the set of all primes belonging to $\omega(G)$. A simple graph $\Gamma(G)$ whose vertex set is $\pi(G)$ and in…

Let $G$ be a group. Then $S\subseteq G$ is an invariable generating set of $G$ if every subset $S'$ obtained from $S$ by replacing each element with a conjugate is also a generating set of $G$. We investigate invariable generation among key…

L\'evai and Pyber proposed the following as a conjecture: Let $G$ be a profinite group such that the set of solutions of the equation $x^n=1$ has positive Haar measure. Then $G$ has an open subgroup $H$ and an element $t$ such that all…

In 1968, John Thompson proved that a finite group $G$ is solvable if and only if every $2$-generator subgroup of $G$ is solvable. In this paper, we prove that solvability of a finite group $G$ is guaranteed by a seemingly weaker condition:…

Let G be a finitely generated group and M_n(G) the number of its normal subgroup subgroups of index at most n. For linear groups G we show that M_n(G) can grow polynomially in n only if the semisimple part of the Zariski closure of G has…

The minimal base size $b(G)$ for a permutation group $G$, is a widely studied topic in the permutation group theory. Z. Halasi and K. Podoski proved that $b(G)\leq 2$ for coprime linear groups. Motivated by this result and the probabilistic…

Limiting distributions are derived for the sparse connected components that are present when a random graph on $n$ vertices has approximately $\half n$ edges. In particular, we show that such a graph consists entirely of trees, unicyclic…

A simple graph more often than not contains adjacent vertices with equal degrees. This in particular holds for all pairs of neighbours in regular graphs, while a lot such pairs can be expected e.g. in many random models. Is there a…

For a graph $G=(V,E)$, let $bc(G)$ denote the minimum number of pairwise edge disjoint complete bipartite subgraphs of $G$ so that each edge of $G$ belongs to exactly one of them. It is easy to see that for every graph $G$, $bc(G) \leq n…

In 2000, L. H\'{e}thelyi and B. K\"{u}lshammer proved that if $p$ is a prime number dividing the order of a finite solvable group $G$, then $G$ has at least $2\sqrt{p-1}$ conjugacy classes. In this paper we show that if $p$ is large, the…