Related papers: Exponential Genus Problems in one-relator products…

An exponential polynomial is a finite linear sum of terms $P(z)e^{Q(z)}$, where $P(z)$ and $Q(z)$ are polynomials. The early results on the value distribution of exponential polynomials can be traced back to Georg P\'olya's paper published…

The isomorphism problem for infinite finitely presented groups is probably the hardest among standard algorithmic problems in group theory. Classes of groups where it has been completely solved are nilpotent groups, hyperbolic groups, and…

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…

In 1962 M.J.Wicks gave a list of forms for commutators in both free groups and free products. Since then similar lists have been constructed for elements of higher genus. A. Vdovina has described a method for the construction of forms for…

Let $n$ be a positive integer, and let $\ell>1$ be square-free odd. We classify the set of equivariant homeomorphism classes of free $C_\ell$-actions on the product $S^1 \times S^n$ of spheres, up to indeterminacy bounded in $\ell$. The…

We study solutions of exponential polynomials over the complex field. Assuming Schanuel's conjecture we prove that certain polynomials have generic solutions in the complex field.

This paper studies the locally uniform exponential growth and product set growth for a finitely generated group $G$ acting properly on a finite product of hyperbolic spaces. Under the assumption of coarsely dense orbits or shadowing…

We introduce a model of random f.g., torsion-free, $2$-step nilpotent groups (in short, $\tau_2$-groups). To do so, we show that these are precisely the groups that admit a presentation of the form $ \label{tau2pres_0}\langle A, C \mid…

Let $G$ be a group acting acylindrically on a hyperbolic space and let $E$ be an exponential equation over $G$. We show that $E$ is equivalent to a finite disjunction of finite systems of pairwise independent equations which are either…

Machine learning and pattern recognition techniques have been successfully applied to algorithmic problems in free groups. In this paper, we seek to extend these techniques to finitely presented non-free groups, with a particular emphasis…

For a finitely generated group $G$, the \emph{Diophantine problem} over $G$ is the algorithmic problem of deciding whether a given equation $W(z_1,z_2,\ldots,z_k) = 1$ (perhaps restricted to a fixed subclass of equations) has a solution in…

This thesis addresses questions in representation and invariant theory of finite groups. The first concerns singularities of quotient spaces under actions of finite groups. We introduce a class of finite groups such that the quotients have…

The survey provides an overview of the work done in the last 10 years to characterise solutions to equations in groups in terms of formal languages. We begin with the work of Ciobanu, Diekert and Elder, who showed that solutions to systems…

We give upper bounds for triples of subsets of a finite group such that the triples of elements that multiply to 1 form a perfect matching. Our bounds are the first to give exponential savings in powers of an arbitrary finite group.…

We consider the problem of characterizing isomorphisms of types, or, equivalently, constructive cardinality of sets, in the simultaneous presence of disjoint unions, Cartesian products, and exponentials. Mostly relying on results about…

We give simple criteria to identify the exponential order of magnitude of the absolute value of the determinant for wide classes of random matrix models, not requiring the assumption of invariance. These include Gaussian matrices with…

We introduce and study the bounded word problem and the precise word problem for groups given by means of generators and defining relations. For example, for every finitely presented group, the bounded word problem is in NP, i.e., it can be…

We develop an analog of the exponential families of Wilf in which the label sets are finite dimensional vector spaces over a finite field rather than finite sets of positive integers. The essential features of exponential families are…

Given two polynomials $p(x), q(x)$ of degree $d$, we give a combinatorial formula for the finite free cumulants of $p(x)\boxtimes_d q(x)$. We show that this formula admits a topological expansion in terms of non-crossing multi-annular…

A permutoid is a set of partial permutations that contains the identity and is such that partial compositions, when defined, have at most one extension in the set. In 2004 Peter Cameron conjectured that there can exist no algorithm that…