Polycyclic, metabelian or soluble of type (FP)∞ groups with boolean algebra of rational sets and biautomatic soluble groups are virtually abelian

Abstract

Let G be a polycyclic, metabelian or soluble of type (FP)∞ group such that the class Rat(G) of all rational subsets of G is a boolean algebra. Then G is virtually abelian. Every soluble biautomatic group is virtually abelian.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…