Related papers: Trees of Fusion Systems

Every two seeds in a field of fractions $\mathcal{F}$ together with a symmetric group element gives rise to an automorphism of $\mathcal{F}$ called an exchange automorphism. For positive cluster algebras, we provide equivalent conditions…

A bounded automorphism of a field or a group with trivial approximate centre is definable. In an expansion of a field by a Pfaffian family F of additive endomorphisms such that algebraic closure in the expansion coincides with relative…

We consider saturated fusion systems $\mathcal F$ on a Sylow $2$-subgroup of $\Omega^+_8(2)$ with $O_2(\mathcal F) = 1$. Examples for this are the $2$-fusion systems of $\Omega^+_8(2)$, $\Omega^+_8(2):3$, $P\Omega^+_8(3)$ and…

We consider certain groups of tree automorphisms as so-called diffeological groups. The notion of diffeology, due to Souriau, allows to endow non-manifold topological spaces, such as regular trees that we look at, with a kind of a…

The derivation trees of a tree adjoining grammar provide a first insight into the sentence semantics, and are thus prime targets for generation systems. We define a formalism, feature-based regular tree grammars, and a translation from…

Bounded infinite graphs are defined on the basis of natural physical requirements. When specialized to trees this definition leads to a natural conjecture that the average connectivity dimension of bounded trees cannot exceed two. We verify…

Given a graph, we can form a spanning forest by first sorting the edges in some order, and then only keep edges incident to a vertex which is not incident to any previous edge. The resulting forest is dependent on the ordering of the edges,…

Let G be group; a finite p-subgroup S of G is a Sylow p-subgroup if every finite p-subgroup of G is conjugate to a subgroup of S. In this paper, we examine the relations between the fusion system over S which is given by conjugation in G…

For a saturated fusion system $\mathcal F$ on a $p$-group $S$, we study the Burnside ring of the fusion system $B(\mathcal F)$, as defined by Matthew Gelvin and Sune Reeh, which is a subring of the Burnside ring $B(S)$. We give criteria for…

For a mixing shift of finite type, the associated automorphism group has a rich algebraic structure, and yet we have few criteria to distinguish when two such groups are isomorphic. We introduce a stabilization of the automorphism group,…

We prove that the group of automorphisms of the generic meet-tree expansion of an infinite non-unary free Fra\"{\i}ss\'{e} limit over a finite relational language is simple. As a prototypical case, the group of automorphism of the Rado…

This thesis (defended 10/07/2019) develops a theory of networks of hybrid open systems and morphisms. It builds upon a framework of networks of continuous-time open systems as product and interconnection. We work out categorical notions for…

We demonstrate the versatility of the tangle-tree duality theorem for abstract separation systems by using it to prove tree-of-tangles theorems. This approach allows us to strengthen some of the existing tree-of-tangles theorems by bounding…

Applications in many domains are based on a series of traversals of tree structures, and fusing these traversals together to reduce the total number of passes over the tree is a common, important optimization technique. In applications such…

We develop an extension of institution theory that accommodates implicitly the partiality of the signature morphisms and its syntactic and semantic effects. This is driven primarily by applications to conceptual blending, but other…

We characterize those countable rooted trees whose full automorphism group has uncountable strong cofinality or contains an open subgroup with ample generics.

We define sparse saturated fusion systems and show that, for odd primes, sparse systems are constrained. This simplifies the proof of the Glauberman-Thompson p-nilpotency theorem for fusion systems and a related theorem of Stellmacher. We…

The notion of transducer integer sequences is considered through a series of examples. By definition, transducer integer sequences are integer sequences produced, under a suitable interpretation, by finite automata encoding tree morphisms…

A method for creating a forest of model trees to fit samples of a function defined on images is described in several steps: down-sampling the images, determining a tree's hyperplanes, applying convolutions to the hyperplanes to handle small…

This paper investigates the finite generation of cluster automorphism groups. By applying the pseudo $\mathbb{N}$-grading introduced in our previous work, we establish a sufficient condition for a cluster automorphism group to be finitely…