Related papers: Normal coverings of linear groups

Let G be any locally compact, unimodular, metrizable group. The main result of this paper, roughly stated, is that if F<G is any finitely generated free group and \Gamma < G any lattice, then up to a small perturbation and passing to a…

Given a finite group $G$ and a set $A$ of generators, the diameter diam$(\Gamma(G,A))$ of the Cayley graph $\Gamma(G,A)$ is the smallest $\ell$ such that every element of $G$ can be expressed as a word of length at most $\ell$ in $A \cup…

We begin the investigation of Gamma-limit groups, where Gamma is a torsion-free group which is hyperbolic relative to a collection of free abelian subgroups. Using the results of Drutu and Sapir, we adapt the results from math.GR/0404440 to…

We consider sequences of finitely generated discrete subgroups Gamma_i=rho_i(Gamma) of a rank 1 Lie group G, where the representations rho_i are not necessarily faithful. We show that, for algebraically convergent sequences (Gamma_i),…

Given a group G and positive integers k,n, we let B_n=B_n(G) denote the set of all elements x in G such that |x^G|\leq n, and we say that G satisfies the (k,n)-covering condition for commutators if there is a subset S in G such that |S|\leq…

Let $G$ be a finite group and $\alpha(G)=\frac{|C(G)|}{|G|}$\,, where $C(G)$ denotes the set of cyclic subgroups of $G$. In this short note, we prove that $\alpha(G)\leq\alpha(Z(G))$ and we describe the groups $G$ for which the equality…

Let $G$ be a finite group and $N$ a normal subgroup of $G$. We determine the structure of $N$ when the diameter of the graph associated to the $G$-conjugacy classes contained in $N$ is as large as possible, that is, is equal to three.

Let $G$ be a group, $m\geq2$ and $n\geq1$. We say that $G$ is an $\mathcal{T}(m,n)$-group if for every $m$ subsets $X_1, X_2, \dots, X_m$ of $G$ of cardinality $n$, there exists $i\neq j$ and $x_i \in X_i, x_j \in X_j$ such that…

For a group $G$, a {\it normalizer covering} of $G$ is a finite set of proper normalizers of some subgroups of $G$ whose union is $G$. We study $p$-groups ($p$ a prime) without a normalizer covering. As an application, we determine some…

For a group $G,$ let $\Gamma(G)$ denote the graph defined on the elements of $G$ in such a way that two distinct vertices are connected by an edge if and only if they generate $G$. Moreover let $\Gamma^*(G)$ be the subgraph of $\Gamma(G)$…

For a finite group $G$, we study the probability $sp(G)$ that, given two elements $x,y \in G$, the cyclic subgroup $\langle x \rangle$ is subnormal in the subgroup $\langle x, y \rangle$. This can be seen as an intermediate invariant…

The power graph $\mathcal{P}(G)$ of a finite group $G$ is the simple undirected graph whose vertex set is $G$, in which two distinct vertices are adjacent if one of them is an integral power of the other. For an integer $n\geq 2$, let $C_n$…

The spectrum $\omega(G)$ of a finite group $G$ is the set of element orders of $G$. Finite groups $G$ and $H$ are isospectral if their spectra coincide. Suppose that $L$ is a simple classical group of sufficiently large dimension (the lower…

Let $\gamma$ be a Riemannian metric on $\Sigma = S^1 \times T^{n-2}$, where $3 \leq n \leq 7$. Consider $\Omega = B^2 \times T^{n-2}$ with boundary $\partial \Omega = \Sigma$, and let $g$ be a Riemannian metric on $\Omega$ such that the…

A graph $G$ of order $n$ is called edge-pancyclic if, for every integer $k$ with $3 \leq k \leq n$, every edge of $G$ lies in a cycle of length $k$. Determining the minimum size $f(n)$ of a simple edge-pancyclic graph with $n$ vertices…

We study conjugacy limits of certain of subgroups inside $\SL(2,\R)\ltimes\R^2$. These subgroups have a common feature that any two in the same category are conjugates of each other.

Let $G$ be a finite group and $\pi$ be a set of primes. We show that if the number of conjugacy classes of $\pi$-elements in $G$ is larger than $5/8$ times the $\pi$-part of $|G|$ then $G$ possesses an abelian Hall $\pi$-subgroup which…

Let G be a finite group acting orthogonally on a pair (S^d,\Gamma) where \Gamma is a finite, connected graph of genus g>1 embedded in the sphere S^d. The 3-dimensional case d=3 has recently been considered in a paper by C. Wang, S. Wang, Y.…

We study the complexity of multiplication in noncommutative group algebras which is closely related to the complexity of matrix multiplication. We characterize such semisimple group algebras of the minimal bilinear complexity and show…

Let $G$ be a finite group, and let $\kappa(G)$ be the probability that elements $g$, $h\in G$ are conjugate, when $g$ and $h$ are chosen independently and uniformly at random. The paper classifies those groups $G$ such that $\kappa(G) \geq…