Related papers: Trees of Fusion Systems

For a prime $p$, we describe a protocol for handling a specific type of fusion system on a $p$-group by computer. These fusion systems contain all saturated fusion systems. This framework allows us to computationally determine whether or…

We determine for which known finite simple groups $G$ and which primes $p$ the $p$-fusion system of $G$ is simple. This means first collecting together the results that were already known (and correcting two errors made in an earlier study…

We investigate the profinite completions of a certain family of groups acting on trees. It turns out that for some of the groups considered, the completions coincide with the closures of the groups in the full group of tree automorphisms.…

We show that the automorphism group of a linking system associated to a saturated fusion system $\mathcal{F}$ depends only on $\mathcal{F}$ as long as the object set of the linking system is $\mathrm{Aut}(\mathcal{F})$-invariant. This was…

Let $\mathcal F$ be a saturated fusion system on a finite $p$-group $S$, and let $P$ be a strongly $\mathcal F$-closed subgroup of $S$. We define the concept ``$\mathcal F$-essential subgroups with respect to $P$" which are some proper…

The theory of complex trees is introduced as a new approach to study a broad class of self-similar sets. Systems of equations encoded by complex trees tip-to-tip equivalence relations are used to obtain one-parameter families of connected…

Tangle-tree theorems are an important tool in structural graph theory, and abstract separation systems are a very general setting in which tangle-tree theorems can still be formulated and proven. For infinite abstract separation systems, so…

A few notes about infinite trees in a descriptive set-theoretic setting.

For a finite group G of Lie type and a prime p, we compare the automorphism groups of the fusion and linking systems of G at p with the automorphism group of G itself. When p is the defining characteristic of G, they are all isomorphic,…

To any block idempotent $b$ of a group algebra $kG$ of a finite group $G$ over a field $k$ of characteristic $p>0$, Puig associated a fusion system and proved that it is saturated if the $k$-algebra $kC_G(P)e$ is split, where $(P,e)$ is a…

We give a definition of topological entropy for tree shifts, prove that the limit in the definition exists, and show that it dominates the topological entropy of the associated one-dimensional shift of finite type when the labeling of the…

Fusion is a common tool for the analysis and utilization of available datasets and so an essential part of data mining and machine learning processes. However, a clear definition of the type of fusion is not always provided due to…

The theory of saturated fusion systems resembles in many parts the theory of finite groups. However, some concepts from finite group theory are difficult to translate to fusion systems. For example, products of normal subsystems with other…

We identify the complexity of the classification problem for automorphisms of a given countable regularly branching tree up to conjugacy. We consider both the rooted and unrooted cases. Additionally, we calculate the complexity of the…

This paper introduces the notion of fusion action system, an abstraction of the $p$-local data of a finite group acting on a finite set. Fusion action systems are closely connected with the theory of fusion systems; we detail the…

We develop a purely set-theoretic formalism for binary trees and binary graphs. We define a category of binary automata, and display it as a fibred category over the category of binary graphs. We also relate the notion of binary graphs to…

Trees are partial orders in which every element has a linearly ordered set of predecessors. Here we initiate the exploration of the structural theory of trees with the study of different notions of \emph{branching in trees} and of…

Phylogenetic networks are a generalisation of phylogenetic trees that allow for more complex evolutionary histories that include hybridisation-like processes. It is of considerable interest whether a network can be considered `tree-like' or…

We generalise the construction of infinite matroids from trees of matroids to allow the matroids at the nodes, as well as the field over which they are represented, to be infinite.

We prove that given a fixed finite tree $P$, almost all trees contain $P$ as a subtree. Moreover, the inclusion can be made so that it induces an embedding of the corresponding (quantum) automorphism groups, thereby providing generic…