Results 1  10
of
74
On conway’s thrackle conjecture
 Proc. 11th ACM Symp. on Computational Geometry
, 1995
"... A thrackle is a graph drawn in the plane so that its edges are represented by Jordan arcs and any two distinct arcs either meet at exactly one common vertex or cross at exactly one point interior to both arcs. About forty years ago, J. H. Conway conjectured that the number of edges of a thrackle can ..."
Abstract

Cited by 18 (2 self)
 Add to MetaCart
A thrackle is a graph drawn in the plane so that its edges are represented by Jordan arcs and any two distinct arcs either meet at exactly one common vertex or cross at exactly one point interior to both arcs. About forty years ago, J. H. Conway conjectured that the number of edges of a thrackle
BORCHERDS ’ PROOF OF THE CONWAYNORTON CONJECTURE
, 903
"... Abstract. We give a summary of R. Borcherds ’ solution (with some modifications) to the following part of the ConwayNorton conjectures: Given the Monster M and FrenkelLepowskyMeurman’s moonshine module V ♮ , prove the equality between the graded characters of the elements of M acting on V ♮ (i.e. ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Abstract. We give a summary of R. Borcherds ’ solution (with some modifications) to the following part of the ConwayNorton conjectures: Given the Monster M and FrenkelLepowskyMeurman’s moonshine module V ♮ , prove the equality between the graded characters of the elements of M acting on V ♮ (i
A Reduction of Conway’s Thrackle Conjecture
"... Abstract. A thrackle is a drawing of a simple graph on the plane, where each edge is drawn as a smooth arc with distinct endpoints, and every two arcs have exactly one common point, at which they have distinct tangents. Conway, who coined the term thrackle, conjectured that there is no thrackle wit ..."
Abstract
 Add to MetaCart
Abstract. A thrackle is a drawing of a simple graph on the plane, where each edge is drawn as a smooth arc with distinct endpoints, and every two arcs have exactly one common point, at which they have distinct tangents. Conway, who coined the term thrackle, conjectured that there is no thrackle
Abstract A Study of Conway’s Thrackle Conjecture
"... A thrackle is a drawing of a simple graph on the plane, where each edge is drawn as a smooth arc with distinct endpoints, and every two arcs have exactly one common point, at which they have distinct tangents. Conway, who coined the term thrackle, conjectured that there is no thrackle with more edg ..."
Abstract
 Add to MetaCart
A thrackle is a drawing of a simple graph on the plane, where each edge is drawn as a smooth arc with distinct endpoints, and every two arcs have exactly one common point, at which they have distinct tangents. Conway, who coined the term thrackle, conjectured that there is no thrackle with more
On The MelvinMortonRozansky Conjecture
, 1994
"... . We prove a conjecture stated by Melvin and Morton (and elucidated further by Rozansky) saying that the AlexanderConway polynomial of a knot can be read from some of the coefficients of the Jones polynomials of cables of that knot (i.e., coefficients of the "colored" Jones polynomial) ..."
Abstract

Cited by 100 (22 self)
 Add to MetaCart
. We prove a conjecture stated by Melvin and Morton (and elucidated further by Rozansky) saying that the AlexanderConway polynomial of a knot can be read from some of the coefficients of the Jones polynomials of cables of that knot (i.e., coefficients of the "colored" Jones polynomial
A factorization of the Conway polynomial
 Comment. Math. Helvetici
, 1999
"... It is tempting to conjecture that there is some interesting relationship between the Conway polynomial ∇L(z) of a link L and ∇K(z), where K is a knot obtained by banding together the components of L. Obviously they cannot be equal since only terms of even or odd degree appear in ∇L(z), according to ..."
Abstract

Cited by 10 (0 self)
 Add to MetaCart
It is tempting to conjecture that there is some interesting relationship between the Conway polynomial ∇L(z) of a link L and ∇K(z), where K is a knot obtained by banding together the components of L. Obviously they cannot be equal since only terms of even or odd degree appear in ∇L(z), according
Chirality And The Conway Polynomial
"... In recent work with J. Mostovoy and T. Stanford, the author found that for every natural number n, a certain polynomial in the coefficients of the Conway polynomial is a primitive integervalued degree n Vassiliev invariant, but that modulo 2, it becomes degree n1. The conjecture then naturally ..."
Abstract
 Add to MetaCart
In recent work with J. Mostovoy and T. Stanford, the author found that for every natural number n, a certain polynomial in the coefficients of the Conway polynomial is a primitive integervalued degree n Vassiliev invariant, but that modulo 2, it becomes degree n1. The conjecture then naturally
Results 1  10
of
74