English
Related papers

Related papers: F-sets and finite automata

200 papers

In this paper, we extend the classical arithmetic defined over the set of natural numbers N, to the set of all finite directed connected multigraphs having a pair of distinct distinguished vertices. Specifically, we introduce a model F on…

Combinatorics · Mathematics 2009-09-29 Bilal Khan , Kiran R. Bhutani , Delaram Kahrobaei

This is Chapter 24 in the "AutoMathA" handbook. Finite automata have been used effectively in recent years to define infinite groups. The two main lines of research have as their most representative objects the class of automatic groups…

Formal Languages and Automata Theory · Computer Science 2015-03-17 Laurent Bartholdi , Pedro V. Silva

In a previous article, we extended the notion of ergodic optimization to the setting of C*-dynamical systems of countable discrete groups. Among the key results of that paper was that given an action $G \stackrel{\Xi}{\curvearrowright}…

Operator Algebras · Mathematics 2021-09-30 Aidan Young

Let $k$ be a finitely generated field, let $X$ be an algebraic variety and $G$ a linear algebraic group, both defined over $k$. Suppose $G$ acts on $X$ and every element of a Zariski-dense semigroup $\Gamma \subset G(k)$ has a rational…

Number Theory · Mathematics 2007-08-16 Pietro Corvaja

Given a dense additive subgroup $G$ of $\mathbb R$ containing $\mathbb Z$, we consider its intersection $\mathbb G$ with the interval $[0,1[$ with the induced order and the group structure given by addition modulo $1$. We axiomatize the…

Logic · Mathematics 2017-07-20 Luc Bélair , Françoise Point

The Gruenberg-Kegel graph $\Gamma(G)$ associated with a finite group $G$ has as vertices the prime divisors of $|G|$, with an edge from $p$ to $q$ if and only if $G$ contains an element of order $pq$. This graph has been the subject of much…

Group Theory · Mathematics 2023-02-01 Peter J. Cameron , Natalia V. Maslova

This work introduces a new kind of affine semigroups called $P$-semigroups. Within the framework of $\mathcal C$-semigroups, we define a finite-state automaton associated to them. Moreover, this automaton determines whether a $\mathcal…

Commutative Algebra · Mathematics 2025-10-16 J. I. Farrán , J. C. Rosales , R. Tapia-Ramos , A. Vigneron-Tenorio

Generalizing the idea of self-similar groups defined by Mealy automata, we itroduce the notion of a self-similar automaton and a self-similar group over a changing alphabet. We show that every finitely generated residually-finite group is…

Group Theory · Mathematics 2016-07-27 Adam Woryna

In this note, we embed the set of all Fricke characters of a free group F -- the set of all characters of representations of F into SL(2,C) -- as an irreducible affine variety V in complex affine space of dimension 2^n-1. Using the Horowitz…

Differential Geometry · Mathematics 2007-05-23 Richard Brown

Ufnarovski remarked in 1990 that it is unknown whether any finitely presented associative algebra of linear growth is automaton, that is, whether the set of normal words in the algebra form a regular language. If the algebra is graded, then…

Rings and Algebras · Mathematics 2017-06-21 Dmitri Piontkovski

Let $G$ be a group. The intersection subgroup graph of $G$ (introduced by Anderson et al. \cite{anderson}) is the simple graph $\Gamma_{S}(G)$ whose vertices are those non-trivial subgroups say $H$ of $G$ with $H\cap K=\{e\}$ for some…

Combinatorics · Mathematics 2023-08-23 Santanu Mandal , Pallabi Manna

We generalize the notion of a graph automatic group introduced by Kharlampovich, Khoussainov and Miasnikov (arXiv:1107.3645) by replacing the regular languages in their definition with more powerful language classes. For a fixed language…

Group Theory · Mathematics 2014-06-06 Murray Elder , Jennifer Taback

Let F be a finitely generated field of characteristic zero and \Gamma<GL_n(F) a finitely generated subgroup. For an element g in \Gamma, let Gal(F(g)/ F) be the Galois group of the splitting field of the characteristic polynomial of g over…

Number Theory · Mathematics 2012-05-25 Alexander Lubotzky , Lior Rosenzweig

We characterize connected tetravalent graphs $\Gamma$ which admit groups $M<H$ of automorphisms such that $\Gamma$ is $M$-half-arc-transitive and $H$-arc-transitive. Examples for each case are constructed, including a counter-example to a…

Group Theory · Mathematics 2025-12-29 Yuandong Li , Binzhou Xia , Jin-Xin Zhou

Let us say that a Cayley graph $\Gamma$ of a group $G$ of order $n$ is a Cerny Cayley graph if every synchronizing automaton containing $\Gamma$ as a subgraph with the same vertex set admits a synchronizing word of length at most $(n-1)^2$.…

Combinatorics · Mathematics 2008-08-12 Benjamin Steinberg

The Mordell-Lang conjecture describes the intersection of a finitely generated subgroup with a closed subvariety of a semiabelian variety. Equivalently, this conjecture describes the intersection of closed subvarieties with the set of…

Number Theory · Mathematics 2013-10-09 Dragos Ghioca , Thomas J. Tucker , Michael E. Zieve

This article focuses on subset reachability in synchronizing automata. First, we provide families of synchronizing automata with subsets which cannot be reached with short words. These families do not fulfil Don's Conjecture about subset…

Formal Languages and Automata Theory · Computer Science 2018-05-08 François Gonze , Raphaël M. Jungers

Given a finitely generated group $\Gamma$, we study the space ${\rm Isom}(\Gamma,{\mathbb Q\mathbb U})$ of all actions of $\Gamma$ by isometries of the rational Urysohn metric space ${\mathbb Q\mathbb U}$, where ${\rm Isom}(\Gamma,{\mathbb…

Logic · Mathematics 2011-04-19 Christian Rosendal

Let k be an algebraically closed field of characteristic 0, let X=P^1\times A^N and let f be a rational endomorphism of X given by (x,y)--->(g(x), A(x)y), where g is a rational function, while A is an N-by-N matrix with entries in k(x). We…

Number Theory · Mathematics 2018-03-13 Dragos Ghioca , Junyi Xie , with an appendix written by Michael Wibmer

Let X be an affine irreducible variety over an algebraically closed field k of characteristic zero. Given an automorphism F, we denote by k(X)^F its field of invariants, i.e. the set of rational functions f on X such that f(F)=f. Let n(F)…

Algebraic Geometry · Mathematics 2007-05-23 Philippe Bonnet