Related papers: Geodesic rewriting systems and pregroups
A rather general ergodic type scheme is presented on arbitrary sets X, as they are generated by arbitrary mappings T : X \longrightarrow X. The structures considered on X are given by suitable subsets of the set of all of its finite…
Non-convex optimization problems are challenging to solve; the success and computational expense of a gradient descent algorithm or variant depend heavily on the initialization strategy. Often, either random initialization is used or…
Let us call pseudo-homothetic group the non-unimodular 3-dimensional Lie group that is the semi-direct product of $\mathbb{R}$ acting non-semisimply on $\mathbb{R}^2$. In this article, we solve the geodesic completeness problem on this Lie…
In studying the formation of topological defects, it is conventional to assume the ``geodesic rule'' which is equivalent to minimizing gradients of the order parameter. This assumption has been called into question in field-theoretic…
Self-similar groups provide a rich source of groups with interesting properties; e.g., infinite torsion groups (Burnside groups) and groups with an intermediate word growth. Various self-similar groups can be described by a recursive…
In recent years hypergraphs have emerged as a powerful tool to study systems with multi-body interactions which cannot be trivially reduced to pairs. While highly structured methods to generate synthetic data have proved fundamental for the…
We discuss whether it is possible to reconstruct a metric by its unparameterized geodesics, and how to do it effectively. We explain why this problem is interesting for general relativity. We show how to understand whether all curves from a…
The two-point function of a free massive scalar field on a fixed background can be evaluated in the large mass limit by using a semiclassical geodesic approximation. In de Sitter space, however, this poses a puzzle. Certain spacelike…
Many groups possess highly symmetric generating sets that are naturally endowed with an underlying combinatorial structure. Such generating sets can prove to be extremely useful both theoretically in providing new existence proofs for…
We present a general method for proving that a semigroup is non-finitely based. The method is strong enough to cover the non-finite basis arguments in articles [1,3,4,5,7,8, 11,14,16,21,27,31,36,37]. In particular, the method allows to…
We propose two geometric versions of the bounded reduction property and find conditions for them to coincide. In particular, for the natural automatic structure on a hyperbolic group, the two notions are equivalent. We study endomorphisms…
We study analytic properties of graph product of finite groups with a hyperbolic defining graph. This is done by studying dynamics on the Bowditch compactification of the extension graph, or the crossing graph, of graph product. In…
Slowly divergent geodesics in the moduli space of Riemann surfaces of genus at least 2 are constructed via cyclic branched covers of the torus. Nonergodic examples (i.e. geodesics whose defining quadratic differential has nonergodic…
We study normalisation of multistep strategies, strategies that reduce a set of redexes at a time, focussing on the notion of necessary sets, those which contain at least one redex that cannot be avoided in order to reach a normal form.…
We solve explicitly the geodesic equation for a wide class of (pseudo)-Riemannian homogeneous manifolds (G/H,m), including those with G compact, as well as non-compact semisimple Lie groups, under a simple algebraic condition for the metric…
We show that one can define and effectively compute Stallings graphs for quasi-convex subgroups of automatic groups (\textit{e.g.} hyperbolic groups or right-angled Artin groups). These Stallings graphs are finite labeled graphs, which are…
We prove a conjecture made by Gilman in 1984 that the groups presented by finite, monadic, confluent rewriting systems are precisely the free products of free and finite groups.
We investigate how much information about a convex body can be retrieved from a finite number of its geometric moments. We give a sufficient condition for a convex body to be uniquely determined by a finite number of its geometric moments,…
We study the termination of rewriting modulo a set of equations in the Calculus of Algebraic Constructions, an extension of the Calculus of Constructions with functions and predicates defined by higher-order rewrite rules. In a previous…
A monoid is said to be special if it admits a presentation in which all defining relations are of the form $w = 1$. Groups are familiar examples of special monoids. This article studies the geometric and structural properties of the Cayley…