3 years ago

# Bounding the minimal number of generators of groups of cellular automata.

Alonso Castillo-ramirez, Miguel Sanchez-alvarez

For a group $G$ and a finite set $A$, denote by $\text{ICA}(G;A)$ the group of all invertible cellular automata over $A^G$. We study the minimal cardinality of a generating set, known as the rank, of $\text{ICA}(G;A)$. In the first part, when $G$ is a finite group, we give upper bounds for the rank in terms of the number of conjugacy classes of subgroups of $G$. The case when $G$ is a finite cyclic group has been studied before, so here we focus on the cases when $G$ is a finite dihedral group or a finite Dedekind group. In the second part, we find a basic lower bound for the rank of $\text{ICA}(G;A)$ when $G$ is a finite group, and we apply this to show that, for any infinite abelian group $H$, the group $\text{ICA}(H;A)$ is not finitely generated. The same is true for various kinds of infinite groups, so we ask if there exists an infinite group $H$ such that $\text{ICA}(H;A)$ is finitely generated.

Publisher URL: http://arxiv.org/abs/1901.02808

DOI: arXiv:1901.02808v1

You might also like
Discover & Discuss Important Research

Keeping up-to-date with research can feel impossible, with papers being published faster than you'll ever be able to read them. That's where Researcher comes in: we're simplifying discovery and making important discussions happen. With over 19,000 sources, including peer-reviewed journals, preprints, blogs, universities, podcasts and Live events across 10 research areas, you'll never miss what's important to you. It's like social media, but better. Oh, and we should mention - it's free.

Researcher displays publicly available abstracts and doesn’t host any full article content. If the content is open access, we will direct clicks from the abstracts to the publisher website and display the PDF copy on our platform. Clicks to view the full text will be directed to the publisher website, where only users with subscriptions or access through their institution are able to view the full article.