English
Related papers

Related papers: Trees of Fusion Systems

200 papers

Consider an infinite tree. A hierarchomorphism (spheromorphism) is a homeomorphism of the absolute which can be extended to the tree except a finite subtree. Examples of groups of hierarchomorphisms: groups of locally analitic…

Representation Theory · Mathematics 2013-01-16 Yurii A. Neretin

A homogenizable structure $\mathcal{M}$ is a structure where we may add a finite amount of new relational symbols to represent some $\emptyset-$definable relations in order to make the structure homogeneous. In this article we will divide…

Logic · Mathematics 2018-02-09 Ove Ahlman

We compare four different types of realizability for saturated fusion systems over discrete $p$-toral groups. For example, when $G$ is a locally finite group all of whose $p$-subgroups are artinian (hence discrete $p$-toral), we show that…

Group Theory · Mathematics 2025-05-26 Carles Broto , Ran Levi , Bob Oliver

In this paper we study the cellularization of classifying spaces of saturated fusion systems with respect to classifying spaces of finite p-groups. We give explicit algebraic criteria to decide when a classifying space is cellular.…

Algebraic Topology · Mathematics 2026-03-03 Guille Carrión , Natàlia Castellana , Alberto Gavira-Romero

We construct a tree T of maximal degree 3 with infinitely many leaves such that whenever finitely many of them are removed, the remaining tree is isomorphic to T. In this sense T resembles an infinite star.

Combinatorics · Mathematics 2008-12-12 Mykhaylo Tyomkyn

We introduce the Insertion Chain Complex, a higher-dimensional extension of insertion graphs, as a new framework for analyzing finite sets of words. We study its topological and combinatorial properties, in particular its homology groups,…

Combinatorics · Mathematics 2025-09-17 Nataša Jonoska , Francisco Martinez-Figueroa , Masahico Saito

We define iterated monodromy groups of more general structures than partial self-covering. This generalization makes it possible to define a natural notion of a combinatorial model of an expanding dynamical system. We prove that a naturally…

Dynamical Systems · Mathematics 2019-02-20 Volodymyr Nekrashevych

We show that the question whether a term is typable is decidable for type systems combining inclusion polymorphism with parametric polymorphism provided the type constructors are at most unary. To prove this result we first reduce the…

Logic in Computer Science · Computer Science 2007-05-23 Sabine Glesner , Karl Stroetmann

We define the notions of a free fusion of structures and a weakly stationary independence relation. We apply these notions to prove simplicity for the automorphism groups of order and tournament expansions of homogeneous structures like the…

Group Theory · Mathematics 2021-04-13 Filippo Calderoni , Aleksandra Kwiatkowska , Katrin Tent

In order to speed-up classification models when facing a large number of categories, one usual approach consists in organizing the categories in a particular structure, this structure being then used as a way to speed-up the prediction…

Machine Learning · Computer Science 2015-11-26 Aurélia Léon , Ludovic Denoyer

We introduce bud generating systems, which are used for combinatorial generation. They specify sets of various kinds of combinatorial objects, called languages. They can emulate context-free grammars, regular tree grammars, and synchronous…

Combinatorics · Mathematics 2019-03-12 Samuele Giraudo

We construct analogs of the embedding of orthogonal and symplectic groups into unitary groups in the context of fusion categories. At least some of the resulting module categories also appear in boundary conformal field theory. We determine…

Operator Algebras · Mathematics 2011-08-09 Hans Wenzl

We propose a new arithmetic for non-empty rooted unordered trees simply called trees. After discussing tree representation and enumeration, we define the operations of tree addition, multiplication and stretch, prove their properties, and…

Discrete Mathematics · Computer Science 2016-02-02 Fabrizio Luccio

The focus of this paper is the analysis of real-time systems with recursion, through the development of good theoretical techniques which are implementable. Time is modeled using clock variables, and recursion using stacks. Our technique…

Formal Languages and Automata Theory · Computer Science 2017-07-11 S. Akshay , Paul Gastin , Shankara Narayanan Krishna , Ilias Sarkar

Imagine we want to split a group of agents into teams in the most \emph{efficient} way, considering that each agent has their own preferences about their teammates. This scenario is modeled by the extensively studied \textsc{Coalition…

Data Structures and Algorithms · Computer Science 2025-05-29 Foivos Fioravantes , Harmender Gahlawat , Nikolaos Melissinos

A priori, the set of birational transformations of an algebraic variety is just a group. We survey the possible algebraic structures that we may add to it, using in particular parametrised family of birational transformations.

Algebraic Geometry · Mathematics 2019-02-14 Jérémy Blanc

The visualization of an image collection is the process of displaying a collection of images on a screen under some specific layout requirements. This paper focuses on an important problem that is not well addressed by the previous methods:…

Multimedia · Computer Science 2016-11-15 Xintong Han , Chongyang Zhang , Weiyao Lin , Mingliang Xu , Bin Sheng , Tao Mei

We construct the $Z_{N}$ symmetry extended fusion ring of bulk and chiral theories and the corresponding modular partition functions with nonanomalous subgroup $Z_{n}(\subset Z_{N})$. The chiral fusion ring provides fundamental data for…

High Energy Physics - Theory · Physics 2026-05-20 Yoshiki Fukusumi , Shinichiro Yahagi

This is a long introduction to the theory of "branch groups": groups acting on rooted trees which exhibit some self-similarity features in their lattice of subgroups.

Group Theory · Mathematics 2009-11-27 Laurent Bartholdi , Rostislav I. Grigorchuk , Zoran Sunik

In this paper we look at the automorphisms of the multiplicative group of finite nearfields. We find partial results for the actual automorphism groups. We find counting techniques for the size of all finite nearfields. We then show that…

Rings and Algebras · Mathematics 2016-02-02 Tim Boykett , Karin-Therese Howell