Related papers: A practical guide to well roundedness
Let $H < G$ both be noncompact connected semisimple real algebraic groups where the former is maximal proper and $\Gamma < G$ be a lattice. Building on the work of Gorodnik-Weiss, we refine their techniques and obtain effective results.…
In this paper we continue to develop the topological method started in Santos-San Martin \cite{ariasm} to get semigroup generators of semi-simple Lie groups. Consider a subset $\Gamma \subset G$ that contains a semi-simple subgroup $G_{1}$…
This paper deals with lattice congruences of the weak order on the symmetric group, and initiates the investigation of the cover graphs of the corresponding lattice quotients. These graphs also arise as the skeleta of the so-called…
Let $\Gamma$ be an irreducible lattice in a product of n infinite irreducible complete Kac-Moody groups of simply laced type over finite fields. We show that if n is at least 3, then each Kac-Moody groups is in fact a simple algebraic group…
This book deals with the theory of generalized algebraic transformations, which is elaborated with the aim to provide a relatively simple theoretical tool that enables an exact treatment of diverse more complex lattice-statistical models.…
Much study has been done on semigroups which are unions of groups. There are several ways in which a union of groups can be made into a semigroup in which each of the component groups arises as subgroups of the constructed semigroup. An…
The aim of this note is to give a geometric proof for classical local rigidity of lattices in semisimple Lie groups. We are reproving well known results in a more geometric (and hopefully clearer) way.
A numbering of a countable family $S$ is a surjective map from the set of natural numbers $\omega$ onto $S$. The paper studies Rogers semilattices, i.e. upper semilattices induced by the reducibility between numberings, for families…
Let E be a number field and G be a finite group. Let A be any O_E-order of full rank in the group algebra E[G] and X be a (left) A-lattice. We give a necessary and sufficient condition for X to be free of given rank d over A. In the case…
Let G be a locally compact Hausdorff group in which every element is of finite order, and let P(G) denote the class of all regular probability measures on G. In this note, it is observed that a characterization of algebraically regular…
In this work we employ machine learning to understand structured mathematical data involving finite groups and derive a theorem about necessary properties of generators of finite simple groups. We create a database of all 2-generated…
Recent algorithmic advances in algebraic automata theory drew attention to semigroupoids (semicategories). These are mathematical descriptions of typed computational processes, but they have not been studied systematically in the context of…
Random walk on the chambers of hyperplanes arrangements is used to define a family of card shuffling measures $H_{W,x}$ for a finite Coxeter group W and real $x \neq 0$. By algebraic group theory, there is a map from the semisimple orbits…
A powerful way to study groups is via their actions on suitable spaces. Classifying spaces for families of subgroups are a type of these spaces, obtained by imposing some strict conditions on the fixed-point sets. We show how in the…
A notion of {\em normal submonoid} of a monoid $M$ is introduced that generalizes the normal subgroups of a group. When ordered by inclusion, the set $\mathsf{NorSub}(M)$ of normal submonoids of $M$ is a complete lattice. Joins are…
Solomon's descent algebra is used to define a family of signed measures M(W,x) for a finite Coxeter group W and non-zero x. The measures corresponding to W of types A and B are known to arise from the theory of card shuffling and to be…
This paper proves strong lower bounds for distributed computing in the CONGEST model, by presenting the bit-gadget: a new technique for constructing graphs with small cuts. The contribution of bit-gadgets is twofold. First, developing…
Two groups are virtually isomorphic if they can be obtained one from the other via a finite number of steps, where each step consists in taking a finite extension or a finite index subgroup (or viceversa). Virtually isomorphic groups are…
The main objective of this thesis is a classification project for integral lattices. Using Kneser's neighbour method we have developed the computer program tn to classify complete genera of integral lattices. Main results are detailed…
A geometric grid class consists of those permutations that can be drawn on a specified set of line segments of slope \pm1 arranged in a rectangular pattern governed by a matrix. Using a mixture of geometric and language theoretic methods,…