Related papers: Finite subgroups of arithmetic lattices in U(2,1)

We give a description of a finite group whose maximal subgroups possess only soluble proper subgroups, which implies the answer to the well-known question on composition factors of finite groups, whose second maximal subgroups are soluble.

Finite (upper) nearlattices are essentially the same mathematical entities as finite semilattices, finite commutative idempotent semigroups, finite join-enriched meet semilattices, and chopped lattices. We prove that if an $n$-element…

We show the boundedness of finite subgroups in any anisotropic reductive algebraic group over a perfect field that contains all roots of 1. Also, we provide explicit bounds for orders of finite subgroups of automorphism groups of…

We give a Super-Rigidity theorem a la Margulis which applies for a wider class of groups. In particular it applies to subgroups which are not assumed to be lattices in the ambient group. Our proof is based on the notion of Algebraic…

Computations in the cohomology of finite groups.

We study maximal sublattices of finite semidistributive lattices via their complements. We focus on the conjecture that such complements are always intervals, which is known to be true for bounded lattices. Since the class of…

In this paper, we classify all finite groups $G$ which have the following property: for all subsets $A \subseteq G$, we have $|AA^{-1}| = |A^{-1}A|$. This question is motivated by the problem in additive combinatorics of More Sums Than…

The structure of groups for which certain sets of commutator subgroups are finite is investigated, with a particular focus on the relationship between these groups and those with finite derived subgroup.

For a class C of finite lattices, the question arises whether any lattice in C can be embedded into some atomistic, biatomic lattice in C. We provide answers to the question above for C being, respectively, --The class of all finite…

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…

We suggest a few projects for studying vertex algebras with emphasis on finite group viewpoints.

We propose an algebraic and a geometric classification of euclidean isodual lattices of fixed rank. First, we prove that these lattices are distribued according to a finite number of algebraic types. Second, we show that they are…

We give a general procedure to analyze the structure for certain $\mathbb{C}$-Fuchsian subgroups of some non-arithmetic lattices. We will also show that their fundamental domains lie in a complex geodesic, a set homeomorphic to the unit…

We study infinite approximate subgroups of soluble Lie groups. Generalising a theorem of Fried and Goldman we show that approximate subgroups are close, in a sense to be defined, to genuine connected subgroups. Building up on this result we…

In this paper, we associate a family of infinite-rank pro-Euclidean lattices to elements of a formal loop group and a highest weight representation of the underlying affine Kac--Moody algebra. In the case that the element has a polynomial…

For a positive integer n, we denote by SUB (resp., SUBn) the class of all lattices that can be embedded into the lattice Co(P) of all order-convex subsets of a partially ordered set P (resp., P of length at most n). We prove the following…

We characterize the fundamental group of a locally finite graph G with ends combinatorially, as a group of infinite words. Our characterization gives rise to a canonical embedding of this group in the inverse limit of the (free) fundamental…

We determine all the ways in which a direct product of two finite groups can be expressed as the set-theoretical union of proper subgroups in a family of minimal cardinality.

We provide a new upper bound on the number of conjugacy classes in the group $U_n(q)$ of unitriangular matrices over a finite field. We also compute a similar upper bound for every group in the lower central series of $U_n(q)$.

We consider the computational problem of determining the unit group of a finite ring, by which we mean the computation of a finite presentation together with an algorithm to express units as words in the generators. We show that the problem…