Related papers: Some geodesic problems in groups
We prove prime geodesic theorems counting primitive closed geodesics on a compact hyperbolic 3-manifold with length and holonomy in prescribed intervals, which are allowed to shrink. Our results imply effective equidistribution of holonomy…
We consider geodesics motion in a particular Kundt type III spacetime in which Einstein-Yang-Mills equations admit solutions. On a particular surface as constraint we project the geodesics into the (x,y) plane and treat the problem as a…
The work consists of solutions of metric problems for convex and finite subsets of geodesic spaces.
The discreteness problem for finitely generated subgroups of $PSL(2,\mathbb{R})$ and $PSL(2,\mathbb{C})$ is a long-standing open problem. In this paper we consider whether or not this problem is decidable by an algorithm. Our main result is…
We show that all groups in a very large class of Coxeter groups are locally quasiconvex and have uniform membership problem solvable in quadratic time. If a group in the class satisfies a further hypothesis it is subgroup separable and…
We revisit two NP-hard geometric partitioning problems - convex decomposition and surface approximation. Building on recent developments in geometric separators, we present quasi-polynomial time algorithms for these problems with improved…
General factors are a generalization of matchings. Given a graph $G$ with a set $\pi(v)$ of feasible degrees, called a degree constraint, for each vertex $v$ of $G$, the general factor problem is to find a (spanning) subgraph $F$ of $G$…
In this article, we study the properties of profinite geometric iterated monodromy groups associated to polynomials. Such groups can be seen as generic representations of absolute Galois groups of number fields into the automorphism group…
We develop a practical algorithm to decide whether a finitely generated subgroup of a solvable algebraic group $G$ is arithmetic. This incorporates a procedure to compute a generating set of an arithmetic subgroup of $G$. We also provide a…
Since the publication of the first scheduling paper in 1954, a huge number of works dealing with different types of single machine problems appeared. They addressed many heuristics and enumerative procedures, complexity results or…
Motivated by a connection with the factorization of multivariate polynomials, we study integral convex polytopes and their integral decompositions in the sense of the Minkowski sum. We first show that deciding decomposability of integral…
The space $J^k$ of $k$-jets of a real function of one real variable $x$ admits the structure of Carnot group type. As such, $J^k$ admits a submetry (\sR submersion) onto the Euclidean plane. Horizontal lifts of Euclidean lines (which are…
The article contains a survey of our results on weakly commensurable arithmetic and general Zariski-dense subgroups, length-commensurable and isospectral locally symmetric spaces and of related problems in the theory of semi-simple agebraic…
Conditions for the existence of closed geodesics is a classic, much-studied subject in Riemannian geometry, with many beautiful results and powerful techniques. However, many of the techniques that work so well in that context are far less…
We describe a polynomial-time algorithm to compute a (tight) geodesic between two curves in the curve graph. As well as enabling us to compute the distance between a pair of curves, this has several applications to mapping classes. For…
We initiate the study of a fundamental combinatorial problem: Given a capacitated graph $G=(V,E)$, find a shortest walk ("route") from a source $s\in V$ to a destination $t\in V$ that includes all vertices specified by a set…
We propose to apply the idea of analytical continuation in the complex domain to the problem of geodesic completeness. We shall analyse rather in detail the cases of analytical warped products of real lines, these ones in parallel with…
We find geodesics, shortest arcs, cut loci, first conjugate loci for some left-invariant sub-Riemannian metrics on the Lie groups $SU(1,1)\times\mathbb{R}$ and $SO_0(2,1)\times\mathbb{R}$.
Algorithms for the computation of geodesics on an ellipsoid of revolution are given. These provide accurate, robust, and fast solutions to the direct and inverse geodesic problems and they allow differential and integral properties of…
The aim of this paper is to present a new algorithm for proving mixed trigonometric-polynomial inequalities by reducing to polynomial inequalities. Finally, we show the great applicability of this algorithm and as examples, we use it to…