Seven mutually touching infinite cylinders

We solve a problem of Littlewood: there exist seven infinite circular cylinders of unit radius which mutually touch each other. In fact, we exhibit two such sets of cylinders. Our approach is algebraic and uses symbolic and numerical computational techniques. We consider a system of polynomial equations describing the position of the axes of the cylinders in the 3 dimensional space. To have the same number of equations (namely 20) as the number of variables, the angle of the first two cylinders is fixed to 90 degrees, and a small family of direction vectors is left out of consideration. Homotopy continuation method has been applied to solve the system. The number of paths is about 121 billion, it is hopeless to follow them all. However, after checking 80 million paths, two solutions are found. Their validity, i.e., the existence of exact real solutions close to the approximate solutions at hand, was verified with the alphaCertified method as well as by the interval Krawczyk method.

[1]  F. Drexler.  Eine Methode zur berechnung sämtlicher Lösungen von Polynomgleichungssystemen , 1977 .

[2]  Rudolf Krawczyk,et al.  Newton-Algorithmen zur Bestimmung von Nullstellen mit Fehlerschranken , 1969, Computing.

[3]  P. Pikhitsa,et al.  Seven, eight, and nine mutually touching infinitely long straight round cylinders: Entanglement in Euclidean space , 2013, 1312.6207.

[4]  Frank Sottile,et al.  ALGORITHM XXX: ALPHACERTIFIED: CERTIFYING SOLUTIONS TO POLYNOMIAL SYSTEMS , 2011 .

[5]  János Pach,et al.  Research problems in discrete geometry , 2005 .

[6]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[7]  Bernd Sturmfels,et al.  A polyhedral method for solving sparse polynomial systems , 1995 .

[8]  Tien Yien Li,et al.  MIXED VOLUME COMPUTATION IN PARALLEL , 2014 .

[9]  J. Littlewood.  Some problems in real and complex analysis , 1968 .

[10]  P. Pikhitsa.  Regular Network of Contacting Cylinders with Implications for Materials with Negative Poisson Ratios , 2004 .

[11]  C. B. García,et al.  Finding all solutions to polynomial systems and other systems of equations , 1979, Math. Program..

[12]  P. Pikhitsa.  Architecture of cylinders with implications for materials with negative Poisson ratio , 2007 .

[13]  András Bezdek,et al.  On the Number of Mutually Touching Cylinders , 2007 .

[14]  András Bezdek,et al.  On the number of mutually touching cylinders. Is it 8? , 2008, Eur. J. Comb..

[15]  Sung-Hoon Ahn,et al.  Auxetic lattice of multipods , 2009 .

[16]  Siegfried M. Rump,et al.  INTLAB - INTerval LABoratory , 1998, SCAN.

[17]  C. Ogilvy,et al.  Tomorrow's math; unsolved problems for the amateur , 1964, Canadian Mathematical Bulletin.

[18]  Tsung-Lin Lee,et al.  HOM4PS-2.0: a software package for solving polynomial systems by the polyhedral homotopy continuation method , 2008, Computing.

[19]  D. J. Benney,et al.  Calculus: An introduction to applied mathematics , 1973 .

[20]  S. Smale.  Newton’s Method Estimates from Data at One Point , 1986 .

[21]  Lenore Blum,et al.  Complexity and Real Computation , 1997, Springer New York.

[22]  Martin Gardner,et al.  Hexaflexagons and other mathematical diversions : the first Scientific American book of puzzles & games , 1988 .

[23]  Eric W. Weisstein.  Line-Line Distance , 2002 .