English
Related papers

Related papers: Trees of Fusion Systems

200 papers

We say that a fusion system is the composition product of two subsystems if every morphism can be factored as a morphism in one fusion system followed by a morphism in the other. We establish a relationship between the characteristic…

Representation Theory · Mathematics 2011-02-28 Sejong Park , Kári Ragnarsson , Radu Stancu

Tree sets are posets with additional structure that generalize tree-like objects in graphs, matroids, or other combinatorial structures. They are a special class of abstract separation systems. We study infinite tree sets and how they…

Combinatorics · Mathematics 2025-05-16 Jay Lilian Kneip

We study an abstract notion of tree structure which lies at the common core of various tree-like discrete structures commonly used in combinatorics: trees in graphs, order trees, nested subsets of a set, tree-decompositions of graphs and…

Combinatorics · Mathematics 2017-02-28 Reinhard Diestel

A saturated fusion system over a finite $p$-group $S$ is a category whose objects are the subgroups of $S$ and whose morphisms are injective homomorphisms between the subgroups satisfying certain axioms. A fusion system over $S$ is realized…

Group Theory · Mathematics 2023-07-13 Carles Broto , Jesper Møller , Bob Oliver , Albert Ruiz

Tree sets are abstract structures that can be used to model various tree-shaped objects in combinatorics. Finite tree sets can be represented by finite graph-theoretical trees. We extend this representation theory to infinite tree sets.…

Combinatorics · Mathematics 2025-05-16 J. Pascal Gollin , Jay Lilian Kneip

We define here two new classes of saturated fusion systems, reduced fusion systems and tame fusion systems. These are motivated by our attempts to better understand and search for exotic fusion systems: fusion systems which are not the…

Algebraic Topology · Mathematics 2014-02-26 Kasper K. S. Andersen , Bob Oliver , Joana Ventura

Linking systems were introduced to provide algebraic models for $p$-completed classifying spaces of fusion systems. Every linking system over a saturated fusion system $\mathcal{F}$ corresponds to a group-like structure called a locality.…

Group Theory · Mathematics 2022-08-30 Andrew Chermak , Ellen Henke

We introduce essential subtrees for terms (trees) and tree automata . There are some results concerning independent sets of subtrees and separable sets for a tree and an automaton.

Computational Complexity · Computer Science 2007-05-23 Slavcho Shtrakov

We derive a formula connecting the orders of the automorphism groups of a finite group and of its covering groups.

Group Theory · Mathematics 2017-07-21 Avinoam Mann

Let $X$ be a finite set. We give criterion to say if a system of trees ${\cal P}=\{T_i\}_i$ with leaf sets $L(T_i) \in {X \choose 5}$ can be amalgamated into a supertree, that is, if there exists a tree $T$ with $L(T)=X$ such that $T$…

Combinatorics · Mathematics 2016-01-05 Simone Calamai , Elena Rubei

We construct the ordinary irreducible representations of the group of automorphisms of a finite rooted tree and we get a natural parametrization of them. To achieve this goals, we introduce and study the combinatorics of tree compositions,…

Representation Theory · Mathematics 2025-04-15 Fabio Scarabotti

We explicitly determine the automorphism groups of all self-similar trees (a.k.a. trees with finitely many cone types). We show that any such automorphism group is a direct limit of certain finite products of finite symmetric groups, which…

Group Theory · Mathematics 2023-12-07 Tobias Hartnick , Merlin Incerti-Medici

We show that every (not necessarily saturated) fusion system can be realized as a full subcategory of the fusion system of a finite group. This result extends our previous work \cite{Park2010} and complements the related result…

Representation Theory · Mathematics 2015-08-25 Sejong Park

We characterize the fixed sets of automorphisms of an arbitrary countable, arithmetically saturated structure.

Logic · Mathematics 2026-05-21 James Schmerl

The Benson-Solomon systems comprise the only known family of simple saturated fusion systems at the prime two that do not arise as the fusion system of any finite group. We determine the automorphism groups and the possible almost simple…

Group Theory · Mathematics 2019-06-25 Ellen Henke , Justin Lynd

Trees are partial orderings where every element has a linearly ordered set of smaller elements. We define and study several natural notions of completeness of trees, extending Dedekind completeness of linear orders and Dedekind-MacNeille…

Combinatorics · Mathematics 2023-01-18 Valentin Goranko , Ruaan Kellerman , Alberto Zanardo

We give an amalgamation construction of free multiple trees with a strongly transitive automorphism group. The construction shows that any partial codistance function on a tuple of finite trees can be extended to yield multiple trees.

Group Theory · Mathematics 2011-10-26 Katrin Tent

Linking systems are crucial for studying the homotopy theory of fusion systems, but are also of interest from an algebraic point of view. We propose a definition of a linking system associated to a saturated fusion system which is more…

Group Theory · Mathematics 2018-06-13 Ellen Henke

We complete the determination of saturated fusion systems on maximal class 3-groups of rank two.

Group Theory · Mathematics 2019-01-24 Chris Parker , Jason Semeraro

In this short note we study the cohomology algebra of saturated fusion systems using finite groups which realize saturated fusion systems and Hochschild cohomology of group algebras. A similar result to a theorem of Alperin is proved for…

Group Theory · Mathematics 2016-10-05 Constantin-Cosmin Todea
‹ Prev 1 2 3 10 Next ›