English
Related papers

Related papers: Regular Languages for Contracting Geodesics

200 papers

We investigate the average-case complexity of decision problems for finitely generated groups, in particular the word and membership problems. Using our recent results on ``generic-case complexity'' we show that if a finitely generated…

Group Theory · Mathematics 2007-05-23 Ilya Kapovich , Alexei Myasnikov , Paul Schupp , Vladimir Shpilrain

We prove that some paths of contactomorphisms of $\mathbb{R}^{2n} \times S^1$ endowed with its standard contact structure are geodesics for different norms defined on the identity component of the group of compactly supported…

Symplectic Geometry · Mathematics 2022-05-20 Pierre-Alexandre Arlove

In this paper, for a given finitely generated algebra (an algebraic structure with arbitrary operations and no predicates) A we study finitely generated limit algebras of A, approaching them via model theory and algebraic geometry. Along…

Algebraic Geometry · Mathematics 2008-08-20 E. Daniyarova , A. Myasnikov , V. Remeslennikov

These are lecture notes on the algebraic approach to regular languages. The classical algebraic approach is for finite words; it uses semigroups instead of automata. However, the algebraic approach can be extended to structures beyond…

Formal Languages and Automata Theory · Computer Science 2020-08-27 Mikołaj Bojańczyk

Let $G$ be a Garside group endowed with the generating set $\mathcal{S}$ of non-trivial simple elements, and let $H$ be a parabolic subgroup of $G$. We determine a transversal $T$ of $H$ in $G$ such that each $\theta \in T$ is of minimal…

Group Theory · Mathematics 2019-02-28 Yago Antolín , Luis Paris

We construct an extension $E(A,G)$ of a given group $G$ by infinite non-Archimedean words over an discretely ordered abelian group like $Z^n$. This yields an effective and uniform method to study various groups that "behave like $G$". We…

Group Theory · Mathematics 2011-02-08 Volker Diekert , Alexei Myasnikov

Let $G$ be a classical algebraic group, $X$ a maximal rank reductive subgroup and $P$ a parabolic subgroup. This paper classifies when $X\G/P$ is finite. Finiteness is proven using geometric arguments about the action of $X$ on subspaces of…

Group Theory · Mathematics 2007-05-23 W. Ethan Duckworth

We show that, if $w_1, \ldots , w_6$ are words which are not an identity of any (non-abelian) finite simple group, then $w_1(G)w_2(G) \cdots w_6(G) = G$ for all (non-abelian) finite simple groups $G$. In particular, for every word $w$,…

Group Theory · Mathematics 2021-01-08 Michael Larsen , Aner Shalev , Pham Huu Tiep

A group is Markov if it admits a prefix-closed regular language of unique representatives with respect to some generating set, and strongly Markov if it admits such a language of unique minimal-length representatives over every generating…

Group Theory · Mathematics 2015-10-21 Alan J. Cain , Victor Maltcev

We give a forbidden pattern characterization for the class of generalized definite languages, show that the corresponding problem is NL-complete and can be solved in quadratic time. We also show that their syntactic complexity coincides…

Formal Languages and Automata Theory · Computer Science 2013-04-23 Szabolcs Ivan , Judit Nagy-Gyorgy

We show that the verbal width is infinite for acylindrically hyperbolic groups, which include hyperbolic groups, mapping class groups and Out(Fn).

Group Theory · Mathematics 2019-02-13 Mladen Bestvina , Ken Bromberg , Koji Fujiwara

We characterize the fundamental group of a locally finite graph G with ends combinatorially, as a group of infinite words. Our characterization gives rise to a canonical embedding of this group in the inverse limit of the (free) fundamental…

Combinatorics · Mathematics 2009-10-30 Reinhard Diestel , Philipp Sprüssel

A fundamental theme in automata theory is regular languages of words and trees, and their many equivalent definitions. Salvati has proposed a generalization to regular languages of simply typed $\lambda$-terms, defined using denotational…

Logic in Computer Science · Computer Science 2024-02-09 Vincent Moreau , Lê Thành Dũng Nguyên

We consider languages defined by signed grammars which are similar to context-free grammars except productions with signs associated to them are allowed. As a consequence, the words generated also have signs. We use the structure of the…

Formal Languages and Automata Theory · Computer Science 2023-09-19 Ömer Eğecioğlu , Benedek Nagy

A periodic geodesic on a surface has a natural lift to the unit tangent bundle; when the complement of this lift is hyperbolic, its volume typically grows as the geodesic gets longer. We give an upper bound for this volume which is linear…

Geometric Topology · Mathematics 2016-05-11 Maxime Bergeron , Tali Pinsky , Lior Silberman

We prove that seesaw words exist in Thompson's Group F(N) for N=2,3,4,... with respect to the standard finite generating set X. A seesaw word w with swing k has only geodesic representatives ending in g^k or g^{-k} (for given g\in X) and at…

Group Theory · Mathematics 2008-09-11 Claire Wladis

We show that if $G$ is a non-elementary word hyperbolic group, mapping class group of a hyperbolic surface or the outer automorphism group of a nonabelian free group then $G$ has $2^{\aleph_0}$ many continuous ergodic invariant random…

Group Theory · Mathematics 2015-06-02 Lewis Bowen , Rostislav Grigorchuk , Rostyslav Kravchenko

Let S be a generating set of a group G. We say that G has FINITE WIDTH relative to S if G=(S\cup S^{-1})^k for a suitable natural number k. We say that a group G is a group of FINITE C-WIDTH if G has finite width with respect to all…

Group Theory · Mathematics 2011-05-31 Valery Bardakov , Vladimir Tolstykh , Vladimir Vershinin

We investigate the geometry of word metrics on fundamental groups of manifolds associated with the generating sets consisting of elements represented by closed geodesics. We ask whether the diameter of such a metric is finite or infinite.…

Differential Geometry · Mathematics 2021-06-28 Bastien Karlhofer , Jarek Kędra , Michał Marcinkowski , Alexander Trost

We give a necessary and sufficient condition for the fundamental group of a finite graph of groups with infinite cyclic edge groups to be acylindrically hyperbolic, from which it follows that a finitely generated group splitting over Z…

Group Theory · Mathematics 2015-09-21 J. O. Button
‹ Prev 1 3 4 5 6 7 10 Next ›