Related papers: Stranding $\mathfrak{sl}_n$ webs
Complex networks in natural, social, and technological systems generically exhibit an abundance of rich information. Extracting meaningful structural features from data is one of the most challenging tasks in network theory. Many methods…
The sl_3 spider is a diagrammatic category used to study the representation theory of the quantum group U_q(sl_3). The morphisms in this category are generated by a basis of non-elliptic webs. Khovanov- Kuperberg observed that non-elliptic…
Webs of domain walls are constructed as 1/4 BPS states in d=4, N=2 supersymmetric U(Nc) gauge theories with Nf hypermultiplets in the fundamental representation. Web of walls can contain any numbers of external legs and loops like (p,q)…
Nature is a blossoming of regular structures, signature of self-organization of the underlying microscopic interacting agents. Turing theory of pattern formation is one of the most studied mechanisms to address such phenomena and has been…
Spin networks, essentially labeled graphs, are ``good quantum numbers'' for the quantum theory of geometry. These structures encompass a diverse range of techniques which may be used in the quantum mechanics of finite dimensional systems,…
The cosmic web structure is studied with the concepts and methods of fractal geometry, employing the adhesion model of cosmological dynamics as a basic reference. The structures of matter clusters and cosmic voids in cosmological N-body…
Persistent homology is a widely used tool in Topological Data Analysis that encodes multiscale topological information as a multi-set of points in the plane called a persistence diagram. It is difficult to apply statistical theory directly…
Tensor network methods are taking a central role in modern quantum physics and beyond. They can provide an efficient approximation to certain classes of quantum states, and the associated graphical language makes it easy to describe and…
These introductory lectures show how to define finite type invariants of links and 3-manifolds by counting graph configurations in 3-manifolds, following ideas of Witten and Kontsevich. The linking number is the simplest finite type…
The (standard) Brownian web is a collection of coalescing one- dimensional Brownian motions, starting from each point in space and time. It arises as the diffusive scaling limit of a collection of coalescing random walks. We show that it is…
Information on any given topic is often scattered across the web. Previously this scatter has been characterized through the distribution of a set of facts (i.e. pieces of information) across web pages, showing that typically a few pages…
The spectrum of stable electrically and magnetically charged supersymmetric particles can change discontinuously as one changes the vacuum on the Coulomb branch of gauge theories with extended supersymmetry in four dimensions. We show that…
We employ the sl(2) foam cohomology to define a cohomology theory for oriented framed tangles whose components are labelled by irreducible representations of U_q(sl(2)). We show that the corresponding colored invariants of tangles can be…
The weak variant of Hanani-Tutte theorem says that a graph is planar, if it can be drawn in the plane so that every pair of edges cross an even number of times. Moreover, we can turn such a drawing into an embedding without changing the…
We find an invariant characterization of planar webs of maximum rank. For 4-webs, we prove that a planar 4-web is of maximum rank three if and only if it is linearizable and its curvature vanishes. This result leads to the direct…
A meander of order n is a simple closed curve in the plane which intersects a horizontal line transversely at 2n points. (Meanders which differ by an isotopy of the line and plane are considered equivalent.) Let Gamma_n be the Cayley graph…
Motivated by [G. Cannizzaro, M. Hairer, Comm. Pure Applied Math., '22], we provide a construction of the Brownian Web (see [T\'oth B., Werner W., Probab. Theory Related Fields, '98] and [L. R. G. Fontes, M. Isopi, C. M. Newman, and K.…
The vast amount of data and increase of computational capacity have allowed the analysis of texts from several perspectives, including the representation of texts as complex networks. Nodes of the network represent the words, and edges…
Quantum networks with bipartite resources and shared randomness present the simplest infrastructure for implementing a future quantum internet. Here, we shall investigate which kinds of entanglement can or cannot be generated from this kind…
Tensor networks provide a powerful new framework for classifying and simulating correlated and topological phases of quantum matter. Their central premise is that strongly correlated matter can only be understood by studying the underlying…