Related papers: Bounding the maximal size of independent generatin…

We show that a topologically generating set $S$ of a connected compact Lie group $G$ of size larger than a fixed polynomial in the rank of $G$ must be redundant (i.e., some proper subset of $S$ still topologically generates $G$). Similar…

For a given m>=1, we consider the finite non-abelian groups G for which |C_G(g):<g>|<=m for every g in G\Z(G). We show that the order of G can be bounded in terms of m and the largest prime divisor of the order of G. Our approach relies on…

Let $G$ be a group and $H \le K \le G$. We say that $H$ is $c$-embedded in $G$ with respect to $K$ if there is a subgroup $B$ of $G$ such that $G = HB$ and $H \cap B \le Z(K)$. Given a finite group $G$, a prime number $p$ and a Sylow…

We consider the group isomorphism problem: given two finite groups G and H specified by their multiplication tables, decide if G cong H. For several decades, the n^(log_p n + O(1)) generator-enumeration bound (where p is the smallest prime…

We study finite groups $G$ with the property that for any subgroup $M$ maximal in $G$ whose order is divisible by all the prime divisors of $|G|$, $M$ is supersolvable. We show that any nonabelian simple group can occur as a composition…

We provide algorithms for performing computations in generalized numerical semigroups, that is, submonoids of $\mathbb{N}^{d}$ with finite complement in $\mathbb{N}^{d}$. These semigroups are affine semigroups, which in particular implies…

We define $g(n)$ to be the maximal order of an element of the symmetric group on $n$ elements. Results about the prime factorization of $g(n)$ allow a reduction of the upper bound on the largest prime divisor of $g(n)$ to $1.328\sqrt{n\log…

Let G be a finite p-solvable group and P a Sylow p-subgroup of G. Suppose that $\gamma_{l(p-1)}(P)\subseteq \gamma_r(P)^{p^s}$ for $l(p-1)<r+s(p-1)$, then the p-length is bounded by a function depending on l.

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…

Given a finite group $G$ of order $p^nm$, where $p$ is a prime and $p\nmid m$, we denote by $\psi_p(G)$ the sum of orders of $p$-parts of elements in $G$. In the current note, we prove that $\psi_p(G)\leq\psi_p(C_{p^nm})$, where $C_{p^nm}$…

Let $G$ be a finite group and $p$ a prime. We establish an upper bound for the derived length of a Sylow $p$-subgroup of $G$ in terms of the number of irreducible characters of $G$ whose degrees are divisible by $p$. We also prove that if…

Let $G$ be a finite 2-generated soluble group and suppose that $\langle a_1,b_1\rangle=\langle a_2,b_2\rangle=G$. If either $G^\prime$ is of odd order or $G^\prime$ is nilpotent, then there exists $b \in G$ with $\langle…

Let $ H $ be a subgroup of a finite group $ G $. We say that $ H $ satisfies the partial $ \Pi $-property in $ G $ if if there exists a chief series $ \varGamma_{G}: 1 =G_{0} < G_{1} < \cdot\cdot\cdot < G_{n}= G $ of $ G $ such that for…

Let G be a finite group with Sylow p-subgroup P. We show that the character table of G determines whether P has maximal nilpotency class and whether P is a minimal non-abelian group. The latter result is obtained from a precise…

Let $G$ be a finite almost simple group. It is well known that $G$ can be generated by 3 elements, and in previous work we showed that 6 generators suffice for all maximal subgroups of $G$. In this paper we consider subgroups at the next…

Let $G$ be a finite $p$-group of order $p^n$ and $M(G)$ be its Schur multiplier. It is well known result by Green that $|M(G)|= p^{\frac{1}{2}n(n-1)-t(G)}$ for some $t(G) \geq 0$. In this article we classify non-abelian $p$-groups $G$ of…

In this note we study sets of normal generators of finitely presented residually $p$-finite groups. We show that if an infinite, finitely presented, residually $p$-finite group $G$ is normally generated by $g_1,\dots,g_k$ with order…

Let $G =<S>$ be a solvable permutation group of the symmetric group $S_n$ given as input by the generating set $S$. We give a deterministic polynomial-time algorithm that computes an \emph{expanding generating set} of size $\tilde{O}(n^2)$…

We fix a field $\kk$ of characteristic $p$. For a finite group $G$ denote by $\delta(G)$ and $\sigma(G)$ respectively the minimal number $d$, such that for any finite dimensional representation $V$ of $G$ over $\kk$ and any $v\in…

Let $k$ be a number field, suppose that $B$ is a central simple division algebra over $k$, and choose any maximal order $\mathcal{D}$ of $B$. The object of this paper is to show that the group $\mathcal{D}_S^*$ of $S$-units of $B$ is…