Related papers: Generating basis webs for $\SL_n$
We give a new proof of a slightly modified version of a result of Queffelec--Rose, by constructing a linear basis for the $\mathrm{SL}(n)$ skein algebra of the twice punctured sphere for any non-zero complex number $q$, excluding finitely…
Motivated by the M-diagrams defined by Tymoczko, we show that these locally non-crossing $\mathfrak{sl}_3$-webs form a basis of the Specht module for the partition $(n,n,n)$. They further admit a unitriangular base change to both the…
We define $2n$-multiwebs on planar graphs and discuss their relation with $\mathrm{Sp}(2n)$-webs. On a planar graph with a symplectic local system we define a matrix whose Pfaffian is the sum of traces of $2n$-multiwebs. As application we…
The geometric Satake correspondence can be regarded as a geometric construction of the rational representations of a complex connected reductive group G. In their study of this correspondence, Mirkovi\'c and Vilonen introduced algebraic…
We introduce a new combinatorial object called a web world that consists of a set of web diagrams. The diagrams of a web world are generalizations of graphs, and each is built on the same underlying graph. Instead of ordinary vertices the…
For a simply-connected simple algebraic group $G$ over $\C$, we exhibit a subvariety of its affine Grassmannian that is closely related to the nilpotent cone of $G$, generalizing a well-known fact about $GL_n$. Using this variety, we…
The space of invariants of a tensor product of representations of SL(n) is provided with the basis parametrized by wave graphs introduced here especially for this purpose. The proof utilizes a game similar to Tetris, named here L-tris.
Laplacian matrices of weighted graphs in surfaces $S$ are used to define module and polynomial invariants of $Z/2$-homologically trivial links in $S \times [0,1]$. Information about virtual genus is obtained.
The symplectic group branching algebra, B, is a graded algebra whose components encode the multiplicities of irreducible representations of Sp(2n-2,C) in each irreducible representation of Sp(2n,C). By describing on B an ASL structure, we…
Hypernetworks are neural networks that generate weights for another neural network. We formulate the hypernetwork training objective as a compromise between accuracy and diversity, where the diversity takes into account trivial symmetry…
We consider the ring I_n of polynomial invariants over weighted graphs on n vertices. Our primary interest is the use of this ring to define and explore algebraic versions of isomorphism problems of graphs, such as Ulam's reconstruction…
In our companion paper, we develop a new $SL_4$-web basis. Basis elements are given by certain planar graphs and are constructed so that important algebraic operations can be performed diagrammatically. A guiding principle behind our…
Inspired by Vershik and Okounkov's inductive and Lie-theoretic approach to the representation theory of the symmetric group, we extend their point of view to reducible $S_n$-modules. Using induced representations along Young's lattice, we…
Basis tensor gauge theory (BTGT) is a vierbein analog reformulation of ordinary gauge theories in which the vierbein field describes the Wilson line. After a brief review of the BTGT, we clarify the Lorentz group representation properties…
Soft gluon exponentiation in non-abelian gauge theories can be described in terms of webs. So far this description has been restricted to amplitudes with two hard partons, where webs were defined as the colour-connected subset of diagrams.…
Given a finite dimensional representation of a semisimple Lie algebra there are two ways of constructing link invariants: 1) quantum group invariants using the R-matrix, 2) the Kontsevich universal link invariant followed by the Lie algebra…
The algebra of invariants of d-tuples of n x n skew-symmetric matrices under the action of the orthogonal group by simultaneous conjugation is considered over an infinite field of characteristic different from two. For n=3 and d>0 a minimal…
This paper investigates flat webs on the projective plane. We present two methods for constructing such webs: the first involves taking the product of finitely many convex reduced foliations and invariant lines, while the second consists of…
Webs are weighted sets of Feynman diagrams which build up the logarithms of correlators of Wilson lines, and provide the ingredients for the computation of the soft anomalous dimension. We present a general analysis of multiple gluon…
A Bayesian Network (BN) is a probabilistic model that represents a set of variables using a directed acyclic graph (DAG). Current algorithms for learning BN structures from data focus on estimating the edges of a specific DAG, and often…