English
Related papers

Related papers: Extensions of Abelian Automata Groups

200 papers

In this paper, we study the class of affine semigroup generated by integral vectors, whose components are in generalised arithmetic progression and we observe that the defining ideal is determinantal. We also give a sufficient condition on…

Commutative Algebra · Mathematics 2023-05-16 Joydip Saha , Indranath Sengupta , Pranjal Srivastava

We study configurations of $n$ points and $n$ lines that form $\Theta(n^{4/3})$ incidences, when the point set is a Cartesian product. We prove structural properties of such configurations, such that there exist many families of parallel…

Combinatorics · Mathematics 2022-10-11 Adam Sheffer , Olivine Silier

Combinatorial objects such as rooted trees that carry a recursive structure have found important applications recently in both mathematics and physics. We put such structures in an algebraic framework of operated semigroups. This framework…

Rings and Algebras · Mathematics 2013-02-05 Li Guo

Let G be a finite group of complex n by n unitary matrices generated by reflections acting on C^n. Let R be the ring of invariant polynomials, and \chi be a multiplicative character of G. Let \Omega^\chi be the R-module of \chi-invariant…

Rings and Algebras · Mathematics 2007-05-23 Anne V. Shepler

Let L:= Z^D be the D-dimensional lattice and let A^L be the Cantor space of L-indexed configurations in some finite alphabet A, with the natural L-action by shifts. A `cellular automaton' is a continuous, shift-commuting self-map F of A^L,…

Dynamical Systems · Mathematics 2009-09-29 Marcus Pivato

We study integrability properties of a reversible deterministic cellular automaton (the rule 54 of [Bobenko et al., Commun. Math. Phys. 158, 127 (1993)]) and present a bulk algebraic relation and its inhomogeneous extension which allow for…

Statistical Mechanics · Physics 2017-10-11 Tomaz Prosen , Berislav Buca

This thesis studies the single-use restriction for register automata and transducers over infinite alphabets. The restriction requires that a read-access to a register should have the side effect of destroying its contents. This constraint…

Formal Languages and Automata Theory · Computer Science 2024-06-28 Rafał Stefański

The paper deals with Henselian valued field with analytic structure. Actually, we are focused on separated analytic structures, but the results remain valid for strictly convergent analytic ones as well. A classical example of the latter is…

Algebraic Geometry · Mathematics 2018-11-29 Krzysztof Jan Nowak

We prove that many dynamical properties of group cellular automata (i.e., cellular automata defined on any finite group and with global rule which is an endomorphism), including surjectivity, injectivity, sensitivity to initial conditions,…

Formal Languages and Automata Theory · Computer Science 2025-07-15 Niccolo' Castronuovo , Alberto Dennunzio , Luciano Margara

We consider a very simple Mealy machine (three states over a two-symbol alphabet), and derive some properties of the semigroup it generates. In particular, this is an infinite, finitely generated semigroup; we show that the growth function…

Group Theory · Mathematics 2009-11-27 Laurent Bartholdi , Illya I. Reznykov

We partition in classes the set of matroids of fixed dimension on a fixed vertex set. In each class we identify two special matroids, respectively with minimal and maximal h-vector in that class. Such extremal matroids also satisfy a…

Commutative Algebra · Mathematics 2012-12-17 Alexandru Constantinescu , Matteo Varbaro

We prove that a semigroup generated by a reversible two-state Mealy automaton is either finite or free of rank 2. This fact leads to the decidability of finiteness for groups generated by two-state or two-letter invertible-reversible Mealy…

Formal Languages and Automata Theory · Computer Science 2013-10-23 Ines Klimann

Abstract algebra provides a large hierarchy of properties that a collection of objects can satisfy, such as forming an abelian group or a semiring. These classifications can arranged into a broad and typically acyclic directed graph. This…

Logic in Computer Science · Computer Science 2023-07-24 Eric Wieser

We analyze statistical properties of the complex system with conditions which manifests through specific constraints on the column/row sum of the matrix elements. The presence of additional constraints besides symmetry leads to new…

Statistical Mechanics · Physics 2015-10-28 Pragya Shukla , Suchetana Sadhukhan

The Abelian Sandpile Model, seen as a deterministic lattice automaton, on two-dimensional periodic graphs generates complex regular patterns displaying (fractal) self-similarity. In particular, on a variety of lattices and initial…

Statistical Mechanics · Physics 2015-11-12 Sergio Caracciolo , Guglielmo Paoletti , Andrea Sportiello

Many decision problems concerning cellular automata are known to be decidable in the case of algebraic cellular automata, that is, when the state set has an algebraic structure and the automaton acts as a morphism. The most studied cases…

Formal Languages and Automata Theory · Computer Science 2023-01-27 Pierre Béaur , Jarkko Kari

We study trees where each successor set is equipped with some additional structure. We introduce a family of automaton models for such trees and prove their equivalence to certain fixed-point logics. As a consequence we obtain…

Logic in Computer Science · Computer Science 2025-02-24 Achim Blumensath

We derive the generalized partial wave expansion for $M \rightarrow N$ scattering amplitude in terms of spinor helicity variables. The basis amplitudes of the expansion with definite angular momentum $j$ consist of the Poincare…

High Energy Physics - Phenomenology · Physics 2021-01-13 Minyuan Jiang , Jing Shu , Ming-Lei Xiao , Yu-Hui Zheng

The components of K*-vectors associated to a simple oriented matroid M are the numbers of general or special tope committees for M. Using the principle of inclusion-exclusion, we determine how the reorientations of M on one-element subsets…

Combinatorics · Mathematics 2010-10-19 Andrey O. Matveev

We introduce and characterize various gluing constructions for residuated lattices that intersect on a common subreduct, and which are subalgebras, or appropriate subreducts, of the resulting structure. Starting from the 1-sum construction…

Logic · Mathematics 2023-06-02 Nick Galatos , Sara Ugolini