Related papers: Subcentric linking systems
We develop a structure theory of connected solvable spherical subgroups in semisimple algebraic groups. Based on this theory, we obtain an explicit classification of all such subgroups up to conjugation.
Drawing parallels with hyperplane arrangements, we develop the theory of arrangements of submanifolds. Given a smooth, finite dimensional, real manifold $X$ we consider a finite collection $\mathcal{A}$ of locally flat, codimension-1…
Hierarchical clustering is a fundamental machine-learning technique for grouping data points into dendrograms. However, existing hierarchical clustering methods encounter two primary challenges: 1) Most methods specify dendrograms without a…
This note initiates an investigation of packing links into a region of Euclidean space to achieve a maximal density subject to geometric constraints. The upper bounds obtained apply only to the class of homotopically essential links and…
Pulse-coupled systems such as spiking neural networks exhibit nontrivial invariant sets in the form of attracting yet unstable saddle periodic orbits where units are synchronized into groups. Heteroclinic connections between such orbits may…
A relational structure is (connected-)homogeneous if every isomorphism between finite (connected) substructures extends to an automorphism of the structure. We investigate notions which generalise (connected-)homogeneity, where…
This paper (parts I and II) provides an expository introduction to monotone and near-monotone dynamical systems associated to biochemical networks, those whose graphs are consistent or near-consistent. Many conclusions can be drawn from…
Networks are a fundamental tool for understanding and modeling complex systems in physics, biology, neuroscience, engineering, and social science. Many networks are known to exhibit rich, lower-order connectivity patterns that can be…
Predicting compound-protein affinity is critical for accelerating drug discovery. Recent progress made by machine learning focuses on accuracy but leaves much to be desired for interpretability. Through molecular contacts underlying…
We present a theoretical framework for new structural metamaterials we refer to as liquid structures: a topology of bistable mechanisms made up of a high number of cells that are sub-mechanisms composed of pseudo-rigid links and joints. The…
Reasoning about objects, relations, and physics is central to human intelligence, and a key goal of artificial intelligence. Here we introduce the interaction network, a model which can reason about how objects in complex systems interact,…
Higher-order connectivity patterns such as small induced sub-graphs called graphlets (network motifs) are vital to understand the important components (modules/functional units) governing the configuration and behavior of complex networks.…
In this note, a generalization of the Thompson transfer lemma and its various extensions, most recently due to Lyons, is proven in the context of saturated fusion systems. A strengthening of Alperin's fusion theorem is also given in this…
Hypergraphs, increasingly utilised for modelling complex and diverse relationships in modern networks, gain much attention representing intricate higher-order interactions. Among various challenges, cohesive subgraph discovery is one of the…
We propose new symplectic networks (SympNets) for identifying Hamiltonian systems from data based on a composition of linear, activation and gradient modules. In particular, we define two classes of SympNets: the LA-SympNets composed of…
Simple nonlinear dynamical systems with multiple stable stationary states are often taken as models for switchlike biological systems. This paper considers the interaction of multiple such simple multistable systems when they are embedded…
Over the complex numbers, the complement of a collection of hyperplanes is a widely-studied object; the cohomology ring, in particular, is known to have a structure depending only on the combinatorial properties of the intersection of…
A function $F$ defined on all subsets of a finite ground set $E$ is quasi-concave if $F(X\cup Y)\geq\min\{F(X),F(Y)\}$ for all $X,Y\subset E$. Quasi-concave functions arise in many fields of mathematics and computer science such as social…
We introduce the notion of smooth cell complexes and its subclass consisting of gathered cell complexes within the category of diffeological spaces (cf. Definitions 1 and 3). It is shown that the following hold. (1) With respect to the…
Saturated fusion systems are categories generalizing important aspects of conjugacy of $p$-subgroups in finite groups. It was shown by Chermak that there are group-like structures called regular localities associated to saturated fusion…