English
Related papers

Related papers: Groups generated by 3-state automata over a 2-lett…

200 papers

Operators acting on the discrete random chaos yield signed multiplicative systems, extending the notion of spin matrices and quaternions. We investigate signed groups through the associated sign matrices, focusing on generators and their…

Rings and Algebras · Mathematics 2017-05-29 Jerzy Szulga

Results of our previous note, "Gerbes of chiral differential operators" (Math. Res. Letters, 7(2000), 55-66), are discussed in the algebraic category.

Algebraic Geometry · Mathematics 2007-05-23 Vassily Gorbounov , Fyodor Malikov , Vadim Schechtman

A finitely generated group is said to be an automata group if it admits a faithful self-similar finite-state representation on some regular $m$-tree. We prove that if $G$ is a subgroup of an automata group, then for each finitely generated…

Group Theory · Mathematics 2024-05-28 Alex C. Dantas , Junio R. Oliveira , Tulio M. G. Santos

Let $k\ge 2$. We prove that the characteristic sequence of a regular language over a $k$-letter alphabet is $k$-automatic. More generally, if $t\ge 2$ and $t,k$ are multiplicatively dependent, we show that the characteristic sequence of a…

Formal Languages and Automata Theory · Computer Science 2018-07-24 Michel Rigo , Robert Underwood

A (2,*)-group is a group that can be generated by two elements, one of which is an involution. We describe the method we have used to produce a census of all (2,*)-groups of order at most 6 000. Various well-known combinatorial structures…

Group Theory · Mathematics 2015-05-06 Primož Potočnik , Pablo Spiga , Gabriel Verret

We show that the first-order logical theory of the binary overlap-free words (and, more generally, the ${\alpha}$-free words for rational ${\alpha}$, $2 < {\alpha} \leq 7/3$), is decidable. As a consequence, many results previously obtained…

Formal Languages and Automata Theory · Computer Science 2022-09-08 L. Schaeffer , J. Shallit

We construct a 2-generated 2-related group without non-trivial finite factors. That answers a question of J. Button.

Group Theory · Mathematics 2007-05-23 A. Yu. Ol'shanskii , M. V. Sapir

We present logically based methods for constructing XP and FPT graph algorithms, parametrized by tree-width or clique-width. We will use fly-automata introduced in a previous article. They make possible to check properties that are not…

Logic in Computer Science · Computer Science 2015-12-21 Bruno Courcelle , Irène Durand

A description of group automorphisms of all two-dimensional algebras, considered up to isomorphism, over any basic field is provided.

Rings and Algebras · Mathematics 2024-11-19 Sh. Eshmirzayev , U. Bekbaev

We characterize the groups isomorphic to full automorphism groups of ordered abelian groups. The result will follow from classical theorems on ordered groups adding an argument from proofs used to realize rings as endomorphism rings of…

Logic · Mathematics 2007-05-23 Rüdiger Göbel , Saharon Shelah

In this paper, we compute the second homology groups of the automorphism group of a free group with coefficients in the abelianization of the free group and its dual group except for 2-torsion part, using combinatorial group theory.

Algebraic Topology · Mathematics 2012-05-21 Takao Satoh

Let $G$ be a finite almost simple group. It is well known that $G$ can be generated by 3 elements, and in previous work we showed that 6 generators suffice for all maximal subgroups of $G$. In this paper we consider subgroups at the next…

Group Theory · Mathematics 2016-11-21 Timothy C. Burness , Martin W. Liebeck , Aner Shalev

We construct a central extension of the group of automorphisms of a 2-Tate vector space viewed as a discrete 2-group. This is done using an action of this 2-group on a 2-gerbe of gerbel theories. This central extension is used to define…

Category Theory · Mathematics 2007-09-03 Sergey Arkhipov , Kobi Kremnizer

Let $T$ be a (first order complete) dependent theory, ${\mathfrak{C}}$ a $\bar\kappa$-saturated model of $T$ and $G$ a definable subgroup which is abelian. Among subgroups of bounded index which are the union of $<\bar\kappa$ type definable…

Logic · Mathematics 2021-09-15 Saharon Shelah

This is a translation. I have added translations for (possibly) outdated definitions in an appendix at the end. In this paper, we define distributive groups and show some properties of them. We then concern ourselves with the homogeinity of…

Group Theory · Mathematics 2026-05-19 C. Burstin , W. Mayer

Accessible groups for which the language of all words defining the identity is accepted by a certain class of nested stack automata are virtually free.

Group Theory · Mathematics 2007-05-23 Robert Gilman Michael Shapiro

We classify all subgroups of $SO(3)$ that are generated by two elements, each a rotation of finite order, about axes separated by an angle that is a rational multiple of $\pi$. In all cases we give a presentation of the subgroup. In most…

Group Theory · Mathematics 2018-07-11 Charles Radin , Lorenzo Sadun

In this article we consider two-way two-tape (alternating) automata accepting pairs of words and we study some closure properties of this model. Our main result is that such alternating automata are not closed under complementation for…

Formal Languages and Automata Theory · Computer Science 2017-10-03 Olivier Carton , Léo Exibard , Olivier Serre

We clarify the structure of subgroups generated by conjugate graph automorphisms of order $3$ of $O_8^+(2)$ and $O_8^+(3)$. As a result, we obtain a correction to a paper by S. Guest which, in turn, plays an important role in proving the…

Group Theory · Mathematics 2026-02-20 Danila O. Revin , Andrei V. Zavarnitsine

These lecture notes provide an introduction to automorphism groups of graphs. Some special families of graphs are then discussed, especially the families of Cayley graphs generated by transposition sets.

Discrete Mathematics · Computer Science 2012-06-28 Ashwin Ganesan
‹ Prev 1 4 5 6 7 8 10 Next ›