Related papers: On the Diophantine problem in some one-relator gro…
This is the first of a sequence of papers devoted to studying the link between the complexity of the Word Problem for a finitely generated recursively presented group $G$ and the isoperimetric functions of the finitely presented groups in…
Equivalence classes of solutions of the Diophantine equation $a^2+mb^2=c^2$ form an infinitely generated abelian group $G_m$, where $m$ is a fixed square-free positive integer. Solutions of Pell's equation $x^2-my^2=1$ generate a subgroup…
We produce infinite families of knots $\{K^i\}_{i\geq 1}$ for which the set of cables $\{K^i_{p,1}\}_{i,p\geq 1}$ is linearly independent in the knot concordance group. We arrange that these examples lie arbitrarily deep in the solvable and…
A group is irreducibly represented if it has a faithful irreducible unitary representation. For countable groups, a criterion for irreducible representability is given, which generalises a result obtained for finite groups by W. Gasch\"utz…
We discuss how non-commutative fundamental groups could eventually contribute to algorithms for finding rational points on hyperbolic curves.
In this second paper we solve the twisted conjugacy problem for even dihedral Artin groups, that is, groups with presentation $G(m) = \langle a,b \mid {}_{m}(a,b) = {}_{m}(b,a) \rangle$, where $m \geq 2$ is even, and $_{m}(a,b)$ is the word…
The purpose of this paper is to study the existence of weak solutions for some classes of one-parameter subelliptic gradient-type systems involving a Sobolev-Hardy potential defined on an unbounded domain $\Omega_\psi$ of the Heisenberg…
We develop a method for proving the Boone--Higman Conjecture for groups acting on locally finite trees. As a consequence, we prove the Boone--Higman Conjecture for all Baumslag--Solitar groups and for all free(finite rank)-by-cyclic groups,…
We generalize the classical Post correspondence problem ($\mathbf{PCP}_n$) and its non-homogeneous variation ($\mathbf{GPCP}_n$) to non-commutative groups and study the computational complexity of these new problems. We observe that…
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…
Let $U$ be an algebraic subgroup of the group of $n\times n$ upper-triangular matrices with units on the diagonal over a finite field of large enough characteristic, and $\mathfrak{n}$ be the Lie algebra of $U$. The main tool in…
We draw connections between the various conjectures which are included in G. R\'emond's generalized Lehmer problems. Specifically, we show that the degree one form of his conjecture for the multiplicative group is, in a sense, almost as…
The \emph{Diophantine exponent} of an action of a group on a homogeneous space, as defined by Ghosh, Gorodnik, and Nevo, quantifies the complexity of approximating the points of the homogeneous space by the points on an orbit of the group.…
We show that any one-relator group $G=F/\langle\langle w\rangle\rangle$ with torsion is coherent -- i.e., that every finitely generated subgroup of $G$ is finitely presented -- answering a 1974 question of Baumslag in this case.
We consider a combinatorial problem occurring naturally in a group theoretical setting and provide a constructive solution in a special case. More precisely, in 1999 the author established a logarithmic bound for the derived length of the…
We prove that Whitehead's algorithm for solving the automorphism problem in a fixed free group $F_k$ has strongly linear time generic-case complexity. This is done by showing that the ``hard'' part of the algorithm terminates in linear time…
The main motivation of our work is to create an efficient algorithm that decides hypertranscendence of solutions of linear differential equations, via the parameterized differential and Galois theories. To achieve this, we expand the…
We investigate the power of counting in Group Isomorphism. We first leverage the count-free variant of the Weisfeiler--Leman Version I algorithm for groups (Brachter & Schweitzer, LICS 2020) in tandem with limited non-determinism and…
Thompson's theorem stated that a finite group $G$ is solvable if and only if every $2$-generated subgroup of $G$ is solvable. In this paper, we prove some new criteria for both solvability and nilpotency of a finite group using certain…
In this paper, we generalise Magnus' Freiheitssatz and solution to the word problem for one-relator groups by considering one relator quotients of certain classes of right-angled Artin groups and graph products of locally indicable…