arXiv subjects
Publications and source records attributed to Louis-Hadrien Robert.
We give a purely combinatorial formula for evaluating closed decorated foams. Our evaluation gives an integral polynomial and is directly connected to an integral equivariant version of the $\mathfrak{sl}_N$ link homology categorifying the $\mathfrak{sl}_N$ link polynomial. We also provide connections to the equivariant cohomology rings of partial flag manifolds.
We define some signature invariants for a class of knotted trivalent graphs using branched covers. We relate them to classical signatures of knots and links. Finally, we explain how to compute these invariants through the example of Kinoshita's knotted theta graph.
We define a new way to evaluate MOY graphs. We prove that this new evaluation coincides with the classical evaluation by checking some skein relations. As a consequence, we prove a formula which relates the $\mathfrak{sl}_N$ and $\mathfrak{sl}_{N-1}$-evaluations of MOY graphs.
We give explicit resolutions of all finite dimensional, simple $U_q(\mathfrak{sl_3})$-modules. We use these resolutions to categorify the colored $\mathfrak{sl}_3$-invariant of framed links via a complex of complexes of graded $\mathbb{Z}$-modules.
The aim of this note is to take benefit of the foam nature of the Khovanov-Kuperberg algebras to compute the Grothendieck groups of their categories of finitely generated projective modules. The computation relies on the Hattori-Stallings trace and some geometrical properties of foams in a solid torus.
In the first part, we introduce a notion a degree of edge-colorings of bicubic plane graphs and proves some local formula of the graded number of colorings. In the second part, we give a new proof of a result of Fisk saying that any two edge-3-colorings of a planar bicubic graph are Kempe equivalent. Additionaly we show that the degree of colorings behaves well with respect to Kempe equivalence.
After shortly recalling the construction of the Khovanov-Kuperberg algebras, we give a characterisation of indecomposable web-modules. It says that a web-module is indecomposable if and only if one can deduce it directly from the Kuperberg bracket (via a Schur lemma argument). The proofs relies on the construction of idempotents given by explicit foams. These foams are encoded by combinatorial data called red graphs. The key point is to show that when, for a web $w$ the Schur lemma does not apply, one can find an appropriate red graph for $w$.
We recall a construction of Mackaay, Pan and Tubbenhauer of the algebras $K^ε$ which allow to understand the $sl_3$ homology for links in a local way (i.e. for tangles). Then, by studying the combinatorics of the Kuperberg bracket, we give a large family of non-elliptic webs whose associated projective $K^ε$-modules are indecomposable.