Related papers: Subcentric linking systems
Semantic subtyping is an approach to define subtyping relations for type systems featuring union and intersection type connectives. It has been studied only for strict languages, and it is unsound for non-strict semantics. In this work, we…
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,…
A typical complex system should be described by a supernetwork or a network of networks, in which the networks are coupled to some other networks. As the first step to understanding the complex systems on such more systematic level,…
The increasing need for intelligent sensors in a wide range of everyday objects requires the existence of low power information processing systems which can operate autonomously in their environment. In particular, merging and processing…
We give examples to show that it is not in general possible to prove the existence and uniqueness of centric linking systems associated to a given fusion system inductively by adding one conjugacy class at a time to the categories. This…
A topological group $X$ is called connected if the only subsets which are both open and closed are the whole space $X$ and the null set $\emptyset$. A subset of a topological group is connected if the subspace is connected. We say that a…
For any prime $p$ and $S$ a $p$-group isomorphic to a Sylow $p$-subgroup of a rank $2$ simple group of Lie type in characteristic $p$, we determine all saturated fusion systems supported on $S$ up to isomorphism.
Recent algorithmic advances in algebraic automata theory drew attention to semigroupoids (semicategories). These are mathematical descriptions of typed computational processes, but they have not been studied systematically in the context of…
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…
As data structures and mathematical objects used for complex systems modeling, hypergraphs sit nicely poised between on the one hand the world of network models, and on the other that of higher-order mathematical abstractions from algebra,…
Given a saturated fusion system $\mathcal{F}$ over a $2$-group $S$, we prove that $S$ is abelian provided any element of $S$ is $\mathcal{F}$-conjugate to an element of $Z(S)$. This generalizes a Theorem of Camina--Herzog, leading to a…
In the context of deep learning, this article presents an original deep network, namely CentralNet, for the fusion of information coming from different sensors. This approach is designed to efficiently and automatically balance the…
A subgroup $A$ of a finite group $G$ is said to be a $CAP$-subgroup of $G$, if for any chief factor $H/K$ of $G$, either $A H= AK$ or $A\cap H = A \cap K$. Let $p$ be a prime, $S$ be a $p$-group and $\mathcal{F}$ be a saturated fusion…
We show that every finite semilattice can be represented as an atomized semilattice, an algebraic structure with additional elements (atoms) that extend the semilattice's partial order. Each atom maps to one subdirectly irreducible…
We define minimal fusion systems in a way that every non-solvable fusion system has a section which is minimal. Minimal fusion systems can also be seen as analogs of Thompson's N-groups. In this paper, we consider a minimal fusion system…
A multicomplex structure is defined from an ordered lattice of multigraphs. This structure will help us to observe the features of Persistent Homology in this context, its interaction with the ordering and the repercussions of the process…
Finitary/static semantics in the form of intersection type assignments have become a paradigm for analysing the fine structure of all sorts of lambda-models. The key step is the construction of a filter model isomorphic to a given…
An interesting question about quasiconvexity in a hyperbolic group concerns finding classes of quasiconvex subsets that are closed under finite intersections. A known example is the class of all quasiconvex subgroups. However, not much is…
Johnson and Livingston have characterized peripheral structures in homomorphs of knot groups. We extend their approach to the case of links. The main result is an algebraic characterization of all possible peripheral structures in certain…
The intended model of the homotopy type theories used in Univalent Foundations is the infinity-category of homotopy types, also known as infinity-groupoids. The problem of higher structures is that of constructing the homotopy types needed…