English
Related papers

Related papers: Context-free rewriting systems and word-hyperbolic…

200 papers

In this article, we prove that if a finitely presented group has an asymptotic cone which is tree-graded with respect to a precise set of pieces then it is relatively hyperbolic. This answers a question of M. Sapir.

Group Theory · Mathematics 2018-08-24 Rémi Coulon , Michael Hull , Curtis Kent

We prove the Borel Conjecture for a class of groups containing word-hyperbolic groups and groups acting properly, isometrically and cocompactly on a finite dimensional CAT(0)-space.

Geometric Topology · Mathematics 2010-03-26 Arthur Bartels , Wolfgang Lueck

Monadic decomposibility --- the ability to determine whether a formula in a given logical theory can be decomposed into a boolean combination of monadic formulas --- is a powerful tool for devising a decision procedure for a given logical…

Formal Languages and Automata Theory · Computer Science 2019-05-09 Pablo Barcelo , Chih-Duo Hong , Xuan-Bach Le , Anthony W. Lin , Reino Niskanen

How can we represent hierarchical information present in large type inventories for entity typing? We study the ability of hyperbolic embeddings to capture hierarchical relations between mentions in context and their target types in a…

Computation and Language · Computer Science 2019-06-07 Federico López , Benjamin Heinzerling , Michael Strube

A geodesic bicombing on a metric space selects for every pair of points a geodesic connecting them. We prove existence and uniqueness results for geodesic bicombings satisfying different convexity conditions. In combination with recent work…

Metric Geometry · Mathematics 2014-04-22 Dominic Descombes , Urs Lang

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…

Group Theory · Mathematics 2022-12-07 Ash DeClerk

The classical subset construction for non-deterministic automata can be generalized to other side-effects captured by a monad. The key insight is that both the state space of the determinized automaton and its semantics---languages over an…

Formal Languages and Automata Theory · Computer Science 2019-05-16 Gerco van Heerdt , Joshua Moerman , Matteo Sammartino , Alexandra Silva

A partial monoid $P$ is a set with a partial multiplication $\times$ (and total identity $1_P$) which satisfies some associativity axiom. The partial monoid $P$ may be embedded in a free monoid $P^*$ and the product $\star$ is simulated by…

Discrete Mathematics · Computer Science 2010-09-30 Laurent Poinsot , Gérard Duchamp , Christophe Tollu

Random groups of density d<\frac{1}{2} are infinite hyperbolic, and of density d>\frac{1}{2} are finite. We prove the existence of a uniform quantifier elimination procedure for formulas of minimal rank (probably the superstable part of the…

Group Theory · Mathematics 2024-08-13 Sobhi Massalha

The study of rod complements is motivated by rod packing structures in crystallography. We view them as complements of links comprised of Euclidean geodesics in the 3-torus. Recent work of the second author classifies when such rod…

Geometric Topology · Mathematics 2025-09-03 Norman Do , Connie On Yu Hui , Jessica S. Purcell

We look at the proofs of a fragment of Linear Logic as a whole: in fact, Linear Logic's coherent semantics interprets the proofs of a given formula $A$ as faces of an abstract simplicial complex, thus allowing us to see the set of the…

Logic in Computer Science · Computer Science 2024-09-19 Davide Barbarossa

We study the family of rational sets of words, called completely reducible and which are such that the syntactic representation of their characteristic series is completely reducible. This family contains, by a result of Reutenauer, the…

Formal Languages and Automata Theory · Computer Science 2016-11-22 Dominique Perrin

We show that a set with an action of a locally finite-dimensional free partially commutative monoid and the corresponding semicubical set have isomorpic homology groups. We build a complex of finite length for the computing homology groups…

K-Theory and Homology · Mathematics 2009-05-11 Ahmet A. Husainov

This paper investigates the relationship between the topology of hyperbolizable 3-manifolds M with incompressible boundary and the volume of hyperbolic convex cores homotopy equivalent to M. Specifically, it proves a conjecture of Bonahon…

Geometric Topology · Mathematics 2009-03-09 Peter A. Storm

We study combinatorial inequalities for various classes of set systems: matroids, polymatroids, poset antimatroids, and interval greedoids. We prove log-concavity inequalities for counting certain weighted feasible words, which generalize…

Combinatorics · Mathematics 2024-08-01 Swee Hong Chan , Igor Pak

Label inventories for fine-grained entity typing have grown in size and complexity. Nonetheless, they exhibit a hierarchical structure. Hyperbolic spaces offer a mathematically appealing approach for learning hierarchical representations of…

Computation and Language · Computer Science 2020-10-06 Federico López , Michael Strube

We will prove bi-interpretability of the arithmetic $\N = \langle N, +,\cdot, 0, 1\rangle$ and the weak second order theory of $\N$ with the free monoid $\mathbb{M}_X$ of finite rank greater than 1 and with a non-trivial partially…

Logic · Mathematics 2019-03-28 Olga Kharlampovich , Laura Lopez

In 2018, it was shown that all finitely generated virtually Abelian groups have multiple context-free word problems, and it is still an open problem as to where to precisely place the word problems of hyperbolic groups in the formal…

Formal Languages and Automata Theory · Computer Science 2021-01-08 Graham Campbell

We give a simple combinatorial criterion, in terms of an action on a hyperbolic simplicial complex, for a group to be hierarchically hyperbolic. We apply this to show that quotients of mapping class groups by large powers of Dehn twists are…

Group Theory · Mathematics 2024-06-25 Jason Behrstock , Mark Hagen , Alexandre Martin , Alessandro Sisto

Monads in category theory are algebraic structures that can be used to model computational effects in programming languages. We show how the notion of "centre", and more generally "centrality", i.e. the property for an effect to commute…

Logic in Computer Science · Computer Science 2025-10-31 TItouan Carette , Louis Lemonnier , Vladimir Zamdzhiev