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

This paper is devoted to the study of lattices generated by finite Abelian groups. Special species of such lattices arise in the exploration of elliptic curves over finite fields. In case the generating group is cyclic, they are also known as the Barnes lattices. It is shown that for every finite Abelian group with the exception of the cyclic group of order four these lattices have a basis of minimal vectors. Another result provides an improvement of a recent upper bound by M...

We announce results about the structure and arithmeticity of all possible lattice embeddings of a class of countable groups which encompasses all linear groups with simple Zariski closure, all groups with non-vanishing first l2-Betti number, word hyperbolic groups, and, more general, convergence groups.

While lattices in semi-simple Lie groups are studied very well, only little is known about discrete subgroups of infinite covolume. The main class of examples are Schottky groups. Here we investigate some new examples. We consider subgroups $\Gamma$ of arithmetic groups in $PSL(2,C)^q \times PSL(2,R)^r$ with $q+r>1$ and their limit set. We prove that the projective limit set of a nonelementary finitely generated $\Gamma$ consists of exactly one point if and only if one and ...

We determine when an arithmetic subgroup of a reductive group defined over a global function field is of type FP_\infty by comparing its large-scale geometry to the large-scale geometry of lattices in real semisimple Lie groups.

The aim of this short lecture series is to expose the students to the beautiful theory of lattices by, on one hand, demonstrating various basic ideas that appear in this theory and, on the other hand, formulating some of the celebrated results which, in particular, shows some connections to other fields of mathematics. The time restriction forces us to avoid many important parts of the theory, and the route we have chosen is naturally biased by the individual taste of the spe...

We give an interpretation of the cohomology of an arithmetically defined group as a set of equivalence classes of lattices. We use this interpretation to give a simpler proof of the connection established by J. Rohlfs between genus and cohomology.

We present a method to compute finite index subgroups of $PSL_2(\mathbb{Z})$. Our strategy follows Kulkarni's ideas, the main contribution being a recursive method to compute bivalent trees and their automorphism group. As a concrete application, we compute all subgroups of index up to 20. We then use this database to produce tables with several arithmetical properties.

In this paper we give a survey of what is currently known about Diophantine exponents of lattices and propose several problems.

By a twenty year old result of Ralph Freese, an $n$-element lattice $L$ has at most $2^{n-1}$ congruences. We prove that if $L$ has less than $2^{n-1}$ congruences, then it has at most $2^{n-2}$ congruences. Also, we describe the $n$-element lattices with exactly $2^{n-2}$ congruences.

This paper deals with the number of subgroups of a given exponent in a finite abelian group. Explicit formulas are obtained in the case of rank two and rank three abelian groups. An asymptotic formula is also presented.