Search

This paper defines a new operation through extending the idea of the 0-dimensional crossing change and Shimizu's 2-dimensional region crossing change [A. Shimizu, Region crossing change is an unknotting operation, J. Math. Soc. Jpn. 66(3) (2014) 693–708, doi:10.2969/jmsj/06630693] to a 1-dimensional version called the arc crossing change. We will also prove that the arc crossing change is an unknotting operation with the help of Gauss diagrams. [ABSTRACT FROM AUTHOR]

In this paper, the discovery of the Jones polynomial will be discussed, emphasizing the way in which it illustrated the remarkable unity between distinct parts of mathematics, each with its own language, but initially without a dictionary. [ABSTRACT FROM AUTHOR]

A spiral knot or link diagram (introduced in [C. Adams, R. Hudson, R. Morrison, W. George, L. Starkston, S. Taylor and O. Turanova, The spiral index of knots, Math. Proc. Cambridge Philos. Soc. 149(2) (2010) 297–315]) is an oriented knot or link diagram where, when traversing through the planar diagram, the curvature does not change sign. An oriented knot or link type is called curly if it admits a spiral diagram with fewer maxima than the braid index of that knot or link type. In this paper, we exhibit families of curly knots and links. [ABSTRACT FROM AUTHOR]

In this paper, we generalize the embedded homology groups of hypergraphs initially given in [S. Bressan, J. Li, S. Ren and J. Wu, The embedded homology of hypergraphs and applications, Asian J. Math. 23(3) (2019) 479–500] and study the relative embedded homology groups of hypergraph pairs. We prove some long exact sequences as well as a Mayer–Vietoris sequence for the relative embedded homology groups of hypergraph pairs. Moreover, we briefly discuss the two-dimensional persistence for the relative embedded homology groups of hypergraph pairs. [ABSTRACT FROM AUTHOR]

Patrick Dehornoy's mathematical legacy is impressive and it has been celebrated in other papers of this volume. However, I think that there is another important aspect of Patrick's work that should be stressed, which is his involvement in scientific and managerial leadership in Mathematics. This text wants therefore to be a very personal memory of Patrick Dehornoy and of the impact that he had on my perspective on the relevance and importance of commitments to our community. [ABSTRACT FROM AUTHOR]

With the untimely passing of Patrick Dehornoy in September 2019, the world of mathematics lost a brilliant scholar who made profound contributions to set theory, algebra, topology, and even computer science and cryptography. And I lost a dear friend and a strong influence in the direction of my own research in mathematics. In this paper, I will concentrate on his remarkable discovery that the braid groups are left-orderable, and its consequences, and its strong influence on my own research. I'll begin by describing how I learned of his work. [ABSTRACT FROM AUTHOR]

Although it is known that the dimension of the Vassiliev invariants of degree three of long virtual knots is seven, the complete list of seven distinct Gauss diagram formulas has been unknown explicitly, where only one known formula was revised without proof. In this paper, we give seven Gauss diagram formulas to present the seven invariants of the degree three (Proposition 4). We further give 2 3 Gauss diagram formulas of classical knots (Proposition 5). In particular, the Polyak–Viro Gauss diagram formula [M. Polyak and O. Viro, Gauss diagram formulas for Vassiliev invariants, Int. Math. Res. Not.1994 (1994) 445–453] is not a long virtual knot invariant; however, it is included in the list of 2 3 formulas. It has been unknown whether this formula would be available by arrow diagram calculus automatically. In consequence, as it relates to the conjecture of Goussarov-Polyak-Viro [Finite-type invariants of classical and virtual knots, Topology39 (2000) 1045–1068, Conjecture 3.C], for all the degree three finite type long virtual knot invariants, each Gauss diagram formula is represented as those of Vassiliev invariants of classical knots (Theorem 1). [ABSTRACT FROM AUTHOR]

In this paper we introduce the special rank for virtual knots and some properties of this number are studied. Although we do not know if it can be considered as a nontrivial extension of the meridional rank given by [H. U. Boden and A. I. Gaudreau, Bridge number for virtual and welded knots, J. Knot Theory Ramifications24 (2015), Article ID: 1550008] and by [M. Boileau and B. Zimmermann, The π -orbifold group of a link, Math. Z.200 (1989) 187–208], we prove that classical knots with special rank 2 are 2 -bridge knots. Therefore, a modified version of the so called Cappell and Shaneson conjecture could be considered. [ABSTRACT FROM AUTHOR]

Champanerkar and Kofman [Twisting quasi-alternating links, Proc. Amer. Math. Soc.137(7) (2009) 2451–2458] introduced an interesting way to construct new examples of quasi-alternating links from existing ones. Actually, they proved that replacing a quasi-alternating crossing c in a quasi-alternating link by a rational tangle of same type yields a new quasi-alternating link. This construction has been extended to alternating algebraic tangles and applied to characterize all quasi-alternating Montesinos links. In this paper, we extend this technique to any alternating tangle of same type as c. As an application, we give new examples of quasi-alternating knots of 13 and 14 crossings. Moreover, we prove that the Jones polynomial of a quasi-alternating link that is obtained in this way has no gap if the original link has no gap in its Jones polynomial. This supports a conjecture introduced in [N. Chbili and K. Qazaqzeh, On the Jones polynomial of quasi-alternating links, Topology Appl.264 (2019) 1–11], which states that the Jones polynomial of any prime quasi-alternating link except (2 , p) -torus links has no gap. [ABSTRACT FROM AUTHOR]

A surface-knot is a closed oriented surface smoothly embedded in 4-space and a surface-knot diagram is a projected image of a surface-knot under the orthogonal projection in 3-space with crossing information. Every surface-knot diagram induces a rectangular-cell complex. In this paper, we introduce a covering diagram over a surface-knot diagram. the covering map induces a covering of the rectangular-cell complexes. As an application, a lower bound of triple point numbers for a family of surface-knots is obtained. [ABSTRACT FROM AUTHOR]

An -string tangle is a pair such that is a disjoint union of properly embedded arcs in a topological -ball . And an -string tangle is said to be trivial (or rational), if it is homeomorphic to as a pair, where is a 2-disk, is the unit interval and each is a point in the interior of . A stick tangle is a tangle each of whose arcs consists of finitely many line segments, called sticks. For an -string stick tangle its stick-order is defined to be a nonincreasing sequence of natural numbers such that, under an ordering of the arcs of the tangle, each denotes the number of sticks constituting the th arc of the tangle. And a stick-order is said to be trivial, if every stick tangle of the order is trivial. In this paper, restricting the -ball to be the standard 3-ball, we give the complete list of trivial stick-orders. [ABSTRACT FROM AUTHOR]

In this paper, we introduce a new type of relation between knots called the descendant relation. One knot is a descendant of another knot if can be obtained from a minimal crossing diagram of by some number of crossing changes. We explore properties of the descendant relation and study how certain knots are related, paying particular attention to those knots, called fertile knots, that have a large number of descendants. Furthermore, we provide computational data related to various notions of knot fertility and propose several open questions for future exploration. [ABSTRACT FROM AUTHOR]

Ichihara and Matsudo introduced the notions of -colorable links and the minimal coloring number for -colorable links, which is one of invariants for links. They proved that the lower bound of minimal coloring number of a non-splittable -colorable link is 4. In this paper, we show the minimal coloring number of any non-splittable -colorable link is exactly 4. [ABSTRACT FROM AUTHOR]

In this paper, the -Gordian complex of knots is defined. The authors show that for any knot and any positive integer , there is a finite set of knots of size containing , such that the -Gordian distance between any two knots in this set is 1 for all . [ABSTRACT FROM AUTHOR]

This paper defines versions of the Jones polynomial and Khovanov homology by using several maps from the set of Gauss diagrams to its variant. Through calculation of some examples, this paper also shows that these versions behave differently from the original ones. [ABSTRACT FROM AUTHOR]

Two welded (respectively virtual) link diagrams are homotopic if one may be transformed into the other by a sequence of extended Reidemeister moves, classical Reidemeister moves, and self crossing changes. In this paper, we extend Milnor's μ and $\bar{\mu}$ invariants to welded and virtual links. We conclude this paper with several examples, and compute the μ invariants using the Magnus expansion and Polyak's skein relation for the μ invariants. [ABSTRACT FROM AUTHOR]

The purpose of this paper is to give the homotopy classification of nanophrases of length 2 with 4 letters. To do it we construct some new invariants of nanophrases γ and T. The invariant γ defined in this paper is an extension of the invariant γ for nanowords introduced by Turaev. The invariant T is a new invariant of nanophrases. As a corollary of these results, we give the classification of two-component pointed, ordered, oriented curves on surfaces with minimum crossing number less than or equal to 2. [ABSTRACT FROM AUTHOR]

In this paper, we show how generalized quaternions including some 2 × 2 matrices, can be used to find solutions of the equation \[ [B,(A - 1)(A,B)] = 0. \] These solutions can then be used to find polynomial invariants of virtual knots and links. The remaining 2 × 2 matrices will be considered in a later paper. [ABSTRACT FROM AUTHOR]

Let A, B be invertible, non-commuting elements of a ring R. Suppose that A - 1 is also invertible and that the equation \[ [B,(A - 1)(A,B)] = 0 \] called the fundamental equation is satisfied. Then an invariant R-module is defined for any diagram of a (virtual) knot or link. Solutions in the classic quaternion case have been found by Bartholomew, Budden and Fenn. Solutions in the generalized quaternion case have been found by Fenn in an earlier paper. These latter solutions are only partial in the case of 2 × 2 matrices and the aim of this paper is to provide solutions to the missing cases. [ABSTRACT FROM AUTHOR]

This paper is an exploration of simple four-regular graphs in the plane (i.e. loop-free and with no more than one edge between any two nodes). Such graphs are fundamental to the theory of knots and links in three dimensional space, and their planar diagrams. We dedicate this paper to Frank Harary (1921–2005), whose fascination with graphs of knots inspired this work, and with whom we had the pleasure of developing this paper. [ABSTRACT FROM AUTHOR]

In this paper we prove a Markov theorem for virtual braids and for analogs of this structure including flat virtual braids and welded braids. The virtual braid group is the natural companion to the category of virtual knots, just as the Artin braid group is the natural companion to classical knots and links. In this paper we follow L-move methods to prove the Virtual Markov theorems. One benefit of this approach is a fully local algebraic formulation of the theorems in each category. [ABSTRACT FROM AUTHOR]

Let m,n ∈ ℕ. We define $B_{n,m}(\mathbb{S}^{2})$ to be the set of (n+m)-braids of the sphere whose associated permutation lies in the subgroup Sn × Sm of the symmetric group Sn+m on n+m letters. In a previous paper [13], we showed that if n ≥ 3, then there exists the following generalisation of the Fadell–Neuwirth short exact sequence: \[ 1\to B_m(\mathbb{S}^{2}\setminus\{x_1,\ldots,x_n\})\to B_{n,m}(\mathbb{S}^{2})\stackrel{p_{\ast}}{\longrightarrow} B_n(\mathbb{S}^{2})\to 1, \] where ${p_{\ast}}{:}\, B_{n,m}(\mathbb{S}^{2}) \to B_n(\mathbb{S}^{2})$ is the group homomorphism (defined for all n ∈ ℕ) given geometrically by forgetting the last m strings. In this paper we study the splitting of this short exact sequence, as well as the existence of a cross-section for the fibration $p{:}\, D_{n,m}(\mathbb{S}^{2}) \to D_n(\mathbb{S}^{2})$ of the quotients of the corresponding configuration spaces. Our main results are as follows: if n = 1 (respectively, n = 2) then the homomorphism p* and the fibration p admit (respectively, do not admit) a section. If n = 3, then p* and p admit a section if and only if m ≡ 0,2 (mod 3). If n ≥ 4, we show that if p* and p admit a section then m ≡ ε1(n - 1)(n - 2) - ε2n(n - 2) (mod n(n - 1)(n - 2)), where ε1,ε2 ∈ {0,1}. Finally, we show that $B_n(\mathbb{S}^{2})$ is generated by two of its torsion elements. [ABSTRACT FROM AUTHOR]

Partially peripheral 3-manifolds and homologically peripheral 3-manifolds are defined by generalizing the notion of totally peripheral 3-manifolds. The aim of this paper is to provide a method for constructing hyperbolic links in 3-manifolds whose exteriors are not partially peripheral but homologically peripheral, and to prove that the connected sum with a homology 3-sphere enables every closed connected orientable 3-manifold to contain infinitely many such hyperbolic links. [ABSTRACT FROM AUTHOR]

In this paper, from the viewpoint of quandle construction we prove that for any link type L and any diagram of it, there exists another diagram of L such that these two diagrams are Ω1-dependent, Ω2-dependent and Ω3-dependent. [ABSTRACT FROM AUTHOR]

In a recent work "Arc-presentation of links: Monotonic simplification", Dynnikov shows that each rectangular diagram of the unknot, composite link, or split link can be monotonically simplified into a trivial, composite, or split diagram, respectively. The following natural question arises: Is it always possible to simplify monotonically a rectangular diagram of a satellite knot or link into one where the satellite structure is seen? Here we give a negative answer to that question both for knot and link cases. An example of a torus embedding that cannot be obtained from ordinary "thin" torus by methods of paper [2] is also constructed. [ABSTRACT FROM AUTHOR]

It is well known that Jones polynomial (hence, Kauffman bracket polynomial) of links is, in general, hard to compute. By now, Jones polynomials or Kauffman bracket polynomials of many link families have been computed, see [4, 7–11]. In recent years, the computer algebra (Maple) techniques were used to calculate link polynomials for various link families, see [7, 12–14]. In this paper, we try to design a maple program to calculate the explicit expression of the Kauffman bracket polynomial of Montesinos links. We first introduce a family of "ring of tangles" links, which includes Montesinos links as a special subfamily. Then, we provide a closed-form formula of Kauffman bracket polynomial for a "ring of tangles" link in terms of Kauffman bracket polynomials of the numerators and denominators of the tangles building the link. Finally, using this formula and known results on rational links, the Maple program is designed. [ABSTRACT FROM AUTHOR]

In this paper, we prove that an adequate virtual link diagram of an adequate virtual link has minimal real crossing number. [ABSTRACT FROM AUTHOR]

It is well known that any virtual link is described as the closure of a virtual braid. Therefore, we can define the virtual braid index. Ohyama proved an inequality for the crossing number and the braid index of a classical link. In this paper, we prove an analogous inequality for the (total) crossing number and the braid index of a virtual link. [ABSTRACT FROM AUTHOR]

A generic immersion of a planar graph into the 2-space is said to be knotted if there does not exist a trivial embedding of the graph into the 3-space obtained by lifting the immersion with respect to the natural projection from the 3-space to the 2-space. In this paper, we show that if a generic immersion of a planar graph is knotted then the number of double points of the immersion is more than or equal to three. To prove this, we also show that an embedding of a graph obtained from a generic immersion of the graph (does not need to be planar) with at most three double points is totally free if it contains neither a Hopf link nor a trefoil knot. [ABSTRACT FROM AUTHOR]

We completely determine which Dehn surgeries on 2-bridge links yield reducible 3-manifolds. Further, we consider which surgery on one component of a 2-bridge link yields a torus knot, a cable knot and a satellite knot in this paper. [ABSTRACT FROM AUTHOR]

The stick index of a knot K is defined to be the least number of line segments needed to construct a polygonal embedding of K. We define the projection stick index of K to be the least number of line segments in any projection of a polygonal embedding of K. In this paper, we establish bounds on the projection stick index for various torus knots. We then show that the stick index of a (p, 2p + 1)-torus knot is 4p, and the projection stick index is 2p + 1. This provides examples of knots such that the projection stick index is one greater than half the stick index. We show that for all other torus knots for which the stick index is known, the projection stick index is larger than this. We conjecture that a projection stick index of half the stick index is unattainable for any knot. [ABSTRACT FROM AUTHOR]

In this paper, based on a talk given at the Oberwolfach research centre in May 2008 I will describe how biquandles and their big brother, biracks, can be used to differentiate isotopy classes of virtual (and welded) knots and links. [ABSTRACT FROM AUTHOR]

The present paper is an introduction to a combinatorial theory arising as a natural generalization of classical and virtual knot theory. There is a way to encode links by a class of "realizable" graphs. When passing to generic graphs with the same equivalence relations we get "graph-links". On one hand graph-links generalize the notion of virtual link, on the other hand they do not detect link mutations. We define the Jones polynomial for graph-links and prove its invariance. We also prove some a generalization of the Kauffman–Murasugi–Thistlethwaite theorem on "minimal diagrams" for graph-links. [ABSTRACT FROM AUTHOR]

In this paper we introduce a Jones-type invariant for singular knots, using a Markov trace on the Yokonuma–Hecke algebras Yd,n(u) and the theory of singular braids. The Yokonuma–Hecke algebras have a natural topological interpretation in the context of framed knots. Yet, we show that there is a homomorphism of the singular braid monoid SBn into the algebra Yd,n(u). Surprisingly, the trace does not normalize directly to yield a singular link invariant, so a condition must be imposed on the trace variables. Assuming this condition, the invariant satisfies a skein relation involving singular crossings, which arises from a quadratic relation in the algebra Yd,n(u). [ABSTRACT FROM AUTHOR]

In this paper we prove the following result: for coprime positive integers p and q with p < q, if r is the least positive integer such that 2p-1 and q + r are coprime, then the minimal degree sequence for a torus knot of type (p, q) is the triple (2p - 1, q + r, d) or (q + r, 2p - 1, d) where q + r + 1 ≤ d ≤ 2q - 1. [ABSTRACT FROM AUTHOR]

In this paper we define a partial ordering of knots and links using a special property derived from their minimal diagrams. A link $\mathcal{K}'$ is called a predecessor of a link $\mathcal{K}$ if $Cr(\mathcal{K}') < Cr(\mathcal{K})$ and a diagram of $\mathcal{K}'$ can be obtained from a minimal diagram D of $\mathcal{K}$ by a single crossing change. In such a case, we say that $\mathcal{K}' < \mathcal{K}$. We investigate the sets of links that can be obtained by single crossing changes over all minimal diagrams of a given link. We show that these sets are specific for different links and permit partial ordering of all links. Some interesting results are presented and many questions are raised. [ABSTRACT FROM AUTHOR]

We investigate the following existence problem for rational functions: for a given collection Π of partitions of a number n to define whether there exists a rational function f of degree n for which Π is the branch datum. An important particular case when the answer is known is the one when the collection Π contains a partition consisting of a single element (in this case, the corresponding rational function is equivalent to a polynomial). In this paper, we provide a solution in the case when Π contains a partition consisting of two elements. [ABSTRACT FROM AUTHOR]

Our longterm plan is to classify knot modules and pairings by utilizing the power of computational number theory. The first step in this is to define invariants for which any given value arises from only finitely many modules: this is the purpose of the present paper. [ABSTRACT FROM AUTHOR]

Isomorphism classes of Alexander quandles of order 16 are determined, and classes of connected quandles are identified. This paper extends the list of distinct connected finite Alexander quandles. [ABSTRACT FROM AUTHOR]

Call two pairs (M,N) and (M′,N′) of m × n matrices over a field K, simultaneously K-equivalent if there exist square invertible matrices S,T over K, with M′ = SMT and N′ = SNT. Kronecker [2] has given a complete set of invariants for simultaneous equivalence of pairs of matrices. Associate in the natural way to a finite directed graph Γ, with v vertices and e edges, an ordered pair (M,N) of e × v matrices of zeros and ones. It is natural to try to compute the Kronecker invariants of such a pair (M,N), particularly since they clearly furnish isomorphism-invariants of Γ. Let us call two graphs "linearly equivalent" when their two corresponding pairs are simultaneously equivalent. There have existed, since 1890, highly effective algorithms for computing the Kronecker invariants of pairs of matrices of the same size over a given field [1,2,5,6] and in particular for those arising in the manner just described from finite directed graphs. The purpose of the present paper, is to compute directly these Kronecker invariants of finite directed graphs, from elementary combinatorial properties of the graphs. A pleasant surprise is that these new invariants are purely rational — indeed, integral, in the sense that the computation needed to decide if two directed graphs are linearly equivalent only involves counting vertices in various finite graphs constructed from each of the given graphs — and does not involve finding the irreducible factorization of a polynomial over K (in apparent contrast both to the familiar invariant-computations of graphs furnished by the eigenvalues of the connection matrix, and to the isomorphism problem for general pairs of matrices). [ABSTRACT FROM AUTHOR]

Motivated by Massey–Milnor linking and Chern–Simon–Witten perturbative quantum field theory, we developed some combinatorial and diagrammatic study in this paper, aiming at knot theory in the combinatoric aspect. [ABSTRACT FROM AUTHOR]

In this paper, we explore the issue of minimizing the degree sequence for torus knots. We find the minimal degree sequence for torus knots of type (p, 2p-1) for any integer p ≥2. We use some results from algebraic geometry to prove our main result. [ABSTRACT FROM AUTHOR]

In this paper, we will explore the properties of knots that lie in a surface cross an interval. We show that any alternating knot nontrivially embedded in S × I is chiral. This demonstrates that knots in S × I behave differently from knots in the three sphere, where alternating knots (like the figure eight) can be amphichiral. We use a generalized Kauffman bracket polynomial, as well as geometric and covering space techniques. [ABSTRACT FROM AUTHOR]

In this paper we investigate the Alexander polynomial of (1,1)-knots, which are knots lying in a 3-manifold with genus one at most, admitting a particular decomposition. More precisely, we study the connections between the Alexander polynomial and a polynomial associated to a cyclic presentation of the fundamental group of an n-fold strongly-cyclic covering branched over the knot K, which we call the n-cyclic polynomial of K. In this way, we generalize to all (1,1)-knots, with the only exception of those lying in S2×S1, a result obtained by Minkus for 2-bridge knots and extended by the author and M. Mulazzani to the case of (1,1)-knots in S3. As corollaries some properties of the Alexander polynomial of knots in S3 are extended to the case of (1,1)-knots in lens spaces. [ABSTRACT FROM AUTHOR]

Habiro found in his thesis a topological interpretation of finite type invariants of knots in terms of local moves called Habiro's Ck-moves. Ck-moves are defined by using his claspers. In this paper we define "oriented" claspers and RCk-moves among ribbon 2-knots as modifications of Habiro's notions to give a similar interpretation of Habiro–Kanenobu–Shima's finite type invariants of ribbon 2-knots. It works also for ribbon 1-knots. Furthermore, by using oriented claspers for ribbon 1-knots, we can prove Habiro–Shima's conjecture in the case of ℚ-valued invariants, saying that ℚ-valued Habiro–Kanenobu–Shima finite type invariant and ℚ-valued Vassiliev–Goussarov finite type invariant are the same thing. [ABSTRACT FROM AUTHOR]

In this paper we prove that two n-gems induce the same manifold if and only if they are linked by a finite sequence of gem moves. A gem move is either a blob move, consisting in the creation or cancellation of an n-dipole, or a clean flip, which is a switch of a pair of edges of the same color that thickens an h-dipole, 1 ≤ h ≤ n - 1, or the inverse operation, which slims an h-dipole, 2 ≤ h ≤ n. Moreover we prove that we can reorder the gem moves, so that all the blob creations precede all clean flips which then precede all the blob cancellations. This reordering is of interest because it is an easy matter to decide whether two gems are linked by a finite sequence of clean flips. As a consequence, if a bound for the number of blob creations is established, then there exists a deterministic finite algorithm to decide whether two gems induce the same manifold or not. [ABSTRACT FROM AUTHOR]

In this paper, we list in explicit form the factoring relations of the Kauffman bracket skein module (KBSM for short) of a twist knot exterior. This is done using curves decorated by characters of irreducible SL(2, ℂ)-representations. In the process, we exhibit a relation which holds in the KBSM of the knot exterior, called the minimal relation. In the final section we prove that, when specializing the variable of the Kauffman bracket at t = -1, the minimal relation becomes the defining polynomial of the SL(2, ℂ)-character variety of the twist knot. [ABSTRACT FROM AUTHOR]

For a hyperbolic knot in the 3-sphere, the distance between toroidal surgeries is at most 5, except the figure eight knot. In this paper, we determine all hyperbolic knots that admit two toroidal surgeries with distance 5. [ABSTRACT FROM AUTHOR]

Hirasawa and Uchida defined the Gordian complex of knots which is a simplicial complex whose vertices consist of all knot types in S3 by using "a crossing change". In this paper, we define the Ck-Gordian complex of knots which is an extension of the Gordian complex of knots. Let k be a natural number more than 2 and we show that for any knot K0 and any given natural number n, there exists a family of knots {K0, K1,..., Kn} such that for any pair (Ki, Kj) of distinct elements of the family, the Ck-distance dCk(Ki, Kj) = 1. [ABSTRACT FROM AUTHOR]

For a knot or link K, let L(K) denote the rope length of K and let Cr(K) denote the crossing number of K. An important problem in geometric knot theory concerns the bound on L(K) in terms of Cr(K). It is well-known that there exist positive constants c1, c2 such that for any knot or link K, c1 · (Cr(K))3/4 ≤ L(K) ≤ c2 · (Cr(K))3/2. It is also known that for any real number p such that 3/4 ≤ p ≤ 1, there exists a family of knots {Kn} with the property that Cr(Kn) → ∞ (as n → ∞) such that L(Kn) = O(Cr(Kn)p). However, it is still an open question whether there exists a family of knots {Kn} with the property that Cr(Kn) → ∞ (as n → ∞) such that L(Kn) = O(Cr(Kn)p) for some 1 < p ≤ 3/2. In this paper, we show that there are many families of prime alternating Conway algebraic knots {Kn} with the property that Cr(Kn) → ∞ (as n → ∞) such that L(Kn) can grow no faster than linearly with respect to Cr(Kn). [ABSTRACT FROM AUTHOR]