Related papers: Finitely and non-finitely related words
We explore finitely generated groups by studying the nilpotent towers and the various Lie algebras attached to such groups. Our main goal is to relate an isomorphism extension problem in the Postnikov tower to the existence of certain…
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…
We describe a finitary 2-monad on a locally finitely presentable 2-category for which not every pseudoalgebra is equivalent to a strict one. This shows that having rank is not a sufficient condition on a 2-monad for every pseudoalgebra to…
Nilpotent Leibniz algebras with isomorphic maximal subalgebras are considered. The algebras are classified for coclass zero, one, and two. The results are field dependent.
In this paper, we describe an algorithm for computing the left, right, or 2-sided congruences of a finitely presented semigroup or monoid with finitely many classes, and an alternative algorithm when the finitely presented semigroup or…
We prove that every clone of operations on a finite set A, if it contains a Malcev operation, is finitely related -- i.e., identical with the clone of all operations respecting R for some finitary relation R over A. It follows that for a…
We consider the class of finitely generated groups which have a normal form computable in logspace. We prove that the class of such groups is closed under finite extensions, finite index subgroups, direct products, wreath products, and also…
We characterize completey (give a necessary and suffcient condition using special neat embeddings)for a relation algebra to belong to the amalgamation, strong amalgamation, and superamalgamation base of the class of representable algebras.…
We consider the class of groups whose word problem is poly-context-free; that is, an intersection of finitely many context-free languages. We show that any group which is virtually a finitely generated subgroup of a direct product of free…
It is proved that for any natural number $n$ the subalgebra of a free finitely generated alternative algebra generated by all the words on generators whose length is a multiple of $n$ (the Veronese $n$-subalgebra), is finitely generated.
This paper contains the results collected so far on polynomial composites in terms of many basic algebraic properties. Since it is a polynomial structure, results for monoid domains come in here and there. The second part of the paper…
This paper investigates the class of finitely presented monoids defined by homogeneous (length-preserving) relations from a computational perspective. The properties of admitting a finite complete rewriting system, having finite derivation…
Rational relations are binary relations of finite words that are realised by non-deterministic finite state transducers (NFT). A particular kind of rational relations is the sequential functions. Sequential functions are the functions that…
An infinite structure has the finite length property (over a given field) if, for each of its finite powers, chains of equivariant subspaces in the corresponding free vector space are bounded in length. Prior work showed that the countable…
We explore a natural class of semigroups that have word problem decidable by finite state automata. Among the main results are invariance of this property under change of generators, invariance under basic algebraic constructions and…
We show that semi-infinite cohomology of a finite dimensional graded algebra (satisfying some additional requirements) are a particular case of a general categorical construction. The motivating example is provided by small quantum groups…
Generalising a recent work of Dequ\^ene et al. on the connection between perfectly clustering words and band bricks over a particular family of gentle algebras, we characterise band bricks over string algebras whose underlying quiver is…
Let $S$ be a submonoid of a free Abelian group of finite rank. We show that if $k$ is a field of prime characteristic such that the monoid $k$-algebra $k[S]$ is split $F$-regular, then $k[S]$ is a finitely generated $k$-algebra, or…
Profinite equations are an indispensable tool for the algebraic classification of formal languages. Reiterman's theorem states that they precisely specify pseudovarieties, i.e.~classes of finite algebras closed under finite products,…
A word is called closed if it has a prefix which is also its suffix and there is no internal occurrences of this prefix in the word. In this paper we study words that are rich in closed factors, i.e., which contain the maximal possible…