The Higman-Thompson groups, their generalisations, and automorphisms of shift spaces

希格曼-汤普森群、它们的概括以及移位空间的自同构

• 批准号: EP/X02606X/1
• 负责人: Feyisayo Olukoya
• 金额: $ 38.01万
• 依托单位: University of St Andrews
• 依托单位国家: 英国
• 项目类别: Fellowship
• 财政年份: 2024
• 资助国家: 英国
• 起止时间: 2024 至 无数据
• 项目状态: 未结题
• 来源: https://gtr.ukri.org/projects?ref=EP%2FX02606X%2F1
• 关键词: Higman; Thompson; groups; their; generalisations

The primary objective of the proposed research is to further explore a new and important connection between group theory, combinatorics and dynamical systems. Our research build upon techniques and methodology arising in several articles of the PI and collaborators some of which have been supported by EPSRC grant EP/R032866/1. We explain broadly what each of these areas are, and, then we say how our research relates to them.Group theory is an area of crucial importance in algebra and arguably arose from the quest to find solutions of polynomial equations of degree higher than 4. The defining characteristic of groups, the objects of study in group theory, is as a means of abstracting the inherent symmetry in a structure. For example, returning to the solutions of polynomial equations, groups arose via an understanding of the symmetry in the set of solutions to a given polynomial equation; the symmetries of a geometric object such as a square, or a circle also form a group. One might consider more complicated objects, for example fractal structures which have fine detail at infinitely small scales. More generally if one considers the collection of reversible transformations of an object which preserves some inherent structure one obtains a group. In our research we are interested in the Higman-Thompson groups which arise as symmetries of the Cantor space --- a fractal space.Group theory and combinatorics are intertwined areas of research. In our research, the connection to combinatorics is by transducers. These are finite state machines with fixed alphabet --- a given state of such a machine will read-in a symbol from the alphabet, possibly transition to a different state, and will output a symbol or string from the alphabet. One can imagine that the set of transducers which transform strings of a given alphabet in a reversible way gives rise to a group. A historical example of a transducer is the enigma machine --- a cipher device.Dynamics typically involves the study of long-term trends in the evolution of a system. Day-to-day examples of dynamical systems arise from the weather and the stock-market. Most dynamical systems can be studied in a symbolic way --- giving rise to the fundamental area of symbolic dynamics. This is our point of contact. We are interested in the shift dynamical system: this is an easily described symbolic dynamical system with numerous interesting features including chaos. One considers a fixed alphabet, and the collection of all bi-infinite (extending left and right) sequences over this alphabet. The shift map simply shifts all symbols of a given bi-infinite sequence one index to the left. Groups arise by considering reversible transformations of the space of infinite sequences which are invariant under the action of the shift map --- that is one cannot distinguish between the distinct processes of first applying the shift map and then such a transformation and applying the shift map first before applying the transformation. These are the so called groups of automorphisms of the shift dynamical system and are useful in understanding local dynamics of the system. Our research arises from the recent resolution, by the PI and collaborators, of the 20 year old problem of characterising the automorphism groups (group of symmetries) of the Higman-Thompson groups. The key insight was that these groups can be described by transducers which possess a synchronization property. This property means that under certain conditions automorphisms of the Higman-Thompson groups give rise to automorphisms of the shift dynamical system. One can go in the other direction -- automorphisms of the shift dynamical system give rise to automorphisms of the Higman Thompson groups. Our research aims, building on previous work, to further explore this new-found connection: expanding techniques and methodology across both fields, to shed further light on these areas of research.

拟议研究的主要目标是进一步探索群论，组合学和动力系统之间的新的和重要的联系。我们的研究建立在PI和合作者的几篇文章中出现的技术和方法的基础上，其中一些文章得到了EPSRC资助EP/R 032866/1的支持。我们大致解释了这些领域是什么，然后我们说我们的研究如何涉及到them.Group理论是一个领域的至关重要的代数和可以说是从寻求解决方案的多项式方程的程度高于4。群的定义性特征，即群论的研究对象，是作为抽象结构中固有对称性的一种手段。例如，回到多项式方程的解，群是通过对给定多项式方程的解集合的对称性的理解而产生的;几何对象（如正方形或圆形）的对称性也形成群。人们可以考虑更复杂的对象，例如在无限小尺度上具有精细细节的分形结构。更一般地说，如果考虑一个对象的可逆变换的集合，它保留了某些固有的结构，则得到一个群。在我们的研究中，我们感兴趣的是Higman-Thompson群，它是作为Cantor空间--一个分形空间的对称性而出现的。群论和组合学是相互交织的研究领域。在我们的研究中，与组合学的联系是通过传感器。这些是具有固定字母表的有限状态机-这种机器的给定状态将从字母表中读入符号，可能转换到不同的状态，并将从字母表中输出符号或字符串。可以想象，以可逆方式变换给定字母表的字符串的换能器集合产生一个群。转换器的一个历史例子是恩尼格玛机--一种密码装置。动力学通常涉及对系统演化的长期趋势的研究。动力系统的日常例子来自天气和股票市场。大多数动力系统可以用符号的方法来研究-这就产生了符号动力学的基本领域。这是我们的联络点我们感兴趣的是移位动力系统：这是一个容易描述的符号动力系统，具有许多有趣的特征，包括混沌。一个考虑一个固定的字母表，和所有双无限（左和右延伸）序列在这个字母表的集合。移位映射简单地将给定双无限序列的所有符号向左移位一个索引。群是通过考虑无限序列空间的可逆变换而产生的，这些序列在移位映射的作用下是不变的-也就是说，人们无法区分首先应用移位映射然后进行这样的变换和在应用变换之前首先应用移位映射的不同过程。这些是所谓的移位动力系统的自同构群，对于理解系统的局部动力学是有用的。我们的研究源于最近的决议，由PI和合作者，20岁的问题的特点的自同构群（组的对称性）的Higman-Thompson群。关键的见解是，这些群体可以描述的传感器具有同步性能。这个性质意味着在一定条件下，Higman-Thompson群的自同构会引起移位动力系统的自同构。人们可以在另一个方向--移位动力系统的自同构产生Higman Thompson群的自同构。我们的研究目标是，在以前工作的基础上，进一步探索这种新发现的联系：在这两个领域扩展技术和方法，进一步阐明这些研究领域。