The Art of Knot Data
Year: 2024 Authors: Paweł Dłotko; Davide Gurnari; Radmila Sazdanovic
Core claim
Knot invariants can be treated as big data, and Ball Mapper reveals both mathematical patterns and aesthetic images from their global structure.
Topics
knot theory as big data, Ball Mapper visualization, generative art
Domains
knot theory, topological data analysis, machine learning, generative art, data visualization, mathematics and art
Methods
dimension reduction, Ball Mapper, principal component analysis, UMAP, t-SNE
Media
Alexander polynomial data, knot invariants, interactive 3D plots
Paper text
The text below is the locally extracted OCR/Markdown version of the paper. Raw PDF files remain local and are not published here.
Bridges 2024 Conference Proceedings
The Art of Knot Data
Paweł Dłotko¹ and Davide Gurnari¹ and Radmila Sazdanovic²
¹ Institute of Mathematics, Polish Academy of Sciences, Warsaw, Poland ² Department of Mathematics, North Carolina State University, Raleigh, NC USA
Abstract
Ernst and Sumners’ theorem, affirming that knots constitute a form of big data, coupled with the comprehensive knot tabulation by Burton, Hoste, Thistlethwaite, and Weeks, along with numerous computations of knot invariants, establishes the groundwork for employing big data methodologies in knot theory. Utilizing dimension reduction and machine learning methods, such as Ball Mapper, not only yields valuable insights into the statistical characteristics of knots but also offers compelling means to visually represent the intricate space of knots. The appeal of generative art obtained is multifaceted, encompassing both aesthetic appeal and the complexity of mathematical statements.
Knots as Big Data
Knots and links possess a profound presence in the realm of art, spanning across diverse cultures and historical periods including Babylonian, Egyptian, Greek, Chinese, Byzantine, and Celtic traditions. This rich heritage continues to influence modern art, as seen in the sculptures of artists such as A. Brakke, B. Collins, Bathsheba Grossman, C.O. Perry, and R. Roelofs. Some of the recent art relies on advanced computational and technological advances such as 3D printing, while our artwork harvests the power of big data analysis techniques as well as the recent developments in knot theory.
According to the theorem by Ernst and Sumners, the number of distinct knots increases exponentially with the minimal crossing number. This theorem implies that knots are “big data” which is evident from knot tables containing over 350 million knots with up to 19 and almost 1.9 billion with 20 crossings obtained by Burton [1] and Thistlethwaite, respectively. Viewing knots as big data opens new ways of analyzing and visualizing collections of knots through the use of advanced big data visualization techniques, such as Ball Mapper [3], in conjunction with other dimension reduction and machine learning methods [2, 5].
Knot theory offers a way of extracting simpler descriptors of these remarkably complex geometric objects which can be used as input for “big data” techniques. One solution comes in the form of knot invariants, essential tools for distinguishing knots. Knot invariants can be numerical, such as crossing or linking numbers or signature, polynomials such as Alexander, Jones, Kauffman etc. or more algebraically sophisticated such as link homology theories. What all invariants have in common is the aim to capture distinct characteristics that are preserved under isotopic transformations of a knot, thereby providing a mathematical fingerprint of sorts. However, most of the computable knot invariants fail to distinguish all knots. For example, the infinite family of pretzel knots with the Conway symbol have the Alexander polynomial equal to but they are distinguished by their Jones polynomials [4].
Instead of comparing knot invariants via classification tasks we delve into visual exploration of the data obtained from knot invariants such as the Alexander polynomial of all knots with up to 17 crossings, its roots, and several numerical knot invariants such as signature, determinant, and crossing number. Using tools from topological data analysis we address open questions in knot theory showcasing how data-driven approaches can be leveraged to obtain new theoretical insights, (re)discover theorems, and generate art by visualizing relations and robust statistical results. Integration of diverse approaches in solving sophisticated mathematical problems emphasizes a harmonious blend of creativity and structure in mathematics and art [6].
Dlotko, Gurnari, and Sazdanovic
Ball Mapper: Exploratory and Visualization Tool
The inherent complexity often drives the pursuit of simplification to enhance our understanding. Visualization techniques offer a spectrum of methodologies for representing data, with the most prevalent approaches involving linear or nonlinear embedding that aim to minimize a specific function. Notably, nonlinear dimension reduction techniques such as t-SNE or UMAP have gained prominence for their efficacy in preserving the local neighborhood structure of data points. However, a significant limitation of these methods is their tendency to distort the global structure of the data, which often remains elusive. This challenge underscores the value of topological data analysis (TDA) tools, especially those based on mapper-type algorithms, in providing a more comprehensive understanding of data structure.
For a given finite point sample and \epsilon > 0 , the Ball Mapper algorithm [3] constructs an undirected graph , called the Ball Mapper graph of at the radius , whose shape captures the essential feature of the shape of . This is achieved by covering with a collection of overlapping balls of radius and assigning a vertex of to each balls, while the edges represent their non-empty intersections. The Ball Mapper graph serves as a 1-dim model for the set . If the point cloud comes with a function , the Ball Mapper construction can be extended to visualize such function by coloring each vertex of the Ball Mapper by the average value of the function within its corresponding ball of the cover. This approach provides a tool to understand the shapes of complex, high-dimensional data, as well as to analyze functions defined on them.
(a)
(b)
Figure 1: Alexander data visualized using (a) 2D PCA (top) and Ball Mapper (bottom) (b) 2D UMAP (c) 2D t-SNE projections. All plots colored by signature modulo 4 (white is 0, red is 2).
(c)
Comparison between Ball Mapper, PCA, UMAP, t-SNE on the point cloud obtained from the coefficients of the Alexander polynomial up to 17 crossing knots colored by the signature modulo 4 is shown in Figure 1. Ball Mapper indicates linear structure confirmed by the existence of dominant first principal component Figure 1a, completely different from the ones in Figure 1b, c. The difference is likely due to properties of nonlinear dimension reductions designed to preserve local structure of data sampled from manifolds. Hence, in the case of highly non-generic data such as ours, the outputs do not capture the underlying global structure.
Ball Mapper on Alexander Coefficient Data
Ball Mapper can be used to visualize relations, such as the one between the Alexander polynomial and other knot invariants. Figure 2 shows the Ball Mapper graph of the Alexander data, or Alexander BM for brevity, colored by knot invariants such as the leading coefficient related to the fibredness or the maximal degree that gives knot genus, providing insight into their global behavior. For example, non-alternating knots are concentrated in the middle, the signature and determinant increase from one to the other end, while maximal degree of the Alexander polynomial filters the linear structure.
Ball Mapper is not just the visualization tool: it can generate art and hypotheses! The BM graph in the bottom of Figure 2a implies that the Alexander polynomial detects signature mod 4, as one half is white
The Art of Knot Data
(a)
(b)
Figure 2: Alexander BM colored by whether the knot is (a) alternating (green) or not (white), signature (purple high, white low), signature mod 4 (red is 2, white is 0); (b) determinant (yellow low, purple high), leading coefficient (white low, red high), maximal degree (white low, red high).
(zero) and the other red (two). SVM (Support vector machine) found a separating hyperplane normal vector in 17-dimensional Alexander data that recovers the theorem stating that the sign of the Alexander polynomial evaluated at -1 determines signature mod 4. The Fox trapezoidal conjecture, open since 1962, states that for an alternating knot the absolute value of coefficients first increases, then there are coefficients with constant value then decrease in the same way (since it is palindromic). The conjecture is illustrated with elegant images in Figure 3 that relate plots of the Alexander coefficients for various classes of knots and the determinant of the minimal real part of any of the zeros shown in Figure 4a. Figure 3b and 4b middle illustrate the distribution of minimal real parts of any zero and Figure 4c plots polynomials for non-alternating knots all contained in the center of Alexander BM Figure 4b bottom.
(a)
(b)
Figure 3: (a) Absolute values of the Alexander coefficients of 10 crossing knots and (c) all 3324 alternating knots with colored by the absolute value of the determinant; (b) the first 500 alternating knots colored by minimum value of the real part of any zero where red is high and white low.
(c)
Summary and Conclusions
In our visually inundated world big data analysis tools provide a way to explore complex, high dimensional, hard-to-sample data, such as the global structure of millions of knots. Applying one such tool to knots, TDA’s Ball Mapper [8], comes with a cost: a collection of numerical descriptors derived from knot invariants used
Dlotko, Gurnari, and Sazdanovic
(a)
(b)
(c)
Figure 4: (a) Zeros of the Alexander polynomials; (b) Alexander BM for all (top) and for alternating knots (middle) colored by the minimum value of the real part of any zero (using the same color scale, white is 0, red is negative). BM for non-alternating knots (bottom) where white means trapezoidal and red means not; (c) Alexander polynomials of non-alternating non-trapezoidal knots.
in Ball Mapper does not capture all of knot’s properties. In return, we get beautiful images and interactive 3d plots [9], knot landscapes, that capture the statistical, global structure of knot invariants. Utility of Ball Mapper extends beyond knot invariants providing a tool [8] for the math and art community to visualize essential features of high-dimensional data sets, functions on and relations between them.
Acknowledgements
All authors acknowledge support by Dioscuri program initiated by the Max Planck Society, jointly managed with the National Science Centre (Poland), and mutually funded by the Polish Ministry of Science and Higher Education and the German Federal Ministry of Education and Research. RS was partially supported by NSF grant DMS-1854705. RS is eternally thankful for S. Jablan’s guidance and unwavering support.
References
[1] B. A. Burton. “The next 350 million knots.” 36th International Symposium on Computational Geometry (SoCG 2020), Schloss-Dagstuhl-Leibniz Zentrum für Informatik, 2020. [2] A. Davies, P. Velicković, L. Buesing, S. Blackwell, D. Zheng, at al. “Advancing mathematics by guiding human intuition with AI.” Nature, 600 (7887), 2021, pp. 70–74. [3] P. Dlotko, D. Gurnari, R. Sazdanovic. “Mapper-type algorithms for complex data and relations.” Journal of Computational and Graphical Statistics, 2024, pp. 1-18. [4] S. Jablan, R. Sazdanovic. “LinKnot: knot theory by computer.” 21, World Scientific, 2007. [5] J.S. Levitt, M. Hajij, R. Sazdanovic. “Big data approaches to knot theory: Understanding the structure of the Jones polynomial.” J. of Knot Theory and Its Ramifications, 31(13), World Scientific, 2022. [6] H. Russell, R. Sazdanovic. “Mathematics and Art: Unifying Perspectives.” In Handbook of Arts and Sciences, Springer, 2021, pp. 497–525. [7] R. Sazdanovic. “Diagrammatics in Art and Mathematics.” Symmetry 4, 2012, pp. 285-301. [8] P. Dlotko, D. Gurnari, R. Sazdanovic. “Mapper-type algorithms for complex data and relations - datasets and code.” Zenodo, 2023. https://doi.org/10.5281/zenodo.7670819 [9] P. Dlotko, D. Gurnari, R. Sazdanovic. “Interactive BallMapper graphs.” 2023. https://dioscuri-tda.org/BallMapperKnots.