Related papers: Post's correspondence problem for hyperbolic and v…
Consider the planar restricted $(N+1)$-body problem with trajectories of the $N(\ge 2)$ primaries forming a collision-free periodic solution of the $N$-body problem, for any positive energy $h$ and directions $\theta_{\pm} \in [0, 2\pi)$,…
A graph H is a vertex-minor of a graph G if it can be reached from G by the successive application of local complementations and vertex deletions. Vertex-minors have been the subject of intense study in graph theory over the last decades…
We exhibit examples of finitely presented subgroups $P$ of direct products of hyperbolic groups for which there is no algorithm that detects whether a finitely presented group has a quotient isomorphic to $P$. For any torsion-free, linear,…
Nicolas Monod showed that the evaluation map $H^*_m(G\curvearrowright G/P)\longrightarrow H^*_m(G)$ between the measurable cohomology of the action of a connected semisimple Lie group $G$ on its Furstenberg boundary $G/P$ and the measurable…
In this paper, we establish an explicit correspondence between kissing reflection groups and critically fixed anti-rational maps. The correspondence, which is expressed using simple planar graphs, has several dynamical consequences. As an…
We prove that the compressed word problem and the compressed simultaneous conjugacy problem are solvable in polynomial time in hyperbolic groups. In such problems, group elements are input as words defined by straight line programs defined…
Tabular intermediate logics are intermediate logics characterized by finite posets treated as Kripke frames. For a poset $\mathbb{P}$, let $L(\mathbb{P})$ denote the corresponding tabular intermediate logic. We investigate the complexity of…
Let $G$ be a connected complex semisimple Lie group, $\Gamma$ be a cocompact, irreducible and torsionless lattice in $G$ and $K$ be a maximal compact subgroup of $G$. Assume $\Gamma$ acts by left multiplication and $K$ acts by right…
We solve Dehn's isomorphism problem for virtually torsion-free relatively hyperbolic groups with nilpotent parabolic subgroups. We do so by reducing the isomorphism problem to three algorithmic problems in the parabolic subgroups, namely…
In the Constraint Satisfaction Problem (CSP for short) the goal is to decide the existence of a homomorphism from a given relational structure $G$ to a given relational structure $H$. If the structure $H$ is fixed and $G$ is the only input,…
We demonstrate a polynomial approach to express the decision version of the directed Hamiltonian Cycle Problem (HCP), which is NP-Complete, as the Solvability of a Polynomial Equation with a constant number of variables, within a bounded…
Let G be a word-hyperbolic group with given finite generating set, for which various standard structures and constants have been pre-computed. A (non-practical) algorithm is described that, given as input two lists A and B, each composed of…
Given a graph G, we investigate the question of determining the parity of the number of homomorphisms from G to some other fixed graph H. We conjecture that this problem exhibits a complexity dichotomy, such that all parity graph…
A group $G$ has cube-free order if no prime to the third power divides $|G|$. We describe an algorithm that given two cube-free groups $G$ and $H$ of known order, decides whether $G\cong H$, and, if so, constructs an isomorphism $G\to H$.…
The Higgs boson mass problem is considered in the next-to-minimal supersymmetric standard model for the case of the spontaneous CP violation. The renormalization group equations for the gauge, Yukawa and scalar coupling constants, the…
The Gan-Gross-Prasad problem is to describe the restriction of representations of a classical group $G$ to smaller groups $H$ of the same kind. In this paper, we solved the Gan-Gross-Prasad problem over finite fields completely. In previous…
The following discourse is inspired by the works on hyperbolic groups of Epstein, and Neumann/Reeves. Epstein showed that geometrically finite hyperbolic groups are biautomatic. Neumann/Reeves showed that virtually central extensions of…
Let $p$ be a prime number, $G$ be a finite $p$-group and $K$ be a field of characteristic $p$. The Modular Isomorphism Problem (MIP) asks whether the group algebra $KG$ determines the group $G$. Dealing with MIP, we investigated a question…
We give lower bounds on the complexity of the word problem of certain non-solvable groups: for a large class of non-solvable infinite groups, including in particular free groups, Grigorchuk's group and Thompson's groups, we prove that their…
Pairwise Compatibility Graphs (PCGs) form a tree-metric graph class that originated in phylogeny and has since attracted sustained interest in graph theory. Several natural generalizations have been proposed in order to overcome the…