Related papers: Stranding $\mathfrak{sl}_n$ webs
We introduce new geometric objects called spectral networks. Spectral networks are networks of trajectories on Riemann surfaces obeying certain local rules. Spectral networks arise naturally in four-dimensional N=2 theories coupled to…
The theory of signature invariants of links in rational homology spheres is applied to covering links of homology boundary links. From patterns and Seifert matrices of homology boundary links, an explicit formula is derived to compute…
This thesis splits into two major parts. The connection between the two parts is the notion of "categorification" which we shortly explain/recall in the introduction. In the first part of this thesis we extend Bar-Natan's cobordism based…
The spin network quantum simulator relies on the su(2) representation ring (or its q-deformed counterpart at q= root of unity) and its basic features naturally include (multipartite) entanglement and braiding. In particular, q-deformed spin…
We introduce a "web-based formalism" for describing the category of half-supersymmetric boundary conditions in $1+1$ dimensional massive field theories with ${\cal N}=(2,2)$ supersymmetry and unbroken $U(1)_R$ symmetry. We show that the…
In 2002, D. Hrencecin and L.H. Kauffman defined a filamentation invariant on oriented chord diagrams that may determine whether the corresponding flat virtual knot diagrams are non-trivial. A virtual knot diagram is non-classical if its…
Quantum walks on networks are a paradigmatic model in quantum information theory. Quantum-walk algorithms have been developed for various applications, including spatial-search problems, element-distinctness problems, and node centrality…
The Rooted Maps Theory, a branch of the Theory of Homology, is shown to be a powerful tool for investigating the topological properties of Feynman diagrams, related to the single particle propagator in the quantum many-body systems. The…
The coarsest approximation of the structure of a complex network, such as the Internet, is a simple undirected unweighted graph. This approximation, however, loses too much detail. In reality, objects represented by vertices and edges in…
Observations reveal that on large scales the universe is spanned by a percolating network of superclusters interspersed with large and almost empty regions -- voids. This thesis reports the construction of a sophisticated computational…
Using a set of $\Lambda$CDM simulations of cosmic structure formation, we study the evolving connectivity and changing topological structure of the cosmic web using state-of-the-art tools of multiscale topological data analysis (TDA). We…
A rooted phylogenetic network is a directed acyclic graph with a single root, whose sinks correspond to a set of species. As such networks are useful for representing the evolution of species that have undergone reticulate evolution, there…
The formalism of quantum theory over discrete systems is extended in two significant ways. First, quantum evolutions are generalized to act over entire network configurations, so that nodes may find themselves in a quantum superposition of…
We introduce a multiscale topological description of the Megaparsec weblike cosmic matter distribution. Betti numbers and topological persistence offer a powerful means of describing the rich connectivity structure of the cosmic web and of…
According to the so-called strong version of structural balance theory, actors in signed social networks avoid establishing triads with an odd number of negative links. Generalising, the weak version of balance theory allows for nodes to be…
The algebraic structure of representation theory naturally arises from 2D fixed-point tensor network states, which conceptually formulates the pattern of long-range entanglement realized in such states. In 3D, the same underlying structure…
Tensor network methods provide an intuitive graphical language to describe quantum states, channels, open quantum systems and a class of numerical approximation methods that efficiently simulate certain many-body states in one spatial…
The PageRank of a graph is a scalar function defined on the node set of the graph which encodes nodes centrality information of the graph. In this article, we use the PageRank function along with persistent homology to obtain a scalable…
The fundamental quandle is an invariant for distinguishing surface knots, yet computable presentations have traditionally been limited to surfaces embedded in the $4$-sphere. Building on the framework of banded unlink diagrams introduced by…
We use a recently proposed class of tensor-network states to study phase transitions in string-net models. These states encode the genuine features of the string-net condensate such as, e.g., a nontrivial perimeter law for Wilson loops…