Related papers: Some Structure Theory for Cayley Graphs and Associ…
The basic idea of quantum complexity geometry is to endow the space of unitary matrices with a metric, engineered to make complex operators far from the origin, and simple operators near. By restricting our attention to a finite subgroup of…
This is a survey article for the forthcoming `A Concise Encyclopedia of Knot Theory.' We focus on the topology of spatial graphs with few vertices and edges, paying particular attention to Brunnian $\theta$-graphs.
A general formalism to construct and improve supercurrents and source or anomaly superfields in two-derivative N=1 supersymmetric theories is presented. It includes arbitrary gauge and chiral superfields and a linear superfield coupled to…
The concept of structured occurrence nets is an extension of that of occurrence nets which are directed acyclic graphs that represent causality and concurrency information concerning a single execution of a distributed system. The formalism…
Comparing networks is essential for a number of downstream tasks, from clustering to anomaly detection. Despite higher-order interactions being critical for understanding the dynamics of complex systems, traditional approaches for network…
Hypergraphs provide a powerful framework for modeling complex systems and networks with higher-order interactions beyond simple pairwise relationships. However, graph-based clustering approaches, which focus primarily on pairwise relations,…
A hypergraph consists of a set of vertices and a set of subsets of vertices, called hyperedges. In the metro map metaphor, each hyperedge is represented by a path (the metro line) and the union of all these paths is the support graph (metro…
Quasi-cyclic codes form an important class of algebraic codes that includes cyclic codes as a special subclass. This chapter focuses on the algebraic structure of quasi-cyclic codes, first. Based on these structural properties, some…
Here we introduce simple structures for the analysis of complex hypergraphs, hypergraph animals. These structures are designed to describe the local node neighbourhoods of nodes in hypergraphs. We establish their relationships to lattice…
Fractional (hyper-)graph theory is concerned with the specific problems that arise when fractional analogues of otherwise integer-valued (hyper-)graph invariants are considered. The focus of this paper is on fractional edge covers of…
We examine spaces of connected tri-/univalent graphs subject to local relations which are motivated by the theory of Vassiliev invariants. It is shown that the behaviour of ladder-like subgraphs is strongly related to the parity of the…
We define analytic maps between super Riemann surfaces which extend the notion of branched covering maps to a supersymmetric setting. We show that these super covering maps appear naturally both in symmetric product orbifolds of…
Hypergraphs naturally represent group interactions, which are omnipresent in many domains: collaborations of researchers, co-purchases of items, and joint interactions of proteins, to name a few. In this work, we propose tools for answering…
We construct and study a class of algebras associated to generalized layered graphs, i.e. directed graphs with a ranking function on their vertices. Each finite directed acyclic graph admits countably many structures of a generalized…
We apply a recent duality theorem for tangles in abstract separation systems to derive tangle-type duality theorems for width-parameters in graphs and matroids. We further derive a duality theorem for the existence of clusters in large data…
While there is a well developed theory of locally solid topologies, many important convergences in vector lattice theory are not topological. Yet they share many properties with locally solid topologies. Building upon the theory of…
We give lower bounds on the maximum possible girth of an $r$-uniform, $d$-regular hypergraph with at most $n$ vertices, using the definition of a hypergraph cycle due to Berge. These differ from the trivial upper bound by an absolute…
We uncover the very rich graph topology of generic bounded non-Hermitian spectra, distinct from the topology of conventional band invariants and complex spectral winding. The graph configuration of complex spectra are characterized by the…
Notions of minimal sufficient causation are incorporated within the directed acyclic graph causal framework. Doing so allows for the graphical representation of sufficient causes and minimal sufficient causes on causal directed acyclic…
We report on a hitherto unnoticed type of resonances occurring in scattering from networks (quantum graphs) which are due to the complex connectivity of the graph - its topology. We consider generic open graphs and show that any cycle leads…