Pythagorean tiling

A Pythagorean tiling or two squares tessellation is a tiling of a Euclidean plane by squares of two different sizes, in which each square touches four squares of the other size on its four sides. Many proofs of the Pythagorean theorem are based on it, it is used as a pattern for floor tiles. When used for this, it is known as a hopscotch pattern or pinwheel pattern, but it should not be confused with the mathematical pinwheel tiling, an unrelated pattern; this tiling has four-way rotational symmetry around each of its squares. When the ratio of the side lengths of the two squares is an irrational number such as the golden ratio, its cross-sections form aperiodic sequences with a similar recursive structure to the Fibonacci word. Generalizations of this tiling to three dimensions have been studied; the Pythagorean tiling is the unique tiling by squares of two different sizes, both unilateral and equitransitive. Topologically, the Pythagorean tiling has the same structure as the truncated square tiling by squares and regular octagons.

The smaller squares in the Pythagorean tiling are adjacent to four larger tiles, as are the squares in the truncated square tiling, while the larger squares in the Pythagorean tiling are adjacent to eight neighbors that alternate between large and small, just as the octagons in the truncated square tiling. However, the two tilings have different sets of symmetries, because the truncated square tiling is symmetric under mirror reflections whereas the Pythagorean tiling isn't. Mathematically, this can be explained by saying that the truncated square tiling has dihedral symmetry around the center of each tile, while the Pythagorean tiling has a smaller cyclic set of symmetries around the corresponding points, giving it p4 symmetry, it is a chiral pattern, meaning that it is impossible to superpose it on top of its mirror image using only translations and rotations. A uniform tiling is a tiling in which each tile is a regular polygon and in which every vertex can be mapped to every other vertex by a symmetry of the tiling.

Uniform tilings additionally are required to have tiles that meet edge-to-edge, but if this requirement is relaxed there are eight additional uniform tilings. Four are formed from infinite strips of squares or equilateral triangles, three are formed from equilateral triangles and regular hexagons; the remaining one is the Pythagorean tiling. This tiling is called the Pythagorean tiling because it has been used as the basis of proofs of the Pythagorean theorem by the ninth-century Islamic mathematicians Al-Nayrizi and Thābit ibn Qurra, by the 19th-century British amateur mathematician Henry Perigal. If the sides of the two squares forming the tiling are the numbers a and b the closest distance between corresponding points on congruent squares is c, where c is the length of the hypotenuse of a right triangle having sides a and b. For instance, in the illustration to the left, the two squares in the Pythagorean tiling have side lengths 5 and 12 units long, the side length of the tiles in the overlaying square tiling is 13, based on the Pythagorean triple.

By overlaying a square grid of side length c onto the Pythagorean tiling, it may be used to generate a five-piece dissection of two unequal squares of sides a and b into a single square of side c, showing that the two smaller squares have the same area as the larger one. Overlaying two Pythagorean tilings may be used to generate a six-piece dissection of two unequal squares into a different two unequal squares. Although the Pythagorean tiling is itself periodic its cross sections can be used to generate one-dimensional aperiodic sequences. In the "Klotz construction" for aperiodic sequences, one forms a Pythagorean tiling with two squares whose sizes are chosen to make the ratio between the two side lengths be an irrational number x. One chooses a line parallel to the sides of the squares, forms a sequence of binary values from the sizes of the squares crossed by the line: a 0 corresponds to a crossing of a large square and a 1 corresponds to a crossing of a small square. In this sequence, the relative proportion of 0s and 1s will be in the ratio x:1.

This proportion cannot be achieved by a periodic sequence of 0s and 1s, because it is irrational, so the sequence is aperiodic. If x is chosen as the golden ratio, the sequence of 0s and 1s generated in this way has the same recursive structure as the Fibonacci word: it can be split into substrings of the form "01" and "0" and if these two substrings are replaced by the shorter strings "0" and "1" another string with the same structure results. According to Keller's conjecture, any tiling of the plane by congruent squares must include two squares that meet edge-to-edge. None of the squares in the Pythagorean tiling meet edge-to-edge, but this fact does not violate Keller's conjecture because the tiles have different sizes, so they are not all congruent to each other; the Pythagorean tiling may be generalized to a three-dimensional tiling of Euclidean space by cubes of two different sizes, unilateral and equitransitive. Attila Bölcskei calls this three-dimensional tiling the Rogers filling, he conjectures that, in any dimension greater than three, there is again a unique unilateral and equitransitive way of tiling space by hypercubes of two different sizes.

Burns and Rigby found several prototiles, including the Koch snowflake, that may be used to tile the plane only by using copies of the prototile in two or more different sizes. An earlier paper by Danz

Hyperbolic geometry

In mathematics, hyperbolic geometry is a non-Euclidean geometry. The parallel postulate of Euclidean geometry is replaced with: For any given line R and point P not on R, in the plane containing both line R and point P there are at least two distinct lines through P that do not intersect R. Hyperbolic plane geometry is the geometry of saddle surfaces and pseudospherical surfaces, surfaces with a constant negative Gaussian curvature. A modern use of hyperbolic geometry is in the theory of special relativity Minkowski spacetime and gyrovector space; when geometers first realised they were working with something other than the standard Euclidean geometry they described their geometry under many different names. In the former Soviet Union, it is called Lobachevskian geometry, named after one of its discoverers, the Russian geometer Nikolai Lobachevsky; this page is about the 2-dimensional hyperbolic geometry and the differences and similarities between Euclidean and hyperbolic geometry. Hyperbolic geometry can be extended to three and more dimensions.

Hyperbolic geometry is more related to Euclidean geometry than it seems: the only axiomatic difference is the parallel postulate. When the parallel postulate is removed from Euclidean geometry the resulting geometry is absolute geometry. There are two kinds of absolute geometry and hyperbolic. All theorems of absolute geometry, including the first 28 propositions of book one of Euclid's Elements, are valid in Euclidean and hyperbolic geometry. Propositions 27 and 28 of Book One of Euclid's Elements prove the existence of parallel/non-intersecting lines; this difference has many consequences: concepts that are equivalent in Euclidean geometry are not equivalent in hyperbolic geometry. Further, because of the angle of parallelism, hyperbolic geometry has an absolute scale, a relation between distance and angle measurements. Single lines in hyperbolic geometry have the same properties as single straight lines in Euclidean geometry. For example, two points uniquely define a line, lines can be infinitely extended.

Two intersecting lines have the same properties as two intersecting lines in Euclidean geometry. For example, two lines can intersect in no more than one point, intersecting lines have equal opposite angles, adjacent angles of intersecting lines are supplementary; when we add a third line there are properties of intersecting lines that differ from intersecting lines in Euclidean geometry. For example, given 2 intersecting lines there are infinitely many lines that do not intersect either of the given lines; these properties all are independent of the model used if the lines may look radically different. Non-intersecting lines in hyperbolic geometry have properties that differ from non-intersecting lines in Euclidean geometry: For any line R and any point P which does not lie on R, in the plane containing line R and point P there are at least two distinct lines through P that do not intersect R; this implies that there are through P an infinite number of coplanar lines that do not intersect R.

These non-intersecting lines are divided into two classes: Two of the lines are limiting parallels: there is one in the direction of each of the ideal points at the "ends" of R, asymptotically approaching R, always getting closer to R, but never meeting it. All other non-intersecting lines have a point of minimum distance and diverge from both sides of that point, are called ultraparallel, diverging parallel or sometimes non-intersecting; some geometers use parallel lines instead of limiting parallel lines, with ultraparallel lines being just non-intersecting. These limiting parallels make an angle θ with PB. For ultraparallel lines, the ultraparallel theorem states that there is a unique line in the hyperbolic plane, perpendicular to each pair of ultraparallel lines. In hyperbolic geometry, the circumference of a circle of radius r is greater than 2 π r. Let R = 1 − K, where K is the Gaussian curvature of the plane. In hyperbolic geometry, K is negative, so the square root is of a positive number.

The circumference of a circle of radius r is equal to: 2 π R sinh r R. And the area of the enclosed disk is: 4 π R 2 sinh 2 r 2 R = 2 π R 2. Therefore, in hyperbolic geometry the ratio of a circle's circumference to its radius is always greater than 2 π, though

Tessellation

A tessellation of a flat surface is the tiling of a plane using one or more geometric shapes, called tiles, with no overlaps and no gaps. In mathematics, tessellations can be generalized to a variety of geometries. A periodic tiling has a repeating pattern; some special kinds include regular tilings with regular polygonal tiles all of the same shape, semiregular tilings with regular tiles of more than one shape and with every corner identically arranged. The patterns formed by periodic tilings can be categorized into 17 wallpaper groups. A tiling that lacks a repeating pattern is called "non-periodic". An aperiodic tiling uses a small set of tile shapes. In the geometry of higher dimensions, a space-filling or honeycomb is called a tessellation of space. A real physical tessellation is a tiling made of materials such as cemented ceramic squares or hexagons; such tilings may be decorative patterns, or may have functions such as providing durable and water-resistant pavement, floor or wall coverings.

Tessellations were used in Ancient Rome and in Islamic art such as in the decorative geometric tiling of the Alhambra palace. In the twentieth century, the work of M. C. Escher made use of tessellations, both in ordinary Euclidean geometry and in hyperbolic geometry, for artistic effect. Tessellations are sometimes employed for decorative effect in quilting. Tessellations form a class of patterns in nature, for example in the arrays of hexagonal cells found in honeycombs. Tessellations were used by the Sumerians in building wall decorations formed by patterns of clay tiles. Decorative mosaic tilings made of small squared blocks called tesserae were employed in classical antiquity, sometimes displaying geometric patterns. In 1619 Johannes Kepler made an early documented study of tessellations, he wrote about semiregular tessellations in his Harmonices Mundi. Some two hundred years in 1891, the Russian crystallographer Yevgraf Fyodorov proved that every periodic tiling of the plane features one of seventeen different groups of isometries.

Fyodorov's work marked the unofficial beginning of the mathematical study of tessellations. Other prominent contributors include Aleksei Shubnikov and Nikolai Belov, Heinrich Heesch and Otto Kienzle. In Latin, tessella is a small cubical piece of stone or glass used to make mosaics; the word "tessella" means "small square". It corresponds to the everyday term tiling, which refers to applications of tessellations made of glazed clay. Tessellation in two dimensions called planar tiling, is a topic in geometry that studies how shapes, known as tiles, can be arranged to fill a plane without any gaps, according to a given set of rules; these rules can be varied. Common ones are that there must be no gaps between tiles, that no corner of one tile can lie along the edge of another; the tessellations created by bonded brickwork do not obey this rule. Among those that do, a regular tessellation has both identical regular tiles and identical regular corners or vertices, having the same angle between adjacent edges for every tile.

There are only three shapes that can form such regular tessellations: the equilateral triangle and regular hexagon. Any one of these three shapes can be duplicated infinitely to fill a plane with no gaps. Many other types of tessellation are possible under different constraints. For example, there are eight types of semi-regular tessellation, made with more than one kind of regular polygon but still having the same arrangement of polygons at every corner. Irregular tessellations can be made from other shapes such as pentagons, polyominoes and in fact any kind of geometric shape; the artist M. C. Escher is famous for making tessellations with irregular interlocking tiles, shaped like animals and other natural objects. If suitable contrasting colours are chosen for the tiles of differing shape, striking patterns are formed, these can be used to decorate physical surfaces such as church floors. More formally, a tessellation or tiling is a cover of the Euclidean plane by a countable number of closed sets, called tiles, such that the tiles intersect only on their boundaries.

These tiles may be any other shapes. Many tessellations are formed from a finite number of prototiles in which all tiles in the tessellation are congruent to the given prototiles. If a geometric shape can be used as a prototile to create a tessellation, the shape is said to tessellate or to tile the plane; the Conway criterion is a sufficient but not necessary set of rules for deciding if a given shape tiles the plane periodically without reflections: some tiles fail the criterion but still tile the plane. No general rule has been found for determining if a given shape can tile the plane or not, which means there are many unsolved problems concerning tessellations. Mathematically, tessellations can be extended to spaces other than the Euclidean plane; the Swiss geometer Ludwig Schläfli pioneered this by defining polyschemes, which mathematicians nowadays call polytopes. These are the analogues to polygons and polyhedra in spaces with more dimensions, he further defined the Schläfli symbol notation to make it easy to describe polytopes.

For example, the Schläfli symbol for an equilateral triangle is. The Schläfli notation makes it possible to describe tilings compactly. For example, a tiling of regular hexagons has three six-sided polygons at each vertex, so its Schläfli symbol is. Other methods exist for describing polygonal tilings; when the tessellation

Rhombille tiling

In geometry, the rhombille tiling known as tumbling blocks, reversible cubes, or the dice lattice, is a tessellation of identical 60° rhombi on the Euclidean plane. Each rhombus has two 120 ° angles. Sets of three rhombi meet at their 120° angles and sets of six rhombi meet at their 60° angles; the rhombille tiling can be seen as a subdivision of a hexagonal tiling with each hexagon divided into three rhombi meeting at the center point of the hexagon. This subdivision represents a regular compound tiling, it can be seen as a subdivision of four hexagonal tilings with each hexagon divided into 12 rhombi. The diagonals of each rhomb are in the ratio 1:√3; this is the dual tiling of the trihexagonal kagome lattice. As the dual to a uniform tiling, it is one of eleven possible Laves tilings, in the face configuration for monohedral tilings it is denoted, it is one of 56 possible isohedral tilings by quadrilaterals, one of only eight tilings of the plane in which every edge lies on a line of symmetry of the tiling.

It is possible to embed the rhombille tiling into a subset of a three-dimensional integer lattice, consisting of the points with |x + y + z| ≤ 1, in such a way that two vertices are adjacent if and only if the corresponding lattice points are at unit distance from each other, more such that the number of edges in the shortest path between any two vertices of the tiling is the same as the Manhattan distance between the corresponding lattice points. Thus, the rhombille tiling can be viewed as an example of an infinite unit distance graph and partial cube; the rhombille tiling can be interpreted as an isometric projection view of a set of cubes in two different ways, forming a reversible figure related to the Necker Cube. In this context it is known as the "reversible cubes" illusion. In the M. C. Escher artworks Metamorphosis I, Metamorphosis II, Metamorphosis III Escher uses this interpretation of the tiling as a way of morphing between two- and three-dimensional forms. In another of his works, Escher played with the tension between the two-dimensionality and three-dimensionality of this tiling: in it he draws a building that has both large cubical blocks as architectural elements and an upstairs patio tiled with the rhombille tiling.

A human figure descends from the patio past the cubes, becoming more stylized and two-dimensional as he does so. These works involve only a single three-dimensional interpretation of the tiling, but in Convex and Concave Escher experiments with reversible figures more and includes a depiction of the reversible cubes illusion on a flag within the scene; the rhombille tiling is used as a design for parquetry and for floor or wall tiling, sometimes with variations in the shapes of its rhombi. It appears in ancient Greek floor mosaics from Delos and from Italian floor tilings from the 11th century, although the tiles with this pattern in Siena Cathedral are of a more recent vintage. In quilting, it has been known since the 1850s as the "tumbling blocks" pattern, referring to the visual dissonance caused by its doubled three-dimensional interpretation; as a quilting pattern it has many other names including cubework, heavenly stairs, Pandora's box. It has been suggested that the tumbling blocks quilt pattern was used as a signal in the Underground Railroad: when slaves saw it hung on a fence, they were to box up their belongings and escape.

See Quilts of the Underground Railroad. In these decorative applications, the rhombi may appear in multiple colors, but are given three levels of shading, brightest for the rhombs with horizontal long diagonals and darker for the rhombs with the other two orientations, to enhance their appearance of three-dimensionality. There is a single known instance of implicit rhombille and trihexagonal tiling in English heraldry – in the Geal/e arms; the rhombille tiling may be viewed as the result of overlaying two different hexagonal tilings, translated so that some of the vertices of one tiling land at the centers of the hexagons of the other tiling. Thus, it can be used to define block cellular automata in which the cells of the automaton are the rhombi of a rhombille tiling and the blocks in alternating steps of the automaton are the hexagons of the two overlaid hexagonal tilings. In this context, it is called the "Q*bert neighborhood", after the video game Q*bert which featured an isometric view of a pyramid of cubes as its playing field.

The Q*bert neighborhood may be used to support universal computation via a simulation of billiard ball computers. In condensed matter physics, the rhombille tiling is known as the dice lattice, diced lattice, or dual kagome lattice, it is one of several repeating structures used to investigate Ising models and related systems of spin interactions in diatomic crystals, it has been studied in percolation theory. The rhombille tiling has *632 symmetry, but vertices can be colored with alternating colors on the inner points leading to a *333 symmetry; the rhombille tiling is the dual of the trihexagonal tiling, as such is part of a set of uniform dual tilings. It is a part of a sequence of rhombic polyhedra and tilings with Coxeter group symmetry, starting from the cube, which can be seen as a rhombic hexahedron where the rhombi are squares; the nth element in this sequence has a face configuration of V3.n.3.n. The rhombille tiling is one of many different ways of tiling the plane by congruent rhombi.

Others include a diagonally flattened variation of the square tiling, the tiling used by the Miura-ori folding pattern, the Penrose tiling which

Tiling with rectangles

A tiling with rectangles is a tiling which uses rectangles as its parts. The domino tilings are tilings with rectangles of 1 × 2 side ratio; the tilings with straight polyominoes of shapes such as 1 × 3, 1 × 4 and tilings with polyominoes of shapes such as 2 × 3 fall into this category. Some tiling of rectangles include: The smallest square that can be cut into rectangles, such that all m and n are different integers, is the 11 × 11 square, the tiling uses five rectangles; the smallest rectangle that can be cut into rectangles, such that all m and n are different integers, is the 9 × 13 rectangle, the tiling uses five rectangles. Squaring the square Tessellation Tiling puzzle

Dual polyhedron

In geometry, any polyhedron is associated with a second dual figure, where the vertices of one correspond to the faces of the other and the edges between pairs of vertices of one correspond to the edges between pairs of faces of the other. Such dual figures remain combinatorial or abstract polyhedra, but not all are geometric polyhedra. Starting with any given polyhedron, the dual of its dual is the original polyhedron. Duality preserves the symmetries of a polyhedron. Therefore, for many classes of polyhedra defined by their symmetries, the duals belong to a symmetric class. Thus, the regular polyhedra – the Platonic solids and Kepler–Poinsot polyhedra – form dual pairs, where the regular tetrahedron is self-dual; the dual of an isogonal polyhedron, having equivalent vertices, is one, isohedral, having equivalent faces. The dual of an isotoxal polyhedron is isotoxal. Duality is related to reciprocity or polarity, a geometric transformation that, when applied to a convex polyhedron, realizes the dual polyhedron as another convex polyhedron.

There are many kinds of duality. The kinds most relevant to elementary polyhedra are polar reciprocity and topological or abstract duality; the duality of polyhedra is defined in terms of polar reciprocation about a concentric sphere. Here, each vertex is associated with a face plane so that the ray from the center to the vertex is perpendicular to the plane, the product of the distances from the center to each is equal to the square of the radius. In coordinates, for reciprocation about the sphere x 2 + y 2 + z 2 = r 2, the vertex is associated with the plane x 0 x + y 0 y + z 0 z = r 2; the vertices of the dual are the poles reciprocal to the face planes of the original, the faces of the dual lie in the polars reciprocal to the vertices of the original. Any two adjacent vertices define an edge, these will reciprocate to two adjacent faces which intersect to define an edge of the dual; this dual pair of edges are always orthogonal to each other. If r 0 is the radius of the sphere, r 1 and r 2 the distances from its centre to the pole and its polar, then: r 1.

R 2 = r 0 2 For the more symmetrical polyhedra having an obvious centroid, it is common to make the polyhedron and sphere concentric, as in the Dorman Luke construction described below. However, it is possible to reciprocate a polyhedron about any sphere, the resulting form of the dual will depend on the size and position of the sphere; the choice of center for the sphere is sufficient to define the dual up to similarity. If multiple symmetry axes are present, they will intersect at a single point, this is taken to be the centroid. Failing that, a circumscribed sphere, inscribed sphere, or midsphere is used. If a polyhedron in Euclidean space has an element passing through the center of the sphere, the corresponding element of its dual will go to infinity. Since Euclidean space never reaches infinity, the projective equivalent, called extended Euclidean space, may be formed by adding the required'plane at infinity'; some theorists prefer to say that there is no dual. Meanwhile, Wenninger found a way to represent these infinite duals, in a manner suitable for making models.

The concept of duality here is related to the duality in projective geometry, where lines and edges are interchanged. Projective polarity works well enough for convex polyhedra, but for non-convex figures such as star polyhedra, when we seek to rigorously define this form of polyhedral duality in terms of projective polarity, various problems appear. Because of the definitional issues for geometric duality of non-convex polyhedra, Grünbaum argues that any proper definition of a non-convex polyhedron should include a notion of a dual polyhedron. Any convex polyhedron can be distorted into a canonical form, in which a unit midsphere exists tangent to every edge, such that the average position of the points of tangency is the center of the sphere; this form is unique up to congruences. If we reciprocate such a canonical polyhedron about its midsphere, the dual polyhedron will share the same edge-tangency points and so must be canonical, it is the canonical dual, the two together form a canonical dual pair.

When a pair of polyhedra cannot be obtained by reciprocation from each other, they may be called duals of each other as long as the vertices of one correspond to the faces of the other, the edges of one correspond to the edges of the other, in an incidence-preserving way. Such pairs of polyhedra are abstractly dual; the vertices and edges of a convex polyhedron form a graph, embedded on a topological sphere, the surface of the polyhedron. The same graph can be projected to form

John Horton Conway

John Horton Conway is an English mathematician active in the theory of finite groups, knot theory, number theory, combinatorial game theory and coding theory. He has contributed to many branches of recreational mathematics, notably the invention of the cellular automaton called the Game of Life. Conway spent the first half of his long career at the University of Cambridge, in England, the second half at Princeton University in New Jersey, where he now holds the title Professor Emeritus. Conway was born in the son of Cyril Horton Conway and Agnes Boyce, he became interested in mathematics at a early age. By the age of eleven his ambition was to become a mathematician. After leaving sixth form, Conway entered Caius College, Cambridge to study mathematics. Conway, a "terribly introverted adolescent" in school, interpreted his admission to Cambridge as an opportunity to transform himself into a new person: an "extrovert", he was awarded his Bachelor of Arts degree in 1959 and began to undertake research in number theory supervised by Harold Davenport.

Having solved the open problem posed by Davenport on writing numbers as the sums of fifth powers, Conway began to become interested in infinite ordinals. It appears that his interest in games began during his years studying the Cambridge Mathematical Tripos, where he became an avid backgammon player, spending hours playing the game in the common room, he was awarded his doctorate in 1964 and was appointed as College Fellow and Lecturer in Mathematics at the University of Cambridge. After leaving Cambridge in 1986, he took up the appointment to the John von Neumann Chair of Mathematics at Princeton University. Conway is known for the invention of the Game of Life, one of the early examples of a cellular automaton, his initial experiments in that field were done with pen and paper, long before personal computers existed. Since the game was introduced by Martin Gardner in Scientific American in 1970, it has spawned hundreds of computer programs, web sites, articles, it is a staple of recreational mathematics.

There is an extensive wiki devoted to cataloging the various aspects of the game. From the earliest days it has been a favorite in computer labs, both for its theoretical interest and as a practical exercise in programming and data display. At times Conway has said he hates the Game of Life–largely because it has come to overshadow some of the other deeper and more important things he has done; the game did help launch a new branch of mathematics, the field of cellular automata. The Game of Life is now known to be Turing complete. Conway's career is intertwined with mathematics popularizer and Scientific American columnist Martin Gardner; when Gardner featured Conway's Game of Life in his Mathematical Games column in October 1970, it became the most read of all his columns and made Conway an instant celebrity. Gardner and Conway had first corresponded in the late 1950s, over the years Gardner had written about recreational aspects of Conway's work. For instance, he discussed Conway's game of Sprouts and his angel and devil problem.

In the September 1976 column he reviewed Conway's book On Numbers and Games and introduced the public to Conway's surreal numbers. Conferences called Gathering 4 Gardner are held every two years to celebrate the legacy of Martin Gardner, Conway himself has been a featured speaker at these events, discussing various aspects of recreational mathematics. Conway is known for his contributions to combinatorial game theory, a theory of partisan games; this he developed with Elwyn Berlekamp and Richard Guy, with them co-authored the book Winning Ways for your Mathematical Plays. He wrote the book On Numbers and Games which lays out the mathematical foundations of CGT, he is one of the inventors of sprouts, as well as philosopher's football. He developed detailed analyses of many other games and puzzles, such as the Soma cube, peg solitaire, Conway's soldiers, he came up with the angel problem, solved in 2006. He invented a new system of numbers, the surreal numbers, which are related to certain games and have been the subject of a mathematical novel by Donald Knuth.

He invented a nomenclature for exceedingly large numbers, the Conway chained arrow notation. Much of this is discussed in the 0th part of ONAG. In the mid-1960s with Michael Guy, son of Richard Guy, Conway established that there are sixty-four convex uniform polychora excluding two infinite sets of prismatic forms, they discovered the grand antiprism in the only non-Wythoffian uniform polychoron. Conway has suggested a system of notation dedicated to describing polyhedra called Conway polyhedron notation. In the theory of tessellations, he devised the Conway criterion which describes rules for deciding if a prototile will tile the plane, he investigated lattices in higher dimensions, was the first to determine the symmetry group of the Leech lattice. In knot theory, Conway formulated a new variation of the Alexander polynomial and produced a new invariant now called the Conway polynomial. After lying dormant for more than a decade, this concept became central to work in the 1980s on the novel knot polynomials.

Conway further developed tangle theory and invented a system of notation for tabulating knots, nowadays known as Conway notation, while correcting a number of errors in the 19th century knot tables and extending them to include all but four of the non-alternating primes with 11 crossings. See Topology Proceedings 7 118, he was the primary author of the ATLAS of Finite Groups giving prope