English
Related papers

Related papers: Tile Number and Space-Efficient Knot Mosaics

200 papers

For a knot K, the concordance crosscap number, c(K), is the minimum crosscap number among all knots concordant to K. Building on work of G. Zhang, which studied the determinants of knots with c(K) < 2, we apply the Alexander polynomial to…

Geometric Topology · Mathematics 2013-10-29 Charles Livingston

We prove that a simple knot in the lens space $L(p,q)$ fibers if and only if its order in homology does not divide any remainder occurring in the Euclidean algorithm applied to the pair $(p,q)$. One corollary is that if $p=m^2$ is a perfect…

Geometric Topology · Mathematics 2021-06-17 Joshua Evan Greene , John Luecke

A knot is an a-small knot if its exterior does not contain closed incompressible surfaces disjoint from some incompressible Seifert surface for the knot. Using circular thin position for knots we prove that the handle number is additive…

Geometric Topology · Mathematics 2012-10-25 F. Manjarrez-Gutiérrez

Previous work used polygonal realizations of knots to reduce the problem of computing the superbridge number of a realization to a linear programming problem, leading to new sharp upper bounds on the superbridge index of a number of knots.…

Geometric Topology · Mathematics 2022-11-14 Clayton Shonkwiler

Digital mosaics have usually used regular tiles, simulating the historical "tessellated" mosaics. In this paper, we present a method for synthesizing pebble mosaics, a historical mosaic style in which the tiles are rounded pebbles. We…

Graphics · Computer Science 2019-02-11 Lars Doyle , Forest Anderson , Ehren Choy , David Mould

A dyadic tile of order n is any rectangle obtained from the unit square by n successive bisections by horizontal or vertical cuts. Let each dyadic tile of order n be available with probability p, independently of the others. We prove that…

Probability · Mathematics 2012-07-24 Omer Angel , Alexander E. Holroyd , Gady Kozma , Johan Wästlund , Peter Winkler

Negami found an upper bound on the stick number $s(K)$ of a nontrivial knot $K$ in terms of the minimal crossing number $c(K)$ of the knot which is $s(K) \leq 2 c(K)$. Furthermore McCabe proved $s(K) \leq c(K) + 3$ for a $2$-bridge knot or…

Geometric Topology · Mathematics 2014-11-10 Youngsik Huh , Sungjong No , Seungsang Oh

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…

Combinatorics · Mathematics 2013-05-14 Igor Pak , Jed Yang

We consider the tiling of an $n$-board (a $1\times n$ array of square cells of unit width) with half-squares ($\frac12\times1$ tiles) and $(\frac12,\frac12)$-fence tiles. A $(\frac12,\frac12)$-fence tile is composed of two half-squares…

Combinatorics · Mathematics 2019-11-05 Kenneth Edwards , Michael A. Allen

We use matchings on Lyndon words to classify flat knots up to 8 crossings. Using flat knots invariants such as the based matrix, the $\phi$-invariant, the flat arrow polynomial, and the flat Jones-Krushkal polynomial, we distinguish all…

Geometric Topology · Mathematics 2024-10-02 Jie Chen

In 2013, Adams introduced the $n$-crossing number of a knot $K$, denoted by $c_n(K)$. Inequalities between the $2$-, $3$-, $4$-, and $5$-crossing numbers have been previously established. We prove $c_9(K)\leq c_3(K)-2$ for all knots $K$…

Geometric Topology · Mathematics 2023-10-18 Nicholas Hagedorn

It is well-known that the question of whether a given finite region can be tiled with a given set of tiles is NP-complete. We show that the same is true for the right tromino and square tetromino on the square lattice, or for the right…

Combinatorics · Mathematics 2007-05-23 Cristopher Moore , John Michael Robson

This is the first of three papers that refine and extend portions of our earlier preprint, "Depth of a knot tunnel." Together, they rework the entire preprint. H. Goda, M. Scharlemann, and A. Thompson described a general construction of all…

Geometric Topology · Mathematics 2008-12-09 Sangbum Cho , Darryl McCullough

Symmetries of knots have been studied extensively, and strongly invertible knots are one of them. Lamm defined the equivariant crossing number $c_t(K)$, the minimum crossing number among all symmetric diagrams for a strongly invertible knot…

Geometric Topology · Mathematics 2023-04-04 Jundai Nanasawa

The (isothermic) compressibility of lattice knots can be examined as a model of the effects of topology and geometry on the compressibility of ring polymers. In this paper, the compressibility of minimal length lattice knots in the simple…

Soft Condensed Matter · Physics 2015-06-04 Esaias J Janse van Rensburg , Andrew Rechnitzer

In this paper we present a systematic method to generate prime knot and prime link minimal triple-point projections, and then classify all classical prime knots and prime links with triple-crossing number at most four. We also extend the…

Geometric Topology · Mathematics 2020-05-25 Michal Jablonowski , Lukasz Trojanowski

We propose a novel, good-quality, and less demanding method for detecting knots on the surface of wooden logs using multimodal data fusion. Knots are a primary factor affecting the quality of sawn timber, making their detection fundamental…

Computer Vision and Pattern Recognition · Computer Science 2025-03-28 Bořek Reich , Matej Kunda , Fedor Zolotarev , Tuomas Eerola , Pavel Zemčík , Tomi Kauppi

A piecewise Chebyshevian spline space is a space of spline functions having pieces in different Extended Chebyshev spaces and where the continuity conditions between adjacent spline segments are expressed by means of connection matrices.…

Numerical Analysis · Mathematics 2016-01-05 Carolina Vittoria Beccari , Giulio Casciola

In this paper we introduce a new algebraic method in tilings. Combining this method with Hilbert's Nullstellensatz we obtain a necessary condition for tiling $n$-space by translates of a cluster of cubes. Further, the polynomial method will…

Combinatorics · Mathematics 2016-03-02 Peter Horak , Dongryul Kim

Discrete tomography deals with reconstructing finite spatial objects from lower dimensional projections and has applications for example in timetable design. In this paper we consider the problem of reconstructing a tile packing from its…

Computational Complexity · Computer Science 2010-12-22 Marek Chrobak , Christoph Durr , Flavio Guinez , Antoni Lozano , Nguyen Kim Thang