Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,742 papers · 148 categories

Trend · papers per month

4181122162 · Jun 202019922001200920172026
48 results for Sartori's diagrammatic formulation

New diagrammatic approach connects knot Floer homology with quantum group representations.

problem Efficiently compute knot Floer homology using bordered algebra.
method Identify endomorphism algebras and use Sartori's diagrammatic formulation.
result Diagrammatic reinterpretation of Sartori's algebra and new modules over Ozsváth-Szabó's algebra.

We explain how Queffelec-Sartori's construction of the HOMFLY-PT link polynomial can be interpreted in terms of parabolic Verma modules for gl2n\mathfrak{gl}_{2n}. Lifting the construction to the world of categorification, we use parabolic 2-Verma modules to give a higher representation theory construction of Khovanov-Ro…

2017-04-27abs ↗pdf ↗

In this survey paper we present the LL--moves between braids and how they can adapt and serve for establishing and proving braid equivalence theorems for various diagrammatic settings, such as for classical knots, for knots in knot complements, in c.c.o. 3--manifolds and in handlebodies, as well as for virtual knots, …

2011-03-22abs ↗pdf ↗

We introduce the notion of directed diagrammatic reducibility which is a relative version of diagrammatic reducibility. Directed diagrammatic reducibility has strong group theoretic and topological consequences. A multi-relator version of the Freiheitssatz in the presence of directed diagrammatic reducibility is given.…

2019-03-11abs ↗pdf ↗

Springer varieties appear in both geometric representation theory and knot theory. Motivated by knot theory and categorification Khovanov provides a topological construction of (n/2,n/2)(n/2, n/2) Springer varieties. We extend Khovanov's construction to all two-row Springer varieties. Using the combinatorial and diagrammatic …

2010-07-05abs ↗pdf ↗

We provide a diagrammatic computation for the bilinear form, which is defined as the pairing between the (relative) cup products with every local coefficients and every integral homology 2-class of every links in the 3-sphere. As a corollary, we construct bilinear forms on the twisted Alexander modules of links.

2016-02-02abs ↗pdf ↗

Develops a diagrammatic method for symplectic filling classifications.

problem Classifying exact/weak symplectic fillings of 3D contact manifolds.
method Symplectic JSJ decomposition applied to contact surgery diagrams.
result Recover symplectic fillings for certain lens spaces and torus bundles, and classify fillings for a large class of plumbed 3-manifolds.

Recently, Bigelow defined a diagrammatic method for calculating the Alexander polynomial of a knot or link by resolving crossings in a planar algebra. I will present my multivariate version of Bigelow's calculation. The advantage to my algorithm is that it generalizes to a multivariate tangle invariant up to Reidemeist…

2012-05-25abs ↗pdf ↗

We use super qq-Howe duality to provide diagrammatic presentations of an idempotented form of the Hecke algebra and of categories of glN\mathfrak{gl}_N-modules (and, more generally, glNM\mathfrak{gl}_{N|M}-modules) whose objects are tensor generated by exterior and symmetric powers of the vector representations. As an ap…

2015-04-20abs ↗pdf ↗

In previous work, we have constructed diagrammatic idempotents in an affine extension of the Temperley-Lieb category, which describe extremal weight projectors for sl(2), and which categorify Chebyshev polynomials of the first kind. In this paper, we generalize the construction of extremal weight projectors to the case…

2018-03-27abs ↗pdf ↗

MXGNet tackles visual reasoning tasks using graph neural networks.

problem Abstract reasoning, especially in the visual domain, is challenging for AI.
method Combines object-level representations, graph neural networks, and multiplex graphs.
result Achieves state-of-the-art accuracy on Euler Diagram Syllogisms and outperforms state-of-the-art models on RPM datasets.

Study on quantum sl3\mathfrak{sl}_3 invariant for positive links.

problem Characterizing and understanding the quantum sl3\mathfrak{sl}_3 invariant of positive links.
method Skein theory of sl3\mathfrak{sl}_3-webs, explicit formulae, diagrammatic quantities, obstructions.
result Positive links are fibered if and only if the second coefficient of the polynomial is 1.

New criteria for Heegaard splittings ensure strong irreducibility and finite Goeritz groups.

problem Determining strong irreducibility and finite Goeritz groups of Heegaard splittings.
method Two diagrammatic criteria for Heegaard splittings, accepting arbitrary disk systems.
result Criteria ensure strong irreducibility and finite Goeritz groups for Heegaard splittings.

Zipper logic is a graph rewrite system, consisting in only local rewrites on a class of zipper graphs. Connections with the chemlambda artificial chemistry and with knot diagrammatics based computation are explored in the article.

2014-05-20abs ↗pdf ↗

A theorem of Katanaga, Saeki, Teragaito, and Yamada relates Gluck and Price twists of 4-manifolds. Using trisection diagrams, we give a purely diagrammatic proof of this theorem, and answer a question of Kim and Miller.

2019-06-04abs ↗pdf ↗