English
Related papers

Related papers: Cayley automaton semigroups

200 papers

A characterization of congruences in free semigroups is presented.

General Mathematics · Mathematics 2008-10-20 Elemer E Rosinger

In this paper, we investigate some characteristic features of holomorphic semigroups. In particular, we investigate nice examples of holomorphic semigroups whose every left or right ideal includes minimal ideal. These examples are compact…

Dynamical Systems · Mathematics 2019-01-23 Bishnu Hari Subedi

We introduce the inverse monoid of inner partial automorphisms of a semigroup -- a tool that associates to every semigroup an inverse semigroup. When the semigroup is a group, this inverse semigroup is isomorphic to the group of inner…

Since first introduced by John von Neumann, the notion of cellular automaton has grown into a key concept in computer science, physics and theoretical biology. In its classical setting, a cellular automaton is a transformation of the set of…

Group Theory · Mathematics 2017-01-24 Alonso Castillo-Ramirez , Maximilien Gadouleau

Every semigroup which is a finite disjoint union of copies of the free monogenic semigroup (natural numbers under addition) is finitely presented and residually finite.

Group Theory · Mathematics 2013-01-07 N. Abu-Ghazalh , Nik Ruskuc

A classification is given for factorizations of almost simple groups with at least one factor solvable, and it is then applied to characterize $s$-arc-transitive Cayley graphs of solvable groups, leading to a striking corollary: Except the…

Group Theory · Mathematics 2016-02-29 Cai Heng Li , Binzhou Xia

Motivated by recent appearance of multivalued structures in categorification, tropical geometry and other areas, we study basic properties of abstract multisemigroups. We give many new and old examples and general constructions for…

Group Theory · Mathematics 2017-05-10 Ganna Kudryavtseva , Volodymyr Mazorchuk

The cyclic graph $\Gamma(S)$ of a semigroup $S$ is the simple graph whose vertex set is $S$ and two vertices $x, y$ are adjacent if the subsemigroup generated by $x$ and $y$ is monogenic. In this paper, we classify the semigroup $S$ such…

Group Theory · Mathematics 2021-10-04 Sandeep Dalal , Jitender Kumar , Siddharth Singh

We characterize left and right amenable semigroups of polynomials of one complex variable with respect to the composition operation. We also prove a number of results about amenable semigroups of arbitrary rational functions. In particular,…

Dynamical Systems · Mathematics 2021-08-25 Fedor Pakovich

Given a group $G$ and a subset $X \subset G$, an element $g \in G$ is called quasi-positive if it is equal to a product of conjugates of elements in the semigroup generated by $X$. This notion is important in the context of braid groups,…

Group Theory · Mathematics 2019-01-30 Robert W. Bell , Rita Gitik

A Cayley graph of a group $H$ is a finite simple graph $\Gamma$ such that ${\rm Aut}(\Gamma)$ contains a subgroup isomorphic to $H$ acting regularly on $V(\Gamma)$, while a Haar graph of $H$ is a finite simple bipartite graph $\Sigma$ such…

Combinatorics · Mathematics 2017-07-12 Yan-Quan Feng , Istvan Kovacs , Da-Wei Yang

We study infinite groups interpretable in power bounded $T$-convex, $V$-minimal or $p$-adically closed fields. We show that if $G$ is an interpretable definably semisimple group (i.e., has no definable infinite normal abelian subgroups)…

Logic · Mathematics 2025-08-06 Yatir Halevi , Assaf Hasson , Ya'acov Peterzil

A graph $\Ga=(V,E)$ is called a Cayley graph of some group $T$ if the automorphism group $\Aut(\Ga)$ contains a subgroup $T$ which acts on regularly on $V$. If the subgroup $T$ is normal in $\Aut(\Ga)$ then $\Ga$ is called a normal Cayley…

Group Theory · Mathematics 2021-04-01 Jing Jian Li , Zai Ping Lu

Let $S$ be a cancellative left-amenable semigroup and let $A$ be a finite set. We prove that every pre-injective cellular automaton $\tau \colon A^S \to A^S$ is surjective.

Dynamical Systems · Mathematics 2015-05-06 Tullio Ceccherini-Silberstein , Michel Coornaert

A complete deterministic finite automaton in which every non-empty subset of the state set occurs as the image of the whole state set under the action of a suitable input word is called completely reachable. We characterize completely…

Formal Languages and Automata Theory · Computer Science 2018-05-09 Eugenija Bondar , Mikhail Volkov

We classify the pairs $(C,G)$ where $C$ is a seminormal curve over an arbitrary field $k$ and $G$ is a smooth connected algebraic group acting faithfully on $C$ with a dense orbit, and we determine the equivariant Picard group of $C$. We…

Algebraic Geometry · Mathematics 2017-03-29 Bruno Laurent

We prove that a connected, locally finite, quasi-transitive graph which is quasi-isometric to a planar graph is necessarily accessible. This leads to a complete classification of the finitely generated groups which are quasi-isometric to…

Group Theory · Mathematics 2026-05-14 Joseph Paul MacManus

We prove that every right-angled Artin group occurs as a finite-index subgroup of the outer automorphism group of another right-angled Artin group. We furthermore show that the latter group can be chosen in such a way that the quotient is…

Group Theory · Mathematics 2024-03-14 Manuel Wiedmer

A graph $\Gamma$ is a bi-Cayley graph over a group $G$ if $G$ is a semiregular group of automorphisms of $\Gamma$ having two orbits. Let $G$ be a non-abelian metacyclic $p$-group for an odd prime $p$, and let $\Gamma$ be a connected…

Combinatorics · Mathematics 2017-07-11 Yi Wang , Yan-Quan Feng

In an earlier work, the author observed that Boolean inverse semi-groups, with semigroup homomorphisms preserving finite orthogonal joins, form a congruence-permutable variety of algebras, called biases. We give a full description of…

Group Theory · Mathematics 2016-10-25 Friedrich Wehrung