arXiv research

Enhances knot counting using mosaic diagrams.

This paper studies virtual knots using mosaic diagrams.

A new mosaic system for immersed surface-links is introduced.

KnotMosaics package simplifies knot theory computations in SageMath.

Algorithm finds mosaic numbers for knots with 10 or fewer crossings.

Inspired by the paper on quantum knots and knot mosaics [23] and grid diagrams (or arc presentations), used extensively in the computations of Heegaard-Floer knot homology [2,3,7,24], we construct the more concise representation of knot mosaics and grid diagrams via mirror-curves. Tame knot theory is equivalent to knot…

New tiles allow efficient knot mosaics for small knots.

Lomonaco and Kauffman introduced a knot mosaic system to give a precise and workable definition of a quantum knot system, the states of which are called quantum knots. This paper is inspired by an open question about the knot mosaic enumeration suggested by them. A knot $n$--mosaic is an $n \times n$ array of 11 mosaic…

Since the Jones polynomial was discovered, the connection between knot theory and quantum physics has been of great interest. Lomonaco and Kauffman introduced the knot mosaic system to give a definition of the quantum knot system that is intended to represent an actual physical quantum system. Recently the authors deve…

New knots found that can only fit in non-reduced projections.

Paper introduces spherical knot mosaics for knot and link invariants.

Rectangular mosaics extend virtual knot studies to larger polygons.

New method uses mosaics to study wild knots.

In 2008, Kauffman and Lomonaco introduce the concepts of a knot mosaic and the mosaic number of a knot or link, the smallest integer $n$ such that a knot or link can be represented on an $n$-mosaic. In arXiv:1702.06462, the authors explore space-efficient knot mosaics and the tile number of a knot or link, the smallest…

Knot mosaic theory was introduced by Lomonaco and Kauffman in the paper on `Quantum knots and mosaics' to give a precise and workable definition of quantum knots, intended to represent an actual physical quantum system. A knot (m,n)-mosaic is an $m \! \times \! n$ matrix whose entries are eleven mosaic tiles, represent…

Researchers found algorithms to construct toric mosaics and set upper bounds for their numbers.

Expanding on prime knots with 6 or less mosaic tiles, this paper analyzes those with 7 tiles.

Knot mosaics are used to model physical quantum states. The mosaic number of a knot is the smallest integer $m$ such that the knot can be represented as a knot $m$-mosaic. In this paper we establish an upper bound for the crossing number of a knot in terms of the mosaic number. Given an $m$-mosaic and any knot $K$ that…

Computes bounds on mosaic number of Legendrian knots.

Improved bounds for knot crossings in different mosaic patterns.

We investigate relationships between bounds on the crossing number and the mosaic number of mosaic knots.

Lomonaco and Kauffman introduced knot mosaic system to give a definition of quantum knot system. This definition is intended to represent an actual physical quantum system. A knot $(m,n)$-mosaic is an $m \times n$ matrix of mosaic tiles which are $T_0$ through $T_{10}$ depicted as below, representing a knot or a link b…

Lomonaco and Kauffman developed knot mosaics to give a definition of a quantum knot system. This definition is intended to represent an actual physical quantum system. A knot $n$-mosaic is an $n \times n$ matrix of 11 kinds of specific mosaic tiles representing a knot or a link. The mosaic number $m(K)$ of a knot $K$ i…

In 2008, Lomonaco and Kauffman introduced a knot mosaic system to define a quantum knot system. A quantum knot is used to describe a physical quantum system such as the topology or status of vortexing that occurs on a small scale can not see. Kuriya and Shehab proved that knot mosaic type is a complete invariant of tam…

In this paper we introduce the concept of a space-efficient knot mosaic. That is, we seek to determine how to create knot mosaics using the least number of non-blank tiles necessary to depict the knot. This least number is called the tile number of the knot. We determine strict bounds for the tile number of a knot in t…

In this paper, we work to construct mosaic representations of knots on the torus, rather than in the plane. This consists of a particular choice of the ambient group, as well as different definitions of contiguous and suitably connected. We present conditions under which mosaic numbers might decrease by this projection…

Paper proves corner connection tiles can represent knots with fewer tiles.

This paper presents a novel framework for generating texture mosaics with convolutional neural networks. Our method is called GANosaic and performs optimization in the latent noise space of a generative texture model, which allows the transformation of a content image into a mosaic exhibiting the visual properties of t…

New tile types for knots and links reduce complexity.

Lomonaco and Kauffman introduced a knot mosaic system to give a definition of a quantum knot system which can be viewed as a blueprint for the construction of an actual physical quantum system. A knot $n$-mosaic is an $n \times n$ matrix of 11 kinds of specific mosaic tiles representing a knot or a link by adjoining pr…

MOSAIC detects change points in dynamic networks with low-rank and sparse changes.

Causal Mosaic distinguishes cause from effect using nonlinear ICA and ensemble methods.

Lomonaco and Kauffman developed a knot mosaic system to introduce a precise and workable definition of a quantum knot system. This definition is intended to represent an actual physical quantum system. A knot (m,n)-mosaic is an $m \times n$ matrix of mosaic tiles ($T_0$ through $T_{10}$ depicted in the introduction) re…

Representations of sets are challenging to learn because operations on sets should be permutation-invariant. To this end, we propose a Permutation-Optimisation module that learns how to permute a set end-to-end. The permuted set can be further processed to learn a permutation-invariant representation of that set, avoid…

MOSAIC selects few informative exemplars from high-dimensional data with non-linear structures.

Samuel J. Lomonaco Jr and Louis H. Kauffman conjectured that tame knot theory and knot mosaic theory are equivalent. We give a proof of the Lomonaco-Kauffman conjecture.

The AutoML task consists of selecting the proper algorithm in a machine learning portfolio, and its hyperparameter values, in order to deliver the best performance on the dataset at hand. Mosaic, a Monte-Carlo tree search (MCTS) based approach, is presented to handle the AutoML hybrid structural and parametric expensiv…

We introduce MosAIc, an interactive web app that allows users to find pairs of semantically related artworks that span different cultures, media, and millennia. To create this application, we introduce Conditional Image Retrieval (CIR) which combines visual similarity search with user supplied filters or "conditions". …

Theory explains creativity in diffusion models generating novel images.

We show that the orthogonal separation coordinates on the sphere $S^n$ are naturally parametrised by the real version of the Deligne-Mumford-Knudsen moduli space $\bar M_{0,n+2}(R)$ of stable curves of genus zero with $n+2$ marked points. We use the combinatorics of Stasheff polytopes tessellating $\bar M_{0,n+2}(R)$ t…

In this paper, we give a precise and workable definition of a quantum knot system, the states of which are called quantum knots. This definition can be viewed as a blueprint for the construction of an actual physical quantum system. Moreover, this definition of a quantum knot system is intended to represent the "quantu…

New framework boosts neural network performance and resilience.

The paper refines transformations of lattice diagrams and introduces dotted diagrams.

This note explains how to transform Heegaard diagrams into framed link diagrams.

New minimal link diagrams found, including torus links and homogeneous ones.

Algorithm converts Kirby diagrams to trisection diagrams for 4-manifolds.

Kernelized Taylor diagram visualizes data populations with fewer assumptions.

A virtual link diagram is called normal if the associated abstract link diagram is checkerboard colorable, and a virtual link is normal if it has a normal diagram as a representative.In this paper, we introduce a method of converting a virtual link diagram to a normal virtual link diagram by use of the double covering …