# Ghost Chimneys. CCCG 2010, Winnipeg MB, August 9 11, David Charlton Erik D. Demaine Martin L. Demaine Vida Dujmović Pat Morin Ryuhei Uehara

Size: px
Start display at page:

Download "Ghost Chimneys. CCCG 2010, Winnipeg MB, August 9 11, David Charlton Erik D. Demaine Martin L. Demaine Vida Dujmović Pat Morin Ryuhei Uehara"

## Transcription

1 Ghost Chimneys David Charlton Erik D. Demaine Martin L. Demaine Vida Dujmović Pat Morin Ryuhei Uehara Abstract A planar point set S is an (i, t) set of ghost chimneys if there exist lines,,..., H t 1 such that the orthogonal projection of S onto H j consists of exactly i + j distinct points. We give upper and lower bounds on the maximum value of t in an (i, t) set of ghost chimneys, showing that it is linear in i. 1 Introduction Once upon a time in Japan, there was a power plant with four chimneys called ghost chimneys (obake entotsu, or ); see Figure 1. Although these chimneys were dismantled in 1964, they are still famous in Japan, with toys, books, manga, and movies referencing them (Figure 2). They are considered a kind of symbol of industrialized Japan in the old, good age of the Showa era [Ada09]. One of the reasons why they are famous and are called ghost chimneys is that they could be seen as two chimneys, three chimneys, or four chimneys depending on the point of view. This phenomenon itself was an accident, but it raises several natural questions. What interval of integers can be realized by such chimneys? How many chimneys do we need to realize the interval? How can we arrange the chimneys to realize the interval? More precisely, we consider the following problem: given an integer i, what is the maximum value t(i) such that there exists a set of points S R 2 and a set,,..., H t(i) 1 of lines where, for each j {0, 1,..., t(i) 1}, the orthogonal projection of S onto H j consists of exactly i + j distinct points? We prove the following result: Theorem 1 For any integer i 1, 2i t(i) i. Computer Science and Artificial Intelligence Laboratory, Massachusetts Institute of Technology, Cambridge, USA. {dchar, Supported in part by Akamai Presidential Fellowship. School of Computer Science, Carleton University, Ottawa, Canada, Research supported in part by NSERC. School of Information Science, Japan Advanced Institute of Science and Technology, Ishikawa , Japan. ac.jp Figure 1: The ghost chimneys in Japan, part of the Senju Thermal Power Station ( ) maintained by the Tokyo Electric Power Company. [Used with permission from Adachi City.] Figure 2: Hello Ghosty In addition to Theorem 1, we show that t(1) = 2, t(2) = 5, t(3) = 9, and t(4) 12. These results show that neither the lower bound nor the upper bound of Theorem 1 is tight for all values of i. Theorem 1 is an immediate consequence of Lemma 1 and Lemma 4, which we prove in the next two sections, respectively.

2 22 nd Canadian Conference on Computational Geometry, 2010 These ghost-chimney problems relate more generally to understanding what orthogonal projections a 2D or 3D shape can have. In 2D, some closely related problems have been considered in [Ski90, MPv08]. Past explorations into structures in 3D, known variously as 3D ambigrams, trip-lets, and shadow sculptures, have focused on precise, usually connected projections [KvWW09, MP09]. Our work was originally motivated by considering what happens with disconnected projections of unspecified relative position. 2 The Lower Bound Lemma 1 For each integer i 1, there exists a set S = S(i) of 3i 1 points and a set,,..., H 2i 1 of lines such that, for each j {0, 1,..., 2i 1}, the orthogonal projection of S onto H j has exactly i + j distinct values. Proof. The point set S consists of the points of an i 3 grid with the bottom-right corner removed; see Figure 3. For even j, H j is a line of slope j/2. For odd j, H j is a line of slope (j + 1)/2. 3 The Upper Bound Our upper-bound proof is closely related to Székely s proof of the Szeméredi Trotter Theorem [Szé97]. We make use of the following version of the Crossing Lemma, which was proved by Pach, Radoicić, Tardos, and Tóth [PRTT04]: Lemma 2 (Crossing Lemma) Let β = 103/6, γ = 1024/31827, and let G be a graph with no self loops, no parallel edges, v vertices, and e > βv edges. Then cr(g) γ e3 v 2. Lemma 3 Let t = αi, let S be a set of r points, and let,,..., H t 1 be a set of lines such that the orthogonal projection of S onto H j gives exactly i + j distinct values. Then, t 34 or r max{4, 2/α α/2}i/γ. Proof. Each projection direction H j defines a set L j of i + j parallel lines, each of which contains at least one point of S. Let G be the geometric graph that contains the points in S plus t additional points p 0, p 1,..., p t 1. Two vertices in S are connected by an edge in G if and only if they occur consecutively on some line in t 1 j=0 L j. Additionally, each vertex p j is connected to each of the i + j lexically largest points on each of the lines in L j. See Figure 4. The graph G has t + r vertices and tr edges. Observe that we have a drawing of G so that the only crossings between edges occur where lines in L intersect p 1 p 0 p 2 Figure 4: The graph G for a set of points with i = 9 and t = 3. each other. The total number of intersecting pairs of lines in L is or j 1 X = (i + j) (i + k) k=0 (i + j)(ij + j 2 /2) (i 2 j + 3ij 2 /2 + j 3 /2) i 2 t 2 /2 + it 3 /2 + t 4 /8. Applying Lemma 2, we learn that either tr β(t + r), (1) X cr(g) γ (tr)3 (t + r) 2. (2) In the former case, we rewrite (1) to obtain t β(t/r + 1) 2β /3, so t 34 (since t is an integer). In the latter case, we expand (2) to obtain i 2 t 2 /2 + it 3 /2 + t 4 /8 γ (tr)3 (t + r) 2. Substituting t = αi gives ( 1 i 2α α ) r 3 γ 8 (t + r) 2 γr/4, where the second inequality follows from the fact that t i + t 1 r. Rewriting to isolate r finally gives ( 2 r α α ) i/γ. 2 We finish the proof by observing that, for α > 2, the inequality r 4i/γ obtained by setting α = 2 is stronger and still applies.

3 j = 0 j = 1 j = 2 j = 3 j = 4 Figure 3: The set S(i) for i = 9 and the projection directions that yield i, i + 1,..., i + 4 distinct points. Lemma 4 For all integers i 1, t(i) i. Proof. Observe that i+t 1 r. Therefore, for i 18, the lemma follows by applying Lemma 3 with α = 2. For i {1, 2,..., 17}, the lemma follows by setting α = 35/i. H 3 H 4 H 2 4 Small Values of i (a) (b) In this section we give some tighter bounds on t(i) for i {1, 2, 3, 4}. Lemma 5 t(1) = 2, and t(2) = 5. Proof. Point sets achieving these bounds are the 1 2 and the 2 3 grid, respectively; see Figure 5. That these point sets are optimal follows from the fact that the existence of and implies that the points of S lie on the intersection of i parallel lines with another set of i + 1 parallel lines. Thus, S i(i + 1), so t(i) S i + 1 i Notice that the proof of Lemma 5 implies that, for any i, t(i) i The following lemma shows that, for i 3, t(i) i 2. Of course, this upper bound is tighter than Lemma 4 for i 123. Figure 5: Point sets showing that (a) t(1) 2 and (b) t(2) 5. For the upper bound, refer to Figure 6. By an affine transformation, we may assume that is vertical and is horizontal. Thus, the points of S are contained in the intersection of 3 horizontal lines with 4 vertical l Lemma 6 t(3) = 9. Proof. The point set S(4) described in the proof of Lemma 1 results in 3 distinct points when projected onto a vertical line, therefore t(3) 9. Figure 6: The proof of Lemma 6.

4 22 nd Canadian Conference on Computational Geometry, 2010 H 3 H 9 H 5 H 2 H 4 H 8 H 7 H10 H 6 Figure 7: A (4, 12) set of ghost chimneys. lines. This establishes that S 12, so t(3) 10. To see that S < 12, assume otherwise and consider any line l that is neither horizontal nor vertical. By a reflection through a horizontal line, we may assume that l has positive slope, so that every point on the bottom row and right column of S has a distinct projection onto l, so S projects onto at least 6 distinct points on l. In particular, this implies that there is no line H 2 such that S projects onto 5 distinct points on H 2. Lemma 7 12 t(4) 15. Proof. The point set and lines,,..., 0 that show t(4) 12 are shown in Figure 7. (1 is omitted since any sufficiently general line will do.) To see that t(4) 15, we argue as in the proof of the second half of Lemma 6. This establishes that S 20. If S {19, 20} then the number of distinct projections of S onto l is at least 7, but this contradicts the existence of H 2. Thus, we must have S 18, to t(4) Conclusions We have given upper and lower bound on the largest possible value of t, as a function of i, in an (i, t) set of ghost chimneys. These bounds differ by only an (admittedly large) constant factor. Reducing this factor remains an open problem. For small values of i, we have shown that t(1) = 2, t(2) = 5, t(3) = 9, and 12 t(4) 18. Another open problem is the generalization of these results to three, or higher, dimensions. Given an integer i, what is the maximum value t(i) such that there exists a set of points S R d and a set,,..., H t(i) 1 of hyperplanes where, for each j {0, 1,..., t(i) 1}, the orthogonal projection of S onto H j consists of exactly i + j distinct points? Finally, the ghost chimneys of Figure 1 appear to be one chimney from some views because of the thickness of the columns. This fact suggests another problem: for what values of i and j can we place unit disks so that different views have i, i + 1,..., j connected components? Acknowledgments This work was initiated at the 25th Bellairs Winter Workshop on Computational Geometry, co-organized by Erik Demaine and Godfried Toussaint, held on February 6 12, 2010, in Holetown, Barbados. We thank the other participants of that workshop Greg Aloupis, Brad Ballinger, Nadia Benbernou, Prosenjit Bose, Sébastien Collette, Mirela Damian, Karim Douïeb, Robin Flatland, Ferran Hurtado, John Iacono, Krishnam Raju Jampani, Anna Lubiw, Vera Sacristan, Stefan Langerman, Diane Souvaine for providing a stimulating research environment. References [Ada09] Adachi City. (Ghost chimneys, in Japanese). tokyo.jp/003/d html, [KvWW09] J. Keiren, F. van Walderveen, and A. Wolff. Constructability of trip-lets. In Abstracts from the 25th European Workshop on Comp. Geom., Brussels, Belgium, [MP09] N. J. Mitra and M. Pauly. Shadow art. ACM Transactions on Graphics, 28(5), Article 157. [MPv08] J. Matoušek, A. Přívětivý, and P. Škovroň. How many points can be reconstructed from k projections? SIAM J. on Discrete Mathematics, 22(4): , 2008.

5 [PRTT04] J. Pach, R. Radoicić, G. Tardos, and G. Tóth. Improving the crossing lemma by finding more crossings in sparse graphs. In Proc. of the 20th Annual Symposium on Comp. Geom., pages 68 75, [Ski90] S. Skiena. Counting k-projections of a point set. J. of Combinatorial Theory, Series A, 55(1): , [Szé97] L. A. Székely. Crossing numbers and hard Erdős problems in discrete geometry. Combinatorics, Probability and Computing, 6: , 1997.

### Zipper Unfolding of Domes and Prismoids

CCCG 2013, Waterloo, Ontario, August 8 10, 2013 Zipper Unfolding of Domes and Prismoids Erik D. Demaine Martin L. Demaine Ryuhei Uehara Abstract We study Hamiltonian unfolding cutting a convex polyhedron

### Realizing partitions respecting full and partial order information

Journal of Discrete Algorithms 6 (2008) 51 58 www.elsevier.com/locate/jda Realizing partitions respecting full and partial order information Erik D. Demaine a, Jeff Erickson b, Danny Kri zanc c, Henk Meijer

### Szemerédi-Trotter theorem and applications

Szemerédi-Trotter theorem and applications M. Rudnev December 6, 2004 The theorem Abstract These notes cover the material of two Applied post-graduate lectures in Bristol, 2004. Szemerédi-Trotter theorem

### arxiv: v1 [cs.cg] 7 Apr 2008

Cauchy s Arm Lemma on a Growing Sphere Zachary Abel David Charlton Sébastien Collette Erik D. Demaine Martin L. Demaine Stefan Langerman Joseph O Rourke Val Pinciu Godfried Toussaint arxiv:0804.0986v1

### THE UNIT DISTANCE PROBLEM ON SPHERES

THE UNIT DISTANCE PROBLEM ON SPHERES KONRAD J. SWANEPOEL AND PAVEL VALTR Abstract. For any D > 1 and for any n 2 we construct a set of n points on a sphere in R 3 of diameter D determining at least cn

### Geometry. The k Most Frequent Distances in the Plane. József Solymosi, 1 Gábor Tardos, 2 and Csaba D. Tóth Introduction

Discrete Comput Geom 8:639 648 (00 DOI: 10.1007/s00454-00-896-z Discrete & Computational Geometry 00 Springer-Verlag New York Inc. The k Most Frequent Distances in the Plane József Solymosi, 1 Gábor Tardos,

### Office: ENGR Phone: (956) Homepage:

Andrew Winslow Department of Computer Science University of Texas Rio Grande Valley 1201 W. University Drive Edinburg, TX 78539-2999 Office: ENGR 3.279 Phone: (956) 655-3054 Email: andrewwinslow@gmail.com

Ladder-Lottery Realization Katsuhisa Yamanaka Takashi Horiyama Takeaki Uno Kunihiro Wasa Abstract C B D A C B D A A ladder lottery of a permutation π = (p 1, p 2,..., p n ) is a network with n vertical

### Bounds on parameters of minimally non-linear patterns

Bounds on parameters of minimally non-linear patterns P.A. CrowdMath Department of Mathematics Massachusetts Institute of Technology Massachusetts, U.S.A. crowdmath@artofproblemsolving.com Submitted: Jan

### Odd Crossing Number Is Not Crossing Number

Odd Crossing Number Is Not Crossing Number Michael J. Pelsmajer Department of Applied Mathematics Illinois Institute of Technology 10 West 3nd Street Chicago, Illinois 60616, USA pelsmajer@iit.edu Daniel

### On the Spanning Ratio of Theta-Graphs

On the Spanning Ratio of Theta-Graphs Prosenjit Bose, André van Renssen, and Sander Verdonschot School of Computer Science, Carleton University, Ottawa, Canada. jit@scs.carleton.ca, andre@cg.scs.carleton.ca,

### Algorithmic Folding Complexity

Algorithmic Folding Complexity Jean Cardinal 1, Erik D. Demaine 2, Martin L. Demaine 2, Shinji Imahori 3, Tsuyoshi Ito 4, Masashi Kiyomi 5, Stefan Langerman 1, Ryuhei Uehara 5, Takeaki Uno 6 1 Département

### arxiv: v1 [cs.cg] 16 May 2011

Collinearities in Kinetic Point Sets arxiv:1105.3078v1 [cs.cg] 16 May 2011 Ben D. Lund George B. Purdy Justin W. Smith Csaba D. Tóth August 24, 2018 Abstract Let P be a set of n points in the plane, each

### arxiv: v2 [math.co] 26 May 2011

The chromatic number of the convex segment disjointness graph arxiv:1105.4931v2 [math.co] 26 May 2011 Dedicat al nostre amic i mestre Ferran Hurtado Ruy Fabila-Monroy David R. Wood October 29, 2018 Abstract

### Covering the Convex Quadrilaterals of Point Sets

Covering the Convex Quadrilaterals of Point Sets Toshinori Sakai, Jorge Urrutia 2 Research Institute of Educational Development, Tokai University, 2-28-4 Tomigaya, Shibuyaku, Tokyo 5-8677, Japan 2 Instituto

### Covering a Chessboard with Staircase Walks

Covering a Chessboard with Staircase Walks Eyal Ackerman Rom Pinchasi July 22, 2013 Abstract An ascending (resp., descending) staircase walk on a chessboard is a rook s path that goes either right or up

### Model-theoretic distality and incidence combinatorics

Model-theoretic distality and incidence combinatorics Artem Chernikov UCLA Model Theory and Combinatorics workshop IHP, Paris, France Jan 29, 2018 Intro I will discuss generalizations of various results

### Distinct Distances in Three and Higher Dimensions

Distinct Distances in Three and Higher Dimensions Boris Aronov János Pach Micha Sharir Gábor Tardos Abstract Improving an old result of Clarkson et al., we show that the number of distinct distances determined

### Lecture 5: January 30

CS71 Randomness & Computation Spring 018 Instructor: Alistair Sinclair Lecture 5: January 30 Disclaimer: These notes have not been subjected to the usual scrutiny accorded to formal publications. They

### Diskrete Mathematik und Optimierung

Diskrete Mathematik und Optimierung Winfried Hochstättler, Robert Nickel: On the Chromatic Number of an Oriented Matroid Technical Report feu-dmo007.07 Contact: winfried.hochstaettler@fernuni-hagen.de

### Sharing a pizza: bisecting masses with two cuts

Sharing a pizza: bisecting masses with two cuts Luis Barba Patrick Schnider Abstract Assume you have a pizza consisting of four ingredients (e.g. bread, tomatoes, cheese and olives) that you want to share

### Distinct Distances in Three and Higher Dimensions

Distinct Distances in Three and Higher Dimensions Boris Aronov János Pach Micha Sharir Gábor Tardos ABSTRACT Improving an old result of Clarkson et al., we show that the number of distinct distances determined

### Containment restrictions

Containment restrictions Tibor Szabó Extremal Combinatorics, FU Berlin, WiSe 207 8 In this chapter we switch from studying constraints on the set operation intersection, to constraints on the set relation

### Minimum Moment Steiner Trees

Minimum Moment Steiner Trees Wangqi Qiu Weiping Shi Abstract For a rectilinear Steiner tree T with a root, define its k-th moment M k (T ) = (d T (u)) k du, T where the integration is over all edges of

### Matching points with squares

Matching points with squares Bernardo M Ábrego1 Esther M Arkin 2 Silvia Fernández-Merchant 1 Ferran Hurtado 3 Mikio Kano 4 Joseph S B Mitchell 2 Jorge Urrutia 5 May 30, 2008 Abstract Given a class C of

### Sums, Products, and Rectangles

July 11, 2012 Joint work in progress with Victor Lie, Princeton. Table of contents 1 Sums and Products 2 3 4 Preliminary definitions We consider sets of real numbers. Now: A is a *finite* set Later: A

### arxiv: v1 [cs.ds] 22 Feb 2011

On Dynamic Optimality for Binary Search Trees Navin Goyal navingo@microsoft.com Manoj Gupta gmanoj@cse.iitd.ernet.in arxiv:1102.4523v1 [cs.ds] 22 Feb 2011 Abstract Does there exist O(1)-competitive(self-adjusting)

### Independence numbers of locally sparse graphs and a Ramsey type problem

Independence numbers of locally sparse graphs and a Ramsey type problem Noga Alon Abstract Let G = (V, E) be a graph on n vertices with average degree t 1 in which for every vertex v V the induced subgraph

### arxiv: v1 [math.co] 24 Sep 2017

k-planar Crossing Number of Random Graphs and Random Regular Graphs arxiv:1709.08136v1 [math.co] 24 Sep 2017 John Asplund 1 Thao Do 2 Arran Hamm 3 László Székely 4 Libby Taylor 5 Zhiyu Wang 4 Abstract

### approximation of the dimension. Therefore, we get the following corollary.

INTRODUCTION In the last five years, several challenging problems in combinatorics have been solved in an unexpected way using polynomials. This new approach is called the polynomial method, and the goal

### 56 CHAPTER 3. POLYNOMIAL FUNCTIONS

56 CHAPTER 3. POLYNOMIAL FUNCTIONS Chapter 4 Rational functions and inequalities 4.1 Rational functions Textbook section 4.7 4.1.1 Basic rational functions and asymptotes As a first step towards understanding

### x y = 1, 2x y + z = 2, and 3w + x + y + 2z = 0

Section. Systems of Linear Equations The equations x + 3 y =, x y + z =, and 3w + x + y + z = 0 have a common feature: each describes a geometric shape that is linear. Upon rewriting the first equation

### Lecture 9: Random sampling, ɛ-approximation and ɛ-nets

CPS296.2 Geometric Optimization February 13, 2007 Lecture 9: Random sampling, -approximation and -nets Lecturer: Pankaj K. Agarwal Scribe: Shashidhara K. Ganjugunte In the next few lectures we will be

### Conflict-Free Colorings of Rectangles Ranges

Conflict-Free Colorings of Rectangles Ranges Khaled Elbassioni Nabil H. Mustafa Max-Planck-Institut für Informatik, Saarbrücken, Germany felbassio, nmustafag@mpi-sb.mpg.de Abstract. Given the range space

### Szemerédi-Trotter type theorem and sum-product estimate in finite fields

Szemerédi-Trotter type theorem and sum-product estimate in finite fields arxiv:0711.4427v1 [math.co] 28 Nov 2007 Le Anh Vinh Mathematics Department Harvard University Cambridge, MA 02138, US vinh@math.harvard.edu

### 2016 Canadian Intermediate Mathematics Contest

The CENTRE for EDUCATION in MATHEMATICS and COMPUTING cemc.uwaterloo.ca 2016 Canadian Intermediate Mathematics Contest Wednesday, November 23, 2016 (in North America and South America) Thursday, November

### Matrices. A matrix is a method of writing a set of numbers using rows and columns. Cells in a matrix can be referenced in the form.

Matrices A matrix is a method of writing a set of numbers using rows and columns. 1 2 3 4 3 2 1 5 7 2 5 4 2 0 5 10 12 8 4 9 25 30 1 1 Reading Information from a Matrix Cells in a matrix can be referenced

### Odd independent transversals are odd

Odd independent transversals are odd Penny Haxell Tibor Szabó Dedicated to Béla Bollobás on the occasion of his 60th birthday Abstract We put the final piece into a puzzle first introduced by Bollobás,

### Natural Numbers: Also called the counting numbers The set of natural numbers is represented by the symbol,.

Name Period Date: Topic: Real Numbers and Their Graphs Standard: 9-12.A.1.3 Objective: Essential Question: What is the significance of a point on a number line? Determine the relative position on the number

### Computing 3SAT on a Fold-and-Cut Machine

CCCG 2017, Ottawa, Ontario, July 26 28, 2017 Computing 3SAT on a Fold-and-Cut Machine Byoungkwon An Erik D Demaine Martin L Demaine Jason S Ku Abstract This paper introduces a computational model called

### 18.5 Crossings and incidences

18.5 Crossings and incidences 257 The celebrated theorem due to P. Turán (1941) states: if a graph G has n vertices and has no k-clique then it has at most (1 1/(k 1)) n 2 /2 edges (see Theorem 4.8). Its

### Semidefinite and Second Order Cone Programming Seminar Fall 2001 Lecture 5

Semidefinite and Second Order Cone Programming Seminar Fall 2001 Lecture 5 Instructor: Farid Alizadeh Scribe: Anton Riabov 10/08/2001 1 Overview We continue studying the maximum eigenvalue SDP, and generalize

### Maximum union-free subfamilies

Maximum union-free subfamilies Jacob Fox Choongbum Lee Benny Sudakov Abstract An old problem of Moser asks: how large of a union-free subfamily does every family of m sets have? A family of sets is called

### Inapproximability Ratios for Crossing Number

Universidade de São Paulo September 14, 2017 Drawings A drawing of a graph G is a function D : G R 2 that maps each vertex to a distinct point and each edge uv E(G) to an arc connecting D(u) to D(v) that

### FUNDAMENTAL GROUPS AND THE VAN KAMPEN S THEOREM. Contents

FUNDAMENTAL GROUPS AND THE VAN KAMPEN S THEOREM SAMUEL BLOOM Abstract. In this paper, we define the fundamental group of a topological space and explore its structure, and we proceed to prove Van-Kampen

### A Simple Proof of Optimal Epsilon Nets

A Simple Proof of Optimal Epsilon Nets Nabil H. Mustafa Kunal Dutta Arijit Ghosh Abstract Showing the existence of ɛ-nets of small size has been the subject of investigation for almost 30 years, starting

### Rewriting Absolute Value Functions as Piece-wise Defined Functions

Rewriting Absolute Value Functions as Piece-wise Defined Functions Consider the absolute value function f ( x) = 2x+ 4-3. Sketch the graph of f(x) using the strategies learned in Algebra II finding the

### arxiv: v1 [math.mg] 10 Feb 2017

Rainbow triangles arxiv:1702.03043v1 [math.mg] 10 Feb 2017 Steven Senger February 9, 2017 Abstract We seek conditions under which colorings of various vector spaces are guaranteed to have a copy of a unit

### Geometry. Open Caps and Cups in Planar Point Sets. Pavel Valtr. 1. Introduction

Discrete Comput Geom 37:565 576 (2007) DOI: 10.1007/s00454-006-1286-3 Discrete & Computational Geometry 2007 Springer Science+Business Media, Inc. Open Caps and Cups in Planar Point Sets Pavel Valtr Department

### Three-Dimensional Grid Drawings with Sub-Quadratic Volume

Contemporary Mathematics Three-Dimensional Grid Drawings with Sub-Quadratic Volume Vida Dujmović and David R. Wood Abstract. A three-dimensional grid drawing of a graph is a placement of the vertices at

### Faster Algorithms for some Optimization Problems on Collinear Points

Faster Algorithms for some Optimization Problems on Collinear Points Ahmad Biniaz Prosenjit Bose Paz Carmi Anil Maheshwari J. Ian Munro Michiel Smid June 29, 2018 Abstract We propose faster algorithms

### Deterministic Decentralized Search in Random Graphs

Deterministic Decentralized Search in Random Graphs Esteban Arcaute 1,, Ning Chen 2,, Ravi Kumar 3, David Liben-Nowell 4,, Mohammad Mahdian 3, Hamid Nazerzadeh 1,, and Ying Xu 1, 1 Stanford University.

### Crossing-Number Critical Graphs have Bounded Path-width

Crossing-Number Critical Graphs have Bounded Path-width Petr Hliněný School of Mathematical and Computing Sciences, Victoria University of Wellington, New Zealand hlineny@member.ams.org Current mailing

### DISTANCE SETS OF WELL-DISTRIBUTED PLANAR POINT SETS. A. Iosevich and I. Laba. December 12, 2002 (revised version) Introduction

DISTANCE SETS OF WELL-DISTRIBUTED PLANAR POINT SETS A. Iosevich and I. Laba December 12, 2002 (revised version) Abstract. We prove that a well-distributed subset of R 2 can have a distance set with #(

### Wooden Geometric Puzzles: Design and Hardness Proofs

Wooden Geometric Puzzles: Design and Hardness Proofs Helmut Alt Hans L. Bodlaender Marc van Kreveld Günter Rote Gerard Tel Department of Information and Computing Sciences, Utrecht University Technical

### On the Chromatic Number of the Visibility Graph of a Set of Points in the Plane

Discrete Comput Geom 34:497 506 (2005) DOI: 10.1007/s00454-005-1177-z Discrete & Computational Geometry 2005 Springer Science+Business Media, Inc. On the Chromatic Number of the Visibility Graph of a Set

### Additional Constructions to Solve the Generalized Russian Cards Problem using Combinatorial Designs

Additional Constructions to Solve the Generalized Russian Cards Problem using Combinatorial Designs Colleen M. Swanson Computer Science & Engineering Division University of Michigan Ann Arbor, MI 48109,

### Geometry. Covering Things with Things. Stefan Langerman 1 and Pat Morin Introduction

Discrete Comput Geom 33:717 729 (2005) DOI: 10.1007/s00454-004-1108-4 Discrete & Computational Geometry 2004 Springer-Verlag New York, LLC Covering Things with Things Stefan Langerman 1 and Pat Morin 2

### A Note on Interference in Random Networks

CCCG 2012, Charlottetown, P.E.I., August 8 10, 2012 A Note on Interference in Random Networks Luc Devroye Pat Morin Abstract The (maximum receiver-centric) interference of a geometric graph (von Rickenbach

### Off-diagonal hypergraph Ramsey numbers

Off-diagonal hypergraph Ramsey numbers Dhruv Mubayi Andrew Suk Abstract The Ramsey number r k (s, n) is the minimum such that every red-blue coloring of the k- subsets of {1,..., } contains a red set of

### The 2-valued case of makespan minimization with assignment constraints

The 2-valued case of maespan minimization with assignment constraints Stavros G. Kolliopoulos Yannis Moysoglou Abstract We consider the following special case of minimizing maespan. A set of jobs J and

07 PAPER Special Section on Discrete Mathematics and Its Applications On Reconfiguring Radial Trees Yoshiyuki KUSAKARI a), Member SUMMARY A linkage is a collection of line segments, called bars, possibly

### Cross-Intersecting Sets of Vectors

Cross-Intersecting Sets of Vectors János Pach Gábor Tardos Abstract Given a sequence of positive integers p = (p 1,..., p n ), let S p denote the set of all sequences of positive integers x = (x 1,...,

### Interval minors of complete bipartite graphs

Interval minors of complete bipartite graphs Bojan Mohar Department of Mathematics Simon Fraser University Burnaby, BC, Canada mohar@sfu.ca Arash Rafiey Department of Mathematics Simon Fraser University

### Finite affine planes in projective spaces

Finite affine planes in projective spaces J. A.Thas H. Van Maldeghem Ghent University, Belgium {jat,hvm}@cage.ugent.be Abstract We classify all representations of an arbitrary affine plane A of order q

### Laplacian Integral Graphs with Maximum Degree 3

Laplacian Integral Graphs with Maximum Degree Steve Kirkland Department of Mathematics and Statistics University of Regina Regina, Saskatchewan, Canada S4S 0A kirkland@math.uregina.ca Submitted: Nov 5,

### Codewords of small weight in the (dual) code of points and k-spaces of P G(n, q)

Codewords of small weight in the (dual) code of points and k-spaces of P G(n, q) M. Lavrauw L. Storme G. Van de Voorde October 4, 2007 Abstract In this paper, we study the p-ary linear code C k (n, q),

### 12-1 Graphing Linear Equations. Warm Up Problem of the Day Lesson Presentation. Course 3

Warm Up Problem of the Day Lesson Presentation Warm Up Solve each equation for y. 1. 6y 1x = 4. y 4x = 0 3. y 5x = 16 4. 3y + 6x = 18 y = x + 4 y = x 10 y = 5 x + 8 y = x + 6 Problem of the Day The same

### Computing 3SAT on a Fold-and-Cut Machine

CCCG 2017, Ottawa, Ontario, July 26 28, 2017 Computing 3SAT on a Fold-and-Cut Machine Byoungkwon An Erik D Demaine Martin L Demaine Jason S Ku Abstract This paper introduces a computational model called

### Section 3.4 Writing the Equation of a Line

Chapter Linear Equations and Functions Section.4 Writing the Equation of a Line Writing Equations of Lines Critical to a thorough understanding of linear equations and functions is the ability to write

### Incidence theorems for pseudoflats

Incidence theorems for pseudoflats Izabella Laba and József Solymosi May 25, 2005 Abstract We prove Pach-Sharir type incidence theorems for a class of curves in R n and surfaces in R 3, which we call pseudoflats.

### UNIVERSITY OF MICHIGAN UNDERGRADUATE MATH COMPETITION 27 MARCH 28, 2010

UNIVERSITY OF MICHIGAN UNDERGRADUATE MATH COMPETITION 27 MARCH 28, 200 Instructions. Write on the front of your blue book your student ID number. Do not write your name anywhere on your blue book. Each

### Generalized Ham-Sandwich Cuts

DOI 10.1007/s00454-009-9225-8 Generalized Ham-Sandwich Cuts William Steiger Jihui Zhao Received: 17 March 2009 / Revised: 4 August 2009 / Accepted: 14 August 2009 Springer Science+Business Media, LLC 2009

### Regular bipartite graphs and intersecting families

Journal of Combinatorial Theory, Series A 155 (2018 180 189 Contents lists available at ScienceDirect Journal of Combinatorial Theory, Series A wwwelseviercom/locate/jcta Regular bipartite graphs and intersecting

### Algebra vocabulary CARD SETS Frame Clip Art by Pixels & Ice Cream

Algebra vocabulary CARD SETS 1-7 www.lisatilmon.blogspot.com Frame Clip Art by Pixels & Ice Cream Algebra vocabulary Game Materials: one deck of Who has cards Objective: to match Who has words with definitions

### Basic Combinatorics. Math 40210, Section 01 Fall Homework 8 Solutions

Basic Combinatorics Math 4010, Section 01 Fall 01 Homework 8 Solutions 1.8.1 1: K n has ( n edges, each one of which can be given one of two colors; so Kn has (n -edge-colorings. 1.8.1 3: Let χ : E(K k

### LIMITS AND DERIVATIVES

2 LIMITS AND DERIVATIVES LIMITS AND DERIVATIVES The intuitive definition of a limit given in Section 2.2 is inadequate for some purposes.! This is because such phrases as x is close to 2 and f(x) gets

### Graphs with large maximum degree containing no odd cycles of a given length

Graphs with large maximum degree containing no odd cycles of a given length Paul Balister Béla Bollobás Oliver Riordan Richard H. Schelp October 7, 2002 Abstract Let us write f(n, ; C 2k+1 ) for the maximal

### Cutting Circles into Pseudo-segments and Improved Bounds for Incidences

Cutting Circles into Pseudo-segments and Improved Bounds for Incidences Boris Aronov Micha Sharir December 11, 2000 Abstract We show that n arbitrary circles in the plane can be cut into On 3/2+ε arcs,

### A Lower Bound for Deterministic Asynchronous Rendez-Vous on the Line

A Lower Bound for Deterministic Asynchronous Rendez-Vous on the Line Luis Barba,2, Prosenjit Bose, Jean-Lou De Carufel 3, Stefan Langerman 2, and Attila Pór 4 Carleton University, Ottawa, Canada 2 Université

### Erdős-Szekeres without induction

Erdős-Szekeres without induction arxiv:1509.03332v1 [math.co] 10 Sep 2015 Sergey Norin Yelena Yuditsky October 1, 2018 Abstract Let ES(n) be the minimal integer such that any set of ES(n) points in the

### On the binary solitaire cone

On the binary solitaire cone David Avis a,1 Antoine Deza b,c,2 a McGill University, School of Computer Science, Montréal, Canada b Tokyo Institute of Technology, Department of Mathematical and Computing

### Excluded permutation matrices and the Stanley Wilf conjecture

Excluded permutation matrices and the Stanley Wilf conjecture Adam Marcus Gábor Tardos November 2003 Abstract This paper examines the extremal problem of how many 1-entries an n n 0 1 matrix can have that

### Ramsey-type results for semi-algebraic relations

Ramsey-type results for semi-algebraic relations David Conlon Jacob Fox János Pach Benny Sudakov Andrew Suk Abstract A k-ary semi-algebraic relation E on R d is a subset of R kd, the set of k-tuples of

### USA Mathematical Talent Search Round 3 Solutions Year 28 Academic Year

1/3/28. Fill in each square of the grid with a number from 1 to 16, using each number exactly once. Numbers at the left or top give the largest sum of two numbers in that row or column. Numbers at the

### SHORTEST PERIODIC BILLIARD TRAJECTORIES IN CONVEX BODIES

SHORTEST PERIODIC BILLIARD TRAJECTORIES IN CONVEX BODIES MOHAMMAD GHOMI Abstract. We show that the length of any periodic billiard trajectory in any convex body K R n is always at least 4 times the inradius

### Optimal Ramp Schemes and Related Combinatorial Objects

Optimal Ramp Schemes and Related Combinatorial Objects Douglas R. Stinson David R. Cheriton School of Computer Science University of Waterloo BCC 2017, Glasgow, July 3 7, 2017 1 / 18 (t, n)-threshold Schemes

### 20th Bay Area Mathematical Olympiad. BAMO 2018 Problems and Solutions. February 27, 2018

20th Bay Area Mathematical Olympiad BAMO 201 Problems and Solutions The problems from BAMO- are A E, and the problems from BAMO-12 are 1 5. February 27, 201 A Twenty-five people of different heights stand

### Folding Equilateral Plane Graphs

Folding Equilateral Plane Graphs Zachary Abel 1, Erik D. Demaine 2, Martin L. Demaine 2, Sarah Eisenstat 2, Jayson Lynch 2, Tao B. Schardl 2, and Isaac Shapiro-Ellowitz 3 1 MIT Department of Mathematics,

### The Number of Unit-Area Triangles in the Plane: Theme and Variations

The Number of Unit-Area Triangles in the Plane: Theme and Variations Orit E. Raz and Micha Sharir School of Computer Science, Tel Aviv University Tel Aviv 69978, Israel {oritraz,michas}@post.tau.ac.il

### Polynomial Expressions and Functions

Hartfield College Algebra (Version 2017a - Thomas Hartfield) Unit FOUR Page - 1 - of 36 Topic 32: Polynomial Expressions and Functions Recall the definitions of polynomials and terms. Definition: A polynomial

### ARRANGEABILITY AND CLIQUE SUBDIVISIONS. Department of Mathematics and Computer Science Emory University Atlanta, GA and

ARRANGEABILITY AND CLIQUE SUBDIVISIONS Vojtěch Rödl* Department of Mathematics and Computer Science Emory University Atlanta, GA 30322 and Robin Thomas** School of Mathematics Georgia Institute of Technology

### 1 The Erdős Ko Rado Theorem

1 The Erdős Ko Rado Theorem A family of subsets of a set is intersecting if any two elements of the family have at least one element in common It is easy to find small intersecting families; the basic

### Geometric Spanners With Small Chromatic Number

Geometric Spanners With Small Chromatic Number Prosenjit Bose 1, Paz Carmi 1, Mathieu Couture 1, Anil Maheshwari 1, Michiel Smid 1, and Norbert Zeh 2 1 School of Computer Science, Carleton University 2

### Foundations of Math II Unit 5: Solving Equations

Foundations of Math II Unit 5: Solving Equations Academics High School Mathematics 5.1 Warm Up Solving Linear Equations Using Graphing, Tables, and Algebraic Properties On the graph below, graph the following

### 0-2. 2) Plot the points and connect them. X

1) Pam s Pie Pantry had 2 backorders for cherry pies. Pam can bake 3 pies every hour. Fill in the blanks. Hours 0-2 Pies Practice 6C 2) Plot the points and connect them. 3) Write an equation for the line.