Related papers: Integrality and arithmeticity of solvable linear g…

The conjugacy problem for a finitely generated group $G$ is the two-variable problem of deciding for an arbitrary pair $(u,v)$ of elements of $G$, whether or not $u$ is conjugate to $v$ in $G$. We construct examples of finitely generated,…

We present a new algorithm deciding if the intersection of a quasiconvex subgroup of a negatively curved group with a conjugate is finite. We also give a short proof of decidability of the membership problem for quasiconvex subgroups of…

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

We determine when an arithmetic subgroup of a reductive group defined over a global function field is of type FP_\infty by comparing its large-scale geometry to the large-scale geometry of lattices in real semisimple Lie groups.

It is a fundamental result in commutative algebra and invariant theory that a finitely generated graded module over a commutative finitely generated graded algebra has rational Hilbert series, and consequently the Hilbert series of the…

Let $n$ be a positive integer and $\mathcal M$ a set of rational $n \times n$-matrices such that $\mathcal M$ generates a finite multiplicative semigroup. We show that any matrix in the semigroup is a product of matrices in $\mathcal M$…

Let G be a finitely generated linear group over a field of characteristic 0. Suppose that every solvable subgroup of G is polycyclic. Then the claim is made that any solvable subgroup of G is separable. This is proven for G=SL_n(Z).…

We prove that it is decidable whether or not a finitely generated submonoid of a virtually free group is graded, introduce a new geometric characterization as quasi-geodesic monoids, and show that their word problem is rational (as a…

We present new computational results for symplectic monodromy groups of hypergeometric differential equations. In particular, we compute the arithmetic closure of each group, sometimes justifying arithmeticity. The results are obtained by…

By combining well-known techniques from both noncommutative algebra and computational commutative algebra, we observe that an algorithmic approach can be applied to the study of irreducible representations of finitely presented algebras. In…

As an instance of a linear action of a Hopf algebra on a free associative algebra, we consider finite group gradings of a free algebra induced by gradings on the space spanned by the free generators. The homogeneous component corresponding…

We present a theoretical algorithm which, given any finite presentation of a group as input, will terminate with answer yes if and only if the group is large. We then implement a practical version of this algorithm using Magma and apply it…

Let $G$ be a finite group and $\sigma_1(G)=\frac{1}{|G|}\sum_{H\leq G}\,|H|$. Under some restrictions on the number of conjugacy classes of (non-normal) maximal subgroups of $G$, we prove that if $\sigma_1(G)<\frac{117}{20}\,$, then $G$ is…

Computing the real solutions to a system of polynomial equations is a challenging problem, particularly verifying that all solutions have been computed. We describe an approach that combines numerical algebraic geometry and sums of squares…

We study orbit-finite systems of linear equations, in the setting of sets with atoms. Our principal contribution is a decision procedure for solvability of such systems. The procedure works for every field (and even commutative ring) under…

This paper gives a new explicit construction of the $\mathbb{Q}$-algebraic hull for virtually solvable groups $\Gamma$ of finite abelian ranks, taking into account the spectrum $S$ of the group $\Gamma$. As an application, we make a…

In this paper we present a novel algorithm for computing a congruence on an inverse semigroup from a collection of generating pairs. This algorithm uses a myriad of techniques from the theories of groups, automata, and inverse semigroups.…

It is shown that any finite group $A$ is realizable as the automizer in a finite perfect group $G$ of an abelian subgroup whose conjugates generate $G$. The construction uses techniques from fusion systems on arbitrary finite groups, most…

William W. Boone and Graham Higman proved that a finitely generated group has soluble word problem if and only if it can be embedded in a simple group that can be embedded in a finitely presented group. We prove the exact analogue for…

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…