中文
相关论文

相关论文: Algorithmic properties of inverse monoids with hyp…

200 篇论文

We prove that an arbitrary right-angled Artin group $G$ admits a quasi-isometric group embedding into a right-angled Artin group defined by the opposite graph of a tree. Consequently, $G$ admits quasi-isometric group embeddings into a pure…

群论 · 数学 2016-01-20 Sang-hyun Kim , Thomas Koberda

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…

群论 · 数学 2021-01-20 Carl-Fredrik Nyberg-Brodda

We show that the membership problem in a finitely generated submonoid of a graph group (also called a right-angled Artin group or a free partially commutative group) is decidable if and only if the independence graph (commutation graph) is…

群论 · 数学 2007-07-19 Markus Lohrey , Benjamin Steinberg

As an appropriate generalisation of the features of the classical (Schein) theory of representations of inverse semigroups in $\mathscr{I}_{X}$, a theory of representations of inverse semigroups by homomorphisms into complete atomistic…

群论 · 数学 2021-02-22 D. G. FitzGerald

We characterize those 1-ended word hyperbolic groups whose Gromov boundaries are homeomorphic to trees of graphs (i.e. to inverse limits of graphs that have particularly simple finitary descriptions). These are groups with the simplest…

群论 · 数学 2025-04-29 Nima Hoda , Jacek Świątkowski

We show that some results from the theory of group automata and monoid automata still hold for more general classes of monoids and models. Extending previous work for finite automata over commutative groups, we demonstrate a context-free…

形式语言与自动机理论 · 计算机科学 2017-08-23 Özlem Salehi , Flavio D'Alessandro , A. C. Cem Say

We provide an algorithm to solve the word problem in all fundamental groups of closed 3-manifolds; in particular, we show that these groups are autostackable. This provides a common framework for a solution to the word problem in any closed…

群论 · 数学 2017-12-14 Mark Brittenham , Susan Hermiller , Tim Susse

We study the language-theoretic aspects of the word problem, in the sense of Duncan & Gilman, of free products of semigroups and monoids. First, we provide algebraic tools for studying classes of languages known as super-AFLs, which…

群论 · 数学 2021-12-21 Carl-Fredrik Nyberg-Brodda

This note proves a generalisation to inverse semigroups of Anisimov's theorem that a group has regular word problem if and only if it is finite, answering a question of Stuart Margolis. The notion of word problem used is the two-tape word…

群论 · 数学 2013-11-18 Tara Brough

This paper studies the classes of semigoups and monoids with context-free and deterministic context-free word problem. First, some examples are exhibited to clarify the relationship between these classes and their connection with the…

群论 · 数学 2019-03-26 Tara Brough , Alan J. Cain , Markus Pfeiffer

We develop a theory of graph C*-algebras using path groupoids and inverse semigroups. Row finiteness is not assumed so that the theory applies to graphs for which there are vertices emitting a countably infinite set of edges. We show that…

算子代数 · 数学 2007-05-23 Alan L. T. Paterson

This paper studies infinite graphs produced from a natural unfolding operation applied to finite graphs. Graphs produced via such operations are of finite degree and automatic over the unary alphabet (that is, they can be described by…

逻辑 · 数学 2008-09-22 Bakhadyr Khoussainov , Jiamou Liu , Mia Minnes

In this paper we study the relationship of hyperbolicity and (Cheeger) isoperimetric inequality in the context of Riemannian manifolds and graphs. We characterize the hyperbolic manifolds and graphs (with bounded local geometry) verifying…

度量几何 · 数学 2016-05-17 Álvaro Martínez-Pérez , José M. Rodríguez

The Eilenberg correspondence relates varieties of regular languages to pseudovarieties of finite monoids. Various modifications of this correspondence have been found with more general classes of regular languages on one hand and classes of…

形式语言与自动机理论 · 计算机科学 2019-03-20 Ondřej Klíma , Libor Polák

We prove that the saddle connection graph associated to any half-translation surface is 4-hyperbolic and uniformly quasi-isometric to the regular countably infinite-valent tree. Consequently, the saddle connection graph is not…

几何拓扑 · 数学 2020-12-10 Valentina Disarlo , Huiping Pan , Anja Randecker , Robert Tang

In this paper we study the generic, i.e., typical, behavior of finitely generated subgroups of hyperbolic groups and also the generic behavior of the word problem for amenable groups. We show that a random set of elements of a nonelementary…

群论 · 数学 2010-07-06 Robert Gilman , Alexei Miasnikov , Denis Osin

Graph inverse semigroups generalize the polycyclic inverse monoids and play an important role in the theory of C*-algebras. This paper has two main goals: first, to provide an abstract characterization of graph inverse semigroups; and…

范畴论 · 数学 2013-08-14 David G. Jones , Mark V. Lawson

For a large class of groups, we exhibit an infinite-dimensional space of homogeneous quasimorphisms that are invariant under the action of the automorphism group. This class includes non-elementary hyperbolic groups, infinitely-ended…

群论 · 数学 2025-12-02 Francesco Fournier-Facio , Richard D. Wade

In this paper we revisit the following inverse problem: given a curve invariant under an irreducible finite linear algebraic group, can we construct an ordinary linear differential equation whose Schwarz map parametrizes it? We present an…

代数几何 · 数学 2024-02-20 Camilo Sanabria Malagón

Given an adaptable separated graph, we construct an associated groupoid and explore its type semigroup. Specifically, we first attach to each adaptable separated graph a corresponding semigroup, which we prove is an $E^*$-unitary inverse…

算子代数 · 数学 2020-02-03 Pere Ara , Joan Bosa , Enrique Pardo , Aidan Sims