Congurations in Non-Desarguesian Planes

Similar documents
An introduction to Finite Geometry

TECHNISCHE UNIVERSITÄT BERLIN WS2005 Fachbereich 3 - Mathematik Prof. Dr. U. Pinkall / Charles Gunn Abgabe:

talk in Boca Raton in Part of the reason for not publishing the result for such a long time was his hope for an improvement in terms of the size

Extending Partial Projective Planes

Definition. Given a (v,k,λ)- BIBD, (X,B), a set of disjoint blocks of B which partition X is called a parallel class.

Tilings of the Euclidean plane

The statement implies that any three intersection points of two distinct planes lie on a line.

Chapter 8. Voronoi Diagrams. 8.1 Post Oce Problem

.Math 0450 Honors intro to analysis Spring, 2009 Notes #4 corrected (as of Monday evening, 1/12) some changes on page 6, as in .

Definition 1 (Hand-shake model). A hand shake model is an incidence geometry for which every line has exactly two points.

Test 1, Spring 2013 ( Solutions): Provided by Jeff Collins and Anil Patel. 1. Axioms for a finite AFFINE plane of order n.

10. Line Arrangements Lecture on Monday 2 nd November, 2009 by Michael Homann

Problem 3.1 (Building up geometry). For an axiomatically built-up geometry, six groups of axioms needed:

An alternative way to generalise the pentagon

The clique number of a random graph in (,1 2) Let ( ) # -subgraphs in = 2 =: ( ) We will be interested in s.t. ( )~1. To gain some intuition note ( )

The clique number of a random graph in (,1 2) Let ( ) # -subgraphs in = 2 =: ( ) 2 ( ) ( )

EXTREME POINTS AND AFFINE EQUIVALENCE

Blocking sets for substructures and reducing the diameter

Lecture 15: The subspace topology, Closed sets

A Short Introduction to Projective Geometry

Technische Universität München Zentrum Mathematik

A Communications Network???

Math 443/543 Graph Theory Notes 11: Graph minors and Kuratowski s Theorem

Extending partial projective planes

Betweenness and the Crossbar Theorem. Lemma: Let A, B, and C be distinct points. If A*B*C, then neither A*C*B nor B*A*C.

9.5 Equivalence Relations

CS-9645 Introduction to Computer Vision Techniques Winter 2019

Fundamental Properties of Graphs

Inversive Plane Geometry

Math 443/543 Graph Theory Notes 2: Transportation problems

Weak Dynamic Coloring of Planar Graphs

1 Solution of Homework I

TWO COORDINATIZATION THEOREMS FOR PROJECTIVE PLANES

Extending partial projective planes

What is Set? Set Theory. Notation. Venn Diagram

Topology Homework 3. Section Section 3.3. Samuel Otten

EM225 Projective Geometry Part 2

Technische Universität München Zentrum Mathematik


Euclid s Axioms. 1 There is exactly one line that contains any two points.

[8] that this cannot happen on the projective plane (cf. also [2]) and the results of Robertson, Seymour, and Thomas [5] on linkless embeddings of gra

Axioms for polar spaces

Synthetic Geometry. 1.1 Foundations 1.2 The axioms of projective geometry

SELF-DUAL CONFIGURATIONS AND THEIR LEVI GRAPHS

Assignments in Mathematics Class IX (Term I) 5. InTroduCTIon To EuClId s GEoMETry. l Euclid s five postulates are : ANIL TUTORIALS

Enumeration of Full Graphs: Onset of the Asymptotic Region. Department of Mathematics. Massachusetts Institute of Technology. Cambridge, MA 02139

Network flows and Menger s theorem

The Graphs of Triangulations of Polygons

On the complete arcs containing the quadrangles constructing the Fano planes of the left near field plane of order 9

TWO CONTRIBUTIONS OF EULER

Random strongly regular graphs?

Intersection of sets *

ON SWELL COLORED COMPLETE GRAPHS

Discharging and reducible configurations

Computer Science 280 Fall 2002 Homework 10 Solutions

GEOMETRY HONORS COORDINATE GEOMETRY PACKET

Find the locus of the center of a bicycle wheel touching the floor and two corner walls.

Arithmetic and Geometry: Uncomfortable Allies? Bill Cherowitzo University of Colorado Denver

1 Appendix to notes 2, on Hyperbolic geometry:

Important!!! First homework is due on Monday, September 26 at 8:00 am.

Adjacent: Two distinct vertices u, v are adjacent if there is an edge with ends u, v. In this case we let uv denote such an edge.

Lecture 4: Bipartite graphs and planarity

The Gewirtz Graph Morgan J. Rodgers Design Theory Fall 2007

Honors 213. Third Hour Exam. Name

Section 17. Closed Sets and Limit Points

Graph Theory Mini-course

2 Solution of Homework

Characterizations of graph classes by forbidden configurations

Simplicial Cells in Arrangements of Hyperplanes

Introduction to Geometry (Autumn Tertm 2012) Exercises 3. Section A. Figure 1

Introduction III. Graphs. Motivations I. Introduction IV

CHAPTER 2 REVIEW COORDINATE GEOMETRY MATH Warm-Up: See Solved Homework questions. 2.2 Cartesian coordinate system

We have set up our axioms to deal with the geometry of space but have not yet developed these ideas much. Let s redress that imbalance.

Solutions to the Test. Problem 1. 1) Who is the author of the first comprehensive text on geometry? When and where was it written?

If three points A (h, 0), P (a, b) and B (0, k) lie on a line, show that: a b 1.

2 Geometry Solutions

A graph is finite if its vertex set and edge set are finite. We call a graph with just one vertex trivial and all other graphs nontrivial.

Technische Universität München Zentrum Mathematik

The Visibility Problem and Binary Space Partition. (slides by Nati Srebro)

Provide a drawing. Mark any line with three points in blue color.

The Geodesic Integral on Medial Graphs

Topology notes. Basic Definitions and Properties.

Laguerre Planes: A Basic Introduction

Tomaz Pisanski, University of Ljubljana, Slovenia. Thomas W. Tucker, Colgate University. Arjana Zitnik, University of Ljubljana, Slovenia

Chapter 3. Quadric hypersurfaces. 3.1 Quadric hypersurfaces Denition.

Module 11. Directed Graphs. Contents

A Decomposition for Chordal graphs and Applications

Characterization of Boolean Topological Logics

Generalized Cell Decompositions of Nested Lorenz Links

Assignment 1 Introduction to Graph Theory CO342

THE LABELLED PEER CODE FOR KNOT AND LINK DIAGRAMS 26th February, 2015

Theorem 3.1 (Berge) A matching M in G is maximum if and only if there is no M- augmenting path.

Final Test in MAT 410: Introduction to Topology Answers to the Test Questions

Exercises for Chapter Three You know you've got to exercise your brain just like your muscles. Will Rogers ( )

On the number of distinct directions of planes determined by n points in R 3

the projective completion of the affine plane with four points

The Structure of Bull-Free Perfect Graphs

PACKING DIGRAPHS WITH DIRECTED CLOSED TRAILS

Lesson 18: There is Only One Line Passing Through a Given Point with a Given

Select the best answer. Bubble the corresponding choice on your scantron. Team 13. Geometry

Transcription:

CEU Budapest, Hungary September 25, 2012

Ane and Projective Planes Ane Plane A set, the elements of which are called points, together with a collection of subsets, called lines, satisfying A1 For every two dierent points there is a unique line containing them. A2 For every line l and a point P not in l, there is a unique line containing P and disjoint from l. A3 There are three points such that no line contains all three of them. Projective Plane A set, the elements of which are called points, together with a collection of subsets, called lines, satisfying the following three axioms. P1. Any two distinct points belong to exactly one line. P2. Any two distinct lines intersect in exactly one point. P3. There are four points such that no line contains any three of them.

Ane and Projective Planes Projective Closure of an Ane Plane

Ane and Projective Planes Examples

Ane and Projective Planes Examples AG(2, R) and PG(2, R)

Ane and Projective Planes Examples AG(2, R) and PG(2, R) AG(2, F p ) and PG(2, F p )

Ane and Projective Planes PG(2,2)

Ane and Projective Planes Recall... A nite projective plane of order t has t 2 + t + 1 points, t 2 + t + 1 lines, each line contains t + 1 points and and each point is contained by t + 1 lines. A nite ane plane of order t has t 2 points, t 2 + t lines, each line contains t points and and each point is contained by t + 1 lines.

Ane and Projective Planes Examples

Ane and Projective Planes Examples AG(2, R) and PG(2, R)

Ane and Projective Planes Examples AG(2, R) and PG(2, R) AG(2, F p ) and PG(2, F p )

Ane and Projective Planes Examples AG(2, R) and PG(2, R) AG(2, F p ) and PG(2, F p )...

Ane and Projective Planes Examples AG(2, R) and PG(2, R) AG(2, F p ) and PG(2, F p )... Question How can we gain further examples?

Ane and Projective Planes Idea 1 P = R R we dene the set of lines as the union of vertical lines in (i.e. x = c for all c R) and the graphs of the functions f (x) = m x 3 + b for all m, b R.

Ane and Projective Planes Idea 1 P = R R we dene the set of lines as the union of vertical lines in (i.e. x = c for all c R) and the graphs of the functions f (x) = m x 3 + b for all m, b R. WRONG! ϕ: (x, y) ( 3 x, y) is isomorphism!

Ane and Projective Planes Idea 2 P = R R We redene the set of lines in AG(2, R) as the union of vertical lines (that is, x = c for all c R) and the translates of f (x) = x 2 with all vectors v R 2.

Ane and Projective Planes Idea 2 P = R R We redene the set of lines in AG(2, R) as the union of vertical lines (that is, x = c for all c R) and the translates of f (x) = x 2 with all vectors v R 2. WRONG! Again, ϕ: (x, y) (x, x 2 + y) is isomorphism!

Ane and Projective Planes Idea 1 - WRONG!!! P = R R we dene the set of lines as the union of vertical lines in (i.e. x = c for all c R) and the graphs of the functions f (x) = m x 3 + b for all m, b R.

Ane and Projective Planes Idea 1 - WRONG!!! P = R R we dene the set of lines as the union of vertical lines in (i.e. x = c for all c R) and the graphs of the functions f (x) = m x 3 + b for all m, b R. Idea 2 - WRONG!!! P = R R We redene the set of lines in AG(2, R) as the union of vertical lines (that is, x = c for all c R) and the translates of f (x) = x 2 with all vectors v R 2.

Ane and Projective Planes Idea 1 - WRONG!!! P = R R we dene the set of lines as the union of vertical lines in (i.e. x = c for all c R) and the graphs of the functions f (x) = m x 3 + b for all m, b R. Idea 2 - WRONG!!! P = R R We redene the set of lines in AG(2, R) as the union of vertical lines (that is, x = c for all c R) and the translates of f (x) = x 2 with all vectors v R 2. Question What makes dierence? How could we deviate from PG(2, F)?

Desargues Theorem Point Perspectivity Two triangles, with their vertices named in a particular order, are said to be perspective from a point P if their three pairs of corresponding vertices are joined by concurrent lines. Figure : Point-perspective triangles with respect P

Desargues Theorem Line Perspectivity Two triangles are said to be perspective from a line l (line-perspective) if their three pairs of corresponding sides meet in collinear points. Figure : Line-perspective triangles with respect l

Desargues Theorem and Hilbert's Theorem Desargues Theorem Two triangles in R 2 are perspective from a point if and only if they are perspective from a line.

Desargues Theorem and Hilbert's Theorem Desargues Theorem Two triangles in R 2 are perspective from a point if and only if they are perspective from a line. Generalized Desargues Theorem (Hilbert) Let F be any eld or skeweld. Two triangles are perspective from a point if and only if they are perspective from a line.

Desargues Theorem and Hilbert's Theorem Desargues Theorem Two triangles in R 2 are perspective from a point if and only if they are perspective from a line. Generalized Desargues Theorem (Hilbert) Let F be any eld or skeweld. Two triangles are perspective from a point if and only if they are perspective from a line. Hilbert's Theorem A projective plane is desarguesian if and only if it can be coordinatized with a skew-eld.

Non-Desarguesian Planes Moulton Plane Figure : Moulton plane: the lines of positive slopes "refract" on the x-axis.

Non-Desarguesian Planes The Moulton Plane is not desarguesian Figure : The triangles ABC and A B C are certainly point-perspective with respect P. The lines AB,AC, B C have positive slopes and so they refract on the x-axis. It yields that AC does not meet A C on the y-axis (as it would do in AG (2, R)) and so the intersections X, Y, Z are not collinear in the Moulton plane, which disproves Desargues theorem.

Non-Desarguesian Planes Further Examples

Non-Desarguesian Planes Further Examples Shifting Planar functions such as f (x) = x 4

Non-Desarguesian Planes Further Examples Shifting Planar functions such as f (x) = x 4 Coordinatization using Nearelds

Non-Desarguesian Planes Further Examples Shifting Planar functions such as f (x) = x 4 Coordinatization using Nearelds Hall-planes

Non-Desarguesian Planes Further Examples Shifting Planar functions such as f (x) = x 4 Coordinatization using Nearelds Hall-planes...

Non-Desarguesian Planes Construction of Hall-planes

Non-Desarguesian Planes Construction of Hall-planes AG(2, q 2 ) has an obvious subplane isomorphic to AG(2, q).

Non-Desarguesian Planes Construction of Hall-planes AG(2, q 2 ) has an obvious subplane isomorphic to AG(2, q). Let D be the set of ideal points of AG(2, q) in PG(2, q 2 ).

Non-Desarguesian Planes Construction of Hall-planes AG(2, q 2 ) has an obvious subplane isomorphic to AG(2, q). Let D be the set of ideal points of AG(2, q) in PG(2, q 2 ). We redene the set of lines on AG(2, q 2 ) as the union of:

Non-Desarguesian Planes Construction of Hall-planes AG(2, q 2 ) has an obvious subplane isomorphic to AG(2, q). Let D be the set of ideal points of AG(2, q) in PG(2, q 2 ). We redene the set of lines on AG(2, q 2 ) as the union of: original lines with ideal points not in D,

Non-Desarguesian Planes Construction of Hall-planes AG(2, q 2 ) has an obvious subplane isomorphic to AG(2, q). Let D be the set of ideal points of AG(2, q) in PG(2, q 2 ). We redene the set of lines on AG(2, q 2 ) as the union of: original lines with ideal points not in D, the translates of the point-set of AG (2, q), i.e. {(a u + b, a v + c) : u, v F q } for all a, b, c F q 2, a 0.

Non-Desarguesian Planes The Hall-planes are not desarguesian Figure : Violation of the Desargues condition in Hall planes

Congurations - Arcs, Ovals and Hyperovals k-arcs A k-arc in a nite projective or ane plane is a set of k points no three of which are collinear.

Congurations - Arcs, Ovals and Hyperovals k-arcs A k-arc in a nite projective or ane plane is a set of k points no three of which are collinear. Complete arcs A k-arc is complete if it is not contained in a (k + 1)-arc.

Congurations - Arcs, Ovals and Hyperovals Bose - Theorem Theorem: an arc in a nite projective plane of order q contains at most q + 1 points if q is odd and q + 2 if q is even.

Congurations - Arcs, Ovals and Hyperovals Bose - Theorem Theorem: an arc in a nite projective plane of order q contains at most q + 1 points if q is odd and q + 2 if q is even. Ovals and Hyperovals (q + 1)-arcs and (q + 2)-arcs of a nite projective plane of order q are called ovals and hyperovals, respectively.

Congurations - Arcs, Ovals and Hyperovals Bose - Theorem Theorem: an arc in a nite projective plane of order q contains at most q + 1 points if q is odd and q + 2 if q is even. Ovals and Hyperovals (q + 1)-arcs and (q + 2)-arcs of a nite projective plane of order q are called ovals and hyperovals, respectively. Existence of Ovals and Hyperovals The existence of ovals and hyperovals in a general projective plane is a famous open question.

Congurations - Arcs, Ovals and Hyperovals Bose - Theorem Theorem: an arc in a nite projective plane of order q contains at most q + 1 points if q is odd and q + 2 if q is even. Ovals and Hyperovals (q + 1)-arcs and (q + 2)-arcs of a nite projective plane of order q are called ovals and hyperovals, respectively. Existence of Ovals and Hyperovals The existence of ovals and hyperovals in a general projective plane is a famous open question. Note Choosing the elements greedily one can generate a complete - arc of size at least q.

Ovals and Hyperovals in PG(2, q) Theorem There exist ovals and hyperovals in PG(2, q).

Ovals and Hyperovals in PG(2, q) Theorem There exist ovals and hyperovals in PG(2, q). Proof The graph of f (x) = x 2 together with the ideal point (0, 1, 0) form an oval. If q = 2 k, this oval can be completed to a hyperoval by adding point (1, 0, 0).

Ovals and Hyperovals in PG(2, q) Theorem There exist ovals and hyperovals in PG(2, q). Proof The graph of f (x) = x 2 together with the ideal point (0, 1, 0) form an oval. If q = 2 k, this oval can be completed to a hyperoval by adding point (1, 0, 0). Note In a nite projective plane of even order ovals can be completed to hyperovals uniquely.

Complete Arcs in PG(2, q) Theorem If K is a k-arc in PG(2, q) and 1 k q+4, if q is even, 2 2 k 2q+5 3, if q is odd, then K is contained in a unique complete arc. Theorem (Segre) If K is a k-arc in PG(2, q) and 1 k > q q + 1, if q is even, 2 k > q q 4 + 7 4, if q is odd, then K can be completed to an oval. Corollary No complete arc of size q exists in PG(2, q).

Complete Arcs in Hall-Planes Theorem (Sz nyi) The set of points C dened by the function f (x) = x 2 (x F q 2\F q ) together with (0, 1, 0) form a complete q 2 q + 1 arc in Hall(q 2 ) for odd q. Theorem (Sz nyi) For an arbitrary, xed non-square c F q 2 the hyperbola H = {(x, c 0 F 2)} is a complete x q (q2 1)-arc in Hall(q 2 ).

THANK YOU FOR YOUR ATTENTION!