Related papers: Some geodesic problems in groups

In this paper we study the realizability question for commuting graphs of finite groups: Given an undirected graph $X$ is it the commuting graph of a group $G$? And if so, to determine such a group. We seek efficient algorithms for this…

We show that every countable group H with solvable word problem (=computable group) can be subnormally embedded into a 2-generated group G which also has solvable word problem. Moreover, the membership problem for H < G is also solvable. We…

The geometric concept of geodesic completeness depends on the choice of the metric field or "metric frame". We develop a frame-invariant concept of "generalised geodesic completeness" or "time completeness". It is based on the notion of…

This note records some observations concerning geodesic growth functions. If a nilpotent group is not virtually cyclic then it has exponential geodesic growth with respect to all finite generating sets. On the other hand, if a finitely…

We study a generalization of the Fuchsian triangle groups to the hyperbolic 3-space, namely, the groups generated by half-turns in three hyperbolic lines. The role of the hyperbolic triangles is now played by the right-angled hexagons. This…

We present a heuristic algorithm for solving the problem of scheduling plans of tasks. The plans are ordered vectors of tasks, and tasks are basic operations carried out by resources. Plans are tied by temporal, precedence and resource…

This paper describes a new approach to the problem of generating the class of all geodetic graphs homeomorphic to a given geodetic one. An algorithmic procedure is elaborated to carry out a systematic finding of such a class of graphs. As a…

We study the Identity Problem, the problem of determining if a finitely generated semigroup of matrices contains the identity matrix; see Problem 3 (Chapter 10.3) in ``Unsolved Problems in Mathematical Systems and Control Theory'' by…

We present a new algorithm deciding if the intersection of a quasiconvex subgroup of a negatively curved group with a conjugate is finite. We also give a short proof of decidability of the membership problem for quasiconvex subgroups of…

The idea that the quantum space-time of microphysics may be fractal everywhere was intensively investigated recently, and several authors have presented the geodesic equations of different fractal space - times. In the present work we…

The geodesic complexity of a Riemannian manifold is a numerical isometry invariant that is determined by the structure of its cut loci. In this article we study decompositions of cut loci over whose components the tangent cut loci fiber in…

A new technique for the study of geodesic connectedness in a class of Lorentzian manifolds is introduced. It is based on arguments of Brouwer's topological degree for the solution of functional equations. It is shown to be very useful for…

The algorithms given in Karney, J. Geodesy 87, 43-55 (2013), to compute geodesics on terrestrial ellipsoids are extended to apply to ellipsoids of revolution with arbitrary eccentricity. For the direct and inverse geodesic problems, this…

Gracefully degrading algorithms [Biely \etal, TCS 2018] are designed to circumvent impossibility results in dynamic systems by adapting themselves to the dynamics. Indeed, such an algorithm solves a given problem under some dynamics and,…

This chapter is an up-to-date account of results on globally hyperbolic spacetimes, and serves several purposes. We begin with the exposition of results from a foundational level, where the main tools are order theory and general topology,…

The paper deals with finite-state Markov decision processes (MDPs) with integer weights assigned to each state-action pair. New algorithms are presented to classify end components according to their limiting behavior with respect to the…

Many problems in Euclidean geometry, arising in computational design and fabrication, amount to a system of constraints, which is challenging to solve. We suggest a new general approach to the solution, which is to start with analogous…

We have proved in [Topology, 45 1 (2006)] that fundamental groups of oriented geometrizable 3-manifolds have a solvable conjugacy problem. We now consider the case of groups of non-oriented geometrizable 3-manifolds in order to conclude…

In this article we study domino snake problems on finitely generated groups. We provide general properties of these problems and introduce new tools for their study. The first is the use of symbolic dynamics to understand the set of all…

We discuss different generalizations of Zariski decomposition, relations between them and connections with finite generation of divisorial algebras.