Related papers: Graphs and complexes of lattices
If G is a group acting properly by semisimple isometries on a proper CAT(0) space X, then we build models for the classifying spaces E_{vc} and E_{fbc} under the additional assumption that the action of G has a well-behaved collection of…
As an abstraction and generalization of the integral operator in analysis, integral operators (known as Rota-Baxter operators of weight zero) on associative algebras and Lie algebras have played an important role in mathematics and physics.…
We initiate in this article the study of weakly exact structures, a generalization of Quillen exact structures. We introduce weak counterparts of one-sided exact structures and show that a left and a right weakly exact structure generate a…
We initiate a systematic study of lattices of thick subcategories for arbitrary essentially small triangulated categories. To this end we give several examples illustrating the various properties these lattices may, or may not, have and…
We prove that Coxeter groups are biautomatic. From our construction of the biautomatic structure it follows that uniform lattices in isometry groups of buildings are biautomatic.
This article studies automorphism groups of graph products of arbitrary groups. We completely characterise automorphisms that preserve the set of conjugacy classes of vertex groups as those automorphisms that can be decomposed as a product…
We study deterministic constructions of graphs for which the unique completion of low rank matrices is generically possible regardless of the values of the entries. We relate the completability to the presence of some patterns (particular…
We consider finite 2-dimensional polyhedral complexes, equipped with piecewise non-positively curved, locally CAT(0) metrics. We give conditions on the complex X that ensure that its fundamental group contains a surface subgroup. Concrete…
A periodic lattice in Euclidean space is the infinite set of all integer linear combinations of basis vectors. Any lattice can be generated by infinitely many different bases. This ambiguity was only partially resolved, but standard…
Lattice-based Cryptography is considered to have the characteristics of classical computers and quantum attack resistance. We will design various graphic lattices and matrix lattices based on knowledge of graph theory and topological…
Let $\Sigma$ be the Davis complex for a Coxeter system (W,S). The automorphism group G of $\Sigma$ is naturally a locally compact group, and a simple combinatorial condition due to Haglund--Paulin determines when G is nondiscrete. The…
From any directed graph $E$ one can construct the graph inverse semigroup $G(E)$, whose elements, roughly speaking, correspond to paths in $E$. Wang and Luo showed that the congruence lattice $L(G(E))$ of $G(E)$ is upper-semimodular for…
We study uniform exponential growth of groups acting on CAT(0) cube complexes. We show that groups acting without global fixed points on CAT(0) square complexes either have uniform exponential growth or stabilize a Euclidean subcomplex.…
Starting with a lattice with an action of $\mathbb{Z}$ or $\mathbb{R}$, we build a Helly graph or an injective metric space. We deduce that the $\ell^\infty$ orthoscheme complex of any bounded graded lattice is injective. We also prove a…
In this paper we study Zimmer's conjecture for $C^1$ actions of lattice subgroup of a higher-rank simple Lie group with finite center on compact manifolds. We show that when the rank of an uniform lattice is larger than the dimension of the…
The main aim of this paper is the description of a large class of lattices in some nilpotent Lie groups, sometimes filiformes, carrying a flat left invariant linear connection anf often a left invariant symplectic form. As a consequence we…
We introduce graphical complexes of groups, which can be thought of as a generalisation of Coxeter systems with 1-dimensional nerves. We show that these complexes are strictly developable, and we equip the resulting Basic Construction with…
This paper studies the differential lattice, defined to be a lattice $L$ equipped with a map $d:L\to L$ that satisfies a lattice analog of the Leibniz rule for a derivation. Isomorphic differential lattices are studied and classifications…
We prove that cocompact arithmetic lattices in a simple Lie group are uniformly discrete if and only if the Salem numbers are uniformly bounded away from $1$. We also prove an analogous result for semisimple Lie groups. Finally, we shed…
We construct a nonuniform lattice and an infinite family of uniform lattices in the automorphism group of a hyperbolic building with all links a fixed finite building of rank 2 associated to a Chevalley group. We use complexes of groups and…