Iterated Point-Line Configurations Grow Doubly-Exponentially
|
|
- Rosemary Howard
- 5 years ago
- Views:
Transcription
1 Iterate Point-Line Configurations Grow Doubly-Exponentially Joshua Cooper an Mark Walters July 9, 008 Abstract Begin with a set of four points in the real plane in general position. A to this collection the intersection of all lines through pairs of these points. Iterate. Ismailescu an Raoičić (003 showe that the limiting set is ense in the plane. We give oubly exponential upper an lower bouns on the number of points at each stage. The proof employs a variant of the Szemeréi-Trotter Theorem an an analysis of the minimum egree of the growing configuration. Consier the iterative process of constructing points an lines in the real plane given by the following: begin with a set of points P 1 = {p 1, p, p 3, p 4 } in the real plane in general position. For each pair of points, construct the line passing through the pair. This will create a set of lines L 1 = {l 1, l, l 3, l 4, l 5, l 6 }. Some of these constructe lines will intersect at points in the plane that o not belong to the set P 1. A any such point to the set P 1 to get a new set P. Now, note that there exist some pairs of points in P that o not lie on a line in L 1, namely some elements of P \ P 1. A these missing lines to the set L 1 to get a new set L. Iterate in this manner, aing points to P k followe by aing lines to L k. We assume that the original configuration is such that for every k N no two lines in L k are parallel. Now we introuce some notation for this iterative process. The k th stage is efine to consist of these two orere steps: 1. A each intersection of pairs of elements of L k to P k+1, an. A a line through each of pair of elements of P k to L k+1. 1
2 Uner this efinition, we say that stage 1 begins with the configuration of four points with six lines an stage k begins with n k points with m k lines. We will enote the set of points at the beginning of stage k by P k an likewise the set of lines at the beginning of stage k by L k. There are some trivial bouns on the number of points an lines at stage k that can be obtaine with this notation. Since a point in P k must lie at the intersection of at least two lines of L k 1 we know that at stage k, there are at most ( m k 1 points. Similarly, since a line in L k must contain at least two points from P k we know that at stage k there are at most ( n k lines. In other wors, n k ( mk 1 an m k ( nk. From this it follows that n k+1 ( mk ( < < ( n k = n k 4 8 an m k+1 ( nk+1 (( mk < ( mk ( < m k = m k 4 8. Note that a stage in this iterative process can be alternatively efine as follows: 1. Place a point at any intersection of a pair of lines for which a point oes not alreay exist.. Take the ual of the configuration of points an lines (points become lines an lines become points. 3. Return to step 1. Hence, points an lines play a very similar role in this process an we only nee to consier bouns on one of the two quantities. Henceforth we will only provie arguments concerning the bouns on n k. A trivial lower boun is given in the following: Proposition 1. For all k N, n k+1 n k + 1.
3 Proof. If this claim is false then we must have a stage at which the process stabilizes [1]. So, suppose that the process stabilizes at the beginning of stage k an let conv(p k enote the convex hull of P k, where conv(p k enotes the number of vertices of this convex hull. Suppose first that conv(p k 4. In this case, we can fin two nonajacent, nonparallel sies of the convex hull, which lie on lines that intersect outsie of the convex hull. This contraicts the stability supposition. So, conv(p k = 3. Let {a, b, c} be the set of vertices of the triangle forming the convex hull. Suppose that there exist points along at least two of the sies of the triangle efine by {a, b, c}, say x ab an y bc. In this case, the line forme by xy must intersect ac outsie the convex hull, again contraicting stability. So, there exist points along at most one of the sies of the triangle efine by {a, b, c}. Suppose that there exists some point x in the interior of {a, b, c} an efine y = ax bc, z = cx ab. In this case, we have y bc an z ab, a contraiction to the assumption that at most one sie of the triangle contains points. The only remaining possibility is that P k is comprise of n k 1 collinear points. But, the starting configuration of points an lines has the conition that for any line in L 1, there are at least two points of P 1 not passing through it. Since we never remove any points uring this process, then this must hol true for every stage, in particular stage k. This contraiction completes the proof. We efine the egree of a point p P k, enote k (p, to be the number of istinct lines incient upon p at the beginning of stage k. Similarly, the egree of a line l L k, enote k (l, is the number of istinct points through which it passes at the beginning of stage k. Also, let an δ k = min{ k (p p P k } an δ k = min{ k (l l L k } k = max{ k (p p P k } an k = max{ k (l l L k }. Define an n n gri to be any configuration of two collections of n parallel lines, where the one collection is not parallel to the other. Using these efinitions, we obtain the following observation: Proposition. For all k N, δ k 3. 3
4 Proof. Suppose to the contrary that there exists some k N with δ k < 3. Since there are no points of egree 1, we must have δ k =. So there exists p P k with k (p =, i.e., there exist two lines l, l L k with P k l l. Note that n = 7 an = 3 an so for all l, l L, P l l. Since we never remove points in this iterative process, we know that if there exists l, l L k with P k l l, then k <, i.e., k = 1. But we know that δ 1 = 3, a contraiction. We can obtain major improvements to the trivial lower boun using the following: Lemma 3. The minimum number of parallel lines require to pass through all of the intersections of an n n gri is n 1. Proof. Suppose that Q an R are sets of parallel lines that comprise an n n gri. Let S be a minimal witness set of s parallel lines passing through all intersections of the gri. We aim to show that s n 1. Without loss of generality, orient the gri so that the lines of S are vertical in the xy-plane an let X = {x 1, x,..., x s } be the x-intercepts of the lines of S. So X is the collection of projecte points, when we project the gri intersections onto the x-axis with this orientation. Let π(p enote the projection of a point p in the gri onto the x-axis. Arbitrarily choose lines l q, l r in the gri with l q Q an l r R. Let q 1, q,..., q n an r 1, r,..., r n be the points of intersection of l q with R an l r with Q, respectively, where an π(q 1 π(q π(q n π(r 1 π(r π(r n. Suppose also that q i = r j. Define A an B to be the sets of real numbers given by A = {π(q 1, π(q,..., π(q n } an B = {π(r 1 π(r j, π(r π(r j,..., π(r n π(r j }. Uner this setting we have that S = A + B an thus s = A + B. 4
5 It is well known that A + B n 1 for any pair A, B of sets of carinality n an that equality is achieve when A an B are arithmetic progressions []. It follows that s n 1, completing the proof. Using this lemma we can prove the following: Theorem 4. δ k+1 min{n k 1, δ k 3}. Proof. Let p P k. It suffices to show that k+1 (p min{n k 1, δ k 3}. First suppose each line in L k that passes through p has egree. In this case, it s easy to see that there are k (p + 1 points at the beginning of stage k an so k (p = n k 1. Since we never remove lines, we know that k+1 (p k (p = n k 1 min{n k 1, δ k 3}. Now suppose there exists a line l L k that passes through p with k (l 3. Let q, r P k be the other two points on l. Note that k (q δ k an k (r δ k an so there exist two sets of lines L q = {l q1, l q,..., l qn } L k \l an L r = {l r1, l r,..., l rm } L k \l, where n, m δ k 1 an the sets L q l an L r l consist of the lines incient upon q an r, respectively. Now, consier the real plane as a subset of the real projective plane in the stanar way an let l be the line at infinity. We restrict our attention to arbitrarily chosen subsets L q L q an L r L r, where L q = L r = δ k 1. These lines form a (δ k 1 (δ k 1 gri. Now in this gri we will place a point at each intersection for which one oes not alreay exist uring stage k. After oing so, we will construct a line through each pair of points for which one oes not alreay exist. In particular, we will o so for pairs of points of the form (p, x, where x lies at the intersection of lines from L q an L r. So, at the beginning of stage k + 1, there will be at least s lines incient upon p, where s enotes the 5
6 number of lines necessary to ajoin p with all of the intersections of the gri. In other wors, k+1 (p s. Note that any lines passing through p woul form a thir collection of parallel lines to a to the gri. Therefore, s is at least the minimum number of parallel lines require to pass through all of the intersections of a (δ k 1 (δ k 1 gri. Applying Lemma 1 yiels k+1 (p s (δ k 1 1 = δ k 3 min{n k 1, δ k 3}. Now by using techniques similar to the preceing proofs, we can obtain even faster growth of the minimum egree. We will then use the growth rate of δ k to provie arguments for a better lower boun on n k. First, let cr(g enote the crossing number of a graph, which is the minimum number of crossings in a planar rawing of the graph G. We will use the following lemma regaring crossing numbers (the proof can be foun in [3]: Lemma 5. If a graph G with n vertices an e eges has e > 7.5n, then we have e 3 cr(g 33.75n. We now use this crossing number inequality in the following theorem. The argument closely resembles Székely s proof ([4] of the Szemeréi-Trotter Theorem (first appearing in [5]. Theorem 6. Let F = {F 1, F,..., F N } be a collection of N 4 families, each of exactly k parallel lines, no two collections parallel to each other. Let P enote the collection of points that lie at the intersections of lines l i an l j, where l i F 1 an l j F j for some j k. Then where c is a positive real constant. P ck N 1/, Proof. Let A enote this configuration of P points an Nk lines. Let i be the number of point-line inciences in A. Note that there are N ifferent 6
7 families of parallel lines in A, each containing exactly k lines. For all families except F 1, each line contains exactly k points from P an thus contains exactly k 1 line segments which connect two points from A, call them eges. We know that k an so k 1 k/. Hence, each line contains at least k/ eges an if we a this up over all of the Nk lines, we see that the number of eges obtaine in this manner is at least half of the total number of inciences. In other wors, (total number of eges i. Now, we can count the exact number of eges in A. For the k lines of F 1, there are P k eges because all P points lie on the lines of F 1 an for each line we must subtract one to count the number of eges. For each of the remaining N 1 families there are exactly k lines, each containing exactly k 1 eges, yieling a total of (N 1k(k 1 eges. Aing these quantities together, we obtain a gran total of eges, which simplifies to P k + (N 1k(k 1 P + Nk(k 1 k. Now consier the graph G with V (G = P an E(G consisting of the aforementione eges. Since all of the eges lie on one of Nk lines, an any two lines intersect in at most one point, we have cr(g (Nk. Applying the crossing number inequality, we obtain that either P + Nk(k 1 k 7.5 P (1 or that (Nk ( P + Nk(k 1 k P ( 7
8 In the case of (1 we get Nk(k 1 k 6.5 P which implies that Nk(k 1 k P. 6.5 Now, since we know that k an N 4, we have k 1 k/ an N N 1/. Combining this with the previous equation yiels P Nk(k 1 k 6.5 (N k 13 c 1 k N 1/ for some positive constant c 1. In the case of ( we have an so P (Nk ( P + Nk(k 1 k 3 c P /3 (Nk /3 P + Nk(k 1 k for some positive constant c. Recall that the RHS of this inequality is E(G, which is at least i/. So we have i c P /3 (Nk /3. Now, since each of the Nk lines in A must pass through at least k points, then there are at least Nk inciences. From this it follows that for some positive constant c 3. Hence, an so Nk i c 3 P /3 (Nk /3 N 3 k 6 c 4 P (Nk P c 5 k N 1/ for some positive constants c 4 an c 5. So in both cases, we en up with our esire result. 8
9 Now, we can use the previous result to prove the following lemma regaring egree growth: Lemma 7. Given any point p P k with k (p =, there exists a positive real constant c such that 1/ k+1 (p cδ k Proof. Let p P k with k (p =. By the pigeonhole principle, there exists some line l through p with at least s = n k 1 points on it (excluing p. Since each of these s points has at least the minimum egree, we know that there are at least δ k 1 lines through each point (excluing l. Consier the real plane as a subset of the real projective plane in the stanar way an let l be the line at infinity. If we restrict our attention to only the points on l an the lines through them, then we obtain a gri of s + 1 families of parallel lines, one family for each of the points on l. Each family of parallel lines contains at least δ k 1 lines an no two families can be parallel (since they come from istinct points. We woul like to restrict our attention to families of exactly δ k 1 parallel lines. So for each family, except for the one generate by p, arbitrarily choose a subset of δ k 1 lines an isregar all other lines in that family. Let F be the family of lines through p an choose one family R to be a set of reference lines. Let P 0 enote the set of points that lie at the intersection of a reference line an one of the other s 1 families (excluing F. Now, uring stage k, a point must be ae to any intersection for which one oes not alreay exist, in particular all points of P 0. Also, a line must be ae to connect any pair of points for which one oes not alreay exist, in particular for the pairs in the set T = {(p, q q P 0 }. Let t enote the number of istinct lines generate by pairs in the set T. Note that any such line can pass through at most δ k 1 points of P 0 because all the points of P 0 lie in the family R, which contains exactly δ k 1 lines. It follows that k+1 (p t P 0 δ k 1 P 0 δ k, (3 with the first inequality holing because any line generate by the set T must pass through p, an hence contributes to its egree in the stage. Now, for the moment, exclue F from our collection of families an consier all other families of lines along with the points of P 0. Suppose s < 4. 9
10 Hence, n k 1 < 4 an so n k < 4 + 1, i.e., n k 4. It follows that 1/. Note that k+1 (p δ k for all p P k+1 an so k+1 (p cδ k hols true for c = 1. Hence, 1/ k+1(p cδ k for some positive real constant c, as esire. Now suppose that s 4. Since we also know that δ k 3, i.e., δ k 1 for all k N, we can apply Theorem to this configuration with F 1 = R, N = s, an k = δ k 1. It follows that P 0 c 1 (δ k 1 ( nk 1 1/ for some positive constant c 1. Now, note that δ k an n k 4, which implies that δ k 1 1δ k an n k 1 3n 4 k. Combining this with the previous equation, we obtain P 0 c 1 ( δk ( 1/ 3nk c δ k 4 1/ (4 for some positive constant c. If we combine (3 an (4 we get 1/ k+1 (p c δ k, (5 as esire. This completes the proof. Note that P 0 n k+1 an so n k+1 cδ k 1/ must hol for any point p P k with k (p = an some positive constant c. In particular, it must hol for p P k chosen with k (p = δ k. In this case ( 1/ nk n k+1 cδ k = cδ 3/ k n 1/ k. (6 δ k Now we are able to provie an improve lower boun on the minimum egree, which will be use to improve the lower boun on n k. 10
11 Lemma 8. Given any k N, ɛ 0, an any positive real constant c 1 such that δ k c 1 n k ɛ, there exists some positive real constant c such that δ k+1 c n k ( 1+ɛ 3. Proof. Suppose that δ k c 1 n k ɛ for some k N, ɛ 0, an positive real constant c 1. Define α R by α = 1 + ɛ. 3 Let p P k with k (p =. There are two cases: either < n k α or n k α. If < n k α, then by Lemma 7 we have ( 1/ nk 1 α k+1 (p c 0 δ k = c n α 0 δ k n k k for some positive real constant c 0. Since δ k c 1 n k ɛ an α = (1 + ɛ/3, we must have 1 α k+1 (p c 0 δ k n k c 0 c 1 n ɛ 1 ɛ k n k 3 = c n k ( 1+ɛ 3, where c = c 0 c 1. If instea n k α, then obviously we have k+1 (p n k α c n k ( 1+ɛ 3, where c 1. So, in both cases, we have the conclusion that k+1 (p c n k ( 1+ɛ 3 an this will hol true for any p P k. Since the choice of p P k was arbitrary, we have δ k+1 c n ( 1+ɛ k 3, (7 as esire. This completes the proof. 11
12 Now, we are able to obtain some numerical results from Lemma 8. Note first that 1/3 δ k c n k 1 (8 for some positive real constant c (letting ɛ = 0. Further recall that the trivial upper boun yiels Combining (8 an (9, we get that for all k N n k 1 (8n k 1/4. (9 δ k c n k 1 1/3 c [(8n k 1/4 ] 1/3 c 3 n k 1/1 for some positive real constant c 3. Now, we can apply Lemma 8 with ɛ = 1 1 for any k N. Since 1 + ( 1 1 = , we get 7/18 δ k c 4 n k 1 (10 for some positive real constant c 4. Now, we combine (10 with (9, to obtain that for all k N δ k c 4 n k 1 7/18 c 4 [(8n k 1/4 ] 7/18 c 5 n k 7/7 for some positive real constant c 5. This process can be iterate an the limiting value of ɛ > 0 is foun by setting which implies that ɛ = 1 + ɛ 1 ɛ = o(1. Now, using Lemma 8 (ɛ = o(1 with (6, we obtain n k+1 cδ k 3/ n k 1/ c (c n k 1 1+(0.1+o(1 3 c n k o(1 3/ n 1/ k (11 for some positive constants c, c, an c. Using (11 along with the trivial upper boun, we obtain the following theorem: 1
13 Theorem 9. Given k N, there exists real positive constants c 1 an c such that c k n k c 4 4k. (1 Proof. Note first that n 1 = 4 an n = 7. From repeate use of (11 we get that there exist real positive constants a 1, a, a 3, a 4 such that an a 1 4 (1.1+o(1k n k+1 a 4 4k+1 a 3 7 (1.1+o(1k 1 n k a 4 4 4k. Taking square roots, it follows that there exist real positive constants c 1 an c such that c k n k c 4 4k, as esire. Theorem 9 shows that the growth of n k is inee oubly-exponential, as the easy upper boun suggests. However, a consierable gap still remains between the exponents. While we have no rigorous argument proviing improvements of either boun, computational results an heuristic reasoning suggest that the actual growth rate of n k is closer to the state upper boun. References [1] Dan Ismailescu an Raoš Raoičić. A ense planar point set from iterate line intersections. Computational Geometry, 7:57 67, 004. [] Melvyn B. Nathanson. Aitive Number Theory: Inverse Problems an the Geometry of Sumsets. Springer, [3] János Pach an Géza Tóth. Graphs rawn with few crossings per ege. Combinatorica, 17(3:47 439, [4] László A. Székely. Crossing numbers an har Erős problems in iscrete geometry. Combin. Probab. Comput., 6(3: , [5] Enre Szemeréi an William T. Trotter, Jr. Extremal problems in iscrete geometry. Combinatorica, 3(3-4:381 39,
REAL ANALYSIS I HOMEWORK 5
REAL ANALYSIS I HOMEWORK 5 CİHAN BAHRAN The questions are from Stein an Shakarchi s text, Chapter 3. 1. Suppose ϕ is an integrable function on R with R ϕ(x)x = 1. Let K δ(x) = δ ϕ(x/δ), δ > 0. (a) Prove
More informationTopic 7: Convergence of Random Variables
Topic 7: Convergence of Ranom Variables Course 003, 2016 Page 0 The Inference Problem So far, our starting point has been a given probability space (S, F, P). We now look at how to generate information
More informationAcute sets in Euclidean spaces
Acute sets in Eucliean spaces Viktor Harangi April, 011 Abstract A finite set H in R is calle an acute set if any angle etermine by three points of H is acute. We examine the maximal carinality α() of
More informationRamsey numbers of some bipartite graphs versus complete graphs
Ramsey numbers of some bipartite graphs versus complete graphs Tao Jiang, Michael Salerno Miami University, Oxfor, OH 45056, USA Abstract. The Ramsey number r(h, K n ) is the smallest positive integer
More informationarxiv: v1 [math.co] 15 Sep 2015
Circular coloring of signe graphs Yingli Kang, Eckhar Steffen arxiv:1509.04488v1 [math.co] 15 Sep 015 Abstract Let k, ( k) be two positive integers. We generalize the well stuie notions of (k, )-colorings
More informationDiscrete Mathematics
Discrete Mathematics 309 (009) 86 869 Contents lists available at ScienceDirect Discrete Mathematics journal homepage: wwwelseviercom/locate/isc Profile vectors in the lattice of subspaces Dániel Gerbner
More informationOn colour-blind distinguishing colour pallets in regular graphs
J Comb Optim (2014 28:348 357 DOI 10.1007/s10878-012-9556-x On colour-blin istinguishing colour pallets in regular graphs Jakub Przybyło Publishe online: 25 October 2012 The Author(s 2012. This article
More informationThe chromatic number of graph powers
Combinatorics, Probability an Computing (19XX) 00, 000 000. c 19XX Cambrige University Press Printe in the Unite Kingom The chromatic number of graph powers N O G A A L O N 1 an B O J A N M O H A R 1 Department
More informationOn the number of isolated eigenvalues of a pair of particles in a quantum wire
On the number of isolate eigenvalues of a pair of particles in a quantum wire arxiv:1812.11804v1 [math-ph] 31 Dec 2018 Joachim Kerner 1 Department of Mathematics an Computer Science FernUniversität in
More informationarxiv: v1 [math.co] 31 Mar 2008
On the maximum size of a (k,l)-sum-free subset of an abelian group arxiv:080386v1 [mathco] 31 Mar 2008 Béla Bajnok Department of Mathematics, Gettysburg College Gettysburg, PA 17325-186 USA E-mail: bbajnok@gettysburgeu
More informationChapter 5. Factorization of Integers
Chapter 5 Factorization of Integers 51 Definition: For a, b Z we say that a ivies b (or that a is a factor of b, or that b is a multiple of a, an we write a b, when b = ak for some k Z 52 Theorem: (Basic
More informationChromatic number for a generalization of Cartesian product graphs
Chromatic number for a generalization of Cartesian prouct graphs Daniel Král Douglas B. West Abstract Let G be a class of graphs. The -fol gri over G, enote G, is the family of graphs obtaine from -imensional
More informationOn the enumeration of partitions with summands in arithmetic progression
AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 8 (003), Pages 149 159 On the enumeration of partitions with summans in arithmetic progression M. A. Nyblom C. Evans Department of Mathematics an Statistics
More informationLATTICE-BASED D-OPTIMUM DESIGN FOR FOURIER REGRESSION
The Annals of Statistics 1997, Vol. 25, No. 6, 2313 2327 LATTICE-BASED D-OPTIMUM DESIGN FOR FOURIER REGRESSION By Eva Riccomagno, 1 Rainer Schwabe 2 an Henry P. Wynn 1 University of Warwick, Technische
More informationALGEBRAIC AND ANALYTIC PROPERTIES OF ARITHMETIC FUNCTIONS
ALGEBRAIC AND ANALYTIC PROPERTIES OF ARITHMETIC FUNCTIONS MARK SCHACHNER Abstract. When consiere as an algebraic space, the set of arithmetic functions equippe with the operations of pointwise aition an
More informationn 1 conv(ai) 0. ( 8. 1 ) we get u1 = u2 = = ur. Hence the common value of all the Uj Tverberg's Tl1eorem
8.3 Tverberg's Tl1eorem 203 hence Uj E cone(aj ) Above we have erive L;=l 'Pi (uj ) = 0, an so by ( 8. 1 ) we get u1 = u2 = = ur. Hence the common value of all the Uj belongs to n;=l cone(aj ). It remains
More informationPDE Notes, Lecture #11
PDE Notes, Lecture # from Professor Jalal Shatah s Lectures Febuary 9th, 2009 Sobolev Spaces Recall that for u L loc we can efine the weak erivative Du by Du, φ := udφ φ C0 If v L loc such that Du, φ =
More informationSurvey Sampling. 1 Design-based Inference. Kosuke Imai Department of Politics, Princeton University. February 19, 2013
Survey Sampling Kosuke Imai Department of Politics, Princeton University February 19, 2013 Survey sampling is one of the most commonly use ata collection methos for social scientists. We begin by escribing
More informationDiophantine Approximations: Examining the Farey Process and its Method on Producing Best Approximations
Diophantine Approximations: Examining the Farey Process an its Metho on Proucing Best Approximations Kelly Bowen Introuction When a person hears the phrase irrational number, one oes not think of anything
More informationWitt#5: Around the integrality criterion 9.93 [version 1.1 (21 April 2013), not completed, not proofread]
Witt vectors. Part 1 Michiel Hazewinkel Sienotes by Darij Grinberg Witt#5: Aroun the integrality criterion 9.93 [version 1.1 21 April 2013, not complete, not proofrea In [1, section 9.93, Hazewinkel states
More informationA new proof of the sharpness of the phase transition for Bernoulli percolation on Z d
A new proof of the sharpness of the phase transition for Bernoulli percolation on Z Hugo Duminil-Copin an Vincent Tassion October 8, 205 Abstract We provie a new proof of the sharpness of the phase transition
More informationGeneralized Tractability for Multivariate Problems
Generalize Tractability for Multivariate Problems Part II: Linear Tensor Prouct Problems, Linear Information, an Unrestricte Tractability Michael Gnewuch Department of Computer Science, University of Kiel,
More informationA Weak First Digit Law for a Class of Sequences
International Mathematical Forum, Vol. 11, 2016, no. 15, 67-702 HIKARI Lt, www.m-hikari.com http://x.oi.org/10.1288/imf.2016.6562 A Weak First Digit Law for a Class of Sequences M. A. Nyblom School of
More informationarxiv: v4 [cs.ds] 7 Mar 2014
Analysis of Agglomerative Clustering Marcel R. Ackermann Johannes Blömer Daniel Kuntze Christian Sohler arxiv:101.697v [cs.ds] 7 Mar 01 Abstract The iameter k-clustering problem is the problem of partitioning
More informationPerfect Matchings in Õ(n1.5 ) Time in Regular Bipartite Graphs
Perfect Matchings in Õ(n1.5 ) Time in Regular Bipartite Graphs Ashish Goel Michael Kapralov Sanjeev Khanna Abstract We consier the well-stuie problem of fining a perfect matching in -regular bipartite
More informationOptimization Notes. Note: Any material in red you will need to have memorized verbatim (more or less) for tests, quizzes, and the final exam.
MATH 2250 Calculus I Date: October 5, 2017 Eric Perkerson Optimization Notes 1 Chapter 4 Note: Any material in re you will nee to have memorize verbatim (more or less) for tests, quizzes, an the final
More informationLecture Introduction. 2 Examples of Measure Concentration. 3 The Johnson-Lindenstrauss Lemma. CS-621 Theory Gems November 28, 2012
CS-6 Theory Gems November 8, 0 Lecture Lecturer: Alesaner Mąry Scribes: Alhussein Fawzi, Dorina Thanou Introuction Toay, we will briefly iscuss an important technique in probability theory measure concentration
More informationA Sketch of Menshikov s Theorem
A Sketch of Menshikov s Theorem Thomas Bao March 14, 2010 Abstract Let Λ be an infinite, locally finite oriente multi-graph with C Λ finite an strongly connecte, an let p
More information12 th Annual Johns Hopkins Math Tournament Saturday, February 19, 2011
1 th Annual Johns Hopkins Math Tournament Saturay, February 19, 011 Geometry Subject Test 1. [105] Let D x,y enote the half-isk of raius 1 with its curve bounary externally tangent to the unit circle at
More informationLinear First-Order Equations
5 Linear First-Orer Equations Linear first-orer ifferential equations make up another important class of ifferential equations that commonly arise in applications an are relatively easy to solve (in theory)
More informationMcMaster University. Advanced Optimization Laboratory. Title: The Central Path Visits all the Vertices of the Klee-Minty Cube.
McMaster University Avance Optimization Laboratory Title: The Central Path Visits all the Vertices of the Klee-Minty Cube Authors: Antoine Deza, Eissa Nematollahi, Reza Peyghami an Tamás Terlaky AvOl-Report
More informationJUST THE MATHS UNIT NUMBER DIFFERENTIATION 2 (Rates of change) A.J.Hobson
JUST THE MATHS UNIT NUMBER 10.2 DIFFERENTIATION 2 (Rates of change) by A.J.Hobson 10.2.1 Introuction 10.2.2 Average rates of change 10.2.3 Instantaneous rates of change 10.2.4 Derivatives 10.2.5 Exercises
More informationII. First variation of functionals
II. First variation of functionals The erivative of a function being zero is a necessary conition for the etremum of that function in orinary calculus. Let us now tackle the question of the equivalent
More informationOn non-antipodal binary completely regular codes
Discrete Mathematics 308 (2008) 3508 3525 www.elsevier.com/locate/isc On non-antipoal binary completely regular coes J. Borges a, J. Rifà a, V.A. Zinoviev b a Department of Information an Communications
More information164 Final Solutions 1
164 Final Solutions 1 1. Question 1 True/False a) Let f : R R be a C 3 function such that fx) for all x R. Then the graient escent algorithm starte at the point will fin the global minimum of f. FALSE.
More information6 General properties of an autonomous system of two first order ODE
6 General properties of an autonomous system of two first orer ODE Here we embark on stuying the autonomous system of two first orer ifferential equations of the form ẋ 1 = f 1 (, x 2 ), ẋ 2 = f 2 (, x
More informationPermanent vs. Determinant
Permanent vs. Determinant Frank Ban Introuction A major problem in theoretical computer science is the Permanent vs. Determinant problem. It asks: given an n by n matrix of ineterminates A = (a i,j ) an
More informationA FURTHER REFINEMENT OF MORDELL S BOUND ON EXPONENTIAL SUMS
A FURTHER REFINEMENT OF MORDELL S BOUND ON EXPONENTIAL SUMS TODD COCHRANE, JEREMY COFFELT, AND CHRISTOPHER PINNER 1. Introuction For a prime p, integer Laurent polynomial (1.1) f(x) = a 1 x k 1 + + a r
More informationMath 342 Partial Differential Equations «Viktor Grigoryan
Math 342 Partial Differential Equations «Viktor Grigoryan 6 Wave equation: solution In this lecture we will solve the wave equation on the entire real line x R. This correspons to a string of infinite
More information19 Eigenvalues, Eigenvectors, Ordinary Differential Equations, and Control
19 Eigenvalues, Eigenvectors, Orinary Differential Equations, an Control This section introuces eigenvalues an eigenvectors of a matrix, an iscusses the role of the eigenvalues in etermining the behavior
More informationLower Bounds for the Smoothed Number of Pareto optimal Solutions
Lower Bouns for the Smoothe Number of Pareto optimal Solutions Tobias Brunsch an Heiko Röglin Department of Computer Science, University of Bonn, Germany brunsch@cs.uni-bonn.e, heiko@roeglin.org Abstract.
More information3.7 Implicit Differentiation -- A Brief Introduction -- Student Notes
Fin these erivatives of these functions: y.7 Implicit Differentiation -- A Brief Introuction -- Stuent Notes tan y sin tan = sin y e = e = Write the inverses of these functions: y tan y sin How woul we
More informationarxiv: v1 [math.co] 13 Dec 2017
The List Linear Arboricity of Graphs arxiv:7.05006v [math.co] 3 Dec 07 Ringi Kim Department of Mathematical Sciences KAIST Daejeon South Korea 344 an Luke Postle Department of Combinatorics an Optimization
More informationLecture XII. where Φ is called the potential function. Let us introduce spherical coordinates defined through the relations
Lecture XII Abstract We introuce the Laplace equation in spherical coorinates an apply the metho of separation of variables to solve it. This will generate three linear orinary secon orer ifferential equations:
More informationThe Approximability and Integrality Gap of Interval Stabbing and Independence Problems
CCCG 01, Charlottetown, P.E.I., August 8 10, 01 The Approximability an Integrality Gap of Interval Stabbing an Inepenence Problems Shalev Ben-Davi Elyot Grant Will Ma Malcolm Sharpe Abstract Motivate by
More informationComputing Exact Confidence Coefficients of Simultaneous Confidence Intervals for Multinomial Proportions and their Functions
Working Paper 2013:5 Department of Statistics Computing Exact Confience Coefficients of Simultaneous Confience Intervals for Multinomial Proportions an their Functions Shaobo Jin Working Paper 2013:5
More informationRobust Forward Algorithms via PAC-Bayes and Laplace Distributions. ω Q. Pr (y(ω x) < 0) = Pr A k
A Proof of Lemma 2 B Proof of Lemma 3 Proof: Since the support of LL istributions is R, two such istributions are equivalent absolutely continuous with respect to each other an the ivergence is well-efine
More informationNew bounds on Simonyi s conjecture
New bouns on Simonyi s conjecture Daniel Soltész soltesz@math.bme.hu Department of Computer Science an Information Theory, Buapest University of Technology an Economics arxiv:1510.07597v1 [math.co] 6 Oct
More informationDECOMPOSITION OF POLYNOMIALS AND APPROXIMATE ROOTS
DECOMPOSITION OF POLYNOMIALS AND APPROXIMATE ROOTS ARNAUD BODIN Abstract. We state a kin of Eucliian ivision theorem: given a polynomial P (x) an a ivisor of the egree of P, there exist polynomials h(x),
More informationMA 2232 Lecture 08 - Review of Log and Exponential Functions and Exponential Growth
MA 2232 Lecture 08 - Review of Log an Exponential Functions an Exponential Growth Friay, February 2, 2018. Objectives: Review log an exponential functions, their erivative an integration formulas. Exponential
More informationLecture 22. Lecturer: Michel X. Goemans Scribe: Alantha Newman (2004), Ankur Moitra (2009)
8.438 Avance Combinatorial Optimization Lecture Lecturer: Michel X. Goemans Scribe: Alantha Newman (004), Ankur Moitra (009) MultiFlows an Disjoint Paths Here we will survey a number of variants of isjoint
More informationInternational Journal of Pure and Applied Mathematics Volume 35 No , ON PYTHAGOREAN QUADRUPLES Edray Goins 1, Alain Togbé 2
International Journal of Pure an Applie Mathematics Volume 35 No. 3 007, 365-374 ON PYTHAGOREAN QUADRUPLES Eray Goins 1, Alain Togbé 1 Department of Mathematics Purue University 150 North University Street,
More informationLarge Triangles in the d-dimensional Unit-Cube (Extended Abstract)
Large Triangles in the -Dimensional Unit-Cube Extene Abstract) Hanno Lefmann Fakultät für Informatik, TU Chemnitz, D-0907 Chemnitz, Germany lefmann@informatik.tu-chemnitz.e Abstract. We consier a variant
More informationQubit channels that achieve capacity with two states
Qubit channels that achieve capacity with two states Dominic W. Berry Department of Physics, The University of Queenslan, Brisbane, Queenslan 4072, Australia Receive 22 December 2004; publishe 22 March
More informationLinear and quadratic approximation
Linear an quaratic approximation November 11, 2013 Definition: Suppose f is a function that is ifferentiable on an interval I containing the point a. The linear approximation to f at a is the linear function
More informationFinal Exam Study Guide and Practice Problems Solutions
Final Exam Stuy Guie an Practice Problems Solutions Note: These problems are just some of the types of problems that might appear on the exam. However, to fully prepare for the exam, in aition to making
More informationCounting Lattice Points in Polytopes: The Ehrhart Theory
3 Counting Lattice Points in Polytopes: The Ehrhart Theory Ubi materia, ibi geometria. Johannes Kepler (1571 1630) Given the profusion of examples that gave rise to the polynomial behavior of the integer-point
More informationOn the minimum distance of elliptic curve codes
On the minimum istance of elliptic curve coes Jiyou Li Department of Mathematics Shanghai Jiao Tong University Shanghai PRChina Email: lijiyou@sjtueucn Daqing Wan Department of Mathematics University of
More informationZachary Scherr Math 503 HW 5 Due Friday, Feb 26
Zachary Scherr Math 503 HW 5 Due Friay, Feb 26 1 Reaing 1. Rea Chapter 9 of Dummit an Foote 2 Problems 1. 9.1.13 Solution: We alreay know that if R is any commutative ring, then R[x]/(x r = R for any r
More informationSturm-Liouville Theory
LECTURE 5 Sturm-Liouville Theory In the three preceing lectures I emonstrate the utility of Fourier series in solving PDE/BVPs. As we ll now see, Fourier series are just the tip of the iceberg of the theory
More informationPure Further Mathematics 1. Revision Notes
Pure Further Mathematics Revision Notes June 20 2 FP JUNE 20 SDB Further Pure Complex Numbers... 3 Definitions an arithmetical operations... 3 Complex conjugate... 3 Properties... 3 Complex number plane,
More information2Algebraic ONLINE PAGE PROOFS. foundations
Algebraic founations. Kick off with CAS. Algebraic skills.3 Pascal s triangle an binomial expansions.4 The binomial theorem.5 Sets of real numbers.6 Surs.7 Review . Kick off with CAS Playing lotto Using
More informationCalculus in the AP Physics C Course The Derivative
Limits an Derivatives Calculus in the AP Physics C Course The Derivative In physics, the ieas of the rate change of a quantity (along with the slope of a tangent line) an the area uner a curve are essential.
More informationThe Exact Form and General Integrating Factors
7 The Exact Form an General Integrating Factors In the previous chapters, we ve seen how separable an linear ifferential equations can be solve using methos for converting them to forms that can be easily
More informationAgmon Kolmogorov Inequalities on l 2 (Z d )
Journal of Mathematics Research; Vol. 6, No. ; 04 ISSN 96-9795 E-ISSN 96-9809 Publishe by Canaian Center of Science an Eucation Agmon Kolmogorov Inequalities on l (Z ) Arman Sahovic Mathematics Department,
More informationZachary Scherr Math 503 HW 3 Due Friday, Feb 12
Zachary Scherr Math 503 HW 3 Due Friay, Feb 1 1 Reaing 1. Rea sections 7.5, 7.6, 8.1 of Dummit an Foote Problems 1. DF 7.5. Solution: This problem is trivial knowing how to work with universal properties.
More informationLecture 5. Symmetric Shearer s Lemma
Stanfor University Spring 208 Math 233: Non-constructive methos in combinatorics Instructor: Jan Vonrák Lecture ate: January 23, 208 Original scribe: Erik Bates Lecture 5 Symmetric Shearer s Lemma Here
More informationLectures - Week 10 Introduction to Ordinary Differential Equations (ODES) First Order Linear ODEs
Lectures - Week 10 Introuction to Orinary Differential Equations (ODES) First Orer Linear ODEs When stuying ODEs we are consiering functions of one inepenent variable, e.g., f(x), where x is the inepenent
More informationd dx But have you ever seen a derivation of these results? We ll prove the first result below. cos h 1
Lecture 5 Some ifferentiation rules Trigonometric functions (Relevant section from Stewart, Seventh Eition: Section 3.3) You all know that sin = cos cos = sin. () But have you ever seen a erivation of
More informationExtreme Values by Resnick
1 Extreme Values by Resnick 1 Preliminaries 1.1 Uniform Convergence We will evelop the iea of something calle continuous convergence which will be useful to us later on. Denition 1. Let X an Y be metric
More informationOn combinatorial approaches to compressed sensing
On combinatorial approaches to compresse sensing Abolreza Abolhosseini Moghaam an Hayer Raha Department of Electrical an Computer Engineering, Michigan State University, East Lansing, MI, U.S. Emails:{abolhos,raha}@msu.eu
More informationu!i = a T u = 0. Then S satisfies
Deterministic Conitions for Subspace Ientifiability from Incomplete Sampling Daniel L Pimentel-Alarcón, Nigel Boston, Robert D Nowak University of Wisconsin-Maison Abstract Consier an r-imensional subspace
More informationON THE DISTANCE BETWEEN SMOOTH NUMBERS
#A25 INTEGERS (20) ON THE DISTANCE BETWEEN SMOOTH NUMBERS Jean-Marie De Koninc Département e mathématiques et e statistique, Université Laval, Québec, Québec, Canaa jm@mat.ulaval.ca Nicolas Doyon Département
More informationLecture 6: Calculus. In Song Kim. September 7, 2011
Lecture 6: Calculus In Song Kim September 7, 20 Introuction to Differential Calculus In our previous lecture we came up with several ways to analyze functions. We saw previously that the slope of a linear
More informationRelatively Prime Uniform Partitions
Gen. Math. Notes, Vol. 13, No., December, 01, pp.1-1 ISSN 19-7184; Copyright c ICSRS Publication, 01 www.i-csrs.org Available free online at http://www.geman.in Relatively Prime Uniform Partitions A. Davi
More informationLower bounds on Locality Sensitive Hashing
Lower bouns on Locality Sensitive Hashing Rajeev Motwani Assaf Naor Rina Panigrahy Abstract Given a metric space (X, X ), c 1, r > 0, an p, q [0, 1], a istribution over mappings H : X N is calle a (r,
More informationCalculus of Variations
16.323 Lecture 5 Calculus of Variations Calculus of Variations Most books cover this material well, but Kirk Chapter 4 oes a particularly nice job. x(t) x* x*+ αδx (1) x*- αδx (1) αδx (1) αδx (1) t f t
More informationFLUCTUATIONS IN THE NUMBER OF POINTS ON SMOOTH PLANE CURVES OVER FINITE FIELDS. 1. Introduction
FLUCTUATIONS IN THE NUMBER OF POINTS ON SMOOTH PLANE CURVES OVER FINITE FIELDS ALINA BUCUR, CHANTAL DAVID, BROOKE FEIGON, MATILDE LALÍN 1 Introuction In this note, we stuy the fluctuations in the number
More informationMath Implicit Differentiation. We have discovered (and proved) formulas for finding derivatives of functions like
Math 400 3.5 Implicit Differentiation Name We have iscovere (an prove) formulas for fining erivatives of functions like f x x 3x 4x. 3 This amounts to fining y for 3 y x 3x 4x. Notice that in this case,
More informationarxiv: v1 [math.co] 17 Feb 2011
On Gromov s Metho of Selecting Heavily Covere Points Jiří Matoušek a,b Uli Wagner b, c August 16, 2016 arxiv:1102.3515v1 [math.co] 17 Feb 2011 Abstract A result of Boros an Fürei ( = 2) an of Bárány (arbitrary
More informationLEGENDRE TYPE FORMULA FOR PRIMES GENERATED BY QUADRATIC POLYNOMIALS
Ann. Sci. Math. Québec 33 (2009), no 2, 115 123 LEGENDRE TYPE FORMULA FOR PRIMES GENERATED BY QUADRATIC POLYNOMIALS TAKASHI AGOH Deicate to Paulo Ribenboim on the occasion of his 80th birthay. RÉSUMÉ.
More informationTable of Common Derivatives By David Abraham
Prouct an Quotient Rules: Table of Common Derivatives By Davi Abraham [ f ( g( ] = [ f ( ] g( + f ( [ g( ] f ( = g( [ f ( ] g( g( f ( [ g( ] Trigonometric Functions: sin( = cos( cos( = sin( tan( = sec
More informationTwo formulas for the Euler ϕ-function
Two formulas for the Euler ϕ-function Robert Frieman A multiplication formula for ϕ(n) The first formula we want to prove is the following: Theorem 1. If n 1 an n 2 are relatively prime positive integers,
More informationNotes on Lie Groups, Lie algebras, and the Exponentiation Map Mitchell Faulk
Notes on Lie Groups, Lie algebras, an the Exponentiation Map Mitchell Faulk 1. Preliminaries. In these notes, we concern ourselves with special objects calle matrix Lie groups an their corresponing Lie
More informationImplicit Differentiation
Implicit Differentiation Thus far, the functions we have been concerne with have been efine explicitly. A function is efine explicitly if the output is given irectly in terms of the input. For instance,
More informationUnit #6 - Families of Functions, Taylor Polynomials, l Hopital s Rule
Unit # - Families of Functions, Taylor Polynomials, l Hopital s Rule Some problems an solutions selecte or aapte from Hughes-Hallett Calculus. Critical Points. Consier the function f) = 54 +. b) a) Fin
More informationTractability results for weighted Banach spaces of smooth functions
Tractability results for weighte Banach spaces of smooth functions Markus Weimar Mathematisches Institut, Universität Jena Ernst-Abbe-Platz 2, 07740 Jena, Germany email: markus.weimar@uni-jena.e March
More informationUNDERSTANDING INTEGRATION
UNDERSTANDING INTEGRATION Dear Reaer The concept of Integration, mathematically speaking, is the "Inverse" of the concept of result, the integration of, woul give us back the function f(). This, in a way,
More informationMath Chapter 2 Essentials of Calculus by James Stewart Prepared by Jason Gaddis
Math 231 - Chapter 2 Essentials of Calculus by James Stewart Prepare by Jason Gais Chapter 2 - Derivatives 21 - Derivatives an Rates of Change Definition A tangent to a curve is a line that intersects
More informationDIFFERENTIAL GEOMETRY, LECTURE 15, JULY 10
DIFFERENTIAL GEOMETRY, LECTURE 15, JULY 10 5. Levi-Civita connection From now on we are intereste in connections on the tangent bunle T X of a Riemanninam manifol (X, g). Out main result will be a construction
More informationCONTAINMENT GAME PLAYED ON RANDOM GRAPHS: ANOTHER ZIG-ZAG THEOREM
CONTAINMENT GAME PLAYED ON RANDOM GRAPHS: ANOTHER ZIG-ZAG THEOREM PAWE L PRA LAT Abstract. We consier a variant of the game of Cops an Robbers, calle Containment, in which cops move from ege to ajacent
More informationSolutions to Math 41 Second Exam November 4, 2010
Solutions to Math 41 Secon Exam November 4, 2010 1. (13 points) Differentiate, using the metho of your choice. (a) p(t) = ln(sec t + tan t) + log 2 (2 + t) (4 points) Using the rule for the erivative of
More informationSHARP BOUNDS FOR EXPECTATIONS OF SPACINGS FROM DECREASING DENSITY AND FAILURE RATE FAMILIES
APPLICATIONES MATHEMATICAE 3,4 (24), pp. 369 395 Katarzyna Danielak (Warszawa) Tomasz Rychlik (Toruń) SHARP BOUNDS FOR EXPECTATIONS OF SPACINGS FROM DECREASING DENSITY AND FAILURE RATE FAMILIES Abstract.
More information16.30/31, Fall 2010 Recitation # 1
6./, Fall Recitation # September, In this recitation we consiere the following problem. Given a plant with open-loop transfer function.569s +.5 G p (s) = s +.7s +.97, esign a feeback control system such
More informationFIRST YEAR PHD REPORT
FIRST YEAR PHD REPORT VANDITA PATEL Abstract. We look at some potential links between totally real number fiels an some theta expansions (these being moular forms). The literature relate to moular forms
More information4.2 First Differentiation Rules; Leibniz Notation
.. FIRST DIFFERENTIATION RULES; LEIBNIZ NOTATION 307. First Differentiation Rules; Leibniz Notation In this section we erive rules which let us quickly compute the erivative function f (x) for any polynomial
More informationCAUCHY INTEGRAL THEOREM
CAUCHY INTEGRAL THEOREM XI CHEN 1. Differential Forms, Integration an Stokes Theorem Let X be an open set in R n an C (X) be the set of complex value C functions on X. A ifferential 1-form is (1.1) ω =
More informationarxiv: v1 [math.co] 27 Nov 2018
FURTHER RESULTS ON THE INDUCIBILITY OF -ARY TREES AUDACE A. V. DOSSOU-OLORY AND STEPHAN WAGNER arxiv:1811.11235v1 [math.co] 27 Nov 2018 Abstract. For a -ary tree every vertex has outegree between 2 an
More informationHilbert functions and Betti numbers of reverse lexicographic ideals in the exterior algebra
Turk J Math 36 (2012), 366 375. c TÜBİTAK oi:10.3906/mat-1102-21 Hilbert functions an Betti numbers of reverse lexicographic ieals in the exterior algebra Marilena Crupi, Carmela Ferró Abstract Let K be
More informationConvergence of Random Walks
Chapter 16 Convergence of Ranom Walks This lecture examines the convergence of ranom walks to the Wiener process. This is very important both physically an statistically, an illustrates the utility of
More information