Related papers: Space-Efficient Prime Knot 7-Mosaics
Minimizing the bending energy within knot classes leads to the concept of elastic knots which has been initiated in [von der Mosel, Asymptot. Anal. 1998]. Motivated by numerical experiments in arxiv:1804.02206 (doi:10.1090/mcom/3633) we…
The paper investigates biorderability of knot quandles of prime knots up to eight crossings. We prove that knot quandles of knots $6_3$, $8_7$, $8_8$, $8_{10}$ and $8_{16}$ can not be biorderable. However, we see that knot quandles of knots…
In this paper, we give a method to evaluate minimum numbers of Dehn colors for knots by using symmetric local biquandle cocycle invariants. We give answers to some questions arising as a consequence of our previous paper [6]. In particular,…
We determine p-colorability of the paradromic rings. These rings arise by generalizing the well-known experiment of bisecting a Mobius strip. Instead of joining the ends with a single half twist, use $m$ twists, and, rather than bisecting…
The works presented in this habilitation concern the algorithmics of polynomials. This is a central topic in computer algebra, with numerous applications both within and outside the field - cryptography, error-correcting codes, etc. For…
This paper proposed a storing approach for trie structures, called coordinate hash trie. The basic idea is using a global hash table with a special hash function to store all edges of a trie. For a trie with $n$ nodes and an alphabet with…
We prove that all knots with unknotting number at most 21 are smoothly slice in the K3 surface. We also prove a more general statement for 4-manifolds that contain a plumbing tree of spheres. Our strategy is based on a flexible method to…
We study the space of all tilings which can be obtained using the Robinson tiles (this is a two-dimensional subshift of finite type). We prove that it has a unique minimal subshift, and describe it by means of a substitution. This…
This text is a presentation of a set of formulae, first found by Vainsencher (for $\delta \leq 6$) and shortly after improved by Kleiman and Piene, counting $\delta$-nodal curves in a complete linear system on a smooth surface, if $\delta…
In this expository paper we describe four primality tests. The first test is very efficient, but is only capable of proving that a given number is either composite or 'very probably' prime. The second test is a deterministic polynomial time…
We develop a recursive formula for counting the number of rectangulations of a square, i.e the number of combinatorially distinct tilings of a square by rectangles. Our formula specializes to give a formula counting generic rectangulations,…
Looking at incidence matrices of $t$-$(v,k,\lambda)$ designs as $v \times b$ matrices with $2$ possible entries, each of which indicates incidences of a $t$-design, we introduce the notion of a $c$-mosaic of designs, having the same number…
Logarithmic gaps have been used in order to find a periodic component of the sequence of prime numbers, hidden by a random noise (stochastic or chaotic). The recovered period for the sequence of the first 10000 prime numbers is equal to…
Tilings of a surface of negative Euler characteristic by n-gons with n\ge 7 is a finite problem. One extreme of the finite problem is single tile tilings. We develop the algorithm for finding all the single tile tilings and present the…
We present an enhanced prime decomposition theorem for knots that gives the isotopy classes of composite knots that can be constructed from a given list of prime factors (allowing for the mirroring and orientation reversing for each…
It is a major unsolved problem as to whether unknot recognition - that is, testing whether a given closed loop in R^3 can be untangled to form a plain circle - has a polynomial time algorithm. In practice, trivial knots (which can be…
We show that all knots up to $6$ crossings can be represented by polynomial knots of degree at most $7$, among which except for $5_2, 5_2^*, 6_1, 6_1^*, 6_2, 6_2^*$ and $6_3$ all are in their minimal degree representation. We provide…
Several articles deal with tilings with squares and dominoes on 2-dimensional boards, but only a few on boards in 3-dimensional space. We examine a tiling problem with colored cubes and bricks of $(2\times2\times n)$-board in three…
This thesis develops some general calculational techniques for finding the orders of knots in the topological concordance group C. The techniques currently available in the literature are either too theoretical, applying to only a small…
In 1999, Balog, Br\"udern, and Wooley (1999) showed there are infinitely many prime gaps $p-q$ that are $(\log p)^{\frac{3}{4}}$-smooth, and infinitely many consecutive prime gaps that are $(\log p)^\frac{7}{8}$-smooth. Advancements made…