惯性聚合 高效追踪和阅读你感兴趣的博客、新闻、科技资讯
阅读原文 在惯性聚合中打开

推荐订阅源

Hugging Face - Blog
Hugging Face - Blog
Vercel News
Vercel News
C
Check Point Blog
G
Google Developers Blog
博客园 - 司徒正美
量子位
Engineering at Meta
Engineering at Meta
S
SegmentFault 最新的问题
Google DeepMind News
Google DeepMind News
F
Fortinet All Blogs
A
About on SuperTechFans
美团技术团队
D
DataBreaches.Net
Stack Overflow Blog
Stack Overflow Blog
Jina AI
Jina AI
Y
Y Combinator Blog
奇客Solidot–传递最新科技情报
奇客Solidot–传递最新科技情报
Apple Machine Learning Research
Apple Machine Learning Research
J
Java Code Geeks
MongoDB | Blog
MongoDB | Blog
人人都是产品经理
人人都是产品经理
H
Hackread – Cybersecurity News, Data Breaches, AI and More
The Cloudflare Blog
U
Unit 42

math.CO updates on arXiv.org

Complement Submodular Information Measures for Balanced and Robust Data Selection A Proof of a Conjecture on Positive and Negative Square Energies of Unicyclic Graphs Laplacian Spectrum of the Weakly Zero-Divisor Graph of a Finite Commutative Ring An identity for second Eulerian numbers via lattice-point counting $t$-tone edge coloring of graphs Constructing Maximal Bumpless Pipedreams for Double Grothendieck Polynomials Mubayi's Polynomial-Ideal Conjecture and Cover-Ideal Turán Methods Implicit Binarization via Complex Phase Dynamics in Combinatorial Optimization The limits of Schur multipliers in Pólya conversion problems for the $q$-permanent function Universality theorems for generalized splines Framing Triangulations for Arbitrary Integer Flow Polytopes On the Common Generalization of Gentle Algebras and Framed Directed Acyclic Graphs The complexity of frugal digraph homomorphisms Chaotic and periodic behavior of jeu de taquin on infinite Young tableaux Enumerating Pattern Avoiding Parking Functions Incidence toric ideals and three-point functions Unique Winning Opening Move in Three-Row Chomp Strong majority colorings of graphs A Balancing Theorem for Spanning Trees of Rectangular Grid Graphs Spectral radius and edge-disjoint connected factors of graphs New invariants for rank metric codes, with applications to the classification of rank two semifields of order 256 Flexible DP-4-coloring of planar graphs without 4-cycles and intersecting triangles Balanced intersection size distributions in projective planes List Reconstruction Problem with List Size Two Is Dimensionality a Barrier for Retrieval Models? The INIEP: Irreducible and Positive Realizations The number of Pfaffian orientations on punctured polygonally cellulated surfaces Explicit Construction of Polytopes whose Ehrhart Polynomials Realize any Given Sign Pattern Finite-state enumeration of adjacency-constrained 132-avoiding permutations AMDS and quantum AMDS Constacyclic codes of length $4p^ς$ over $\mathbb{F}_{{p}^{m}}$
Knot theory and cluster algebras II: The knot cluster
[Submitted on 26 May 2024 (v1), last revised 17 Aug 2026 (this v · 2024-05-26 · via math.CO updates on arXiv.org

View PDF HTML (experimental)

Abstract:To every knot (or link) diagram K, we associate a cluster algebra A that contains a cluster x with the property that every cluster variable in x specializes to the Alexander polynomial of K. We call x the knot cluster of A. Furthermore, there exists a cluster automorphism of A of order two that maps the initial cluster to the cluster x.
We realize this connection between knot theory and cluster algebras in two ways. In our previous work, we constructed indecomposable representations T(i) of the initial quiver Q of the cluster algebra A. Modulo the removal of 2-cycles, the quiver Q is the incidence quiver of the segments in K, and the representation T(i) of Q is built by taking successive boundaries of K cut open at the i-th segment. The relation to the Alexander polynomial stems from an isomorphism between the submodule lattice of T(i) and the lattice of Kauffman states of K relative to segment i.
In the current article, we identify the knot cluster x in A via a sequence of mutations that we construct from a sequence of bigon reductions and generalized Reidemeister III moves on the diagram K. On the level of diagrams, this sequence first reduces K to the Hopf link, then reflects the Hopf link to its mirror image, and finally rebuilds (the mirror image of) K by reversing the reduction. We show that every diagram of a prime link admits such a sequence.
We further prove that the cluster variables in x have the same F-polynomials as the representations T(i). This establishes the important fact that our representations T(i) do indeed correspond to cluster variables in A. But it even establishes the much stronger result that these cluster variables are all compatible, in the sense that they form a cluster.
We also prove that the representations T(i) have the following symmetry property. For all vertices i,j of Q, the dimension of T(i) at j is equal to the dimension of T(j) at i.

Submission history

From: Ralf Schiffler [view email]
[v1] Sun, 26 May 2024 14:55:17 UTC (134 KB)
[v2] Mon, 17 Aug 2026 17:33:04 UTC (188 KB)