相关论文: Space-Efficient Prime Knot 7-Mosaics

Consecutive matrix multiplications are commonly used in graph neural networks and sparse linear solvers. These operations frequently access the same matrices for both reading and writing. While reusing these matrices improves data locality,…

It is well known that knots are countable in ordinary knot theory. Recently, knots {\it with intersections} have raised a certain interest, and have been found to have physical applications. We point out that such knots --equivalence…

A new Combined Sieve algorithm is presented with cost proportional to the number of enumerated factors over a series of intervals. This algorithm achieves a significant speedup, over a traditional sieve, when handling many ([10^4, 10^7])…

In [BNRR], it was shown that tiling of general regions with two rectangles is NP-complete, except for a few trivial special cases. In a different direction, R\'emila showed that for simply connected regions by two rectangles, the…

Aperiodic tiling is a well-know area of research. First developed by mathematicians for the mathematical challenge they represent and the beauty of their resulting patterns, they became a growing field of interest when their practical use…

In 2000, Thomas Fink and Young Mao studied neck ties and, with certain assumptions, found 85 different ways to tie a neck tie. They gave a formal language which describes how a tie is made, giving a sequence of moves for each neck tie. The…

We compute the linking number of two modular knots in the space $\text{PSL}(2, \mathbb{Z})\backslash\text{PSL}(2, \mathbb{R})$ with the trefoil filled in, which answers a question posed by Ghys in 2007. This computation is realized through…

Every knot can be embedded in the union of finitely many half planes with a common boundary line in such a way that the portion of the knot in each half plane is a properly embedded arc. The minimal number of such half planes is called the…

Knots in wood are critical to both aesthetics and structural integrity, making their detection and pairing essential in timber processing. However, traditional manual annotation was labor-intensive and inefficient, necessitating automation.…

How many different tiles are needed at the minimum to create aperiodicity? Several tilings made of two tiles were discovered, the first one being by Penrose in the seventies. Since then, scientists discovered other aperiodic tilings made of…

We determine the prime strongly positive amphicheiral knots up to 16 crossings and show that a large fraction of them admit knot diagrams with a double symmetry (rotational symmetry for strongly positive amphicheirality and an additional…

An effective way to design structured coherent wave interference patterns that builds on the theory of coherent lattices, is presented. The technique combines prime number factorization in the complex plane with moir\'e theory to provide a…

We show that a square-tiling of a $p\times q$ rectangle, where $p$ and $q$ are relatively prime integers, has at least $\log_2p$ squares. If $q>p$ we construct a square-tiling with less than $q/p+C\log p$ squares of integer size, for some…

Given a (genus 2) cube-with-holes M, i.e. the complement in S^3 of a handlebody H, we relate intrinsic properties of M (like its cut number) with extrinsic features depending on the way the handlebody H is knotted in S^3. Starting from a…

We study the dissection of a square into congruent convex polygons. Yuan \emph{et al.} [Dissecting the square into five congruent parts, Discrete Math. \textbf{339} (2016) 288-298] asked whether, if the number of tiles is a prime number…

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

Optimal block designs in small blocks are explored when the treatments have a natural ordering and interest lies in comparing consecutive pairs of treatments. We first develop an approximate theory which leads to a convenient multiplicative…

Tilings of a surface of negative Euler characteristic by n-gons with n\ge 7 is a finite problem. We develop the algorithm for finding all the tilings for fixed number of tiles and present the calculation for tilings of surfaces of small…

Frequently, knots are enumerated by their crossing number. However, the number of knots with crossing number $c$ grows exponentially with $c$, and to date computer-assisted proofs can only classify diagrams up to around twenty crossings.…

Finding an efficient optimal partial tiling algorithm is still an open problem. We have worked on a special case, the tiling of Manhattan polyominoes with dominoes, for which we give an algorithm linear in the number of columns. Some…