Combinatorial Geometry 邓俊辉 清华大学计算机系 2015年10月12日星期一 2015年10月12日星期一 2015年10月12日星期一 2015年10月12日星期一.

Slides:



Advertisements
Similar presentations
Section 7.5: Equivalence Relations Def: A relation R on a set A is called an equivalence relation if it is reflexive, symmetric, and transitive. Ex: Let.
Advertisements

On Complexity, Sampling, and -Nets and -Samples. Range Spaces A range space is a pair, where is a ground set, it’s elements called points and is a family.
Discrete Structures Chapter 6: Set Theory
Abstract Order Type Extension and New Results on the Rectilinear Crossing Number Oswin Aichholzer Institute for Softwaretechnology Graz University of Technology.
1 Chapter Equivalence, Order, and Inductive Proof.
Convexity of Point Set Sandip Das Indian Statistical Institute.
Lindsay Mullen Seminar Presentation #3 November 18, 2013 Geometry Discrete Geometry.
Ramseyan Theorems for Numbers. page 2Ramseyan Theorems for Numbers Contents 1.Sum-Free Sets 2.Zero-Sum Sets 3.Szemerédi’s Cube Lemma.
Partitioning Sets to Decrease the Diameter N. Harvey U. Waterloo TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: A A.
Triangulation 邓俊辉 清华大学计算机系 2015年5月24日星期日 2015年5月24日星期日 2015年5月24日星期日 2015年5月24日星期日 2015年5月24日星期日.
Chapter 7 Relations : the second time around
Denoting the beginning
Polya’s Orchard Visibility Problem and Related Questions in Geometry and Number Theory Asilomar - December 2008 Bruce Cohen Lowell High School, SFUSD
1 Numerical geometry of non-rigid shapes Mathematical background Mathematical background Tutorial 1 © Maks Ovsjanikov, Alex & Michael Bronstein tosca.cs.technion.ac.il/book.
FSM Decomposition using Partitions on States 290N: The Unknown Component Problem Lecture 24.
Outline Circuits and flows Reorientation and geometry
Vapnik-Chervonenkis Dimension Definition and Lower bound Adapted from Yishai Mansour.
1 Set Theory. Notation S={a, b, c} refers to the set whose elements are a, b and c. a  S means “a is an element of set S”. d  S means “d is not an element.
Relations Chapter 9.
MA4266 Topology Wayne Lawton Department of Mathematics S ,
The Integers and Division
Ordered Sets. Relations. Equivalence Relations 1.
Discrete Math for CS Binary Relation: A binary relation between sets A and B is a subset of the Cartesian Product A x B. If A = B we say that the relation.
Three different ways There are three different ways to show that ρ(A) is a simple eigenvalue of an irreducible nonnegative matrix A:
MA4266 Topology Wayne Lawton Department of Mathematics S ,
Chapter 2. A lattice point is a point in R d with integer coordinates. Later we will talk about general lattice point.
Chapter 9: Geometric Selection Theorems 11/01/2013
8.3 Representing Relations Directed Graphs –Vertex –Arc (directed edge) –Initial vertex –Terminal vertex.
Line Transversals to Disjoint Balls (Joint with C. Borcea, O. Cheong, X. Goaoc, A. Holmsen) Sylvain Petitjean LORIA, Vegas team O. Schwarzkopf.
MA4266 Topology Wayne Lawton Department of Mathematics S ,
The Simplex Algorithm 虞台文 大同大學資工所 智慧型多媒體研究室. Content Basic Feasible Solutions The Geometry of Linear Programs Moving From Bfs to Bfs Organization of a.
The countable character of uncountable graphs François Laviolette Barbados 2003.
Perito Moreno Glacier Perito Moreno Glacier 二○一五年十月二十七日星期二.
I.4 Polyhedral Theory 1. Integer Programming  Objective of Study: want to know how to describe the convex hull of the solution set to the IP problem.
§Discrete mathematics §Discrete i.e. no continuous §Set theory, Combinatorics, Graphs, Modern Algebra(Abstract algebra, Algebraic structures), Logic, classic.
Unit II Discrete Structures Relations and Functions SE (Comp.Engg.)
Discrete Mathematics Set.
GRAPHS. Graph Graph terminology: vertex, edge, adjacent, incident, degree, cycle, path, connected component, spanning tree Types of graphs: undirected,
Chapter 8: Relations. 8.1 Relations and Their Properties Binary relations: Let A and B be any two sets. A binary relation R from A to B, written R : A.
Copyright © Cengage Learning. All rights reserved. CHAPTER 8 RELATIONS.
8.5 Equivalence Relations
1 Section 4.2 Equivalence Relations A binary relation is an equivalence relation if it has the three properties reflexive, symmetric, and transitive (RST).
ORDERED SETS. RELATIONS COSC-1321 Discrete Structures 1.
Summary of the Last Lecture This is our second lecture. In our first lecture, we discussed The vector spaces briefly and proved some basic inequalities.
Topology Preserving Edge Contraction Paper By Dr. Tamal Dey et al Presented by Ramakrishnan Kazhiyur-Mannar.
Dilworth’s theorem and extremal set theory 張雁婷 國立交通大學應用數學系.
1 Chapter 4 Geometry of Linear Programming  There are strong relationships between the geometrical and algebraic features of LP problems  Convenient.
The Relation Induced by a Partition
Chapter 5 Limits and Continuity.
Unit-III Algebraic Structures
Equivalence Relations
The countable character of uncountable graphs François Laviolette Barbados 2003.
9. Counting and Probability 1 Summary
Chapter 3 The Real Numbers.
Sets and Logic…. Chapters 5 and 6
Computational Geometry
3.3 Applications of Maximum Flow and Minimum Cut
Polyhedron Here, we derive a representation of polyhedron and see the properties of the generators. We also see how to identify the generators. The results.
Polyhedron Here, we derive a representation of polyhedron and see the properties of the generators. We also see how to identify the generators. The results.
Miniconference on the Mathematics of Computation
Affine Spaces Def: Suppose
I.4 Polyhedral Theory (NW)
Discrete Mathematics and its Applications Lecture 7 – Cops and Robbers
Flow Feasibility Problems
Quantum Foundations Lecture 2
I.4 Polyhedral Theory.
Counting Elements of Disjoint Sets: The Addition Rule
ICOM 5016 – Introduction to Database Systems
Preliminaries on normed vector space
Convex Hull - most ubiquitous structure in computational geometry
Presentation transcript:

Combinatorial Geometry 邓俊辉 清华大学计算机系 年10月12日星期一 2015年10月12日星期一 2015年10月12日星期一 2015年10月12日星期一 2015年10月12日星期一 2015年10月12日星期一下午12时18分 下午12时18分 下午12时18分 下午12时18分 下午12时18分

2 Junhui Deng, Tsinghua Computer Radon's Theorem ☞ Radon's partition Radon partition –Given P a family of sets in E d, if there are two disjoint, non-empty subfamilies P 1 and P 2 of P such that conv(P 1 )  conv(P 2 )  , then (P 1, P 2 ) is called a Radon partition of P ☞ Radon's Theorem –Every family of n  d+2 sets in E d admits a Radon partition

3 Junhui Deng, Tsinghua Computer Radon's Theorem ☞ Kirchberger's Theorem –For any Radon partition (P 1, P 2 ) of a family P of n  d+2 sets in E d, there is a subfamily U  P with (dim(P 1  P 2 )+2) sets such that (P 1  U, P 2  U) is a Radon partition of U (and hence of P) ☞ Tverberg's Theorem –  Every set of (m-1)(d+1)+1 points in E d can be divided into m (pairwise disjoint) subsets whose convex hulls have a common point; –  the number (m-1)(d+1)+1 is the smallest which has the stated property

4 Junhui Deng, Tsinghua Computer Helly's Theorem ☞ [Helly, 1923] –[Finite version] A family of finite convex sets admits a nonempty common intersection iff each of its (d+1)-cardinality subfamilies does –[Infinite version] A family of infinite compact convex sets admits a nonempty common intersection iff each of its (d+1)-cardinality subfamilies does

5 Junhui Deng, Tsinghua Computer Transversal ☞ k-Transversal –Given F a family of sets in E d, a k-flat T is called a k-transversal of F if T meets every member of F ☞ Examples –0-transversal / Helly theorem –1-transversal / stabbing line

6 Junhui Deng, Tsinghua Computer The space of k-transversals ☞ Given F a family of convex sets in E d –the topological space of all k-flats intersecting F is called the space of k- transversals of F ☞ The space of 0-transversals –convex (why?) ☞ The space of k-transversals (k>=1) –not convex –even not connected

7 Junhui Deng, Tsinghua Computer Finding k-Transversal ☞ Goal –not just a single k-transversal –a data structure representing the entire space of k-transversals ☞ Problems –How much time/space is needed for the construction? –What's the complexity of such a data structure? –What's the combinatorial complexity of this space?

8 Junhui Deng, Tsinghua Computer Ham-Sandwich Theorem ☞ [Discrete version] –Let P 1, …, P d be d finite sets of points in E d –There exists a hyperplane h that simultaneously bisects P 1, …, P d

9 Junhui Deng, Tsinghua Computer Minkowski's first Theorem ☞ [Minkowski, 1891] –Let C  E d be symmetric, convex, bounded, and suppose that vol(C) > 2 d –Then C contains at least one lattice point different from 0 ☞ Ex: Regular Forest –Diameter of forest = 26m –Diameter of trees = ? ?

10 Junhui Deng, Tsinghua Computer Two-Square Theorem & Four-Square Theorem ☞ [Two-square Theorem] –Each prime p  1 (mod 4) can be written as a sum of two squares –i.e.,  prime p = 4k + 1,  a, b  Z s.t. p = a 2 + b 2 –e.g. 13 = = ☞ [Four-square Theorem] –Any natural number can be written as a sum of 4 squares of integer

11 Junhui Deng, Tsinghua Computer Four-Square Theorem ☞ 2004 –= (25, 25, 23, 15) = (27, 25, 19, 17) = (27, 25, 23, 11) = (27, 25, 25, 5) = (28, 26, 20, 12) –= (28, 28, 20, 6) = (29, 21, 19, 19) = (29, 25, 23, 3) = (30, 28, 16, 8) = (31, 23, 17, 15) –= (31, 27, 17, 5) = (31, 29, 11, 9) = (31, 31, 9, 1) = (32, 20, 18, 16) = (32, 24, 20, 2) –= (32, 28, 14, 0) = (32, 30, 8, 4) = (33, 23, 19, 5) = (33, 25, 13, 11) = (33, 25, 17, 1) –= (33, 29, 7, 5) = (34, 24, 16, 4) = (34, 28, 8, 0) = (35, 21, 13, 13) = (35, 21, 17, 7) –= (35, 23, 13, 9) = (35, 23, 15, 5) = (35, 27, 5, 5) = (35, 27, 7, 1) = (36, 16, 16, 14) –= (36, 26, 4, 4) = (37, 17, 15, 11) = (37, 19, 15, 7) = (37, 21, 13, 5) = (37, 23, 9, 5) –= (37, 25, 3, 1) = (38, 20, 12, 4) = (39, 17, 13, 5) = (39, 19, 11, 1) = (40, 14, 12, 8) –= (40, 16, 12, 2) = (40, 18, 8, 4) = (40, 20, 2, 0) = (41, 11, 11, 9) = (41, 15, 7, 7) –= (41, 17, 5, 3) = (43, 9, 7, 5) = (43, 11, 5, 3) = (44, 6, 4, 4) = (44, 8, 2, 0)

12 Junhui Deng, Tsinghua Computer The Erdos-Szekeres Theorem ☞ Convex Independent Set –A set X  R d is called convex independent if for every x  X, we have x  conv(X\{x}) ☞ [Erdos & Szekeres, 1935] –For every k  N, there exists a number n(k) such that any n(k)-point set X  R 2 in general position contains a k-point convex independent subset ☞ What is the lower bound of n(k)? –Ex: n(5)  9

13 Junhui Deng, Tsinghua Computer The k-Set Problem ☞ k-Sets –Let P be a configuration of n points in E d and let S be a halfspace k-set –P  S is called a k-set of P if card(P  S) = k, 0  k  n ☞ Problems –What are the upper/lower bounds for the maximum number of k-sets for all configurations of n points in E d, in terms of n and k? –What are the upper/lower bounds for the maximum number of k-sets for all configurations of n points in E 2, in terms of n and k?

14 Junhui Deng, Tsinghua Computer The k-Set Problem ☞ Lower bounds –  (nlog(k+1))Edelsbrunner & Welzl, 1985 –  (ne sqrt(log(k+1)) )Toth, 1999 ☞ Upper bounds – O(n*sqrt(k+1))Lovasz, 1971 – O(n*sqrt(k+1)/log * (k+1))Pach et al., 1989 – O(n*cbrt(k+1))Dey, 1998