Related papers: On the group of a rational maximal bifix code

For affine symmetric groups we construct finite $W$-graphs corresponding to two-row shapes, and prove their uniqueness. This gives the first non-trivial family of examples of finite $W$-graphs in an affine type. We compare our construction…

We consider maps between commutative groups and their functional degrees. These degrees are defined based on a simple idea -- the functional degree should decrease if a discrete derivative is taken. We show that the maps of finite…

We study the problem of realizing families of subgroups as the set of stabilizers of configurations from a subshift of finite type (SFT). This problem generalizes both the existence of strongly and weakly aperiodic SFTs. We show that a…

We prove that, given a torsion-free relatively hyperbolic group G with non-relatively-hyperbolic peripherals, isomorphic finite index subgroups of G have the same index. This applies for instance to fundamental groups of finite-volume…

We study in detail the profinite group G arising as geometric \'etale iterated monodromy group of an arbitrary quadratic polynomial over a field of characteristic different from two. This is a self-similar closed subgroup of the group of…

In recent years codes that are not Uniquely Decipherable (UD) are been studied partitioning them in classes that localize the ambiguities of the code. A natural question is how we can extend the notion of maximality to codes that are not…

Given a group word $w$ and a group $G$, the set of $w$-values in $G$ is denoted by $G_w$ and the verbal subgroup $w(G)$ is the one generated by $G_w$. In the present paper we consider profinite groups admitting a word $w$ such that the…

Let $G$ be a residually finite, good group of finite virtual cohomological dimension. We prove that the natural monomorphism $G\hookrightarrow\hat{G}$ induces a bijective correspondence between conjugacy classes of finite $p$-subgroups of…

Let $\Phi:F\rightarrow F$ be an automorphism of the finite-rank free group $F$. Suppose that $G=F\rtimes_\Phi\mathbb Z$ is word-hyperbolic. Then $G$ acts freely and cocompactly on a CAT(0) cube complex.

Assuming that every set is constructible, we find a $\Pi^1_1$ maximal cofinitary group of permutations of $\mathbb N$ which is indestructible by Cohen forcing. Thus we show that the existence of such groups is consistent with arbitrarily…

Symmetric fix-free codes are prefix condition codes in which each codeword is required to be a palindrome. Their study is motivated by the topic of joint source-channel coding. Although they have been considered by a few communities they…

The word problem for Thompson's group $F$ has a solution, but it remains unknown whether $F$ is automatic or has a finite or regular convergent (terminating and confluent) rewriting system. We show that the group $F$ admits a natural…

We prove that every proper subclass of the 321-avoiding permutations that is defined either by only finitely many additional restrictions or is well quasi-ordered has a rational generating function. To do so we show that any such class is…

We prove that the isomorphism problem for finitely generated fully residually free groups is decidable. We also show that each finitely generated fully residually free group G has a decomposition that is invariant under automorphisms of G,…

We show that a compact group $G$ has finite conjugacy classes, i.e., is an FC-group if and only if its center $Z(G)$ is open if and only if its commutator subgroup $G'$ is finite. Let $d(G)$ denote the Haar measure of the set of all pairs…

We describe finite soluble groups in which every $n$-maximal subgroup is $\mathfrak F$-subnormal.

In the paper we investigate the semigroup of monotone co-finite partial homeomorphisms of the space of the usual real line $\mathbb{R}$. We prove that the inverse semigroup $\mathscr{P\!\!H}^+_{\!\!\operatorname{\textsf{cf}}}\!(\mathbb{R})$…

This note contains a report of a proof by computer that the Fibonacci group F(2,9) is automatic. The automatic structure can be used to solve the word problem in the group. Furthermore, it can be seen directly from the word-acceptor that…

Let $G$ be the fundamental group of a graph of finitely generated virtually free groups with virtually cyclic edge groups. We shaw that $G$ is cohomologically good if $G$ is residually finite. If $G$ is LERF, we prove that G splits…

A self-similar group of finite type is the profinite group of all automorphisms of a regular rooted tree that locally around every vertex act as elements of a given finite group of allowed actions. We provide criteria for determining when a…