Related papers: Semigroup intersection problems in the Heisenberg …
It is shown that the knapsack problem (introduced by Myasnikov, Nikolaev, and Ushakov) is undecidable in a direct product of sufficiently many copies of the discrete Heisenberg group (which is nilpotent of class 2). Moreover, for the…
We consider several subgroup-related algorithmic questions in groups, modeled after the classic computational lattice problems, and study their computational complexity. We find polynomial time solutions to problems like finding a subgroup…
A proper subsemigroup of a semigroup is maximal if it is not contained in any other proper subsemigroup. A maximal subsemigroup of a finite semigroup has one of a small number of forms, as described in a paper of Graham, Graham, and Rhodes.…
Two groups are said to have the same nilpotent genus if they have the same nilpotent quotients. We answer four questions of Baumslag concerning nilpotent completions. (i) There exists a pair of finitely generated, residually…
In this paper, we study the word problem for automaton semigroups and automaton groups from a complexity point of view. As an intermediate concept between automaton semigroups and automaton groups, we introduce automaton-inverse semigroups,…
We study the geodesics problem in Heisenberg group H (case SR and riemannian). The sheaf of infinitesimal automorphisms of the (2n,2n+1) distribution D over H is an infinite, transitive Lie algebra sheaf.
In this paper, we study intersecting sets in primitive and quasiprimitive permutation groups. Let $G \leqslant \mathrm{Sym}(\Omega)$ be a transitive permutation group, and ${S}$ an intersecting set. Previous results show that if $G$ is…
We study the horofunction boundary of finitely generated nilpotent groups, and the natural group action on it. More specifically, we prove the followings results: For discrete Heisenberg groups, we classify the orbits of Busemann points. As…
In the context of finite Abelian groups two problems are presented and solved using quantum computing techniques. The first is the well--known Hidden Subgroup Problem, originally solved by Simon in a landmark work. The second is the Fully…
We study the intersection of finitely generated subgroups of free groups by utilizing the method of linear programming. We prove that if $H_1$ is a finitely generated subgroup of a free group $F$, then the WN-coefficient $\sigma(H_1)$ of…
In this paper we explore fundamental concepts in computational complexity theory and the boundaries of algorithmic decidability. We examine the relationship between complexity classes \textbf{P} and \textbf{NP}, where $L \in \textbf{P}$…
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…
In this paper, we show the fundamental theorems for rotationally symmetric hypersurfaces, and thus, together with the earlier results in [3] and [4], provide a complete classification of umbilic hypersurfaces in the Heisenberg groups…
In the first part, we obtain sharp results for L^2 boundedness of strongly singular operators on the Heisenberg group. We also define the oscillating convolution operators on the Heisenberg group and study their boundedness properties. In…
We study the parameterized complexity of dominating sets in geometric intersection graphs. In one dimension, we investigate intersection graphs induced by translates of a fixed pattern Q that consists of a finite number of intervals and a…
The geometry of the Heisenberg group acting on the plane arises naturally in geometric topology as a degeneration of the familiar spaces $\mathbb{S}^2,\mathbb{H}^2$ and $\mathbb{E}^2$ via conjugacy limit as defined by Cooper, Danciger, and…
Takahasi's theorem on chains of subgroups of bounded rank in a free group is generalized to several classes of semigroups. As an application, it is proved that the subsemigroups of periodic points are finitely generated and periodic orbits…
The Kepler-Heisenberg problem is that of determining the motion of a planet around a sun in the sub-Riemannian Heisenberg group. The sub-Riemannian Hamiltonian provides the kinetic energy, and the gravitational potential is given by the…
Let us be given two graphs $\Gamma_1$, $\Gamma_2$ of $n$ vertices. Are they isomorphic? If they are, the set of isomorphisms from $\Gamma_1$ to $\Gamma_2$ can be identified with a coset $H\cdot\pi$ inside the symmetric group on $n$…
In this paper we investigate computational properties of the Diophantine problem for spherical equations in some classes of finite groups. We classify the complexity of different variations of the problem, e.g., when $G$ is fixed and when…