colouring the plane
play

Colouring the Plane G. Eric Moorhouse Department of Mathematics - PowerPoint PPT Presentation

Colouring the Plane G. Eric Moorhouse Department of Mathematics University of Wyoming Designs, Codes & Geometries 2010 G. Eric Moorhouse Colouring the Plane Chromatic Number of the Euclidean Plane Consider the Euclidean plane R 2 to be a


  1. Colouring the Plane G. Eric Moorhouse Department of Mathematics University of Wyoming Designs, Codes & Geometries 2010 G. Eric Moorhouse Colouring the Plane

  2. Chromatic Number of the Euclidean Plane Consider the Euclidean plane R 2 to be a graph with adjacency defined by the distance-one relation ( x ′ − x ) 2 + ( y ′ − y ) 2 = 1 . ( x , y ) ∼ ( x ′ , y ′ ) iff The chromatic number χ ( R 2 ) is the minimum number of colours needed to colour the points of R 2 such that no two points at distance one bear the same colour. Known: χ ( R 2 ) ∈ { 4 , 5 , 6 , 7 } χ ( R 2 ) � 4 as seen from the Moser spindle : G. Eric Moorhouse Colouring the Plane

  3. Chromatic Number of the Euclidean Plane Consider the Euclidean plane R 2 to be a graph with adjacency defined by the distance-one relation ( x ′ − x ) 2 + ( y ′ − y ) 2 = 1 . ( x , y ) ∼ ( x ′ , y ′ ) iff The chromatic number χ ( R 2 ) is the minimum number of colours needed to colour the points of R 2 such that no two points at distance one bear the same colour. Known: χ ( R 2 ) ∈ { 4 , 5 , 6 , 7 } χ ( R 2 ) � 4 as seen from the Moser spindle : G. Eric Moorhouse Colouring the Plane

  4. Chromatic Number of the Euclidean Plane Consider the Euclidean plane R 2 to be a graph with adjacency defined by the distance-one relation ( x ′ − x ) 2 + ( y ′ − y ) 2 = 1 . ( x , y ) ∼ ( x ′ , y ′ ) iff The chromatic number χ ( R 2 ) is the minimum number of colours needed to colour the points of R 2 such that no two points at distance one bear the same colour. Known: χ ( R 2 ) ∈ { 4 , 5 , 6 , 7 } χ ( R 2 ) � 4 as seen from the Moser spindle : G. Eric Moorhouse Colouring the Plane

  5. Chromatic Number of the Euclidean Plane Consider the Euclidean plane R 2 to be a graph with adjacency defined by the distance-one relation ( x ′ − x ) 2 + ( y ′ − y ) 2 = 1 . ( x , y ) ∼ ( x ′ , y ′ ) iff The chromatic number χ ( R 2 ) is the minimum number of colours needed to colour the points of R 2 such that no two points at distance one bear the same colour. Known: χ ( R 2 ) ∈ { 4 , 5 , 6 , 7 } χ ( R 2 ) � 4 as seen from the Moser spindle : G. Eric Moorhouse Colouring the Plane

  6. Chromatic Number of the Affine Plane K 2 Let K be an arbitrary field (or any commutative ring with 1). Adjacency in K 2 : ( x ′ − x ) 2 + ( y ′ − y ) 2 = 1 . ( x , y ) ∼ ( x ′ , y ′ ) iff χ ( F 2 χ ( F 2 2 ) = 2 3 ) = 3 G. Eric Moorhouse Colouring the Plane

  7. Chromatic Number of the Affine Plane K 2 Let K be an arbitrary field (or any commutative ring with 1). Adjacency in K 2 : ( x ′ − x ) 2 + ( y ′ − y ) 2 = 1 . ( x , y ) ∼ ( x ′ , y ′ ) iff χ ( F 2 χ ( F 2 2 ) = 2 3 ) = 3 G. Eric Moorhouse Colouring the Plane

  8. Chromatic Number of the Affine Plane Q 2 Consider the subring � a � R = b : a , b ∈ Z , b is a product of primes ≡ 3 mod 4 ⊂ Q . The connected component of ( 0 , 0 ) in Q 2 is R 2 . Note that 2 . There is a graph homomorphism R 2 → F 2 R / 2 R ∼ 2 : = F − → χ ( R 2 ) = 2 χ ( F 2 2 ) = 2 Since Q 2 is a disjoint union of copies of R 2 , each of which is 2-colourable, so is Q 2 . G. Eric Moorhouse Colouring the Plane

  9. Chromatic Number of the Affine Plane Q 2 Consider the subring � a � R = b : a , b ∈ Z , b is a product of primes ≡ 3 mod 4 ⊂ Q . The connected component of ( 0 , 0 ) in Q 2 is R 2 . Note that 2 . There is a graph homomorphism R 2 → F 2 R / 2 R ∼ 2 : = F − → χ ( R 2 ) = 2 χ ( F 2 2 ) = 2 Since Q 2 is a disjoint union of copies of R 2 , each of which is 2-colourable, so is Q 2 . G. Eric Moorhouse Colouring the Plane

  10. Chromatic Number of the Affine Plane Q 2 Consider the subring � a � R = b : a , b ∈ Z , b is a product of primes ≡ 3 mod 4 ⊂ Q . The connected component of ( 0 , 0 ) in Q 2 is R 2 . Note that 2 . There is a graph homomorphism R 2 → F 2 R / 2 R ∼ 2 : = F − → χ ( R 2 ) = 2 χ ( F 2 2 ) = 2 Since Q 2 is a disjoint union of copies of R 2 , each of which is 2-colourable, so is Q 2 . G. Eric Moorhouse Colouring the Plane

  11. Chromatic Number of the Affine Plane Q 2 Consider the subring � a � R = b : a , b ∈ Z , b is a product of primes ≡ 3 mod 4 ⊂ Q . The connected component of ( 0 , 0 ) in Q 2 is R 2 . Note that 2 . There is a graph homomorphism R 2 → F 2 R / 2 R ∼ 2 : = F − → χ ( R 2 ) = 2 χ ( F 2 2 ) = 2 Since Q 2 is a disjoint union of copies of R 2 , each of which is 2-colourable, so is Q 2 . G. Eric Moorhouse Colouring the Plane

  12. χ ( R 2 ) = χ ( K 2 ) for a small subfield K ⊆ R By a theorem of de Bruijn and Erdös, χ ( R 2 ) = χ (Γ) for some finite subgraph Γ ⊂ R 2 . Let K ⊂ R be the subfield generated by the coordinates of all vertices in K . So χ ( R 2 ) = χ ( K 2 ) where the subfield K ⊂ R is finitely generated over Q . In particular K is countable. In fact we may reduce further to the case K is a number field: G. Eric Moorhouse Colouring the Plane

  13. χ ( R 2 ) = χ ( K 2 ) for a small subfield K ⊆ R By a theorem of de Bruijn and Erdös, χ ( R 2 ) = χ (Γ) for some finite subgraph Γ ⊂ R 2 . Let K ⊂ R be the subfield generated by the coordinates of all vertices in K . So χ ( R 2 ) = χ ( K 2 ) where the subfield K ⊂ R is finitely generated over Q . In particular K is countable. In fact we may reduce further to the case K is a number field: G. Eric Moorhouse Colouring the Plane

  14. χ ( R 2 ) = χ ( K 2 ) for a small subfield K ⊆ R By a theorem of de Bruijn and Erdös, χ ( R 2 ) = χ (Γ) for some finite subgraph Γ ⊂ R 2 . Let K ⊂ R be the subfield generated by the coordinates of all vertices in K . So χ ( R 2 ) = χ ( K 2 ) where the subfield K ⊂ R is finitely generated over Q . In particular K is countable. In fact we may reduce further to the case K is a number field: G. Eric Moorhouse Colouring the Plane

  15. χ ( R 2 ) = χ ( K 2 ) for a finite extension K ⊃ Q Theorem (M.) There exists a number field K embeddable in R and subfields K = K n ⊃ K n − 1 ⊃ · · · ⊃ K 1 ⊃ K 0 ⊇ Q such that (a) χ ( R 2 ) = χ ( K 2 ) (b) [ K i : K i − 1 ] = 2 for i = 1 , 2 , . . ., n (c) the extension K 0 ⊇ Q is finite of odd degree [ K 0 : Q ] (d) χ ( K 2 0 ) = χ ( Q 2 ) = 2 Note that points of K 2 are straightedge-and-compass constructible from points of K 2 0 . Does it make sense to colour by induction on n ? Each ‘new’ point in K 2 i (i.e. not in K 2 i − 1 ) has at most two neighbours in K 2 i − 1 . G. Eric Moorhouse Colouring the Plane

  16. χ ( R 2 ) = χ ( K 2 ) for a finite extension K ⊃ Q Theorem (M.) There exists a number field K embeddable in R and subfields K = K n ⊃ K n − 1 ⊃ · · · ⊃ K 1 ⊃ K 0 ⊇ Q such that (a) χ ( R 2 ) = χ ( K 2 ) (b) [ K i : K i − 1 ] = 2 for i = 1 , 2 , . . ., n (c) the extension K 0 ⊇ Q is finite of odd degree [ K 0 : Q ] (d) χ ( K 2 0 ) = χ ( Q 2 ) = 2 Note that points of K 2 are straightedge-and-compass constructible from points of K 2 0 . Does it make sense to colour by induction on n ? Each ‘new’ point in K 2 i (i.e. not in K 2 i − 1 ) has at most two neighbours in K 2 i − 1 . G. Eric Moorhouse Colouring the Plane

  17. χ ( R 2 ) = χ ( K 2 ) for a finite extension K ⊃ Q Theorem (M.) There exists a number field K embeddable in R and subfields K = K n ⊃ K n − 1 ⊃ · · · ⊃ K 1 ⊃ K 0 ⊇ Q such that (a) χ ( R 2 ) = χ ( K 2 ) (b) [ K i : K i − 1 ] = 2 for i = 1 , 2 , . . ., n (c) the extension K 0 ⊇ Q is finite of odd degree [ K 0 : Q ] (d) χ ( K 2 0 ) = χ ( Q 2 ) = 2 Note that points of K 2 are straightedge-and-compass constructible from points of K 2 0 . Does it make sense to colour by induction on n ? Each ‘new’ point in K 2 i (i.e. not in K 2 i − 1 ) has at most two neighbours in K 2 i − 1 . G. Eric Moorhouse Colouring the Plane

  18. Quadratic extensions We are especially interested in how much the chromatic number can grow for quadratic extensions. Note: √ K 2 contains a 3-cycle iff K ⊇ Q ( 3 ) . √ 3 ) 2 ) = 3. χ ( Q ( √ √ K 2 contains a Moser spindle iff K ⊇ Q ( 3 , 11 ) . √ √ 11 ) 2 ) ∈ { 4 , 5 , 6 , 7 } . χ ( Q ( 3 , √ What can we say about χ ( K 2 ) when K = Q ( d ) , d � 2 a squarefree integer? G. Eric Moorhouse Colouring the Plane

  19. Quadratic extensions We are especially interested in how much the chromatic number can grow for quadratic extensions. Note: √ K 2 contains a 3-cycle iff K ⊇ Q ( 3 ) . √ 3 ) 2 ) = 3. χ ( Q ( √ √ K 2 contains a Moser spindle iff K ⊇ Q ( 3 , 11 ) . √ √ 11 ) 2 ) ∈ { 4 , 5 , 6 , 7 } . χ ( Q ( 3 , √ What can we say about χ ( K 2 ) when K = Q ( d ) , d � 2 a squarefree integer? G. Eric Moorhouse Colouring the Plane

  20. Quadratic extensions We are especially interested in how much the chromatic number can grow for quadratic extensions. Note: √ K 2 contains a 3-cycle iff K ⊇ Q ( 3 ) . √ 3 ) 2 ) = 3. χ ( Q ( √ √ K 2 contains a Moser spindle iff K ⊇ Q ( 3 , 11 ) . √ √ 11 ) 2 ) ∈ { 4 , 5 , 6 , 7 } . χ ( Q ( 3 , √ What can we say about χ ( K 2 ) when K = Q ( d ) , d � 2 a squarefree integer? G. Eric Moorhouse Colouring the Plane

  21. Quadratic extensions We are especially interested in how much the chromatic number can grow for quadratic extensions. Note: √ K 2 contains a 3-cycle iff K ⊇ Q ( 3 ) . √ 3 ) 2 ) = 3. χ ( Q ( √ √ K 2 contains a Moser spindle iff K ⊇ Q ( 3 , 11 ) . √ √ 11 ) 2 ) ∈ { 4 , 5 , 6 , 7 } . χ ( Q ( 3 , √ What can we say about χ ( K 2 ) when K = Q ( d ) , d � 2 a squarefree integer? G. Eric Moorhouse Colouring the Plane

Recommend


More recommend