English
Related papers

Related papers: The quantum sl(3) invariants of cubic bipartite pl…

200 papers

We extend the $sl(3)$-polynomial invariant for links to tangles. Motivated by Kuperberg's construction of this invariant via planar trivalent graphs, we first define a category of $sl(3)$ webs and its sister linear category, and describe…

Geometric Topology · Mathematics 2025-08-28 Nipun Amarasinghe

We study Cayley graphs of abelian groups from the perspective of quantum symmetries. We develop a general strategy for determining the quantum automorphism groups of such graphs. Applying this procedure, we find the quantum symmetries of…

Quantum Algebra · Mathematics 2024-02-07 Daniel Gromada

We introduce two invariants called sl(3) Khovanov module and pointed sl(3) Khovanov homology for spatial webs (bipartite trivalent graphs). Those invariants are related to Kronheimer-Mrowka's instanton invariants $J^\sharp$ and $I^\sharp$…

Geometric Topology · Mathematics 2018-09-14 Yi Xie

We define a bigraded homology theory whose Euler characteristic is the quantum sl(3) link invariant.

Quantum Algebra · Mathematics 2014-10-01 Mikhail Khovanov

We determine all possible triples of depth, dimension, and regularity of edge ideals of weighted oriented graphs with a fixed number of vertices. Also, we compute all the possible Betti table sizes of edge ideals of weighted oriented trees…

Commutative Algebra · Mathematics 2025-04-18 Trung Chau , Richie Sheng , Deborah Wooton

One of the apparent advantages of quantum computers over their classical counterparts is their ability to efficiently contract tensor networks. In this article, we study some implications of this fact in the case of topological tensor…

Quantum Physics · Physics 2016-10-17 Gorjan Alagic , Edgar A. Bering

For a planar graph with a given f-vector $(f_{0}, f_{1}, f_{2}),$ we introduce a cubic polynomial whose coefficients depend on the f-vector. The planar graph is said to be real if all the roots of the corresponding polynomial are real. Thus…

Combinatorics · Mathematics 2018-03-29 M. R. Emamy-K. , Bahman Kalantari , Tatiana Correa

For every integer $\ell$, we construct a cubic 3-vertex-connected planar bipartite graph $G$ with $O(\ell^3)$ vertices such that there is no planar straight-line drawing of $G$ whose vertices all lie on $\ell$ lines. This strengthens…

Computational Geometry · Computer Science 2021-12-23 David Eppstein

We show how to define invariants of graphs related to quantum $\mathfrak{sl}(2)$ when the graph has more then one connected component and components are colored by blocks of representations with zero quantum dimensions.

Geometric Topology · Mathematics 2015-05-13 Nathan Geer , Nicolai Reshetikhin

In this survey we collect all results regarding the construction of the Framization of the Temperley-Lieb algebra of type $A$ as a quotient algebra of the Yokonuma-Hecke algebra of type $A$. More precisely, we present all three possible…

Geometric Topology · Mathematics 2018-11-09 Dimos Goundaroulis

Three new graph invariants are introduced which may be measured from a quantum graph state and form examples of a framework under which other graph invariants can be constructed. Each invariant is based on distinguishing a different number…

Quantum Physics · Physics 2019-11-20 P. W. Mills , R. P. Rundle , J. H. Samson , Simon J. Devitt , Todd Tilma , V. M. Dwyer , Mark J. Everitt

Trivalent plane graphs are used in various areas of mathematics which relate for instance to the colored Jones polynomial, invariants of 3-manifolds and quantum computation. Their evaluation is based on computations in the Temperley-Lieb…

Quantum Algebra · Mathematics 2013-01-11 Claire Isabelle Levaillant

In this paper, we study quantum modular forms in connection to quantum invariants of plumbed 3-manifolds introduced recently by Gukov, Pei, Putrov, and Vafa. We explicitly compute these invariants for any $3$-leg star plumbing graphs whose…

Quantum Algebra · Mathematics 2019-06-27 Kathrin Bringmann , Karl Mahlburg , Antun Milas

We use the skein theory of $\mathfrak{sl}_3$-webs to study the properties of the quantum $\mathfrak{sl}_3$-link polynomial of positive links. We give explicit formulae for the three leading terms of the polynomial on positive links in terms…

Geometric Topology · Mathematics 2026-03-27 Matthew Harper , Efstratia Kalfagianni

Webs give a diagrammatic calculus for spaces of tensor invariants. We introduce hourglass plabic graphs as a new avatar of webs, and use these to give the first rotation-invariant $U_q(\mathfrak{sl}_4)$-web basis, a long-sought object. The…

Combinatorics · Mathematics 2026-05-12 Christian Gaetz , Oliver Pechenik , Stephan Pfannerer , Jessica Striker , Joshua P. Swanson

We consider a connected negative definite plumbing graph, and we assume that the associated plumbed 3-manifold is a rational homology sphere. We provide two new combinatorial formulae for the Seiberg-Witten invariant of this manifold. The…

Algebraic Geometry · Mathematics 2010-10-07 András Némethi

We compute the quadratic embedding constant for complete bipartite graphs with disjoint edges removed. Moreover, we study the quadratic embedding property for theta graphs, i.e., graphs consisting of three paths with common initial points…

Combinatorics · Mathematics 2024-10-02 Wojciech Młotkowski , Marek Skrzypczyk , Michał Wojtylak

We summarize different approaches to the theory of quantum graphs and provide several ways to construct concrete examples. First, we classify all undirected quantum graphs on the quantum space $M_2$. Secondly, we apply the theory of…

Quantum Algebra · Mathematics 2022-12-15 Daniel Gromada

In order to apply quantum topology methods to nonplanar graphs, we define a planar diagram category that describes the local topology of embeddings of graphs into surfaces. These \emph{virtual graphs} are a categorical interpretation of…

Geometric Topology · Mathematics 2020-05-01 Calvin McPhail-Snyder , Kyle A. Miller

A simple undirected graph is said to be {\em semisymmetric} if it is regular and edge-transitive but not vertex-transitive. Every semisymmetric graph is a bipartite graph with two parts of equal size. It was proved in [{\em J. Combin.…

Combinatorics · Mathematics 2012-06-12 Li Wang , Shaofei Du
‹ Prev 1 2 3 10 Next ›