相关论文: On the rational subset problem for groups

We show that certain classes of graphs of free groups contain surface subgroups, including groups with positive $b_2$ obtained by doubling free groups along collections of subgroups, and groups obtained by "random" ascending HNN extensions…

We propose a way of associating to each finitely generated monoid or semigroup a formal language, called its loop problem. In the case of a group, the loop problem is essentially the same as the word problem in the sense of combinatorial…

In 2022, using methods from ergodic theory, Kra, Moreira, Richter, and Robertson resolved a longstanding conjecture of Erd\H{o}s about sumsets in large subsets of the natural numbers. In this paper, we extend this result to several…

We generalize the classical definition of effectively closed subshift to finitely generated groups. We study classical stability properties of this class and then extend this notion by allowing the usage of an oracle to the word problem of…

Reversible weighted automata are introduced and considered in a specific setting where the weights are taken from a nontrivial locally finite commutative ring such as a finite field. It is shown that the supports of series realised by such…

I introduce modal group theory, in which we study the category of all groups, considering embeddability as providing a notion of modal possibility. Using HNN extensions and Britton's lemma, I demonstrate that the modal language of groups is…

It is shown that the knapsack problem (introduced by Myasnikov, Nikolaev, and Ushakov) is undecidable in a direct product of sufficiently many copies of the discrete Heisenberg group (which is nilpotent of class 2). Moreover, for the…

We propose a general conjecture on decompositions of finite simple groups as products of conjugates of an arbitrary subset. We prove this conjecture for bounded subsets of arbitrary finite simple groups, and for large subsets of groups of…

We study a class of inverse monoids of the form M = Inv< X | w=1 >, where the single relator w has a combinatorial property that we call sparse. For a sparse word w, we prove that the word problem for M is decidable. We also show that the…

Motivated by approaches to the word problem for one-relation monoids arising from work of Adian and Oganesian (1987), Guba (1997), and Ivanov, Margolis and Meakin (2001), we study the submonoid and rational subset membership problems in…

A classical result of Schreier states that nontrivial finitely generated normal subgroups of free groups are of finite index, that is, free groups can only quotient to finite groups with finitely generated kernel. In this note we extend…

The use of monoids in the study of word languages recognized by finite-state automata has been quite fruitful. In this work, we look at the same idea of "recognizability by finite monoids" for other monoids. In particular, we attempt to…

The set of idempotents of any semigroup carries the structure of a biordered set, which contains a great deal of information concerning the idempotent generated subsemigroup of the semigroup in question. This leads to the construction of a…

Let $(\mathcal{A}, G, \alpha)$ be a groupoid dynamical system. We show that if $G$ is assumed to be measurewise amenable and the section algebra $A = \Gamma_0(G^{(0)}, \mathcal{A})$ is nuclear, then the associated groupoid crossed product…

By means of analyzing the notion of verbal products of groups, we show that soficity, hyperlinearity, amenability, the Haagerup property, the Kazhdan's property (T) and exactness are preserved under taking $k$-nilpotent products of groups,…

Elder, Kambites, and Ostheimer showed that if the word problem of a finitely generated group $H$ is accepted by a $G$-automaton for an abelian group $G$, then $H$ is virtually abelian. We give a new, elementary, and purely combinatorial…

We show that the subset sum problem, the knapsack problem and the rational subset membership problem for permutation groups are NP-complete. Concerning the knapsack problem we obtain NP-completeness for every fixed $n \geq 3$, where $n$ is…

We study the freeness problem for matrix semigroups. We show that the freeness problem is decidable for upper-triangular $2\times 2$ matrices with rational entries when the products are restricted to certain bounded languages.

We develop a combinatorial approach to the study of semigroups and monoids with finite presentations satisfying small overlap conditions. In contrast to existing geometric methods, our approach facilitates a sequential left-right analysis…

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…