SearcharxivSearch

arXiv · 1304.5549

Simply transitive quaternionic lattices of rank 2 over F_q(t) and a non-classical fake quadric

Abstract

We construct an infinite series of simply transitive irreducible lattices in PGL_2(F_q((t))) \times PGL_2(F_q((t))) by means of a quaternion algebra over F_q(t). The lattices depend on an odd prime power q = p^r and a parameter τ in F_q^* different from 1, and are the fundamental group of a square complex with just one vertex and universal covering T_{q+1} \times T_{q+1}, a product of trees with constant valency q + 1. Our lattices give rise via non-archimedian uniformization to smooth projective surfaces of general type over F_q((t)) with ample canonical class, Chern ratio (c_1)^2/c_2 = 2, trivial Albanese variety and non-reduced Picard scheme. For q = 3, the Zariski-Euler characteristic attains its minimal value χ= 1: the surface is a non-classical fake quadric.

Explore related subjects

Keep this discovery

BibTeXRIS

Jakob Stix, Alina Vdovina. 2013-04-19. Simply transitive quaternionic lattices of rank 2 over F_q(t) and a non-classical fake quadric. https://arxiv.org/abs/1304.5549

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Reversibility and its asymptotic counting in Picard group

We investigate reversible elements in the Picard modular group $\mathrm{PSL}(2,\mathbb{Z}[i])$. We show that reversibility coincides with strong reversibility for Kleinian groups, in particular for the Picard group. We classify reversible elements in the Picard group and characterize loxodromic reversible elements up to conjugacy. We prove that each such conjugacy class contains exactly eight special representatives. We also obtain asymptotic estimates for the number of reversible conjugacy classes with bounded trace.

math.GR

Conjugator length in finitely generated groups

We describe all functions $\mathbb{N}\rightarrow \mathbb{N}$ that can be realized, up to the standard equivalence, as conjugator length functions of finitely generated groups. Furthermore, we show that any two increasing functions $f,g\colon \mathbb N\to \mathbb N$ can be simultaneously realized as conjugator length functions of finitely generated, commensurable (in particular, quasi-isometric) groups.

math.GR

The spectrum of conjugator length functions

A recent program tries to find which functions appear as conjugator length functions. In this note, we show that any (computable) increasing function larger than $n$ appears as $\mathrm{Cl}_G$ for some finitely generated (recursively presented) group. On the other hand, we demonstrate that either $\mathrm{Cl}_G$ must be constant or $\mathrm{Cl}_G(n)\succ n$. Combining these, we obtain a complete description of which functions appear as conjugator length functions of finitely generated groups.

math.GR