Related papers: Web bases in degree two from hourglass plabic grap…
We study four-dimensional N=1 gauge theories which arise from D3-brane probes of toric Calabi-Yau threefolds. There are some standing paradoxes in the literature regarding relations among (p,q)-webs, toric diagrams and various phases of the…
Let $R$ be a commutative ring with identity and a fixed invertible element $q^{\frac{1}{2}}$, and suppose $q+q^{-1}$ is invertible in $R$. For each planar surface $\Sigma_{0,n+1}$, we present its Kauffman bracket skein algebra over $R$ by…
Let $(\Sigma,p)$ be a pointed Riemann surface of genus $g\geq 1$. For any integer $k\geq 1$, we parametrize the space of meromorphic quadratic differentials on $\Sigma$ with a pole of order $(k+2)$ at $p$, having a connected critical graph…
An invariant characterization of the rotationally symmetric R-separable webs for the Laplace equation in Euclidean space is given in terms of invariants and covariants of a real binary quartic canonically associated to the characteristic…
For $p,q\ge2$ the $\{p,q\}$-tiling graph is the (finite or infinite) planar graph $T_{p,q}$ where all faces are cycles of length $p$ and all vertices have degree $q$. We give algorithms for the problem of recognizing (induced) subgraphs of…
Knowledge Graphs are pivotal for semantic data integration. The real-world data they model is often inherently uncertain. Within knowledge graphs, uncertainty manifests in three distinct levels: imprecise attribute values, probabilistic…
This paper considers *-graphs in which all vertices have degree 4 or 6, and studies the question of calculating the genus of orientable 2-surfaces into which such graphs may be embedded. A *-graph is a graph endowed with a formal adjacency…
We continue investigating the generalisations of geometrical statistical models introduced in [13], in the form of models of webs on the hexagonal lattice H having a U_q(sl_n) quantum group symmetry. We focus here on the n=3 case of cubic…
We use annular foam TQFTs introduced by the first two authors to define equivariant $SL(2)$ and $SL(3)$ web algebras in the annulus. To a diagram of a tangle in the thickened annulus we assign a complex of bimodules over these algebras…
Understanding and interacting with everyday physical scenes requires rich knowledge about the structure of the world, represented either implicitly in a value or policy function, or explicitly in a transition model. Here we introduce a new…
Continuing to our previous work [IY21](arXiv:2101.00643) on the $\mathfrak{sl}_3$-case, we introduce a skein algebra $\mathscr{S}_{\mathfrak{sp}_4,\Sigma}^{q}$ consisting of $\mathfrak{sp}_4$-webs on a marked surface $\Sigma$ with certain…
We develop novel first- and second-order features for dependency parsing based on the Google Syntactic Ngrams corpus, a collection of subtree counts of parsed sentences from scanned books. We also extend previous work on surface $n$-gram…
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.
In this work, we introduce a new class of algebras called skew-Brauer graph algebras, which generalize the well-known Brauer graph algebras. We establish that skew-Brauer graph algebras are symmetric and can be defined using a Brauer graph…
We introduce a novel class of graphical models, termed profile graphical models, that represent, within a single graph, how an external factor influences the dependence structure of a multivariate set of variables. This class is quite…
This work examines the problem of graph learning over a diffusion network when data can be collected from a limited portion of the network (partial observability). The main question is to establish technical guarantees of consistent…
The first part of this paper completes the classification of Whitney towers in the 4-ball that was started in three related papers. We provide an algebraic framework allowing the computations of the graded groups associated to geometric…
In this paper, we give polynomial-time algorithms that can take a graph G with a given combinatorial embedding on an orientable surface S of genus g and produce a planar drawing of G in R^2, with a bounding face defined by a polygonal…
Let G be a simple algebraic group. Labelled trivalent graphs called webs can be used to product invariants in tensor products of minuscule representations. For each web, we construct a configuration space of points in the affine…
Gowers and Hatami initiated the inverse theory for the uniformity norms $U^k$ of matrix-valued functions on non-abelian groups by proving a $1\%$-inverse theorem for the $U^2$-norm and relating it to stability questions for almost…