Related papers: Geodesic languages for rational subsets and conjug…
Let H and K be quasiconvex subgroups of a negatively curved torsion-free group G. We give an algorithm which decides whether an element of H is conjugated in G to an element of K.
Let $G$ be a finite group and $K$ a normal subset consisting of odd-order elements. The rational closure of $K$, denoted $\mathbf D_K$, is the set of elements $x \in G$ with the property that $\langle x \rangle = \langle y \rangle$ for some…
We study density of rational languages under shift invariant probability measures on spaces of two-sided infinite words, which generalizes the classical notion of density studied in formal languages and automata theory. The density for a…
In this note we prove the following results: $\bullet$ If a finitely presented group $G$ admits a strongly aperiodic SFT, then $G$ has decidable word problem. More generally, for f.g. groups that are not recursively presented, there exists…
We compute the genus of a rational quadratic form in terms of the K-theory of a C*-algebra attached to the adelic orthogonal group of the form. As a corollary, one gets a higher composition law for the rational quadratic forms. As an…
Greenlees has conjectured that the rational stable equivariant homotopy category of a compact Lie group always has an algebraic model. Based on this idea, we show that the category of rational local systems on a connected finite loop space…
One of the main reasons for the correspondence of regular languages and monadic second-order logic is that the class of regular languages is closed under images of surjective letter-to-letter homomorphisms. This closure property holds for…
We study dynamical systems arising from word maps on simple groups. We develop a geometric method based on the classical trace map for investigating periodic points of such systems. These results lead to a new approach to the search of…
A group G is a vGBS group if it admits a decomposition as a finite graph of groups with all edge and vertex groups finitely generated and free abelian. We construct the JSJ decomposition of a vGBS group over abelian groups. We prove that…
We consider the embedding problem in coding theory: given an independence (a code-related property) and an independent language $L$, find a maximal independent language containing $L$. We consider the case where the code-related property is…
We construct new examples of non-nil algebras with any number of generators, which are direct sums of two locally nilpotent subalgebras. As all previously known examples, our examples are contracted semigroup algebras and the underlying…
We study subsets of groups and monoids defined by language-theoretic means, generalizing the classical approach to the word problem. We expand on results by Herbst from 1991 to a more general setting, and for a class of languages…
We show that a finitely generated subgroup of a free group, chosen uniformly at random, is strictly Whitehead minimal with overwhelming probability. Whitehead minimality is one of the key elements of the solution of the orbit problem in…
Among the various forms of reasoning studied in the context of artificial intelligence, qualitative reasoning makes it possible to infer new knowledge in the context of imprecise, incomplete information without numerical values. In this…
Models of a generalized nondeterminism are defined by limitations on nonde- terministic behavior of a computing device. A regular realizability problem is a problem of verifying existence of a special sort word in a regular language. These…
Let E be a number field and G be a finite group. Let A be any O_E-order of full rank in the group algebra E[G] and X be a (left) A-lattice. In a previous article, we gave a necessary and sufficient condition for X to be free of given rank d…
Group languages are regular languages recognized by finite groups, or equivalently by finite automata in which each letter induces a permutation on the set of states. We investigate the separation problem for this class of languages: given…
Much work has been done to study groups with few rational conjugacy classes or few rational irreducible characters. In this paper we look at the opposite extreme. Let $G$ be a finite group. Given a conjugacy class $K$ of $G$, we say it is…
This paper describes a new approach to the problem of the structural research of clusters based on the theory of geodetic and k-geodetic graphs. We firmly believe that this same approach can be used when solving problems of correlation…
The study of word hyperbolic groups is a prominent topic in geometric group theory; however word hyperbolic groups are defined by a geometric condition which does not extend naturally to semigroups. We propose a linguistic definition.…