Linear representations and arithmeticity of lattices in products of trees
نویسندگان
چکیده
In this paper we continue our study of lattices in the automorphisms groups of products of trees initiated in [BM97], [BM00a], [BM00b], [Moz98] (see also [Gla03], [BG02], [Rat04]). We concentrate here on the interplay between the linear representation theory and the structure of these lattices. Before turning to the main results of this paper it may be worthwhile to put certain concepts and results from [BM00a], [BM00b] in perspective, and explain the motivations for our approach. A lattice Γ in a locally compact group G is a discrete subgroup such that the quotient space G/Γ carries a finite G-invariant measure. If in addition G/Γ is compact the lattice is called cocompact or uniform. Consider the following special setting: let Qp be the field of p-adic numbers and let
منابع مشابه
Arithmeticity vs. Non-linearity for Irreducible Lattices
We establish an arithmeticity vs. non-linearity alternative for irreducible lattices in suitable product groups, for instance products of topologically simple groups. This applies notably to a (large class of) Kac-Moody groups. The alternative relies heavily on the superrigidity theorem we propose in [Md], since we follow Margulis’ reduction of arithmeticity to superrigidity.
متن کاملIrreducibility of the tensor product of Albeverio's representations of the Braid groups $B_3$ and $B_4$
We consider Albeverio's linear representations of the braid groups $B_3$ and $B_4$. We specialize the indeterminates used in defining these representations to non zero complex numbers. We then consider the tensor products of the representations of $B_3$ and the tensor products of those of $B_4$. We then determine necessary and sufficient conditions that guarantee the irreducibility of th...
متن کاملEEH: AGGH-like public key cryptosystem over the eisenstein integers using polynomial representations
GGH class of public-key cryptosystems relies on computational problems based on the closest vector problem (CVP) in lattices for their security. The subject of lattice based cryptography is very active and there have recently been new ideas that revolutionized the field. We present EEH, a GGH-Like public key cryptosystem based on the Eisenstein integers Z [ζ3] where ζ3 is a primitive...
متن کاملThe effect of material nonlinearity on the band gap for TE and TM modes in square and triangular lattices
In this article, by using the method of finite difference time domain (FDTD) and PML boundary conditions, we have studied the photonic band gaps for TE and TM modes in square and triangular lattices consisting of air holes in dielectric medium and compared the results. In addition, the effect of nonlinearity of the photonic crystal background on the photonic band gaps and comparison with the re...
متن کاملIdeal of Lattice homomorphisms corresponding to the products of two arbitrary lattices and the lattice [2]
Abstract. Let L and M be two finite lattices. The ideal J(L,M) is a monomial ideal in a specific polynomial ring and whose minimal monomial generators correspond to lattice homomorphisms ϕ: L→M. This ideal is called the ideal of lattice homomorphism. In this paper, we study J(L,M) in the case that L is the product of two lattices L_1 and L_2 and M is the chain [2]. We first characterize the set...
متن کامل