Related papers: Computing the Zariski closure of a finitely genera…
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 consider the variety of pre-Lie algebra structures on a given n-dimensional vector space. The group GL_n(K) acts on it, and we study the closure of the orbits with respect to the Zariski topology. This leads to the definition of pre-Lie…
Given a fixed integer n, we consider closed subgroups G of H = GL(n,Z_p) where Z_p denotes the ring of p-adic integers and p is sufficiently large in terms of n. Assuming that the Zariski closure of G has no toric part, we give a condition…
A finitely generated group admits a decomposition, called its Grushko decomposition, into a free product of freely indecomposable groups. There is an algorithm to construct the Grushko decomposition of a finite graph of finite rank free…
We initiate a new, computational approach to a classical problem: certifying non-freeness of ($2$-generator, parabolic) M\"{o}bius subgroups of $\mathrm{SL}(2,\mathbb{Q})$. The main tools used are algorithms for Zariski dense groups and…
We obtain a computational realization of the strong approximation theorem. That is, we develop algorithms to compute all congruence quotients modulo rational primes of a finitely generated Zariski dense group $H \leq \mathrm{SL}(n,…
In this paper we give a unified approach in categorical setting to the problem of finding the Galois closure of a finite cover, which includes as special cases the familiar finite separable field extensions, finite unramified covers of a…
The image of a polynomial map is a constructible set. While computing its closure is standard in computer algebra systems, a procedure for computing the constructible set itself is not. We provide a new algorithm, based on algebro-geometric…
We present a new algorithm to decide finiteness of matrix groups defined over a field of positive characteristic. Together with previous work for groups in zero characteristic, this provides the first complete solution of the finiteness…
The dominant theme of this thesis is the construction of matrix representations of finite solvable groups using a suitable system of generators. For a finite solvable group $G$ of order $N = p_{1}p_{2}\dots p_{n}$, where $p_{i}$'s are…
We obtain a new classification of the finite metacyclic group in terms of group invariants. We present an algorithm to compute these invariants, and hence to decide if two given finite metacyclic groups are isomorphic, and another algorithm…
The discreteness problem for finitely generated subgroups of $PSL(2,\mathbb{R})$ and $PSL(2,\mathbb{C})$ is a long-standing open problem. In this paper we consider whether or not this problem is decidable by an algorithm. Our main result is…
We call a group $G$ {\it algorithmically finite} if no algorithm can produce an infinite set of pairwise distinct elements of $G$. We construct examples of recursively presented infinite algorithmically finite groups and study their…
We exhibit an algorithm to compute the strongest polynomial (or algebraic) invariants that hold at each location of a given affine program (i.e., a program having only non-deterministic (as opposed to conditional) branching and all of whose…
This is an introduction to linear algebra and group theory. We first review the linear algebra basics, namely the determinant, the diagonalization procedure and more, and with the determinant being constructed as it should, as a signed…
We give a complete characterization of abelian subgroups of GL(n, R) with a locally dense (resp. dense) orbit in R^n. For finitely generated subgroups, this characterization is explicit and it is used to show that no abelian subgroup of…
The rank of a finite algebraic structure with a single binary operation is the minimum number of elements needed to express every other element under the closure of the operation. In the case of groups, the previous best algorithm for…
We discuss different generalizations of Zariski decomposition, relations between them and connections with finite generation of divisorial algebras.
We show that if $\M$ is a Zariski-like structure (see \cite{lisuriart}) that does not interpret a non-classical group, and the canonical pregeometry obtained from the bounded closure operator (bcl) is non locally modular, then $\M$…
According to Markov, a subset of an abelian group G of the form {x in G: nx=a}, for some integer n and some element a of G, is an elementary algebraic set; finite unions of elementary algebraic sets are called algebraic sets. We prove that…