cp's OEIS Frontend

A Legendrian n-mosaic is an n X n array of the 10 tiles given in Figure 5 of Pezzimenti and Pandey. These tiles represent part of a Legendrian curve in the front projection.

A Legendrian n-mosaic is suitably connected iff the connection points of each tile coincide with those of all contiguous tiles. Note that the n-mosaic consisting of all blank tiles is vacuously suitably connected even though it does not represent a link.

This is the main diagonal of A375354. It appears to grow at a quadratic exponential rate, and the ratios a(n)/A261400(n) seem to converge to 0 at a quadratic exponential rate.

For more information, see Sections 4 and 5 of Kipe et al. In particular, see Figures 20 and 21 for explicit best-fit models. - Luc Ta, Oct 27 2024

An m X n link mosaic is a suitably connected m X n array of the 11 tiles given by Lomonaco and Kauffman. The condition of being suitably connected means that the connection points of each tile coincide with those of the contiguous tiles. Thus, link mosaics depict projections of a link or a knot onto a plane.

The Mathematica program below is based on the algorithm given in Theorem 1 of Oh, Hong, Lee, and Lee.

An m X n Legendrian mosaic is an m X n array of the 10 tiles given in Figure 5 of Pezzimenti and Pandey. These tiles represent part of a Legendrian curve in the front projection. The condition of being suitably connected means that the connection points of each tile coincide with those of the contiguous tiles.

The Mathematica program below is based on the algorithm given in Theorem 1 of Oh, Hong, Lee, and Lee, adapted to the Legendrian setting: since Legendrian mosaic tiles omit the crossing tile T_9 used in general knot mosaics, the bottom-right submatrix of O_(k+1) is 3*O_k rather than 4*O_k. See Theorem 6 of Kipe et al.

T(m,2) = A375353(m,2) = A000079(m-1) for all m >= 2 since neither classical nor Legendrian link mosaics with only 2 columns or rows can use T_9 tiles.

An m X n mosaic is an m X n array of the 11 tiles given by Lomonaco and Kauffman. A period m X n mosaic is an m X n mosaic whose opposite edges are identified. A period mosaic depicts a knot or link iff the connection points of each tile coincide with those of the contiguous tiles and with those of the tiles on identified edges.

The Mathematica program below is based on the algorithm given in Theorem 2 of Oh, Hong, Lee, Lee, and Yeon.

T(m, n) >= A375356(m, n) for all m and n, with equality iff m = n = 1.

T(m, 1) = A074600(m) for all m. To see this, proceed by induction on m. In Theorem 2 of Oh, Hong, Lee, Lee, and Yeon, it is clear that tr(X_{m+1}) = 2*tr(X_m) and tr(O_{m+1}) = 5*tr(O_m) for all m. The theorem states that T(m+1, 1) = tr(X_{m+1} + O_{m+1}) = tr(X_{m+1}) + tr(O_{m+1}) = 2*tr(X_m) + 5*tr(O_m), and the claim follows since tr(X_1 + O_1) = 7.

An m X n mosaic is an m X n array of the 11 tiles given by Lomonaco and Kauffman. A period m X n mosaic is an m X n mosaic whose opposite edges are identified. A toroidal m X n mosaic is an equivalence class of period m X n mosaics up to finite sequences of cyclic rotations of rows and columns. A toroidal mosaic depicts the projection of a knot or link on the surface of a torus iff the connection points of each tile coincide with those of the contiguous tiles and with those of the tiles on identified edges.

The first five rows of the triangle are from Table 2 of Oh, Hong, Lee, Lee, and Yeon.

Clearly, T(m,n) <= A375355(m,n) for all m,n, with equality iff m = n = 1.

A p X p mosaic is an p X p array of the 11 tiles given by Lomonaco and Kauffman. A period p X p mosaic is an p X p mosaic whose opposite edges are identified. A toroidal p X p mosaic is an equivalence class of period p X p mosaics up to finite sequences of cyclic rotations of rows and columns. A toroidal mosaic depicts the projection of a knot or link on the surface of a torus iff the connection points of each tile coincide with those of the contiguous tiles and with those of the tiles on identified edges.

The Mathematica program below is based on the algorithm given in Theorem 4 of Oh, Hong, Lee, Lee, and Yeon.

Partial sums of A081341. - Klaus Purath, Jul 28 2020

An n X n mosaic is an n X n array of the 11 tiles given by Lomonaco and Kauffman. The mosaic number of a knot K is the smallest integer n such that K is realizable on an n X n knot mosaic.

Here, we count the unknot as a prime knot.