Search arXivSearch

arXiv · 2608.24298

Spectral geometry of Khovanov Laplacians

Abstract

For an oriented link diagram $D$, the Khovanov cochain complex carries a canonical Hermitian inner product that defines a combinatorial Hodge Laplacian. Its kernel is naturally isomorphic to rational Khovanov cohomology, while its positive spectrum depends on the chosen diagram. Building on the numerical work of Jones and Wei, we develop a structural study of this diagram-dependent higher spectrum. In the minimal and maximal cube degrees, we identify the Khovanov Laplacian with signless Laplacians of explicit weighted graphs, up to diagonal sign conjugation in maximal degree. The graph model describes rational Khovanov classes and harmonic representatives through its bipartite components and gives inverse-polynomial gap bounds in fixed-width bands near the extremal $q$-degrees when the corresponding rational cohomology vanishes. It also yields exact $Θ(N^{-2})$ bidegree gaps for twisted unknots, odd $(2,N)$-torus knots, and even twist knots. The exact gap calculations are motivated in part by the spectral-resolution requirement in a recent quantum algorithm for Khovanov homology. We also prove a finite-dimensional analytic--combinatorial torsion correspondence for the Khovanov complex showing that an alternating product of nonzero Laplacian pseudodeterminants recovers integral Khovanov torsion in rationally acyclic $q$-degrees and differs from it by an explicit regulator in general. Finally, we transfer Lee's deformation to a filtered differential on the harmonic Khovanov subspace, giving a canonical harmonic model for the Lee spectral sequence.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jernej Grlj, Aaron D. Lauda. 2026-08-25. Spectral geometry of Khovanov Laplacians. https://arxiv.org/abs/2608.24298

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Word Length Formulae, Normal Forms, Conjugation and Root-finding Algorithms in Surface Groups

In this paper, we mainly study the following symmetric presentation of the surface group $$π_1(Σ_g)=\left\langle c_1,\dots, c_{2g}\mid c_1\cdots c_{2g}c_1^{-1}\cdots c_{2g}^{-1}\right\rangle.$$ For every nontrivial element $x\in π_1(Σ_g)$ and $k\geq 2$, we obtain a uniform representative of the normal forms $\mathfrak{nf}(x^k)$ of $x^k$ under the length-lexicographical order: $$\mathfrak{nf}(x^k) = \overline{LW^{k-2}R}.$$ Building on this result, we establish a new relation among these normal forms, and then derive the following three formulae related to the word length: $|x^2|>|x|$; $|x^k|=(k-1)(|x^2|-|x|)+|x|$; $\lim_{k\to\infty}\frac{|x^k|}{k}=|x^2|-|x|$. Furthermore, we extend these results to obtain a coarser analogue for every minimal geometric presentation. We then define normal forms of conjugacy classes in $π_1(Σ_g)$ and provide a criterion for determining the conjugacy of group elements. As a consequence, we provide efficient algorithms for solving the root-finding and conjugacy problems. Finally, we present applications to the computation of several growth rates.

math.GT

Plane separating continua inscribe rectangles

We prove the following: If $X$ is a plane separating continuum, then every embedding of $X$ into $\mathbb{R}^2$ contains the vertices of a Euclidean rectangle. We arrive to this result by extending a known result by H. Vaughan for Jordan curves to a wider class of topological objects via shape theory and Steenrod homology.

math.GT

Every Link Has Infinitely Many Explicit Generalised T-Link Presentations

Generalised $T$-links provide a simple description of all links in $S^3$ as closures of products of standard twisting blocks, parametrised by finite sequences of integers. We prove that every link admits infinitely many pairwise distinct generalised $T$-link presentations. Starting from any such presentation, we give explicit parameter transformations that preserve the represented link and generate families of pairwise distinct presentations depending on arbitrarily many independent integer parameters.

math.GT