Related papers: Groups with flat-rank greater than 1

Hidden community is a useful concept proposed recently for social network analysis. To handle the rapid growth of network scale, in this work, we explore the detection of hidden communities from the local perspective, and propose a new…

Let G be a connected real Lie group of dimension n. Then there exists a relatively compact open neighbourhood W of e in G such that for n+1 randomly chosen elements g_0,..,g_n the generated subgroup will be dense in G with probability one.

A scale-multiplicative semigroup in a totally disconnected, locally compact group $G$ is one for which the restriction of the scale function on $G$ is multiplicative. The maximal scale-multiplicative semigroups in groups acting…

Polynomial-time algorithms are given to find a central decomposition of maximum size for a finite p-group of class 2 and for a nilpotent Lie ring of class 2. The algorithms use Las Vegas probabilistic routines to compute the structure of…

We obtain a characterization of totally disconnected, locally compact groups $G$ with the following property: given a locally normal subgroup $K$ of $G$, then there is an open subgroup of $K$ that is a direct factor of an open subgroup of…

The main result of this paper states that for any group $G$ with an automatic structure $L$ with unique representatives one can construct a uniform partial algorithm which detects $L$-rational subgroups and gives their preimages in $L$.…

This paper develops a basic theory of H-groups. We introduce a special quotient of H-groups and extend some algebraic constructions of topological groups to the category of H-groups and H-maps. We use these constructions to prove some…

We study ergodic invariant random subgroups that give full measure to the subset of compact subgroups. We show that in real Lie groups, compactly generated $p$-adic Lie groups, locally compact hyperbolic groups and infinitely ended groups…

We give an efficient algorithm to randomly generate finitely generated subgroups of a given size, in a finite rank free group. Here, the size of a subgroup is the number of vertices of its representation by a reduced graph such as can be…

A discrete subgroup $\Gamma$ of a locally compact group $H$ is called a uniform lattice if the quotient $H/\Gamma$ is compact. Such an $H$ is called an envelope of $\Gamma$. In this paper we study the problem of classifying envelopes of…

We give an introduction to the Cayley-Abels graph for a totally disconnected, locally compact (tdlc) group. It is a generalization of the Cayley graph. We illustrate that on the one hand, Cayley-Abels graphs are useful tools to extend…

A group $G$ with conjugation operation is a rack. We call such racks \emph{group racks}. In this paper we study finite group racks via their subrack lattices. Heckenberger, Shareshian, and Welker proved that the isomorphism type of the…

In this note we study the finite groups whose subgroup lattices are dismantlable.

Polynomials in this paper are defined starting from a compact semisimple Lie group. A known classification of maximal, semisimple subgroups of simple Lie groups is used to select the cases to be considered here. A general method is…

We study contraction groups for automorphisms of totally disconnected locally compcat groups using the scale of the automorphism as a tool. The contraction group is shown to be unbounded when the inverse automorphism has non-trivial scale…

We give a topological framework for the study of Sela's limit groups: limit groups are limits of free groups in a compact space of marked groups. Many results get a natural interpretation in this setting. The class of limit groups is known…

We show that a rank reduction technique for string C-group representations first used for the symmetric groups generalizes to arbitrary settings. The technique permits us, among other things, to prove that orthogonal groups defined on…

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…

Local clustering aims to identify specific substructures within a large graph without any additional structural information of the graph. These substructures are typically small compared to the overall graph, enabling the problem to be…

In this paper, we establish a complete structural description of flat Lorentzian Lie groups, i.e., Lie groups endowed with a flat left invariant Lorentzian metric, thereby resolving a long-standing open problem in the theory of…