Related papers: Some geodesic problems in groups

The group isomorphism problem asks whether two finite groups given by their Cayley tables are isomorphic or not. Although there are polynomial-time algorithms for some specific group classes, the best known algorithm for testing isomorphism…

Motivated by applications in robotics and computer vision, we study problems related to spatial reasoning of a 3D environment using sublevel sets of polynomials. These include: tightly containing a cloud of points (e.g., representing an…

Replacing finite groups by linear algebraic groups, we study an algebraic-geometric counterpart of the theory of free profinite groups. In particular, we introduce free proalgebraic groups and characterize them in terms of embedding…

Groups with the falsification by fellow traveler property are known to have solvable word problem, but they are not known to be automatic or to have finite convergent rewriting systems. In this paper, we show that these groups admit a…

The growth of a finitely generated group is an important geometric invariant which has been studied for decades. It can be either polynomial, for a well-understood class of groups, or exponential, for most groups studied by geometers, or…

We propose a geometrical approach to the investigation of Hamiltonian systems on (Pseudo) Riemannian manifolds. A new geometrical criterion of instability and chaos is proposed. This approach is more generic than well known reduction to the…

Recently knapsack problems have been generalized from the integers to arbitrary finitely generated groups. The knapsack problem for a finitely generated group $G$ is the following decision problem: given a tuple $(g, g_1, \ldots, g_k)$ of…

Partitioning and grouping of similar objects plays a fundamental role in image segmentation and in clustering problems. In such problems a typical goal is to group together similar objects, or pixels in the case of image processing. At the…

We prove that fundamental groups of orientable (geometrizable) 3-manifolds have a solvable conjugacy problem.

We investigate classical and quantum physics-based algorithms for solving the graph isomorphism problem. Our work integrates and extends previous work by Gudkov et al. (cond-mat/0209112) and by Rudolph (quant-ph/0206068). Gudkov et al.…

We give new results for problems in computational and statistical machine learning using tools from high-dimensional geometry and probability. We break up our treatment into two parts. In Part I, we focus on computational considerations in…

When a group acts on a set, it naturally partitions it into orbits, giving rise to orbit problems. These are natural algorithmic problems, as symmetries are central in numerous questions and structures in physics, mathematics, computer…

The purpose of this article is to present a survey of our recent results on length commensurable and isospectral locally symmetric spaces. The geometric questions led us to the notion of "weak commensurability" of two Zariski-dense…

We take a three dimensional Euclidian metric in toroidal coordinates and consider the corresponding Laplace equation. The simplest solution of this equation is taken. Based on this we build a Weyl space-time. This space-time is transformed…

The orbit problem is at the heart of symmetry reduction methods for model checking concurrent systems. It asks whether two given configurations in a concurrent system (represented as finite strings over some finite alphabet) are in the same…

We consider nonholonomic geodesic flows of left-invariant metrics and left-invariant nonintegrable distributions on compact connected Lie groups. The equations of geodesic flows are reduced to the Euler-Poincare-Suslov equations on the…

It is required to find an optimal order of constructing the edges of a network so as to minimize the sum of the weighted connection times of relevant pairs of vertices. Construction can be performed anytime anywhere in the network, with a…

In this paper we give a polynomial-time quantum algorithm for computing orders of solvable groups. Several other problems, such as testing membership in solvable groups, testing equality of subgroups in a given solvable group, and testing…

In many singular metric spaces, the regularity of a shortest-length curve is unknown. Algebraic varieties, or more generally sets defined by finitely many polynomial or real analytic equalities or inequalities, all locally partition into…

Let $\mathcal{M}$ be a geometrically finite hyperbolic manifold. We present a very general theorem on the shrinking target problem for the geodesic flow, using its exponential mixing. This includes a strengthening of Sullivan's logarithm…