arXiv research

Rectangular mosaics extend virtual knot studies to larger polygons.

Improved bounds for knot crossings in different mosaic patterns.

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…

We give an infinite family of knots such that for any given $r \geq 3$, the family contains a knot which can be embedded on a hexagonal $r$-mosaic, but cannot fit on a hexagonal $r$-mosaic in an embedding that achieves its crossing number. This extends the rectangular mosaic result of Ludwig, Evans, and Paat. We also i…

Paper introduces spherical knot mosaics for knot and link invariants.

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…

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

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

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

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…

Enhances knot counting using mosaic diagrams.

This paper studies virtual knots using mosaic diagrams.

Computes bounds on mosaic number of Legendrian knots.

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

KnotMosaics package simplifies knot theory computations in SageMath.

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 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…

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…

The concepts of tile number and space-efficiency for knot mosaics were first explored by Heap and Knowles (arXiv:1702.06462), where they determined the possible tile numbers and space-efficient layouts for every prime knot with mosaic number 6 or less. In this paper, we extend those results to prime knots with mosaic n…

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…

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…

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…

New tiles allow efficient knot mosaics for small knots.

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.

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…

Rectangular diagrams help analyze foliations in 3-sphere.

We address the problem of distinguishing cause from effect in bivariate setting. Based on recent developments in nonlinear independent component analysis (ICA), we train nonparametrically general nonlinear causal models that allow non-additive noise. Further, we build an ensemble framework, namely Causal Mosaic, which …

New proof for symmetric spaces with rectangular lattices.

Rectangular peg problem solved for many curves.

Proves a theorem for comparing surfaces in 3D space.

If a rectangular diagram represents the trivial knot, then it can be deformed into the rectangular diagram with only two vertical edges by a finite sequence of merge operations and exchange operations, without increasing the number of vertical edges, which was shown by I. A. Dynnikov. We show in this paper that we need…

In this paper Legendrian graphs in $(\mathbb{R}^3,ξ_{\mathrm{st}})$ are considered modulo Legendrian isotopy and edge contraction. To a Legendrian graph we associate a (generalized) rectangular diagram --- a purely combinatorial object. Moves of rectangular diagrams are introduced so that equivalence classes of Legendr…

Paper studies S-rectangular DR-RL models for robust reinforcement learning with near-optimal sample complexity.

The study improves inequalities for link diagrams and introduces weak rectangular diagrams.

We introduce a simple combinatorial way, which we call a rectangular diagram of a surface, to represent a surface in the three-sphere. It has a particularly nice relation to the standard contact structure on $\mathbb S^3$ and to rectangular diagrams of links. By using rectangular diagrams of surfaces we are going, in p…

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…

Study reveals $1/f$ noise in signals made from nonoverlapping rectangular pulses.

We claim that the recently discovered universal-matrix precursor for the $F$ functions, which define the differential expansion of colored polynomials for twist and double braid knots, can be extended from rectangular to non-rectangular representations. This case is far more interesting, because it involves multiplicit…

We conjecture a closed-form expression of HOMFLY-PT invariants of double twist knots colored by rectangular Young diagrams where the twist is encoded in interpolation Macdonald polynomials. We also put forth a conjecture of cyclotomic expansions of HOMFLY-PT polynomials colored by rectangular Young diagrams for any kno…

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

If a rectangular diagram represents the trivial knot, then it can be deformed into the trivial rectangular diagram with only four edges by a finite sequence of merge operations and exchange operations, without increasing the number of edges, which was shown by I. A. Dynnikov. Using this, Henrich and Kauffman gave an up…