European Journal of Combinatorics
|
|
- Loraine Neal
- 5 years ago
- Views:
Transcription
1 European Journal of Combinatorics 30 (2009) Contents lists available at ScienceDirect European Journal of Combinatorics ournal homepage: Generalizations of Heilbronn s triangle problem Hanno Lefmann Fakultät für Informatik, TU Chemnitz, D Chemnitz, Germany a r t i c l e i n f o a b s t r a c t Article history: Available online 2 April 2009 For given integers d, 2 and any positive integers n, distributions of n points in the d-dimensional unit cube [0, 1] d are investigated, where the minimum volume of the convex hull determined by of these n points is large. In particular, for fixed integers d, k 2 the existence of a configuration of n points in [0, 1] d is shown, such that, simultaneously for = 2,..., k, the volume of the convex hull of any points among these n points is Ω(1/n ( 1)/(1+ d +1 ) ). Moreover, a deterministic algorithm is given achieving this lower bound, provided that d + 1 k Elsevier Ltd. All rights reserved. 1. Introduction Originally, Heilbronn s triangle problem asks for the supremum value 3 (n), over all distributions of n points in the unit square [0, 1] 2, of the minimum area of a triangle among n points in [0, 1] 2. For prime numbers n, the points (1/n) (i mod n, i 2 mod n), i = 0,..., n 1, show that 3 (n) = Ω(1/n 2 ) as has been observed by Erdős. By using results on the independence number of certain 3- uniform hypergraphs, this lower bound has been improved by Komlós, Pintz and Szemerédi [11] to 3 (n) = Ω(log n/n 2 ). Upper bounds on 3 (n) have been proved by Roth [18 21] and Schmidt [22], and the currently best upper bound 3 (n) = O(2 c log n /n 8/7 ), for some constant c > 0, is due to Komlós, Pintz and Szemerédi [10], compare [6] for an algorithmic version. A variant of this problem, which has been considered by Schmidt [22], asks, for integers 2 n, for the supremum value (n), over all distributions of n points in [0, 1] 2, of the minimum area of the convex hull of among n points. Schmidt obtained 4 (n) = Ω(1/n 3/2 ), and observed that (n) +1 (n) for 2. For fixed 3, the currently best lower bound (n) = Ω((log n) 1/( 2) /n ( 1)/( 2) ) has been obtained in [14], while for fixed 4 only the upper bound (n) = O(1/n) is known. Extensions of Heilbronn s triangle problem to higher dimensions have been investigated in several papers. For integers d,, n 2, let,d (n) be the supremum, over all distributions of n points in address: lefmann@informatik.tu-chemnitz.de /$ see front matter 2009 Elsevier Ltd. All rights reserved. doi: /.ec
2 H. Lefmann / European Journal of Combinatorics 30 (2009) the d-dimensional unit cube [0, 1] d, of the minimum (( 1)-dimensional for d + 1) volume of a -point simplex among the n points. In [2] Barequet has shown that d+1,d = Ω(1/n d ) for fixed integers d 2, and in [4] Barequet and Naor proved the bounds f (k, d)/n k d k+1 k,d (n) (k k/d d k/2 )/(k! n k d ) for arbitrary fixed integers 1 k d, where the function f (k, d) depends on d and k only. For fixed integers d,, 3 d + 1, the currently best lower bounds on,d (n) are,d (n) = Ω((log n) 1/(d +2) /n ( 1)/(d +2) ), compare [12] and [15]. Notice, that the parameter,d (n) is denoted in [4] by H 1,d (n). An on-line version of Heilbronn s triangle problem the points have to be positioned one after the other in [0, 1] d and suddenly this process stops has been considered by Barequet for dimensions d = 3 and d = 4 in [3], where he obtained a configuration of n points in [0, 1] d such that for the minimum volume of any simplex determined by (d + 1) among these n points the lower bounds are Ω(1/n 10/3 ) and Ω(1/n 127/24 ), respectively. These results have been extended in the on-line situation by Barequet and Shaikhet [5,23] to an arbitrary fixed dimension by using a packing argument the lower bound Ω(1/n (d+1) ln(d 2) 0.265d ) for fixed d 5, compare [13] for the case of triangles in [0, 1] d. In connection with some range searching problems Chazelle [9] has investigated the function,d (n) for values, which depend on n, and he showed the asymptotically correct order Θ(/n) for log n n and fixed d 2. In view of this result, it might be of interest to know whether there exists for fixed d, k 3, a single configuration of n points in [0, 1] d, which yields good lower bounds on the minimum volume of any points among the n points, simultaneously for = 3,..., k. We investigate this for fixed k. Moreover, for the range d + 1 k, the arguments can be made constructive by a deterministic polynomial in n time algorithm. Theorem 1. Let d, k 2 be fixed integers. (i) Then, for any integer n k, there exists a configuration of n points in the d-dimensional unit cube [0, 1] d, such that, simultaneously for = 2,..., k, the volume of the convex hull of any points among these n points is Ω(1/n ( 1)/(1+ d +1 ) ). (ii) Moreover, for fixed k d+1 and any integer n k, there is a deterministic polynomial time algorithm, which finds a configuration of n points in [0, 1] d, which, simultaneously for = d+1,..., k, achieves the lower bound Ω(1/n ( 1)/(1+ d +1 ) ) on the volume of the convex hull of any among the n points in [0, 1] d. For fixed integers d, 2, Theorem 1 gives,d = Ω(1/n ( 1)/(1+ d +1 ) ). Concerning upper bounds, a partition of the unit cube [0, 1] d into d-dimensional subcubes each of side length Θ(1/n 1/d ), yields,d (n) = O(1/n ( 1)/d ) for d+1 and,d (n) = O(1/n) for d+1. For even integers, the upper bound can be improved to,d (n) = O(1/n ( 1)/d+( 2)/(2d(d 1)) ), see Brass [7] for = d + 1, and [15] for 4 d + 1. Somewhat surprisingly, achieving by a deterministic polynomial time algorithm for the same n points in [0, 1] d the lower bound,d (n) = Ω(1/n ( 1)/(1+ d +1 ) ), simultaneously for = 2,..., k, where d, k 2 are fixed integers, causes so far some difficulties with respect to the simplices of low dimension, for = 4 and d 5 say, in particular, counting in the d-dimensional N N-standard lattice the number of configurations of lattice points with volume at most v. 2. Proof of Theorem 1(i) Let dist (P i, P ) be the Euclidean distance between the points P i, P [0, 1] d. A simplex given by the points P 1,..., P [0, 1] d, 2 d+1, is the set of all points P 1 + λ i=2 i(p i P 1 ) with λ i=2 i 1 and λ 2,..., λ 0. The (( 1)-dimensional) volume of a simplex given by points P 1,..., P [0, 1] d, 2 d + 1, is defined by vol (P 1,..., P ) := 1/( 1)! i=2 dist (P i; P 1,..., P i 1 ), where dist (P i ; P 1,..., P i 1 ) is the Euclidean distance of the point P i from the affine space P 1,..., P i 1 (1)
3 1688 H. Lefmann / European Journal of Combinatorics 30 (2009) over the reals generated by the vectors P 2 P 1,..., P i 1 P 1 and attached to the point P 1. For points P 1,..., P [0, 1] d, d + 1, let vol (P 1,..., P ) be the (d-dimensional) volume of the convex hull of the points P 1,..., P. Next we prove part (i) of Theorem 1. Proof. Let d, k 2 be fixed integers and let n k be any integer. We select uniformly at random and independently of each other N := k n points P 1, P 2,..., P N from the unit cube [0, 1] d. Set v := β /n ( 1)/(1+ d +1 ) for constants β > 0, = 2,..., k, which will be specified later. Let V := {P 1, P 2,..., P N } be the random set of chosen points in [0, 1] d. For = 2,..., k, let E be the set of all -element subsets {P i1,..., P i } [V] of points such that vol (P i1,..., P i ) v. We give upper bounds on the expected numbers E( E ) of -element sets in E, = 2,..., k, and we show that for a suitable choice of v 2,..., v k all numbers E( E ) are not too big, i.e., E( E 2 ) + + E( E k ) (k 1) n. Thus, there exists a choice of N points P 1, P 2,..., P N [0, 1] d such that E E k (k 1) n. Then, for = 2,..., k, we delete one point from each -element set of points in E. The set of the remaining points has cardinality at least k n (k 1) n = n, and the volume of the convex hull of any points of these at least n points is bigger than v. Lemma 1. Let d, k 2 be fixed integers. For = 2,..., k, there exist constants c,d > 0 such that for every number v > 0 it is (2) E( E ) c,d N v 1+ d +1. (3) Proof. For given v > 0 and random points P 1,..., P [0, 1] d we give an upper bound on the probability Prob (vol (P 1,..., P ) v ). Let the points P 1,..., P be numbered such that for 2 g h and g d + 1 it is dist (P g ; P 1,..., P g 1 ) dist (P h ; P 1,..., P g 1 ). (4) The point P 1 can be anywhere in [0, 1] d. Given P 1, the probability, that the point P 2 [0, 1] d has from P 1 a Euclidean distance within the infinitesimal range [r 1, r 1 + dr 1 ], is at most the difference of the volumes of the d-dimensional balls with center P 1 and with radii (r 1 + dr 1 ) and r 1, respectively, hence Prob (r 1 dist (P 1, P 2 ) r 1 + dr 1 ) d C d r d 1 1 dr 1, where C d is the volume of the d-dimensional unit ball in R d. Given the points P 1 and P 2 with dist (P 1, P 2 ) = r 1, the probability that the Euclidean distance of the point P 3 [0, 1] d from the affine line P 1, P 2 is within the infinitesimal range [r 2, r 2 + dr 2 ] is at most the difference of the volumes of two cylinders centered at the affine line P 1, P 2 with radii r 2 + dr 2 and r 2, respectively, and, by assumption (4), with height 2 r 1 = 2 dist (P 1, P 2 ), thus Prob (r 2 dist (P 3 ; P 1, P 2 ) r 2 + dr 2 ) 2 r 1 (d 1) C d 1 r d 2 2 dr 2. In continuing in this manner, given the points P 1,..., P g, g < and g < d + 1, with dist (P x ; P 1,..., P x 1 ) = r x 1, x = 2,..., g, by (4) for g 2 and g d 1 the proection of the point P g+1 onto the affine space P 1,..., P g is contained in a (g 1)-dimensional box with volume 2 g 1 r 1 r g 1, hence Prob (r g dist (P g+1 ; P 1,..., P g ) r g + dr g ) 2 g 1 r 1 r g 1 (d g + 1) C d g+1 r d g g dr g. (5) For g = 1 < d, in order to satisfy vol (P 1,..., P ) v, we must have 1 ( 1)! dist (P i ; P 1,..., P i 1 ) v. (6) i=2
4 H. Lefmann / European Journal of Combinatorics 30 (2009) By (4) the proection of the point P onto the affine space P 1,..., P 1 is contained in a ( 2)- dimensional box with volume 2 2 r 1 r 2, and by (6) the point P has Euclidean distance at most (( 1)!v )/(r 1 r 2 ) from the affine space P 1,..., P 1, which happens with probability at most ( 1)! d v r 1 r 2 C d +2. (7) r 1 r 2 For d g 1, again by (4), the proection of the point P g+1 onto the affine space P 1,..., P d is contained in a (d 1)-dimensional box with volume at most 2 d 1 r 1 r d 1, and by (6), the point P g+1 has Euclidean distance at most (d! v )/(r 1 r d 1 ) from the affine space P 1,..., P d, which happens with probability at most 2 d 1 r 1 r d 1 2 d! v r 1 r d 1 = d! 2 d v. (8) Thus, for d with (5) and (7), and for some constants c,,d c,d > 0 we obtain Prob (vol (P 1,..., P ) v ) g=1 r 2 =0 r 1 =0 2 2 Cd +2 (( 1)!) d +2 v d +2 (r 1 r 2 ) d g 1 r 1 r g 1 (d g + 1) C d g+1 r d g g dr 2... dr 1 c,d vd +2 r 2 =0 2 r 1 =0 g=1 r 2 2g 3 g dr 2 dr 1 c,d vd +2 as 2 2 g 3 1. (9) Similarly, for = d + 1,..., k, by (5) and (8) for constants c,,d c,d > 0 we infer Prob (vol (P 1,..., P ) v ) g=1 r d 1 =0 r 1 =0 (d! 2 d v ) d d 1 2 g 1 r 1 r g 1 (d g + 1) C d g+1 r d g g drd 1... dr 1 c,d v d r d 1 =0 d 1 r 1 =0 g=1 r 2d 2g 1 g drd 1 dr 1 c,d v d as 2 d 2 g 1 1. (10) By (9) and (10), we have Prob (vol (P 1,..., P ) v ) c,d v1+ d +1 for constants c >,d 0, = 2,..., k. Since there are choices for out of the N random points P 1,..., P N [0, 1] d, inequality (3) follows. N By (3) and Markov s inequality there exist N = k n points P 1,..., P N in [0, 1] d such that for = 2,..., k the corresponding sets E fulfill E k c,d N v 1+ d +1. (11) Fix constants β := 1/(c,d k +1 ) 1/(1+ d +1 ), = 2,..., k. We claim that it is E N/k. (12)
5 1690 H. Lefmann / European Journal of Combinatorics 30 (2009) Namely, for = 2,..., k, by (2) and (11) with N = k n, we infer E N/k k c,d N v 1+ d +1 N/k k +1 c,d n 1 v 1+ d +1 1 k +1 c,d β 1+ d +1 1, which holds by the choice of β > 0. By (12), we have E E k ((k 1)/k) N. For = 2,..., k, we discard one point from each -element set in E. Then, the set of remaining points has cardinality at least N/k = n. These at least n points in [0, 1] d satisfy, simultaneously for = 2,..., k, that the volume of the convex hull of each points is bigger than v = β /n ( 1)/(1+ d +1 ), which finishes the proof of Theorem 1(i). 3. Proof of Theorem 1(ii) Throughout this section, let d, k 2 be fixed integers with k d + 1. Let B d (T) denote the d-dimensional ball with radius T around the origin. To provide a deterministic polynomial time algorithm which, for any integer n > 0, finds a configuration of n points in [0, 1] d, such that the volume of the convex hull of sets with few points is large, we discretize the d-dimensional unit cube [0, 1] d by considering all points in B d (T) Z d for T large enough. With this discretization we have to take care of degenerate sets of points. A set {P 1,..., P } B d (T) Z d with d + 1 is said to be degenerate, if all points P 1,..., P are contained in a (d 1)-dimensional affine subspace of R d, otherwise {P 1,..., P } is said to be non-degenerate. In our arguments for proving Theorem 1(ii) we use lattices. A lattice L in Z d is a subset of Z d, which is generated by all integral linear combinations of some linearly independent vectors b 1,..., b m Z d, hence L = Zb Zb m. The parameter m = rank(l) is called the rank of the lattice L, and the set B = {b 1,..., b m } is a basis of L. The set F B := { m α i=1 i b i 0 α i 1, i = 1,..., m} R d is the fundamental parallelepiped of B and its volume is vol(f B ) := (det(g(b) G(B))) 1/2, where G(B) := (b 1,..., b m ) d m is a d m generator matrix of B. If B and B are two bases of a lattice L in Z d, then vol(f B ) = vol(f B ), see [8]. For vectors a = (a 1,..., a d ) R d and b = (b 1,..., b d ) R d let a, b := d i=1 a i b i be the standard scalar product. The length a of a vector a R d is defined by a := a, a. For a lattice L in Z d let span(l) be the linear space over the reals, which is generated by the vectors in L. For a subset S = {P 1,..., P k } R d of points the rank of S is the dimension of the linear space over the reals, which is generated by the vectors P 2 P,..., 1 P k P 1. A vector a = (a 1,..., a d ) Z d \ {0 d } is said to be primitive, if the greatest common divisor of a 1,..., a d is equal to 1 and a > 0 with = min{i a i 0}. A lattice L in Z d is said to be (d 1)- maximal, if rank(l) = d 1 and no other lattice L L in Z d with rank(l ) = d 1 contains L as a proper subset. The next result shows that the (d 1)-maximal lattices in Z d and the primitive vectors a = (a 1,..., a d ) Z d \ {0 d } are in a one-to-one correspondence. Proposition 1. (i) For each lattice L in Z d with rank(l) = d 1 1 there is exactly one primitive vector a L = (a 1,..., a d ) Z d \ {0 d } with a L, x = 0 for every x L. The vector a L is the primitive normal vector of L. (ii) For each lattice L in Z d with rank(l ) = d 1 there is exactly one (d 1)-maximal lattice L in Z d with L L. (iii) There is a biection between the set of all (d 1)-maximal lattices L in Z d and the set of all primitive vectors a L in Z d. For a lattice L in Z d, a residue class of L is a set L of the form L = x + L = {x + v v L} with x Z d. In our arguments, we use the following Lemmas 2 5; their proofs can be found in [17].
6 H. Lefmann / European Journal of Combinatorics 30 (2009) Lemma 2. Let L be a (d 1)-maximal lattice in Z d with primitive normal vector a L Z d, basis B, and fundamental parallelepiped F B. (i) There exists a point v Z k \ L such that Z d can be partitioned into the residue classes s v + L, s Z, and, for each point x L, it is dist(s v + x, span(l)) = s / a L. (ii) vol(f B ) = a L. Lemma 3. Let d N be fixed. Let S B d (T) Z d be a set of points with rank(s) d 1. Then there exists a (d 1)-maximal lattice L in Z d such that S is contained in some residue class L = v + L of L for some point v Z d, and L has a basis b 1,..., b d 1 Z d with b i = O(T), i = 1,..., d 1. Lemma 4. Let d N be fixed. Let L be a (d 1)-maximal lattice of Z d with primitive normal vector a L Z d, and let B = {b 1,..., b d 1 } be a basis of L with b i = O(T), i = 1,... d 1. Let L be a residue class of L. Then the following hold: a L = O(T d 1 ) and L B d (T) = O ( T d 1 / a L ). For integers g, l N, let r g (l) be the number of g-tuples (x 1,..., x g ) Z g such that x x2 g = l. Lemma 5. Let g, r N be fixed integers. Then, for all integers m N: m { r g (l) ( O m = g/2 r) if g/2 r > 0 l r O (log m) if g/2 r 0. l=1 Now we have all the tools to prove Theorem 1(ii). Proof. Set v := β T d /n ( 1)/( d) for suitable constants β > 0, = d + 1,..., k, which will be fixed later, where T/ log T = ω(n). We construct for = d + 1,..., k two types of -element sets. For points P i1,..., P i B d (T) Z d, let {P i1,..., P i } E if vol (P i1,..., P i ) v and {P i1,..., P i } is not contained in a (d 1)-dimensional affine subspace of R d, i.e., the set {P i1,..., P i } is non-degenerate. Moreover, let {P i1,..., P i } E 0 if {P i1,..., P i } is degenerate. Next we give upper bounds on the sizes E and E 0, = d + 1,..., k. Lemma 6. Let d, k 2 be fixed integers with k d + 1. For = d + 1,..., k, there exist constants c,0 > 0, such that the numbers E 0 of degenerate -element sets of points in Bd (T) Z d satisfy E 0 c,0 T (d 1)+1 log T. (13) Proof. By Lemma 3, each degenerate -element subset of points in B d (T) Z d is contained in a residue class L of some (d 1)-maximal lattice L in Z d, and L has a basis b 1,..., b d 1 Z d with b i = O(T), i = 1,..., d 1. Fix a (d 1)-maximal lattice L in Z d, which is determined by its primitive normal vector a L Z d where a L = O(T d 1 ) by Lemma 4. By Lemma 2(i), there are O(T a L ) residue classes L of L with ( L B d (T). By Lemma 4, from each set L B d (T) we can select points in obtain a degenerate -element set, hence we infer E 0 = O T d 1 / a T a a Z d, a =O(T d 1 ) = O T (d 1)+1 1 a 1 a Z d, a =O(T d 1 ) O(T d 1 / a L ) ) ways to
7 1692 H. Lefmann / European Journal of Combinatorics 30 (2009) = O T (d 1)+1 O(T 2d 2 ) l=1 r d (l) l ( 1)/2 = O ( T (d 1)+1 log T ), as, by Lemma 5, we have m l=1 r d(l)/l ( 1)/2 = O(log m) for d + 1. Lemma 7. Let d, k 2 be fixed integers with k d + 1. For = d + 1,..., k, there exist constants c > 0, such that the numbers E of non-degenerate -element sets of points in B d (T) Z d with volumes of their convex hulls at most v, fulfill E c T d2 v d. (14) Proof. For = d + 1,..., k, consider points P 1,..., P B d (T) Z d with vol (P 1,..., P ) v, where {P 1,..., P } is non-degenerate. Let these points be numbered such that for 2 g h and g d + 1 it is dist (P g ; P 1,..., P g 1 ) dist (P h ; P 1,..., P g 1 ). (15) By Lemma 3, the points P 1,..., P d B d (T) Z d are contained in a residue class L of some (d 1)- maximal lattice L in Z d with primitive normal vector a L Z d, where L has a basis b 1,..., b d 1 Z d with b i = O(T), i = 1,..., d 1. By Lemma 4, it suffices to consider primitive normal vectors a L Z d with a L = O(T d 1 ). Fix a (d 1)-maximal lattice L in Z d with primitive normal vector a L Z d. By Lemma 2(i), there are O(T a L ) residue classes L of L with L B d (T). By Lemma 4, from each set L B d (T) we ( can select d points P 1,..., P d in O(T d 1 / a L ) d ) ways. With (15) we infer for the (d 1)-dimensional volume vol (P 1,..., P d ) > 0, as otherwise {P 1,..., P } is degenerate. Again by (15) the proection of each point P d+1,..., P B d (T) Z d onto the residue class L is contained in a (d 1)-dimensional box of volume 2 d 1 (d 1)! vol (P 1,..., P d ), which, by Lemma 2(ii), contains at most (d 1)! 2 2d 2 vol (P 1,..., P d )/ a L (16) points of L, as each fundamental parallelepiped contains 2 d 1 lattice points. Now vol (P 1,..., P ) v implies dist (P i, P 1,..., P d ) d v /vol (P 1,..., P d ), and by Lemma 2(i), each point P i B d (T) Z d, i = d + 1,...,, is contained in one of at most a L d v /vol (P 1,..., P d ) 3 a L d v /vol (P 1,..., P d ) (17) residue classes L of L. By (16) in each such residue class L we can choose at most (d 1)! 2 2d 2 vol (P 1,..., P d )/ a L points P i B d (T) Z d, hence with (17), each point P i, i = d + 1,...,, can be chosen in at most d! 3 2 2d 2 v ways, and we infer the upper bound E = O T d 1 / a T a v d d a Z d, a =O(T d 1 ) = O = O T d 2 d+1 v d T d 2 d+1 v d 1 a d 1 a Z d, a =O(T d 1 ) O(T 2d 2 ) l=1 r d (l) l (d 1)/2 as m l=1 r d(l)/l (d 1)/2 = O(m 1/2 ) by Lemma 5. = O(T d2 v d ),
8 H. Lefmann / European Journal of Combinatorics 30 (2009) For fixed integers d,, k 2 the sets E and E 0, can easily be constructed by brute force in time polynomial in T. Let B d (T) Z d = C d T d, where C > d 0 is a constant. We enumerate the lattice points in Bd (T) Z d by P 1,..., P C dt d, and to each point P i we associate a variable p i [0, 1], i = 1,..., C d T d, and define a function F: [0, 1] C d T d R as follows: F(p 1,..., p C dt d) := 2pC d T d /2 + k =d+1 C d T d ( 1 p i 2 i=1 {i 1,...,i } E 0 ) + k =d+1 p i1 p i 2 k p c,0 T (d 1)+1 log T. {i 1,...i } E p i1 p i 2 k p c T d2 v d Fix p 1 := := p C dt d := p = (2 k n)/(c d T d ) in the beginning. Then it is p 1 as T/ log T = ω(n). We infer, using 1 + x e x for every x R and Lemmas 6 and 7, that F(p,..., p) < (2/e) pc d T d /2 + (2k 2d)/(2k). This is less than 1 for p C d T d 7 ln k, which holds for n k 2. By using the linearity of F(p 1,..., p C dt d) in each p i (with fixed p, i), we minimize F(p 1,..., p C dt d) step by step by fixing one after the other p i := 0 or p i := 1 for i = 1,..., C d T d, and finally we obtain F(p 1,..., p C dt d) < 1. The set V = {P i B d (T) Z d p i = 1} of points yields subsets E 0 := [V ] E 0 and E := [V ] E of -element sets, = d + 1,..., k, such that V p C d T d /2 (18) E 2 k p c T d2 v d E 0 2 k p c,0 T (d 1)+1 log T. (20) Namely, otherwise, if one of the inequalities (18), (19), or (20) would not hold, then F(p 1,..., p C d) > dt 1, which would be a contradiction. By the choice of the numbers v, = d + 1,..., k, the running time of this procedure is O(T d + k ( E =d+1 + E 0 )) = O(T dk ), i.e., polynomial in T for fixed integers d, k 2. Lemma 8. For = d + 1,..., k, and 0 < β (C d /(2+2 k +1 c )) 1/( d), it is E V /(2 k). (19) Proof. By (18) and (19) with v := β T d /n ( 1)/( d), and p = (2 k n)/(c d T d ), and with β > 0 it is E V /(2 k) 2 k p c T d2 v d p C d T d /(4 k) ( 2 k 1 n 8 k 2 C d T c d T d2 d β T d 2 +2 k +1 c β d C d, n 1 d ) d C d which holds for β d C d /(2+2 k +1 c ), = d + 1,..., k. Lemma 9. For = d + 1,..., k, and T/(log T) 1/( 1) = ω(n), it is E 0 V /(2 k).
9 1694 H. Lefmann / European Journal of Combinatorics 30 (2009) Proof. By (18) and (20), with p = (2 k n)/(c d T d ), = d + 1,..., k, we infer E 0 V /(2 k) 2 k p c,0 T (d 1)+1 log T p C d T d /(4 k) 2 k 1 n 8 k 2 C d T c d,0 T (d 1) d+1 log T C d 2 +2 k +1 c,0 n 1 log T C T 1 which holds for T/(log T) 1/( 1) = ω(n). d, With say T := n (log n) 2, and β := C d /(2+2 k +1 c ) 1/( d), = d + 1,..., k, all assumptions in Lemmas 8 and 9 are fulfilled. By discarding in time O( V + k ( E 0 =d+1 + E )) = O(T kd ) one point from each -element set in E and E 0, = d + 1,..., k, the remaining points yield a subset V V B d (T) Z d of size at least V /k p C d T d /(2 k) = n. These at least n points in V satisfy that the volume of the convex hull of any of these points, = d + 1,..., k, is at least v, i.e. Ω(T d /n ( 1)/( d) ). After rescaling by the factor (2 T) d, we have n points in the unit cube [0, 1] d such that the volume of the convex hull of any of these points is Ω(1/n ( 1)/( d) ), = d + 1,..., k. Altogether the time of this algorithm is O((n (log n) 2 ) dk ) for fixed d, k 2, hence polynomial in n, which finishes the proof of Theorem 1(ii). 4. Remarks By more involved techniques using results on the independence number of certain hypergraphs for some range of k the lower bound (1) in Theorem 1 can be improved by a polylogarithmic factor, as is indicated below, and complements the work from [15]. For a hypergraph G the notation G = (V, E 2 E k ) means that V is its vertex set and E i is the set of all i-element edges in G, i = 2,..., k. The independence number α(g) of a hypergraph G = (V, E) is the largest size of a subset I V which contains no edges from E. A hypergraph G is said to be linear if distinct edges intersect in at most one vertex. The following result from [16] extends an earlier one by Atai, Komlós, Pintz, Spencer and Szemerédi [1] from uniform to arbitrary linear hypergraphs. Theorem 2. Let k 3 be fixed. Let G = (V, E 3 E k ) be a linear hypergraph on V = N vertices, such that for some number T 1 for i = 3,..., k the average degrees i E i /N for the i- element edges are at most T i 1 (log T) (k i)/(k 1). Then, the independence number α(g) fulfills α(g) = Ω((N/T) (log T) 1/(k 1) ). With Theorem 2 one can show the following existence result by more involved arguments than those used here (the details are given elsewhere): Let d 2 and k 3 with k d + 1 be fixed. For every n k there exist n points in the unit cube [0, 1] d, such that, simultaneously for = 3,..., k, the ( 1)- dimensional volume of any -point simplex among these n points is Ω((log n) 1/(d +2) /n ( 1)/(d +2) ). References [1] M. Atai, J. Komlós, J. Pintz, J. Spencer, E. Szemerédi, Extremal uncrowded hypergraphs, Journal of Combinatorial Theory Series A 32 (1982) [2] G. Barequet, A lower bound for Heilbronn s triangle problem in d dimensions, SIAM Journal on Discrete Mathematics 14 (2001) [3] G. Barequet, The on-line Heilbronn s triangle problem, Discrete Mathematics 283 (2004) [4] G. Barequet, J. Naor, Large k D simplices in the D-dimensional unit cube, Far East Journal of Applied Mathematics 24 (2006) [5] G. Barequet, A. Shaikhet, The on-line Heilbronn s triangle problem in d dimensions, Discrete & Computational Geometry 38 (2007)
10 H. Lefmann / European Journal of Combinatorics 30 (2009) [6] C. Bertram-Kretzberg, T. Hofmeister, H. Lefmann, An algorithm for Heilbronn s problem, SIAM Journal on Computing 30 (2000) [7] P. Brass, An upper bound for the d-dimensional Heilbronn triangle problem, SIAM Journal on Discrete Mathematics 19 (2005) [8] J.W.S. Cassels, An Introduction to the Geometry of Numbers, vol. 99, Springer, New York, [9] B. Chazelle, Lower bounds on the complexity of polytope range searching, Journal of the American Mathematical Society 2 (1989) [10] J. Komlós, J. Pintz, E. Szemerédi, On Heilbronn s triangle problem, Journal of the London Mathematical Society 24 (1981) [11] J. Komlós, J. Pintz, E. Szemerédi, A lower bound for Heilbronn s problem, Journal of the London Mathematical Society 25 (1982) [12] H. Lefmann, On Heilbronn s problem in higher dimension, Combinatorica 23 (2003) [13] H. Lefmann, Large triangles in the d-dimensional unit-cube, Theoretical Computer Science 363 (2006) [14] H. Lefmann, Distributions of points in the unit-square and large k-gons, European Journal of Combinatorics 29 (2008) [15] H. Lefmann, Distributions of points in d dimensions and large k-points simplices, Discrete & Computational Geometry 40 (2008) [16] H. Lefmann, On the independence number of uncrowded hypergraphs, preprint. [17] H. Lefmann, N. Schmitt, A deterministic polynomial time algorithm for Heilbronn s problem in three dimensions, SIAM Journal on Computing 31 (2002) [18] K.F. Roth, On a problem of Heilbronn, Journal of the London Mathematical Society 26 (1951) [19] K.F. Roth, On a problem of Heilbronn, II, and III, Proceedings of the London Mathematical Society 25 (3) (1972) , [20] K.F. Roth, Estimation of the area of the smallest triangle obtained by selecting three out of n points in a disc of unit area, in: Proc. of Symposia in Pure Mathematics, vol. 24, AMS, Providence, 1973, pp [21] K.F. Roth, Developments in Heilbronn s triangle problem, Advances in Mathematics 22 (1976) [22] W.M. Schmidt, On a problem of Heilbronn, Journal of the London Mathematical Society 4 (2) (1972) [23] A. Shaikhet, The On-line Heilbronn s triangle problem in d dimensions, M.Sc. Thesis, Department of Computer Science, The Technion Haifa, Israel, 2007.
Large 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 informationColoring Simple Hypergraphs
Department of Mathematics, Statistics and Computer Science University of Illinois Chicago May 13, 2011 A Puzzle Problem Let n 2 and suppose that S [n] [n] with S 2n 1. Then some three points in S determine
More informationColoring Simple Hypergraphs
Department of Mathematics, Statistics and Computer Science University of Illinois Chicago August 28, 2010 Problem Let n 2 and suppose that S [n] [n] with S 2n 1. Then some three points in S determine a
More informationLower Bounds on the Complexity of Simplex Range Reporting on a Pointer Machine
Lower Bounds on the Complexity of Simplex Range Reporting on a Pointer Machine Extended Abstract Bernard Chazelle Department of Computer Science Princeton University Burton Rosenberg Department of Mathematics
More informationEdge-disjoint induced subgraphs with given minimum degree
Edge-disjoint induced subgraphs with given minimum degree Raphael Yuster Department of Mathematics University of Haifa Haifa 31905, Israel raphy@math.haifa.ac.il Submitted: Nov 9, 01; Accepted: Feb 5,
More informationThe concentration of the chromatic number of random graphs
The concentration of the chromatic number of random graphs Noga Alon Michael Krivelevich Abstract We prove that for every constant δ > 0 the chromatic number of the random graph G(n, p) with p = n 1/2
More informationConstructive bounds for a Ramsey-type problem
Constructive bounds for a Ramsey-type problem Noga Alon Michael Krivelevich Abstract For every fixed integers r, s satisfying r < s there exists some ɛ = ɛ(r, s > 0 for which we construct explicitly an
More informationPacking k-partite k-uniform hypergraphs
Available online at www.sciencedirect.com Electronic Notes in Discrete Mathematics 38 (2011) 663 668 www.elsevier.com/locate/endm Packing k-partite k-uniform hypergraphs Richard Mycroft 1 School of Mathematical
More informationNeighborly families of boxes and bipartite coverings
Neighborly families of boxes and bipartite coverings Noga Alon Dedicated to Professor Paul Erdős on the occasion of his 80 th birthday Abstract A bipartite covering of order k of the complete graph K n
More informationIrredundant Families of Subcubes
Irredundant Families of Subcubes David Ellis January 2010 Abstract We consider the problem of finding the maximum possible size of a family of -dimensional subcubes of the n-cube {0, 1} n, none of which
More informationCSE 206A: Lattice Algorithms and Applications Spring Minkowski s theorem. Instructor: Daniele Micciancio
CSE 206A: Lattice Algorithms and Applications Spring 2014 Minkowski s theorem Instructor: Daniele Micciancio UCSD CSE There are many important quantities associated to a lattice. Some of them, like the
More informationIndependence 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
More informationConstructions in Ramsey theory
Constructions in Ramsey theory Dhruv Mubayi Andrew Suk Abstract We provide several constructions for problems in Ramsey theory. First, we prove a superexponential lower bound for the classical 4-uniform
More informationBALANCING GAUSSIAN VECTORS. 1. Introduction
BALANCING GAUSSIAN VECTORS KEVIN P. COSTELLO Abstract. Let x 1,... x n be independent normally distributed vectors on R d. We determine the distribution function of the minimum norm of the 2 n vectors
More informationInduced subgraphs of prescribed size
Induced subgraphs of prescribed size Noga Alon Michael Krivelevich Benny Sudakov Abstract A subgraph of a graph G is called trivial if it is either a clique or an independent set. Let q(g denote the maximum
More informationDecomposing oriented graphs into transitive tournaments
Decomposing oriented graphs into transitive tournaments Raphael Yuster Department of Mathematics University of Haifa Haifa 39105, Israel Abstract For an oriented graph G with n vertices, let f(g) denote
More informationSome Sieving Algorithms for Lattice Problems
Foundations of Software Technology and Theoretical Computer Science (Bangalore) 2008. Editors: R. Hariharan, M. Mukund, V. Vinay; pp - Some Sieving Algorithms for Lattice Problems V. Arvind and Pushkar
More informationA lattice point problem and additive number theory
A lattice point problem and additive number theory Noga Alon and Moshe Dubiner Department of Mathematics Raymond and Beverly Sackler Faculty of Exact Sciences Tel Aviv University, Tel Aviv, Israel Abstract
More informationSELECTIVELY BALANCING UNIT VECTORS AART BLOKHUIS AND HAO CHEN
SELECTIVELY BALANCING UNIT VECTORS AART BLOKHUIS AND HAO CHEN Abstract. A set U of unit vectors is selectively balancing if one can find two disjoint subsets U + and U, not both empty, such that the Euclidean
More informationList coloring hypergraphs
List coloring hypergraphs Penny Haxell Jacques Verstraete Department of Combinatorics and Optimization University of Waterloo Waterloo, Ontario, Canada pehaxell@uwaterloo.ca Department of Mathematics University
More informationSum of dilates in vector spaces
North-Western European Journal of Mathematics Sum of dilates in vector spaces Antal Balog 1 George Shakan 2 Received: September 30, 2014/Accepted: April 23, 2015/Online: June 12, 2015 Abstract Let d 2,
More informationCovering Lattice Points by Subspaces and Counting Point-Hyperplane Incidences
Covering Lattice Points by Subspaces and Counting Point-Hyperplane Incidences Martin Balko 1, Josef Cibulka 2, and Pavel Valtr 3 1 Department of Applied Mathematics, Faculty of Mathematics and Physics,
More informationAvoider-Enforcer games played on edge disjoint hypergraphs
Avoider-Enforcer games played on edge disjoint hypergraphs Asaf Ferber Michael Krivelevich Alon Naor July 8, 2013 Abstract We analyze Avoider-Enforcer games played on edge disjoint hypergraphs, providing
More information1: Introduction to Lattices
CSE 206A: Lattice Algorithms and Applications Winter 2012 Instructor: Daniele Micciancio 1: Introduction to Lattices UCSD CSE Lattices are regular arrangements of points in Euclidean space. The simplest
More informationChapter 1. Preliminaries
Introduction This dissertation is a reading of chapter 4 in part I of the book : Integer and Combinatorial Optimization by George L. Nemhauser & Laurence A. Wolsey. The chapter elaborates links between
More informationSzemeré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
More informationA MOORE BOUND FOR SIMPLICIAL COMPLEXES
Bull. London Math. Soc. 39 (2007) 353 358 C 2007 London Mathematical Society doi:10.1112/blms/bdm003 A MOORE BOUND FOR SIMPLICIAL COMPLEXES ALEXANDER LUBOTZKY and ROY MESHULAM Abstract Let X be a d-dimensional
More informationarxiv: 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
More informationConflict-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
More informationPacking triangles in regular tournaments
Packing triangles in regular tournaments Raphael Yuster Abstract We prove that a regular tournament with n vertices has more than n2 11.5 (1 o(1)) pairwise arc-disjoint directed triangles. On the other
More informationNote on shortest and nearest lattice vectors
Note on shortest and nearest lattice vectors Martin Henk Fachbereich Mathematik, Sekr. 6-1 Technische Universität Berlin Straße des 17. Juni 136 D-10623 Berlin Germany henk@math.tu-berlin.de We show that
More informationNew lower bounds for hypergraph Ramsey numbers
New lower bounds for hypergraph Ramsey numbers Dhruv Mubayi Andrew Suk Abstract The Ramsey number r k (s, n) is the minimum N such that for every red-blue coloring of the k-tuples of {1,..., N}, there
More informationMatrix approximation and Tusnády s problem
European Journal of Combinatorics 28 (2007) 990 995 www.elsevier.com/locate/ejc Matrix approximation and Tusnády s problem Benjamin Doerr Max-Planck-Institut für Informatik, Stuhlsatzenhausweg 85, 66123
More informationShort cycles in random regular graphs
Short cycles in random regular graphs Brendan D. McKay Department of Computer Science Australian National University Canberra ACT 0200, Australia bdm@cs.anu.ed.au Nicholas C. Wormald and Beata Wysocka
More informationThe Algorithmic Aspects of the Regularity Lemma
The Algorithmic Aspects of the Regularity Lemma N. Alon R. A. Duke H. Lefmann V. Rödl R. Yuster Abstract The Regularity Lemma of Szemerédi is a result that asserts that every graph can be partitioned in
More informationMost General Position joint work with
Most General Position joint work with Jan Kynčl, Alexander Pilz, André Schulz supported by the European Science Foundation as part of the EuroGIGA collaborative research project (Graphs in Geometry and
More informationArithmetic Progressions with Constant Weight
Arithmetic Progressions with Constant Weight Raphael Yuster Department of Mathematics University of Haifa-ORANIM Tivon 36006, Israel e-mail: raphy@oranim.macam98.ac.il Abstract Let k n be two positive
More informationc 2010 Society for Industrial and Applied Mathematics
SIAM J. DISCRETE MATH. Vol. 24, No. 3, pp. 1038 1045 c 2010 Society for Industrial and Applied Mathematics SET SYSTEMS WITHOUT A STRONG SIMPLEX TAO JIANG, OLEG PIKHURKO, AND ZELEALEM YILMA Abstract. A
More informationMULTIPLICITIES OF MONOMIAL IDEALS
MULTIPLICITIES OF MONOMIAL IDEALS JÜRGEN HERZOG AND HEMA SRINIVASAN Introduction Let S = K[x 1 x n ] be a polynomial ring over a field K with standard grading, I S a graded ideal. The multiplicity of S/I
More informationApproximation algorithms for cycle packing problems
Approximation algorithms for cycle packing problems Michael Krivelevich Zeev Nutov Raphael Yuster Abstract The cycle packing number ν c (G) of a graph G is the maximum number of pairwise edgedisjoint cycles
More informationChromatic number, clique subdivisions, and the conjectures of Hajós and Erdős-Fajtlowicz
Chromatic number, clique subdivisions, and the conjectures of Hajós and Erdős-Fajtlowicz Jacob Fox Choongbum Lee Benny Sudakov Abstract For a graph G, let χ(g) denote its chromatic number and σ(g) denote
More informationTopological properties of Z p and Q p and Euclidean models
Topological properties of Z p and Q p and Euclidean models Samuel Trautwein, Esther Röder, Giorgio Barozzi November 3, 20 Topology of Q p vs Topology of R Both R and Q p are normed fields and complete
More informationAhlswede Khachatrian Theorems: Weighted, Infinite, and Hamming
Ahlswede Khachatrian Theorems: Weighted, Infinite, and Hamming Yuval Filmus April 4, 2017 Abstract The seminal complete intersection theorem of Ahlswede and Khachatrian gives the maximum cardinality of
More informationOff-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
More informationPigeonhole Principle and Ramsey Theory
Pigeonhole Principle and Ramsey Theory The Pigeonhole Principle (PP) has often been termed as one of the most fundamental principles in combinatorics. The familiar statement is that if we have n pigeonholes
More informationSolving a linear equation in a set of integers II
ACTA ARITHMETICA LXXII.4 (1995) Solving a linear equation in a set of integers II by Imre Z. Ruzsa (Budapest) 1. Introduction. We continue the study of linear equations started in Part I of this paper.
More informationTRISTRAM BOGART AND REKHA R. THOMAS
SMALL CHVÁTAL RANK TRISTRAM BOGART AND REKHA R. THOMAS Abstract. We introduce a new measure of complexity of integer hulls of rational polyhedra called the small Chvátal rank (SCR). The SCR of an integer
More informationSzemerédi s regularity lemma revisited. Lewis Memorial Lecture March 14, Terence Tao (UCLA)
Szemerédi s regularity lemma revisited Lewis Memorial Lecture March 14, 2008 Terence Tao (UCLA) 1 Finding models of large dense graphs Suppose we are given a large dense graph G = (V, E), where V is a
More informationConstructions of digital nets using global function fields
ACTA ARITHMETICA 105.3 (2002) Constructions of digital nets using global function fields by Harald Niederreiter (Singapore) and Ferruh Özbudak (Ankara) 1. Introduction. The theory of (t, m, s)-nets and
More information#A69 INTEGERS 13 (2013) OPTIMAL PRIMITIVE SETS WITH RESTRICTED PRIMES
#A69 INTEGERS 3 (203) OPTIMAL PRIMITIVE SETS WITH RESTRICTED PRIMES William D. Banks Department of Mathematics, University of Missouri, Columbia, Missouri bankswd@missouri.edu Greg Martin Department of
More information< k 2n. 2 1 (n 2). + (1 p) s) N (n < 1
List of Problems jacques@ucsd.edu Those question with a star next to them are considered slightly more challenging. Problems 9, 11, and 19 from the book The probabilistic method, by Alon and Spencer. Question
More informationMAXIMAL PERIODS OF (EHRHART) QUASI-POLYNOMIALS
MAXIMAL PERIODS OF (EHRHART QUASI-POLYNOMIALS MATTHIAS BECK, STEVEN V. SAM, AND KEVIN M. WOODS Abstract. A quasi-polynomial is a function defined of the form q(k = c d (k k d + c d 1 (k k d 1 + + c 0(k,
More informationTORIC WEAK FANO VARIETIES ASSOCIATED TO BUILDING SETS
TORIC WEAK FANO VARIETIES ASSOCIATED TO BUILDING SETS YUSUKE SUYAMA Abstract. We give a necessary and sufficient condition for the nonsingular projective toric variety associated to a building set to be
More informationVertex colorings of graphs without short odd cycles
Vertex colorings of graphs without short odd cycles Andrzej Dudek and Reshma Ramadurai Department of Mathematical Sciences Carnegie Mellon University Pittsburgh, PA 1513, USA {adudek,rramadur}@andrew.cmu.edu
More informationCSE 190, Great ideas in algorithms: Pairwise independent hash functions
CSE 190, Great ideas in algorithms: Pairwise independent hash functions 1 Hash functions The goal of hash functions is to map elements from a large domain to a small one. Typically, to obtain the required
More informationInduced subgraphs with many repeated degrees
Induced subgraphs with many repeated degrees Yair Caro Raphael Yuster arxiv:1811.071v1 [math.co] 17 Nov 018 Abstract Erdős, Fajtlowicz and Staton asked for the least integer f(k such that every graph with
More informationOn tight cycles in hypergraphs
On tight cycles in hypergraphs Hao Huang Jie Ma Abstract A tight k-uniform l-cycle, denoted by T Cl k, is a k-uniform hypergraph whose vertex set is v 0,, v l 1, and the edges are all the k-tuples {v i,
More informationDominating a family of graphs with small connected subgraphs
Dominating a family of graphs with small connected subgraphs Yair Caro Raphael Yuster Abstract Let F = {G 1,..., G t } be a family of n-vertex graphs defined on the same vertex-set V, and let k be a positive
More informationDistinct volume subsets
Distinct volume subsets David Conlon Jacob Fox William Gasarch David G. Harris Douglas Ulrich Samuel Zbarsky Abstract Suppose that a and d are positive integers with a 2. Let h a,d (n) be the largest integer
More information18.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
More informationHardness of the Covering Radius Problem on Lattices
Hardness of the Covering Radius Problem on Lattices Ishay Haviv Oded Regev June 6, 2006 Abstract We provide the first hardness result for the Covering Radius Problem on lattices (CRP). Namely, we show
More informationLecture notes on the ellipsoid algorithm
Massachusetts Institute of Technology Handout 1 18.433: Combinatorial Optimization May 14th, 007 Michel X. Goemans Lecture notes on the ellipsoid algorithm The simplex algorithm was the first algorithm
More informationAlgebraic Methods in Combinatorics
Algebraic Methods in Combinatorics Po-Shen Loh 27 June 2008 1 Warm-up 1. (A result of Bourbaki on finite geometries, from Răzvan) Let X be a finite set, and let F be a family of distinct proper subsets
More informationA SUM-PRODUCT ESTIMATE IN ALGEBRAIC DIVISION ALGEBRAS OVER R. Department of Mathematics University of California Riverside, CA
A SUM-PRODUCT ESTIMATE IN ALGEBRAIC DIVISION ALGEBRAS OVER R 1 Mei-Chu Chang Department of Mathematics University of California Riverside, CA 951 mcc@math.ucr.edu Let A be a finite subset of an integral
More informationProbabilistic Proofs of Existence of Rare Events. Noga Alon
Probabilistic Proofs of Existence of Rare Events Noga Alon Department of Mathematics Sackler Faculty of Exact Sciences Tel Aviv University Ramat-Aviv, Tel Aviv 69978 ISRAEL 1. The Local Lemma In a typical
More informationAn estimate for the probability of dependent events
Statistics and Probability Letters 78 (2008) 2839 2843 Contents lists available at ScienceDirect Statistics and Probability Letters journal homepage: www.elsevier.com/locate/stapro An estimate for the
More informationOn distinct distances among points in general position and other related problems
On distinct distances among points in general position and other related problems Adrian Dumitrescu September 8, 008 Abstract A set of points in the plane is said to be in general position if no three
More informationMaximum 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
More information34 th United States of America Mathematical Olympiad
34 th United States of America Mathematical Olympiad 1. Determine all composite positive integers n for which it is possible to arrange all divisors of n that are greater than 1 in a circle so that no
More informationEnumeration. Phong Nguyễn
Enumeration Phong Nguyễn http://www.di.ens.fr/~pnguyen March 2017 References Joint work with: Yoshinori Aono, published at EUROCRYPT 2017: «Random Sampling Revisited: Lattice Enumeration with Discrete
More informationPartial cubes: structures, characterizations, and constructions
Partial cubes: structures, characterizations, and constructions Sergei Ovchinnikov San Francisco State University, Mathematics Department, 1600 Holloway Ave., San Francisco, CA 94132 Abstract Partial cubes
More informationIMA Preprint Series # 2385
LIST COLORINGS WITH DISTINCT LIST SIZES, THE CASE OF COMPLETE BIPARTITE GRAPHS By Zoltán Füredi and Ida Kantor IMA Preprint Series # 2385 ( October 2011 ) INSTITUTE FOR MATHEMATICS AND ITS APPLICATIONS
More informationThe edge-diametric theorem in Hamming spaces
Discrete Applied Mathematics 56 2008 50 57 www.elsevier.com/locate/dam The edge-diametric theorem in Hamming spaces Christian Bey Otto-von-Guericke-Universität Magdeburg, Institut für Algebra und Geometrie,
More informationMONOCHROMATIC SCHUR TRIPLES IN RANDOMLY PERTURBED DENSE SETS OF INTEGERS
MONOCHROMATIC SCHUR TRIPLES IN RANDOMLY PERTURBED DENSE SETS OF INTEGERS ELAD AIGNER-HOREV AND YURY PERSON Abstract. Given a dense subset A of the first n positive integers, we provide a short proof showing
More informationarxiv: v1 [math.co] 28 Oct 2018
Collapsibility of simplicial complexes of hypergraphs Alan Lew arxiv:1810.11802v1 [math.co] 28 Oct 2018 Abstract Let H be a hypergraph of rank r. We show that the simplicial complex whose simplices are
More informationLecture 1: Basic Concepts
ENGG 5781: Matrix Analysis and Computations Lecture 1: Basic Concepts 2018-19 First Term Instructor: Wing-Kin Ma This note is not a supplementary material for the main slides. I will write notes such as
More informationPacking and decomposition of graphs with trees
Packing and decomposition of graphs with trees Raphael Yuster Department of Mathematics University of Haifa-ORANIM Tivon 36006, Israel. e-mail: raphy@math.tau.ac.il Abstract Let H be a tree on h 2 vertices.
More informationPOLARS AND DUAL CONES
POLARS AND DUAL CONES VERA ROSHCHINA Abstract. The goal of this note is to remind the basic definitions of convex sets and their polars. For more details see the classic references [1, 2] and [3] for polytopes.
More informationOn a hypergraph matching problem
On a hypergraph matching problem Noga Alon Raphael Yuster Abstract Let H = (V, E) be an r-uniform hypergraph and let F 2 V. A matching M of H is (α, F)- perfect if for each F F, at least α F vertices of
More informationThe cocycle lattice of binary matroids
Published in: Europ. J. Comb. 14 (1993), 241 250. The cocycle lattice of binary matroids László Lovász Eötvös University, Budapest, Hungary, H-1088 Princeton University, Princeton, NJ 08544 Ákos Seress*
More informationPacking Ferrers Shapes
Packing Ferrers Shapes Noga Alon Miklós Bóna Joel Spencer February 22, 2002 Abstract Answering a question of Wilf, we show that if n is sufficiently large, then one cannot cover an n p(n) rectangle using
More informationGeneralized hashing and applications to digital fingerprinting
Generalized hashing and applications to digital fingerprinting Noga Alon, Gérard Cohen, Michael Krivelevich and Simon Litsyn Abstract Let C be a code of length n over an alphabet of q letters. An n-word
More informationDiscrete Geometry. Problem 1. Austin Mohr. April 26, 2012
Discrete Geometry Austin Mohr April 26, 2012 Problem 1 Theorem 1 (Linear Programming Duality). Suppose x, y, b, c R n and A R n n, Ax b, x 0, A T y c, and y 0. If x maximizes c T x and y minimizes b T
More information7. Lecture notes on the ellipsoid algorithm
Massachusetts Institute of Technology Michel X. Goemans 18.433: Combinatorial Optimization 7. Lecture notes on the ellipsoid algorithm The simplex algorithm was the first algorithm proposed for linear
More informationA PASCAL-LIKE BOUND FOR THE NUMBER OF NECKLACES WITH FIXED DENSITY
A PASCAL-LIKE BOUND FOR THE NUMBER OF NECKLACES WITH FIXED DENSITY I. HECKENBERGER AND J. SAWADA Abstract. A bound resembling Pascal s identity is presented for binary necklaces with fixed density using
More informationThe Turán number of sparse spanning graphs
The Turán number of sparse spanning graphs Noga Alon Raphael Yuster Abstract For a graph H, the extremal number ex(n, H) is the maximum number of edges in a graph of order n not containing a subgraph isomorphic
More informationSzemerédi s Lemma for the Analyst
Szemerédi s Lemma for the Analyst László Lovász and Balázs Szegedy Microsoft Research April 25 Microsoft Research Technical Report # MSR-TR-25-9 Abstract Szemerédi s Regularity Lemma is a fundamental tool
More informationDecidability of consistency of function and derivative information for a triangle and a convex quadrilateral
Decidability of consistency of function and derivative information for a triangle and a convex quadrilateral Abbas Edalat Department of Computing Imperial College London Abstract Given a triangle in the
More informationJeong-Hyun Kang Department of Mathematics, University of West Georgia, Carrollton, GA
#A33 INTEGERS 10 (2010), 379-392 DISTANCE GRAPHS FROM P -ADIC NORMS Jeong-Hyun Kang Department of Mathematics, University of West Georgia, Carrollton, GA 30118 jkang@westga.edu Hiren Maharaj Department
More informationA Lower Bound for the Size of Syntactically Multilinear Arithmetic Circuits
A Lower Bound for the Size of Syntactically Multilinear Arithmetic Circuits Ran Raz Amir Shpilka Amir Yehudayoff Abstract We construct an explicit polynomial f(x 1,..., x n ), with coefficients in {0,
More informationRational exponents in extremal graph theory
Rational exponents in extremal graph theory Boris Bukh David Conlon Abstract Given a family of graphs H, the extremal number ex(n, H) is the largest m for which there exists a graph with n vertices and
More informationOn a Balanced Property of Compositions
On a Balanced Property of Compositions Miklós Bóna Department of Mathematics University of Florida Gainesville FL 32611-8105 USA Submitted: October 2, 2006; Accepted: January 24, 2007; Published: March
More informationDistinct distances between points and lines in F 2 q
Distinct distances between points and lines in F 2 q Thang Pham Nguyen Duy Phuong Nguyen Minh Sang Claudiu Valculescu Le Anh Vinh Abstract In this paper we give a result on the number of distinct distances
More informationMath 320-2: Midterm 2 Practice Solutions Northwestern University, Winter 2015
Math 30-: Midterm Practice Solutions Northwestern University, Winter 015 1. Give an example of each of the following. No justification is needed. (a) A metric on R with respect to which R is bounded. (b)
More informationIndividual Solutions
Individual s November 19, 017 1. A dog on a 10 meter long leash is tied to a 10 meter long, infinitely thin section of fence. What is the minimum area over which the dog will be able to roam freely on
More information3. Linear Programming and Polyhedral Combinatorics
Massachusetts Institute of Technology 18.433: Combinatorial Optimization Michel X. Goemans February 28th, 2013 3. Linear Programming and Polyhedral Combinatorics Summary of what was seen in the introductory
More informationWhere is matrix multiplication locally open?
Linear Algebra and its Applications 517 (2017) 167 176 Contents lists available at ScienceDirect Linear Algebra and its Applications www.elsevier.com/locate/laa Where is matrix multiplication locally open?
More informationCOS 598D - Lattices. scribe: Srdjan Krstic
COS 598D - Lattices scribe: Srdjan Krstic Introduction In the first part we will give a brief introduction to lattices and their relevance in some topics in computer science. Then we show some specific
More informationLecture 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
More informationRoth s Theorem on 3-term Arithmetic Progressions
Roth s Theorem on 3-term Arithmetic Progressions Mustazee Rahman 1 Introduction This article is a discussion about the proof of a classical theorem of Roth s regarding the existence of three term arithmetic
More information