Related papers: Detecting quasiconvexity: algorithmic aspects

We associate cube complexes called completions to each subgroup of a right-angled Coxeter group (RACG). A completion characterizes many properties of the subgroup such as whether it is quasiconvex, normal, finite-index or torsion-free. We…

We show that one can define and effectively compute Stallings graphs for quasi-convex subgroups of automatic groups (\textit{e.g.} hyperbolic groups or right-angled Artin groups). These Stallings graphs are finite labeled graphs, which are…

We develop a practical algorithm to decide whether a finitely generated subgroup of a solvable algebraic group $G$ is arithmetic. This incorporates a procedure to compute a generating set of an arithmetic subgroup of $G$. We also provide a…

Let G be a unipotent algebraic subgroup of some GL_m(C) defined over Q. We describe an algorithm for finding a finite set of generators of the subgroup G(Z) = G \cap GL_m(Z). This is based on a new proof of the result (in more general form…

Let G be a group which is hyperbolic relative to a collection of subgroups A, and it is also hyperbolic relative to a collection of subgroups B. Suppose that the collection A contains B. We characterize, for subgroups of G, when…

This is an informal announcement of results to be described and proved in detail in a paper to appear. We give various results on the structure of approximate subgroups in linear groups such as $\SL_n(k)$. For example, generalising a result…

We suggest a new algorithm to estimate representations of compact Lie groups from finite samples of their orbits. Different from other reported techniques, our method allows the retrieval of the precise representation type as a direct sum…

We give an efficient algorithm that, given a graph $G$ and a partition $V_1,\ldots,V_m$ of its vertex set, finds either an independent transversal (an independent set $\{v_1,\ldots,v_m\}$ in $G$ such that $v_i\in V_i$ for each $i$), or a…

We present a new algorithm for the problem of universal gathering mobile oblivious robots (that is, starting from any initial configuration that is not bivalent, using any number of robots, the robots reach in a finite number of steps the…

In many cases the convexity of the image of a linear map with range is $R^n$ is automatic because of the facial structure of the domain of the map. We develop a four step procedure for proving this kind of ``automatic convexity''. To make…

The aim of this short note is to provide a proof of the decidability of the generalized membership problem for relatively quasi-convex subgroups of finitely presented relatively hyperbolic groups, under some reasonably mild conditions on…

Model sets play a fundamental role in structure analysis of quasicrystals. The diffraction diagram of a quasicrystal admits as symmetry group a finite group G, and there is a G-cluster C (union of orbits of G) such that the quasicrystal can…

We develop practical techniques to compute with arithmetic groups $H\leq \mathrm{SL}(n,\mathbb{Q})$ for $n>2$. Our approach relies on constructing a principal congruence subgroup in $H$. Problems solved include testing membership in $H$,…

We address the question: for which collections of finite simple groups does there exist an algorithm that determines the images of an arbitrary finitely presented group that lie in the collection? We prove both positive and negative…

Symmetries and equivariance are fundamental to the generalization of neural networks on domains such as images, graphs, and point clouds. Existing work has primarily focused on a small number of groups, such as the translation, rotation,…

We present an algorithm which given a presentation of a group $G$ without 2-torsion, a solution to the word problem with respect to this presentation, and an acylindricity constant ${\kappa}$, outputs a collection of tracks in an…

The paper deals with quasigroups having a trivial group of automorphisms and a trivial group of autotopisms. Examples of such quasigroups and methods of their verification are given.

In this article we overview those aspects of the theory of affine semigroups and their algebras that have been relevant for our own research, and pose several open problems. Answers to these problems would contribute substantially to the…

We give an algorithm for computing the irreducible admissible representations of a real reductive group with regular integral infinitesimal character. This algorithm has been implemented on a computer, as part of the Atlas of Lie Groups and…

We present an algorithm which decides whether a given quasiconvex residually finite subgroup $H$ of a hyperbolic group $G$ is associated with a splitting. The methods developed also provide algorithms for computing the number of filtered…