Expansive Actions with Specification of Sofic Groups, Strong Topological Markov Property, and Surjunctivity
Total Page:16
File Type:pdf, Size:1020Kb
Load more
Recommended publications
-
Surjunctivity and Reversibility of Cellular Automata Over Concrete
SURJUNCTIVITY AND REVERSIBILITY OF CELLULAR AUTOMATA OVER CONCRETE CATEGORIES TULLIO CECCHERINI-SILBERSTEIN AND MICHEL COORNAERT Abstract. Following ideas developed by Misha Gromov, we investigate surjunctivity and reversibility properties of cellular automata defined over certain concrete categories. Dedicated to Alessandro Fig`aTalamanca 1. Introduction A cellular automaton is an abstract machine which takes as input a configuration of a universe and produces as output another configuration. The universe consists of cells and a configuration is described by the state of each cell of the universe. There is an input and an output state set and these two sets may be distinct. The state sets are also called the sets of colors, the sets of symbols, or the alphabets. The transition rule of a cellular automaton must obey two important properties, namely locality and time-independence. Locality means that the output state of a given cell only depends on the input states of a finite number of its neighboring cells possibly including the cell itself. In the present paper, we restrict ourselves to cellular automata for which the universe is a group. The cells are the elements of the group. If the input alphabet is denoted by A, the output alphabet by B, and the group by G, this means that a cellular automaton is given by a map τ : AG → BG, where AG := {x: G → A} is the set of all input configurations and BG := {y : G → B} is the set of all possible output configurations. Besides locality, we will also always require a symmetry condition for τ, namely that it commutes with the shift actions of G on AG and BG (see Section 2 for precise definitions). -
Springer Monographs in Mathematics for Further Volumes: Tullio Ceccherini-Silberstein R Michel Coornaert
Springer Monographs in Mathematics For further volumes: www.springer.com/series/3733 Tullio Ceccherini-Silberstein r Michel Coornaert Cellular Automata and Groups Tullio Ceccherini-Silberstein Michel Coornaert Dipartimento di Ingegneria Institut de Recherche Mathématique Avancée Università del Sannio Université de Strasbourg C.so Garibaldi 107 7 rue René-Descartes 82100 Benevento 67084 Strasbourg Cedex Italy France [email protected] [email protected] ISSN 1439-7382 ISBN 978-3-642-14033-4 e-ISBN 978-3-642-14034-1 DOI 10.1007/978-3-642-14034-1 Springer Heidelberg Dordrecht London New York Library of Congress Control Number: 2010934641 Mathematics Subject Classification (2010): 37B15, 68Q80, 20F65, 43A07, 16S34, 20C07 © Springer-Verlag Berlin Heidelberg 2010 This work is subject to copyright. All rights are reserved, whether the whole or part of the material is concerned, specifically the rights of translation, reprinting, reuse of illustrations, recitation, broadcasting, reproduction on microfilm or in any other way, and storage in data banks. Duplication of this publication or parts thereof is permitted only under the provisions of the German Copyright Law of September 9, 1965, in its current version, and permission for use must always be obtained from Springer. Violations are liable to prosecution under the German Copyright Law. The use of general descriptive names, registered names, trademarks, etc. in this publication does not imply, even in the absence of a specific statement, that such names are exempt from the relevant protective laws and regulations and therefore free for general use. Cover design: deblik Printed on acid-free paper Springer is part of Springer Science+Business Media (www.springer.com) To Katiuscia, Giacomo, and Tommaso To Martine and Nathalie Preface Two seemingly unrelated mathematical notions, namely that of an amenable group and that of a cellular automaton, were both introduced by John von Neumann in the first half of the last century. -
Open Problems
Open Problems In the list below we collect some open problems related to the topics treated in this book. (OP-1) Let G be an amenable periodic group which is not locally finite. Does there exist a finite set A and a cellular automaton τ : AG → AG which is surjective but not injective? (OP-2) Let G be a periodic group which is not locally finite and let A be an infinite set. Does there exist a bijective cellular automaton τ : AG → AG which is not invertible? (OP-3) Let G be a periodic group which is not locally finite and let V be an infinite-dimensional vector space over a field K. Does there exist a bijective linear cellular automaton τ : V G → V G which is not invertible? (OP-4) Is every Gromov-hyperbolic group residually finite (resp. residually amenable, resp. sofic, resp. surjunctive)? (OP-5) (Gottschalk’s conjecture) Is every group surjunctive? (OP-6) Let G be a periodic group which is not locally finite and let A be an infinite set. Does there exist a cellular automaton τ : AG → AG whose image τ(AG) is not closed in AG with respect to the prodiscrete topology? (OP-7) Let G be a periodic group which is not locally finite and let V be an infinite-dimensional vector space over a field K. Does there exist a linear cellular automaton τ : V G → V G whose image τ(V G)isnot closed in V G with respect to the prodiscrete topology? (OP-8) Let G and H be two quasi-isometric groups. -
Arxiv:2008.10565V2 [Math.GR] 26 Oct 2020 N Ftems Motn Lse Fgop Ngoercgopthe Group Geometric T in on Groups Life of a Classes Live Important Sofi Now Most Surjunctive
ON DUAL SURJUNCTIVITY AND APPLICATIONS MICHAL DOUCHA AND JAKUB GISMATULLIN Abstract. We explore the dual version of Gottschalk’s conjecture recently intro- duced by Capobianco, Kari, and Taati, and the notion of dual surjunctivity in general. We show that dual surjunctive groups satisfy Kaplansky’s direct finiteness conjecture for all fields of positive characteristic. By quantifying the notions of injectivity and post-surjectivity for cellular automata, we show that the image of the full topological shift under an injective cellular automaton is a subshift of finite type in a quantitative way. Moreover we show that dual surjunctive groups are closed under ultraproducts, under elementary equivalence, and under certain semidirect products (using the ideas of Arzhantseva and Gal for the latter); they form a closed subset in the space of marked groups, fully residually dual surjunctive groups are dual surjunctive, etc. We also consider dual surjunctive systems for more general dynamical systems, namely for certain expansive algebraic actions, employing results of Chung and Li. Contents Introduction 1 1. Post-surjectivity and pre-injectivity 3 2. More observations on injectivity and post-surjectivity 5 3. Dual surjunctive groups and ultraproducts 8 4. Direct finiteness conjecture 12 5. Metric direct finiteness conjecture 13 6. Expansive dynamical systems 16 References 19 Introduction In the beginning of the 1970s, W. Gottschalk introduced the following notion. Let G be a group and A a finite set, and let us consider the topological Bernoulli shift G y AG. arXiv:2008.10565v2 [math.GR] 26 Oct 2020 If any injective, continuous, and G-equivariant map T : AG → AG is also surjective, then G is called surjunctive. -
A Koksma–Hlawka Inequality for Simplices
Springer INdAM Series Volum e 3 Editor-in-Chief V. Ancona Series Editors P. Cannarsa C. Canuto G. Coletti P. Marcellini G. Patrizio T. Ruggeri E. Strickland A. Verra For further volumes: www.springer.com/series/10283 Massimo A. Picardello Editor Trends in Harmonic Analysis Editor Massimo A. Picardello Dipartimento di Matematica Università di Roma “Tor Vergata” Rome, Italy ISSN 2281-518X ISSN 2281-5198 (electronic) Springer INdAM Series ISBN 978-88-470-2852-4 ISBN 978-88-470-2853-1 (eBook) DOI 10.1007/978-88-470-2853-1 Springer Milan Heidelberg New York Dordrecht London Library of Congress Control Number: 2012948292 © Springer-Verlag Italia 2013 This work is subject to copyright. All rights are reserved by the Publisher, whether the whole or part of the material is concerned, specifically the rights of translation, reprinting, reuse of illustrations, recitation, broadcasting, reproduction on microfilms or in any other physical way, and transmission or information storage and retrieval, electronic adaptation, computer software, or by similar or dissimilar methodology now known or hereafter developed. Exempted from this legal reservation are brief excerpts in connection with reviews or scholarly analysis or material supplied specifically for the purpose of being entered and executed on a computer system, for exclusive use by the purchaser of the work. Duplication of this publication or parts thereof is permitted only under the provisions of the Copyright Law of the Publisher’s location, in its current version, and permission for use must always be obtained from Springer. Permissions for use may be obtained through RightsLink at the Copyright Clearance Center.