Related papers: Computing arithmetic Kleinian groups

In this paper, we obtain several results on the commensurability of two Kleinian groups and their limit sets. We prove that two finitely generated subgroups $G_1$ and $G_2$ of an infinite co-volume Kleinian group $G \subset…

We present an algorithm for the computation of logarithmic l-class groups of number fields. Our principal motivation is the effective determination of the l-rank of the wild kernel in the K-theory of number fields.

The Galois/monodromy group of a family of geometric problems or equations is a subtle invariant that encodes the structure of the solutions. Computing monodromy permutations using numerical algebraic geometry gives information about the…

This expository article explains how planar diagrammatics naturally arise in the study of categorified quantum groups with a focus on the categorification of quantum sl2. We derive the definition of categorified quantum sl2 and highlight…

We introduce self-dual codes over the Kleinian four group $K = \mathbb{Z}_2 \times \mathbb{Z}_2$ for a natural quadratic form on $K^n$ and develop the theory. Topics studied are: weight enumerators, mass formulas, classification up to…

We discuss a practical algorithm to compute parabolic Kazhdan-Lusztig polynomials. As an application we compute Kazhdan-Lusztig polynomials which are needed to evaluate a character formula for reductive groups due to Lusztig. Some…

In this thesis, we develop algorithms similar to the Gaussian elimination algorithm in symplectic and split orthogonal similitude groups. As an application to this algorithm, we compute the spinor norm for split orthogonal groups. Also, we…

A Mathematica based program has been elaborated in order to determine the symmetry group of a finite difference equation, by means of its differential representation. The package provides functions which enable us to solve the determining…

This is an overview of Erlangen Programme at Large. Study of objects and properties, which are invariant under a group action, is very fruitful far beyond the traditional geometry. In this paper we demonstrate this on the example of the…

We show that finite dimensional half-quantum groups at roots of unity corresponding to simple Lie algebras having symmetric Cartan matrix are of wild representation type, except for sl_2. Moreover, the underlying associative algebra is…

In this paper we describe all group gradings by a finite abelian group $\Gamma$ of a simple Lie algebra of type $G_2$ over an algebraically closed field $F$ of characteristic 0.

Let P be a locally finite circle packing in the plane invariant under a non-elementary Kleinian group Gamma and with finitely many Gamma-orbits. When Gamma is geometrically finite, we construct an explicit Borel measure on the plane which…

We compute the group homology, the algebraic $K$- and $L$-groups, and the topological $K$-groups of right-angled Artin groups, right-angled Coxeter groups, and more generally, graph products.

Let p be a fixed prime. An Abelian p-group is an Abelian group (not necessarily finitely generated) in which every element has for its order some power of p. The countable Abelian p-groups are classified by Ulm's theorem, and Khisamiev…

We show that strong approximate lattices in higher-rank semi-simple algebraic groups are arithmetic.

We calculate explicitly cohomologies of the lattices over the Kleinian 4-group belonging to the regular components of the Auslander-Reiten quiver as well as of their dual modules. The result is applied to the classification of some…

For cofinite Kleinian groups, with finite-dimensional unitary representations, we derive the Selberg trace formula. As an application we define the corresponding Selberg zeta-function and compute its divisor, thus generalizing results of…

We present here algorithms for efficient computation of linear algebra problems over finite fields.

An algorithm for the explicit computation of a complete set of primitive central idempotents, Wedderburn decomposition and the automorphism group of the semisimple group algebra of a finite metabelian group is developed. The algorithm is…

For $n > 2$, let $\Gamma$ denote either $SL(n, Z)$ or $Sp(n, Z)$. We give a practical algorithm to compute the level of the maximal principal congruence subgroup in an arithmetic group $H\leq \Gamma$. This forms the main component of our…