Related papers: Computing isomorphisms between lattices
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…
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 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. In a previous article, we gave a necessary and sufficient condition for X to be free of given rank d…
We present a new algorithm to decide isomorphism between finite graded algebras. For a broad class of nilpotent Lie algebras, we demonstrate that it runs in time polynomial in the order of the input algebras. We introduce heuristics that…
We present a new algorithm that, given two matrices in $GL(n,Q)$, decides if they are conjugate in $GL(n,Z)$ and, if so, determines a conjugating matrix. We also give an algorithm to construct a generating set for the centraliser in…
Let $X$ be a locally symmetric space $\Gamma\backslash G/K$ where $G$ is a connected non-compact semisimple real Lie group with trivial centre, $K$ is a maximal compact subgroup of $G$, and $\Gamma\subset G$ is a torsion-free irreducible…
Let $\mathcal{O}$ be a Dedekind domain whose field of fractions $K$ is a global field. Let $A$ be a finite-dimensional separable $K$-algebra and let $\Lambda$ be an $\mathcal{O}$-order in $A$. Let $n$ be a positive integer and suppose that…
Let \Gamma=<\alpha, \beta > be a numerical semigroup. In this article we consider several relations between the so-called \Gamma-semimodules and lattice paths from (0,\alpha) to (\beta,0): we investigate isomorphism classes of…
We show that the isomorphism problem is solvable in the class of central extensions of word-hyperbolic groups, and that the isomorphism problem for biautomatic groups reduces to that for biautomatic groups with finite centre. We describe an…
In this paper, we give algorithms for determining the existence of isomorphism between two finite-dimensional Lie algebras and compute such an isomorphism in the affirrmative case. We also provide algorithms for determining algebraic…
If $\Gamma$ is an irreducible non-uniform higher-rank characteristic zero arithmetic lattice (for example, $SL_n(\mathbb{Z})$, $n \geq 3$) and $\Lambda$ is a finitely generated group that is elementarily equivalent to $\Gamma$, then…
Let $G$ and $G'$ be simple Lie groups of equal real rank and real rank at least $2$. Let $\Gamma <G$ and $\Lambda < G'$ be non-uniform lattices. We prove a theorem that often implies that any quasi-isometric embedding of $\Gamma$ into…
For a finite multigraph G, let \Lambda(G) denote the lattice of integer flows of G -- this is a finitely generated free abelian group with an integer-valued positive definite bilinear form. Bacher, de la Harpe, and Nagnibeda show that if G…
There are well known algorithms to compute the class group of the maximal order $\mathcal{O}_K$ of a number field $K$ and the group of invertible ideal classes of a non-maximal order $R$. In this paper we explain how to compute also the…
Let $G$ be a connected complex semisimple Lie group, $\Gamma$ be a cocompact, irreducible and torsionless lattice in $G$ and $K$ be a maximal compact subgroup of $G$. Assume $\Gamma$ acts by left multiplication and $K$ acts by right…
Let G=SL(n,R) with n>5. We construct examples of lattices Gamma of G, subgroup A of the diagonal group and points x in G/Gamma such that the closure of the orbit Ax is not homogeneous but does not factors through the action of a…
We study the Lattice Isomorphism Problem (LIP), in which given two lattices L_1 and L_2 the goal is to decide whether there exists an orthogonal linear transformation mapping L_1 to L_2. Our main result is an algorithm for this problem…
It is shown that, given any finite dimensional, split basic algebra $\Lambda = K\Gamma/I$ (where $\Gamma$ is a quiver and $I$ an admissible ideal in the path algebra $K \Gamma$), there is a finite list of affine algebraic varieties, the…
A procedure for the construction and the classification of multilattices in arbitrary dimension is proposed. The algorithm allows to determine explicitly the location of the points of a multilattice given its space group, and to determine…
Constructing lattice isomorphic line arrangements that are not lattice isotopic is a complex yet fundamental task. In this paper, we focus on such pairs but which are not Galois conjugated, referred to as nonarithmetic pairs. Splitting…