Related papers: Computing arithmetic Kleinian groups

For cofinite Kleinian groups (or equivalently, finite-volume three-dimensional hyperbolic orbifolds) with finite-dimensional unitary representations, we evaluate the regularized determinant of the Laplacian using W. Muller's regularization.…

Let $K$ be a number field, let $A$ be a finite-dimensional $K$-algebra, let $\mathrm{J}(A)$ denote the Jacobson radical of $A$, and let $\Lambda$ be an $\mathcal{O}_{K}$-order in $A$. Suppose that each simple component of the semisimple…

The absolute Galois group Gal$(\overline{\mathbb{Q}}/\mathbb{Q})$ of the field $\mathbb{Q}$ of rational numbers can be presented as a highly computable object, under the notion of type-2 Turing computation. We formalize such a presentation…

We show that a group admits a planar, finitely generated Cayley graph if and only if it admits a special kind of group presentation we introduce, called a planar presentation. Planar presentations can be recognised algorithmically. As a…

For a number field K, we show that any S-arithmetic subgroup of SL_2(K) contains a subgroup of finite index generated by three elements if card(S)> 1.

We show that lambda calculus is a computation model which can step by step simulate any sequential deterministic algorithm for any computable function over integers or words or any datatype. More formally, given an algorithm above a family…

Quantum algorithms are sequences of abstract operations, performed on non-existent computers. They are in obvious need of categorical semantics. We present some steps in this direction, following earlier contributions of Abramsky, Coecke…

On the one hand the algebras of linear operators here act on finite-dimensional vector spaces, and on the other hand the point of view is generally an analysts'. Also, one might think of algebras as being used to add more data to basic…

We compute explicitly the group of connected components $\pi_0G(\mathbb{R})$ of the real Lie group $G(\mathbb{R})$ for an arbitrary (not necessarily linear) connected algebraic group $G$ defined over the field $\mathbb{R}$ of real numbers.…

In this paper we present several algorithms related with the computation of the homology of groups, from a geometric perspective (that is to say, carrying out the calculations by means of simplicial sets and using techniques of Algebraic…

We consider the computational problem of determining the unit group of a finite ring, by which we mean the computation of a finite presentation together with an algorithm to express units as words in the generators. We show that the problem…

We introduce a category of dual pairs of finite locally free algebras over a ring. This gives an efficient way to represent finite locally free commutative group schemes. We give a number of algorithms to compute with dual pairs of…

We extend Kovacic's algorithm to compute the differential Galois group of some second order parameterized linear differential equation. In the case where no Liouvillian solutions could be found, we give a necessary and sufficient condition…

By calculating the symmetric subgroups $\Aut(\fru_0)^{\theta}$ and their involution classes, we classify the Klein four subgroups $\Gamma$ of $\Aut(\fru_0)$ for each compact simple Lie algebra $\fru_0$ up to conjugation. This leads to a new…

We classify all locally finite joinings of a horospherical subgroup action on \Gamma \ G when \Gamma is a Zariski dense geometrically finite subgroup of G=PSL_2(R) or PSL_2(C). This generalizes Ratner's 1983 joining theorem for the case…

We construct arithmetic Kleinian groups that are profinitely rigid in the absolute sense: each is distinguished from all other finitely generated, residually finite groups by its set of finite quotients. The Bianchi group…

In this paper we consider some Lie groups in complexified Clifford algebras. Using relations between operations of conjugation in Clifford algebras and matrix operations we prove isomorphisms between these groups and classical matrix groups…

We describe a provably quasi-polynomial algorithm to compute discrete logarithms in the multiplicative groups of finite fields of small characteristic, that is finite fields whose characteristic is logarithmic in the order. We partially…

The principle result of this article is the determination of the possible finite subgroups of arithmetic lattices in U(2,1).

Let $k$ be a field. We characterize the group schemes $G$ over $k$, not necessarily affine, such that $\mathsf{D}_{\mathrm{qc}}(B_kG)$ is compactly generated. We also describe the algebraic stacks that have finite cohomological dimension in…