Lower Envelopes Yuval Suede. What’s on the menu? Lower Envelopes Davenport-Schinzel Sequences Trivial upper bound Super linear complexity* Tight upper.

Slides:



Advertisements
Similar presentations
Xiaoming Sun Tsinghua University David Woodruff MIT
Advertisements

10 October 2006 Foundations of Logic and Constraint Programming 1 Unification ­An overview Need for Unification Ranked alfabeths and terms. Substitutions.
Thresholds for Ackermannian Ramsey Numbers Authors: Menachem Kojman Gyesik Lee Eran Omri Andreas Weiermann.
Longest Common Subsequence
Walks, Paths and Circuits Walks, Paths and Circuits Sanjay Jain, Lecturer, School of Computing.
 期中测验时间:本周五上午 9 : 40  教师 TA 答疑时间 : 周三晚上 6 : 00—8 : 30  地点:软件楼 315 房间,  教师 TA :李弋老师  开卷考试.
AP Calculus Section 3.4 Concavity and the Second Derivative Test
Sharp Bounds on Davenport-Schinzel Sequences of Every Order Seth Pettie University of Michigan.
Lecture 3 Lower envelopes Computational Geometry, 2005/06 Prof.Dr.Th.Ottmann 1 The Lower Envelope The Pointwise Minimum of a Set of Functions.
The Lower Envelope: The Pointwise Minimum of a Set of Functions Computational Geometry, WS 2006/07 Lecture 4 Prof. Dr. Thomas Ottmann Algorithmen & Datenstrukturen,
1 Introduction to Computability Theory Lecture3: Regular Expressions Prof. Amos Israeli.
The main idea of the article is to prove that there exist a tester of monotonicity with query and time complexity.
Lower Envelopes (Cont.) Yuval Suede. Reminder Lower Envelope is the graph of the pointwise minimum of the (partially defined) functions. Letbe the maximum.
Finite Mathematics & Its Applications, 10/e by Goldstein/Schneider/SiegelCopyright © 2010 Pearson Education, Inc. 1 of 71 Chapter 1 Linear Equations and.
On the Union of Cylinders in Esther Ezra Duke University On the Union of Cylinders in  3 Esther Ezra Duke University.
Computational Geometry Seminar Lecture 1
. Hidden Markov Model Lecture #6 Background Readings: Chapters 3.1, 3.2 in the text book, Biological Sequence Analysis, Durbin et al., 2001.
Validating Streaming XML Documents Luc Segoufin & Victor Vianu Presented by Harel Paz.
Complexity1 Pratt’s Theorem Proved. Complexity2 Introduction So far, we’ve reduced proving PRIMES  NP to proving a number theory claim. This is our next.
1 Single Final State for NFAs and DFAs. 2 Observation Any Finite Automaton (NFA or DFA) can be converted to an equivalent NFA with a single final state.
Variable-Length Codes: Huffman Codes
1 A Single Final State for Finite Accepters. 2 Observation Any Finite Accepter (NFA or DFA) can be converted to an equivalent NFA with a single final.
Start with a puzzle… There are four occurrences of the pattern  = 132 in the sequence  = 13254: Can you find.
Chapter 6. Order Relations and Structure
Introduction Information in science, business, and mathematics is often organized into rows and columns to form rectangular arrays called “matrices” (plural.
2.3 Analyzing Graphs of Functions. Graph of a Function set of ordered pairs.
On the union of cylinders in 3-space Esther Ezra Duke University.
Name that property Use your white board and write down your response. Hold it up When I see all boards I will tell you the correct response.
Fan-planar Graphs: Combinatorial Properties and Complexity results Carla Binucci, Emilio Di Giacomo, Walter Didimo, Fabrizio Montecchiani, Maurizio Patrignani,
The Integers. The Division Algorithms A high-school question: Compute 58/17. We can write 58 as 58 = 3 (17) + 7 This forms illustrates the answer: “3.
Chapter 2 Mathematical preliminaries 2.1 Set, Relation and Functions 2.2 Proof Methods 2.3 Logarithms 2.4 Floor and Ceiling Functions 2.5 Factorial and.
Center for Graphics and Geometric Computing, Technion 1 Computational Geometry Chapter 8 Arrangements and Duality.
MA4266 Topology Wayne Lawton Department of Mathematics S ,
How to Cut Pseudoparabolas into Segments Seminar on Geometric Incidences By: Almog Freizeit.
Volume: The Disk Method
Center for Graphics and Geometric Computing, Technion 1 Computational Geometry Chapter 8 Arrangements and Duality.
Arrangements and Duality Sanjay Sthapit Comp290 10/6/98.
Unit II Discrete Structures Relations and Functions SE (Comp.Engg.)
1 Tighter bounds and simpler constructions for Davenport-Schinzel sequences Haim Kaplan, Gabriel Nivasch, Micha Sharir Tel-Aviv University.
 Quotient graph  Definition 13: Suppose G(V,E) is a graph and R is a equivalence relation on the set V. We construct the quotient graph G R in the follow.
1 Computational Geometry Seminar Lecture 9 Eyal Zur.
Date: 1.2 Functions And Their Properties A relation is any set of ordered pairs. The set of all first components of the ordered pairs is called the domain.
Department of Statistics University of Rajshahi, Bangladesh
The Jordan Arc theorem. A Lemma: For a connected, finite union of open discs, no two of which are mutually tangent, the outer boundary (which separates.
Ch 9.6: Liapunov’s Second Method In Section 9.3 we showed how the stability of a critical point of an almost linear system can usually be determined from.
Sorting by placement and Shift Sergi Elizalde Peter Winkler By 資工四 B 周于荃.
Relations and Graphs Relations and Graphs Sanjay Jain, Lecturer, School of Computing.
Theory of Computational Complexity M1 Takao Inoshita Iwama & Ito Lab Graduate School of Informatics, Kyoto University.
Dilworth’s theorem and extremal set theory 張雁婷 國立交通大學應用數學系.
FINDING VOLUME USING DISK METHOD & WASHER METHOD
Chapter 3 The Real Numbers.
Chapter 5 Limits and Continuity.
TOPIC 20.2 Composite and Inverse Functions
Unit-III Algebraic Structures
Geometric Graphs and Quasi-Planar Graphs
Chapter 2 Sets and Functions.
Chapter 5. Optimal Matchings
Distinct Distances in the Plane
The Art Gallery Problem
3.3 Applications of Maximum Flow and Minimum Cut
The Art Gallery Problem
Chapter 2 Analytic Function
AREA Section 4.2.
Flow Feasibility Problems
Computational Geometry
Chapter 4 Sequences.
TBF Generall Mathematics - II Lecture – 8 : Linear Inequalities
AREA Section 4.2.
Math 1304 Calculus I 4.03 – Curve Shape.
Presentation transcript:

Lower Envelopes Yuval Suede

What’s on the menu? Lower Envelopes Davenport-Schinzel Sequences Trivial upper bound Super linear complexity* Tight upper bound

Lower Envelope Informal definition: – The part that can be seen by observer sitting at and looking upward. Lower Envelope is the graph of the pointwise minimum of the (partially defined) functions.

Letbe the maximum number of pieces in the lower envelope. We are interested in finding upper bound to Davenport-Schinzel Seq. is a combinatorial abstraction of lower envelopes that is used to obtain a tight upper bound. Davenport-Schinzel Sequences

Let us consider a finite set of curves in the plain: Suppose that each curve is a graph of continuous function Assume that every two curves intersect at most s points for some constant s.

Davenport-Schinzel Sequences Let us number the curves 1 through n, and write down the sequence of the numbers along the lower envelope: We obtain a sequence a 1 a 2... a m with the properties: (1) (2) No two adjacent terms coincide; i.e.,

Davenport-Schinzel Sequences (3)There is no subsequence of the form: note: between an occurrence a curve a and occurrence of a curve b, a and b have to intersect.

Davenport-Schinzel Sequences Theorem: Each D-S sequence of order s over n symbols corresponds to the lower envelope of a suitable set of n curves with at most s intersections between each pair.

Given DS sequence U=(a 1 a 2... a m ) of order s over n symbols: – Suppose that the leftmost appearance of symbol i precedes the leftmost appearance of j iff I < j – Choose m-1 transition points on the x-axis, and n+m-1 distinct horizontal levels, at y=1,2,..,n,-1, -2,…,-(m-1). – For each symbol the graph f a is horizontal at one of this levels except for short intervals near of the transition points. Davenport-Schinzel Sequences

Each pair of functions intersect in at most s points.

Davenport-Schinzel Sequences Each pair of segments intersect once – is it DS(n,1)? We can convert each segment into a graph of an everywhere-defined function: Each pairs of these curves have at most 3 intersections, and so we have DS sequence of order 3 (no ababa).

Trivial upper bound Let be the maximum possible length of Davenport-Schinzel sequence of order s over n symbols. Theorem: = n Proof: – Let U be a DS(n,1)-sequence. – U cannot contain any subsequence a.. b.. a – therefore all elements of U are distinct

Trivial upper bound Theorem: Proof (by induction): – Case n=1: … – Suppose the claim holds for n-1, and let U be DS(n,2)-sequence. Again assume leftmost occurrence of i before j for i<j in U. – Then n has only 1 occurrence in U or else the forbidden pattern (.. x.. n.. x.. n) appears – Remove the appearance of n and at most one of its neighbors if they are equal.

Trivial upper bound The resulting sequence is DS(n-1,2) and has one or two elements less. Therefore D(n,2) has 2*(n-1) = = 2n = 2n – 1 length at most.

Trivial upper bound Determining asymptotic of is hard – Was first posed on – Solved in the mid-1980s. Proposition : Proof: – Let w be DS(n,3). – if the length of w is m, there is a symbol a occurring at most times in w.

Trivial upper bound – proof(cont.) Let us remove all occurrences of a from w. – The resulting sequence can contain pairs of identical adjacent symbols – But there are only 2 pairs at most – the ones of the first and last occurrence of a in w. – Else, we would get the sequence (.. a.. bab.. a..) By deleting all the a and at most 2 symbols we get DS(n-1,3)

Trivial upper bound – proof(cont.) We get the recurrence: Which can be written as: We know that and so we get: And so :

Super linear complexity Maybe the upper bound is O(n)? Theorem (7.2.1) : The function is superlinear – for every C there exists an n 0 such that σ(n 0 ) Cn 0