Large Triangles in the d-dimensional Unit-Cube (Extended Abstract)
|
|
- Judith Carson
- 5 years ago
- Views:
Transcription
1 Large Triangles in the -Dimensional Unit-Cube Extene Abstract) Hanno Lefmann Fakultät für Informatik, TU Chemnitz, D-0907 Chemnitz, Germany Abstract. We consier a variant of Heilbronn s triangle problem by asking for fixe imension 2 for a istribution of n points in the -imensional unit-cube [0, ] such that the minimum 2-imensional) area of a triangle among these n points is maximal. Denoting this maximum value by Δ off line n) anδ on line n) for the off-line an the online situation, respectively, we will show that c log n) / ) /n 2/ ) Δ off line n) C /n 2/ an c 2/n 2/ ) Δ on line n) C 2/n 2/ for constants c,c 2,C,C 2 > 0 which epen on only. Introuction Given any integer n 3, originally Heilbronn s problem asks for the maximum value Δ 2 n) such that there exists a configuration of n points in the twoimensional unit-square [0, ] 2 where the minimum area of a triangle forme by three of these n points is equal to Δ 2 n). For primes n, thepointsp k = /n k mo n, k 2 mo n), k =0,,...,n, easily show that Δ 2 n) =Ω/n 2 ). Komlós, Pintz an Szemeréi [] improve this to Δ 2 n) =Ωlog n/n 2 )anin [5] the authors provie a eterministic polynomial time algorithm achieving this lower boun, which is currently the best known. From the other sie, improving earlier results of Roth [4 8] an Schmit [9], Komlós, Pintz an Szemeréi [0] prove the upper boun Δ 2 n) =O2 c log n /n 8/7 )forsomeconstantc>0. Recently, for n ranomly chosen points in the unit-square [0, ] 2, the expecte value of the minimum area of a triangle among these n points was etermine to Θ/n 3 ) by Jiang, Li an Vitany [9]. A variant of Heilbronn s problem consiere by Barequet [2] asks, given a fixe integer 2, for the maximum value Δ n) such that there exists a istribution of n points in the -imensional unit-cube [0, ] where the minimum volume of a simplex forme by some +)ofthese n points is equal to Δ n). He showe in [2] the lower boun Δ n) =Ω/n ), which was improve in [2] to Δ n) =Ωlog n/n ). In [3] a eterministic polynomial time algorithm was given achieving the lower boun Δ 3n) =Ωlog n/n 3 ). Recently, Brass [6] showe the upper boun Δ n) =O/n2+)/2) )foro 3, while for even 4onlyΔ n) =O/n) is known. Moreover, an on-line version of this variant was investigate by Barequet [3] for imensions =3an =4,where he showe the lower bouns Ω/n 0/3 )anω/n 27/24 ), respectively.
2 Here we will investigate the following extension of Heilbronn s problem to higher imensions: for fixe integers 2 an any given integer n 3 fin a set of n points in the -imensional unit-cube [0, ] such that the minimum area of a triangle etermine by three of these n points is maximal. We consier the off-line as well as the on-line version of our problem. In the off-line situation the number n of points is given in avance, while in the on-line case the points are positione in [0, ] one after the other an at some time this process stops. Let the corresponing maximum values on the minimum triangle areas be enote by Δ off line n) anδ on line n), respectively. Theorem. Let 2 be a fixe integer. Then, for constants c,c 2,C,C 2 > 0, which epen on only, for every integer n 3 it is c log n)/ ) n 2/ ) c 2 Δ off line n) C n 2/ ) Δon line n2/ ) n) C 2. 2) n2/ The lower bouns ) an 2) iffer only by a factor of Θlog n) / ) ). In contrast to this, the lower bouns in the on-line situation consiere by Barequet [3], i.e. maximizing the minimum volume of simplices among n points in [0, ], iffer by a factor of Θn /3 log n) for imension = 3 an by a factor of Θn 3/24 log n) for imension = 4 from the currently best known lower boun Δ n) =Ωlog n/n ) for any fixe integer 2 in the off-line situation. In the following we will split the statement of Theorem into a few lemmas. 2 The Off-Line Case A line through points P i,p j [0, ] is enote by P i P j.letistp i,p j )be the Eucliean istance between the points P i an P j. The area of a triangle etermine by three points P i,p j,p k [0, ] is enote by area P i,p j,p k ), where area P i,p j,p k ) := ist P i,p j ) h/2 anh is the Eucliean istance from point P k to the line P i P j. First we will prove the lower boun in ) from Theorem, namely Lemma. Let 2 be a fixe integer. Then, for some constant c = c ) > 0, for every integer n 3 it is Δ off line log n)/ ) n) c. 3) n 2/ ) Proof. Let 2 be a fixe integer. For arbitrary integers n 3 an a constant α>0, which will be specifie later, we select uniformly at ranom an inepenently of each other N = n +α points P,P 2,...,P N in the -imensional unit-cube [0, ].Forfixei < j < k we will estimate the probability that area P i,p j,p k ) A for some value A>0 which will be specifie later. The point P i can be anywhere in [0, ]. Given point P i, the probability, that point
3 P j [0, ] has a Eucliean istance from P i within the infinitesimal range [r, r + r], is at most the ifference of the volumes of the -imensional balls with center P i an with raii r + r) anr, respectively. Hence we obtain Prob r ist P i,p j ) r + r) C r r, 4) where throughout this paper C is equal to the volume of the -imensional unitball in R.GiventhepointsP i an P j with ist P i,p j )=r, thethirpoint P k [0, ] satisfies area P i,p j,p k ) A, ifp k is containe in the intersection C i,j [0, ] with C i,j being a -imensional cyliner, centere at the line P i P j with raius 2 A/r an height at most.the-imensional volume vol C i,j [0, ] )isatmostc 2A/r), an we infer for some constant C > 0: Prob area P i,p j,p k ) A) 0 0 vol C i,j [0, ] ) C r r ) 2 A C C r r r = C C 2 3/2 A 0 r = C A. 5) Definition. A hypergraph G =V,E) with vertex set V an ege set E is k-uniform if E = k for all eges E E. A hypergraph G =V,E) is linear if E E for all istinct eges E,E E. AsubsetI V of the vertex set is inepenent if I contains no eges from E. The largest size I of an inepenent set in G is the inepenence number αg). We form a ranom 3-uniform hypergraph G = V,E 3 ) with vertex set V = {, 2,...,N}, where vertex i correspons to the ranom point P i [0, ],an with eges {i, j, k} E 3 if an only if area P i,p j,p k ) A. The expecte number E E 3 ) of eges satisfies by 5) for some constant c > 0: E E 3 ) ) N C A c A N 3. 6) 3 We will use the following result on the inepenence number of linear k-uniform hypergraphs ue to Ajtai, Komlós, Pintz, Spencer an Szemeréi [], see also [7], compare Funia [8] an [4] for eterministic algorithmic versions of Theorem 2: Theorem 2. [, 7] Let k 3 be a fixe integer. Let G =V,E) be a k-uniform hypergraph on V = n vertices with average egree t k = k E / V. IfG is linear, then its inepenence number αg) satisfies for some constant c k > 0: αg) c k n t log t) k. 7)
4 To apply Theorem 2, we estimate in the ranom hypergraph G =V,E 3 )the expecte number EBP D0 G)) of ba pairs of small triangles in G, whichare among the ranom points P,...,P N [0, ] those pairs of triangles sharing an ege an both with area at most A, where all sies are of length at least D 0. Then we will elete one vertex from each pair of points with Eucliean istance at most D 0 an from each ba pair of small triangles, which yiels a linear subhypergraph G of G an G fulfills the assumptions of Theorem 2. Let P D0 G) be a ranom variable counting the number of pairs of istinct points with Eucliean istance at most D 0 among the N ranomly chosen points. For fixe integers i, j, i<jn, wehave Prob ist P i,p j ) D 0 ) C D 0, as point P i can be anywhere in [0, ] an, given point P i, the probability that ist P i,p j ) D 0 is boune from above by the volume of the -imensional ball with raius D 0 an center P i.ford 0 := /N β,whereβ>0 is a constant, the expecte number EP D0 G)) of pairs of istinct points with Eucliean istance at most D 0 among the N points satisfies for some constant c > 0: EP D0 G)) ) N C D0 c N 2 β. 8) 2 For istinct points P i,p j,p k,p l, i<j<k<l N, thereare 4 2) choices for the joint sie of the two triangles, given by the points P i an P j,say.given point P i, by 4) we have Prob r ist P i,p j ) r+r) C r r. Given points P i an P j with ist P i,p j )=r, the probability that the triangle forme by P i,p j,p k,orbyp i,p j,p l, has area at most A, is at most the volume of the cyliner, which is centere at the line P i P j with height an raius 2 A/r. Thus, for 3wehaveforsomeconstantC > 0: Prob P i,p j,p k,p l form a ba pair of small triangles ) ) 4 C ) ) 2 2 A C r r 2 D 0 r = C r A2 2 D 0 r 9) ) = C 2 A2 2 D0 2 C 2)/2 A 2 2 N β 2). For imension = 2 the expression 9) is boune from above by C 2 A 2 log N for a constant C 2 > 0. Thus, for each 2wehave Prob P i,p j,p k,p l form a ba pair of small triangles ) C A2 2 N β 2) log N,
5 an we obtain for the expecte number EBP D0 G)) of such ba pairs of small triangles among the N points for a constant c > 0that ) N EBP D0 G)) C 4 A2 2 N β 2) log N c A2 2 N 4+β 2) log N. 0) Using 6), 8) an 0) an Markov s inequality there exist N = n +α points in the unit-cube [0, ] such that the corresponing 3-uniform hypergraph G = V,E 3 )on V = N vertices satisfies E 3 3 c A N 3 ) P D0 G) 3 c N 2 β 2) BP D0 G) 3 c A 2 2 N 4+β 2) log N. 3) By ) the average egree t 2 =3 E 3 / V of G =V,E 3 )satisfiest 2 t 2 0 := 9 c A N 3 /N =9 c A N 2. For a suitable constant ε>0, we pick with probability p := N ε /t 0 uniformly at ranom an inepenently of each other vertices from V.LetV V be the ranom set of the picke vertices, an let G =V, E3 )withe3 = E 3 [V ] 3 be the resulting ranom inuce subhypergraph of G. Using ), 2), 3) we infer for the expecte numbers of vertices, eges, pairs of points with Eucliean istance at most D 0 an ba pairs of small triangles in G for some constants c,c 2,c 3,c 4 > 0: E V )=p N c N ε /A 2 E E3 ) =p 3 E 3 p 3 3 c A N 3 c 2 N 3ε /A 2 EP D0 G )) = p 2 P D0 G) p 2 3 c N 2 β c 3 N 2ε β /A EBP D0 G )) = p 4 BP D0 G) p 4 3 c A 2 2 N 4+β 2) log N c 4 N 4ε+β 2) log N. By Chernoff s an Markov s inequality there exists an inuce subhypergraph G =V, E3 )ofg such that the following hol: V c o)) N ε /A 2 4) E3 4 c 2 N 3ε /A 2 5) P D0 G ) 4 c 3 N 2ε β /A 6) BP D0 G ) 4 c 4 N 4ε+β 2) log N. 7) Now we fix α := / an β := / an for some suitable constant c > 0weset A := c log n) n 2 Lemma 2. For 0 <ε +2)/3 +)) it is BP D0 G )=o V ).. 8)
6 Proof. Using 4), 7), 8) an N = n +α we have BP D0 G )=o V ) N 4ε+β 2) log N = on ε /A 2 ) N 3ε+β 2) log N A 2 = o) n +α)3ε+β 2)) log n) 2 = o) = +α) 3ε + β 2)) < +2 ε< as α = β =/. 3 +) Lemma 3. For 0 <ε</ +)it is P D0 G )=o V ). Proof. By 4), 6), 8), using N = n +α,weinfer P D0 G )=o V ) N 2ε β /A = on ε /A 2 ) N ε β /A 2 = o) n ε β)+α)+ /log n) /2 = o) = ε β) + α) < ε< as α = β =/. + We fix ε := /3), hence p forn>n 0. In the subhypergraph G =V, E3 ) we elete one vertex form each ba pair of small triangles with all sie-lengths at least D 0 an from each pair of vertices where the corresponing points have Eucliean istance at most D 0. The resulting inuce subhypergraph G = V, E3 )withe 3 =[V ] 3 E3 fulfills by Lemmas 2 an 3 an by 4), 5): V c o)) N ε /A 2 9) E3 E3 4 c 2 N 3ε /A 2 20) an the points corresponing to the vertices of the subhypergraph G o not form any ba pairs of small triangles anymore, i.e. G is a linear hypergraph. By 9) an 20) the hypergraph G has average egree t 2 t 2 := 2 c 2 N 3ε /A 2 c o)) N ε /A 2 = 2 + o)) c 2 c N 2ε. 2)
7 The assumptions of Theorem 2 are fulfille by the 3-uniform subhypergraph G of G an we infer for t 2 with 7), 9) an 2) for its inepenence number αg) αg ) c 3 V t c 3 c 3/2 o)) N ε 2 + o)) c 2 ) /2 N ε A )/2 log t) /2 c 3 V log t ) /2 t ) ) /2 /2 2 + o)) c2 log N ε c log n) /2 /A )/2 as N = n +α c /c ) n 2 log n) log /2 n)/2 n for some sufficiently small constant c > 0. Thus the hypergraph G contains an inepenent set I V with I = n. Thesen vertices represent n points in [0, ], where every triangle among these n points has area at least A, i.e. Δ n) off line = Ωlog n) / ) /n 2/ ) ). c 3 The On-Line Case In this section we consier the on-line situation an we will show the lower boun in 2) from Theorem : Lemma 4. Let 2 be a fixe integer. Then, for some constant c 2 = c 2 ) > 0, for every integer n 3 it is Δ on line c 2 n) n. 2/ ) Proof. Successively we will construct an arbitrary long sequence P,P 2,... of points in the unit-cube [0, ] such that for suitable constants a, b, α, β > 0, which will be fixe later, for every n the set S n = {P,P 2,...,P n } satisfies i) ist P i,p j ) >a/n α for all i<j n, an ii) area P i,p j,p k ) >b/n β for all i<j<k n. Assume that a set S n = {P,P 2,...,P n } [0, ] of n ) points with i ) ist P i,p j ) >a/n ) α for all i<j n, an ii ) area P i,p j,p k ) > b/n ) β for all i<j<k n is alreay constructe. To have some space in [0, ] available for choosing a new point P n [0, ] such that i) is fulfille, this new point P n is not allowe to lie within any of the -imensional balls B r P i )ofraiusr = a/n α with center P i, i =, 2,...,n. Aing the volumes of these balls yiels n vol B r P i )) <n C r = a C n α. i= For α := / an a C < /2 wehave n i= vol B rp i )) < /2.
8 We will show next that the regions, where conition ii) is violate, also have volume less than /2. The regions, where ii) is violate by points P n [0, ], are given by C i,j [0, ], i<j n, where C i,j is a -imensional cyliner centere at the line P i P j. These sets C i,j [0, ] are containe in cyliners of height an raius 2 b/n β ist P i,p j )). We sum up their volumes: vol C i,j [0, ] ) i<jn i<jn 2 b C n β ist P i,p j ) = 2 b) n C 2 n β ) n i= j=;j i ) ). 22) ist P i,p j ) We fix some point P i, i =, 2,...,n. To give an upper boun on the last sum, we will use a packing argument, compare [2]. Consier the balls B rt P i ) with center P i an raius r t := a t/n α, t =0,,... with t n α /a. Clearly vol B r0 P i )) = 0, an for some constant C > 0fort =, 2,... we have vol B rt P i ) \ B rt P i )) C t. 23) nα Notice that for every ball B r P j ) with raius r = Θn α ) an center P j B rt P i ) \ B rt P i )withi j we have vol B r P j ) B rt P i ) \ B rt P i )) = Θn α ). By inequalities i ) we have n = an by 23) each shell B rt P i ) \ B rt P i ), t =2, 3,..., contains at most n t C t points from the set S n for some constant C > 0. Using the inequality + x ex, x R, weobtain n j=;j i n α /a t=2 ist P i,p j ) C t ) n α /a t=2 a t )/n α n t ) n α /a a t )/n α t=2 ) C e t a n α ) C n α 24) for some constant C > 0. We set β := 2/ ) an, using α =/ an 24), inequality 22) becomes for a sufficiently small constant b>0: vol C i,j [0, ] ) i<jn 2 b) n C n β ) n i= j=;j i 2 b) n C C n β ) nα i= ist P i,p j ) 2 b) C C n+α β ) < /2. )
9 The forbien regions have volume less than, hence there exists a point P n [0, ] such that i) an ii) are satisfie, thus Δ on line n) =Ω/n 2/ ) ). 4 An Upper Boun Here we will show the upper boun O/n 2/ ) from Theorem on the smallest area of a triangle among any n points in the -imensional unit-cube [0, ]. Lemma 5. Let 2 be a fixe integer. Then, for some constant C > 0, for every integer n 3 it is Δ on line n) Δ off line n) C n. 2/ Proof. Given any n points P,P 2,...,P n [0, ],forsomevalued 0 > 0we form a graph G D0 = V,E) with vertex set V = {, 2,...,n}, where vertex i correspons to point P i [0, ],aneges{i, j} E if an only if ist P i,p j ) D 0. An inepenent set I V in this graph G D0 yiels a subset I {P,P 2,...,P n } of points with Eucliean istance between any two istinct points bigger than D 0. Each ball B r P j ) with center P j [0, ] an raius r satisfies vol B r P j ) [0, ] ) vol B r P j ))/2. The balls with raius D 0 /2an centers from the set I have pairwise empty intersection, thus αg D0 ) 2 C D 0 /2) vol [0, ] )=. 25) By Turán s theorem [20], for any graph G =V,E) we have the lower boun αg) n/2 t) on the inepenence number αg), where t := 2 E / V is the average egree of G. This with 25) implies 4 C D 0 αg D0 ) n 2 t = t C 2 4 n D 0. Let D 0 := c/n / where c>0 is a constant with c > 2 4 /C.Thent>an there exist two eges {i, j}, {i, k} E incient at vertex i V. Then the two points P j an P k have Eucliean istance at most D 0 from point P i, an hence area P i,p j,p k ) D 2 0 /2=/2 c2 /n 2/, i.e. Δ off line n) =O/n 2/ ). 5 Conclusion Certainly it is of interest to improve the bouns given in this paper. Also, for the off-line case it is esirable to get a eterministic polynomial time algorithm achieving the boun Δ n) off line = Ωlog n) / ) /n 2/ ) ). In view of the results in [9] it is also of interest to etermine the expecte value of the minimum triangle area with respect to the uniform istribution of n points in [0, ].
10 References. M. Ajtai, J. Komlós, J. Pintz, J. SpenceranE. Szemeréi, Extremal Uncrowe Hypergraphs, Journal of Combinatorial Theory Ser. A, 32, 982, G. Barequet, A Lower Boun for Heilbronn s Triangle Problem in Dimensions, SIAM Journal on Discrete Mathematics 4, 200, G. Barequet, The On-Line Heilbronn s Triangle Problem in Three an Four Dimensions, Proceeings 8r Annual International Computing an Combinatorics Conference COCOON 02, LNCS 2387, Springer, 2002, C. Bertram Kretzberg an H. Lefmann, The Algorithmic Aspects of Uncrowe Hypergraphs, SIAM Journal on Computing 29, 999, C. Bertram-Kretzberg, T. Hofmeister an H. Lefmann, An Algorithm for Heilbronn s Problem, SIAM Journal on Computing 30, 2000, P. Brass, An Upper Boun for the -Dimensional Heilbronn Triangle Problem, preprint, R. A. Duke, H. Lefmann an V. Röl, On Uncrowe Hypergraphs, Ranom Structures & Algorithms 6, 995, A. Funia, Deranomizing Chebychev s Inequality to fin Inepenent Sets in Uncrowe Hypergraphs, Ranom Structures & Algorithms, 8, 996, T. Jiang, M. Li an P. Vitany, The Average Case Area of Heilbronn-type Triangles, Ranom Structures & Algorithms 20, 2002, J. Komlós, J. Pintz an E. Szemeréi, On Heilbronn s Triangle Problem, Journal of the Lonon Mathematical Society, 24, 98, J. Komlós, J. Pintz an E. Szemeréi, A Lower Boun for Heilbronn s Problem, Journal of the Lonon Mathematical Society, 25, 982, H. Lefmann, On Heilbronn s Problem in Higher Dimension, Combinatorica 23, 2003, H. Lefmann an N. Schmitt, A Deterministic Polynomial Time Algorithm for Heilbronn s Problem in Three Dimensions, SIAM Journal on Computing 3, 2002, K. F. Roth, On a Problem of Heilbronn, Journal of the Lonon Mathematical Society 26, 95, K. F. Roth, On a Problem of Heilbronn, II, Proc. of the Lonon Mathematical Society 3), 25, 972, K. F. Roth, On a Problem of Heilbronn, III, Proc. of the Lonon Mathematical Society 3), 25, 972, K. F. Roth, Estimation of the Area of the Smallest Triangle Obtaine by Selecting Three out of n Points in a Disc of Unit Area, Proc. of Symposia in Pure Mathematics, 24, 973, AMS, Provience, K. F. Roth, Developments in Heilbronn s Triangle Problem, Avances in Mathematics, 22, 976, W. M. Schmit, On a Problem of Heilbronn, Journal of the Lonon Mathematical Society 2), 4, 972, P. Turán, On an Extremal Problem in Graph Theory, Mat. Fiz. Lapok 48, 94,
European Journal of Combinatorics
European Journal of Combinatorics 30 (2009) 1686 1695 Contents lists available at ScienceDirect European Journal of Combinatorics ournal homepage: www.elsevier.com/locate/ec Generalizations of Heilbronn
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 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 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 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 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 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 informationIterated Point-Line Configurations Grow Doubly-Exponentially
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
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 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 informationarxiv: v1 [math.mg] 10 Apr 2018
ON THE VOLUME BOUND IN THE DVORETZKY ROGERS LEMMA FERENC FODOR, MÁRTON NASZÓDI, AND TAMÁS ZARNÓCZ arxiv:1804.03444v1 [math.mg] 10 Apr 2018 Abstract. The classical Dvoretzky Rogers lemma provies a eterministic
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 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 informationUC Berkeley Department of Electrical Engineering and Computer Science Department of Statistics
UC Berkeley Department of Electrical Engineering an Computer Science Department of Statistics EECS 8B / STAT 4B Avance Topics in Statistical Learning Theory Solutions 3 Spring 9 Solution 3. For parti,
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 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 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 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 informationLeast-Squares Regression on Sparse Spaces
Least-Squares Regression on Sparse Spaces Yuri Grinberg, Mahi Milani Far, Joelle Pineau School of Computer Science McGill University Montreal, Canaa {ygrinb,mmilan1,jpineau}@cs.mcgill.ca 1 Introuction
More informationProbabilistic Analysis of Power Assignments
Probabilistic Analysis of Power Assignments Maurits e Graaf 1,2 an Boo Manthey 1 1 University of Twente, Department of Applie Mathematics, Enschee, Netherlans m.egraaf/b.manthey@utwente.nl 2 Thales Neerlan
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 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 information1. Aufgabenblatt zur Vorlesung Probability Theory
24.10.17 1. Aufgabenblatt zur Vorlesung By (Ω, A, P ) we always enote the unerlying probability space, unless state otherwise. 1. Let r > 0, an efine f(x) = 1 [0, [ (x) exp( r x), x R. a) Show that p f
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 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 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 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 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 informationLECTURE NOTES ON DVORETZKY S THEOREM
LECTURE NOTES ON DVORETZKY S THEOREM STEVEN HEILMAN Abstract. We present the first half of the paper [S]. In particular, the results below, unless otherwise state, shoul be attribute to G. Schechtman.
More informationSpring 2016 Network Science
Spring 206 Network Science Sample Problems for Quiz I Problem [The Application of An one-imensional Poisson Process] Suppose that the number of typographical errors in a new text is Poisson istribute with
More information12.11 Laplace s Equation in Cylindrical and
SEC. 2. Laplace s Equation in Cylinrical an Spherical Coorinates. Potential 593 2. Laplace s Equation in Cylinrical an Spherical Coorinates. Potential One of the most important PDEs in physics an engineering
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 informationTOEPLITZ AND POSITIVE SEMIDEFINITE COMPLETION PROBLEM FOR CYCLE GRAPH
English NUMERICAL MATHEMATICS Vol14, No1 Series A Journal of Chinese Universities Feb 2005 TOEPLITZ AND POSITIVE SEMIDEFINITE COMPLETION PROBLEM FOR CYCLE GRAPH He Ming( Λ) Michael K Ng(Ξ ) Abstract We
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 informationREAL 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 informationLeast Distortion of Fixed-Rate Vector Quantizers. High-Resolution Analysis of. Best Inertial Profile. Zador's Formula Z-1 Z-2
High-Resolution Analysis of Least Distortion of Fixe-Rate Vector Quantizers Begin with Bennett's Integral D 1 M 2/k Fin best inertial profile Zaor's Formula m(x) λ 2/k (x) f X(x) x Fin best point ensity
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 informationResistant Polynomials and Stronger Lower Bounds for Depth-Three Arithmetical Formulas
Resistant Polynomials an Stronger Lower Bouns for Depth-Three Arithmetical Formulas Maurice J. Jansen University at Buffalo Kenneth W.Regan University at Buffalo Abstract We erive quaratic lower bouns
More informationResistant Polynomials and Stronger Lower Bounds for Depth-Three Arithmetical Formulas
Resistant Polynomials an Stronger Lower Bouns for Depth-Three Arithmetical Formulas Maurice J. Jansen an Kenneth W.Regan University at Buffalo (SUNY) Abstract. We erive quaratic lower bouns on the -complexity
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 informationA New Vulnerable Class of Exponents in RSA
A ew Vulnerable Class of Exponents in RSA Aberrahmane itaj Laboratoire e Mathématiues icolas Oresme Campus II, Boulevar u Maréchal Juin BP 586, 4032 Caen Ceex, France. nitaj@math.unicaen.fr http://www.math.unicaen.fr/~nitaj
More informationA LIMIT THEOREM FOR RANDOM FIELDS WITH A SINGULARITY IN THE SPECTRUM
Teor Imov r. ta Matem. Statist. Theor. Probability an Math. Statist. Vip. 81, 1 No. 81, 1, Pages 147 158 S 94-911)816- Article electronically publishe on January, 11 UDC 519.1 A LIMIT THEOREM FOR RANDOM
More informationLower Bounds for k-distance Approximation
Lower Bouns for k-distance Approximation Quentin Mérigot March 21, 2013 Abstract Consier a set P of N ranom points on the unit sphere of imension 1, an the symmetrize set S = P ( P). The halving polyheron
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 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 informationLeaving Randomness to Nature: d-dimensional Product Codes through the lens of Generalized-LDPC codes
Leaving Ranomness to Nature: -Dimensional Prouct Coes through the lens of Generalize-LDPC coes Tavor Baharav, Kannan Ramchanran Dept. of Electrical Engineering an Computer Sciences, U.C. Berkeley {tavorb,
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 informationLecture 12: November 6, 2013
Information an Coing Theory Autumn 204 Lecturer: Mahur Tulsiani Lecture 2: November 6, 203 Scribe: Davi Kim Recall: We were looking at coes of the form C : F k q F n q, where q is prime, k is the message
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 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 informationLower Bounds for Local Monotonicity Reconstruction from Transitive-Closure Spanners
Lower Bouns for Local Monotonicity Reconstruction from Transitive-Closure Spanners Arnab Bhattacharyya Elena Grigorescu Mahav Jha Kyomin Jung Sofya Raskhonikova Davi P. Wooruff Abstract Given a irecte
More informationEwan Davies, Matthew Jenssen, Will Perkins, Barnaby Roberts On the average size of independent sets in triangle-free graphs
Ewan Davies, Matthew Jenssen, Will Perkins, Barnaby Roberts On the average size of inepenent sets in triangle-free graphs Article (Accepte version) (Referee) Original citation: Davies, Ewan an Jenssen,
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 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 informationA note on asymptotic formulae for one-dimensional network flow problems Carlos F. Daganzo and Karen R. Smilowitz
A note on asymptotic formulae for one-imensional network flow problems Carlos F. Daganzo an Karen R. Smilowitz (to appear in Annals of Operations Research) Abstract This note evelops asymptotic formulae
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 informationThe number of K s,t -free graphs
The number of K s,t -free graphs József Balogh an Wojciech Samotij August 17, 2010 Abstract Denote by f n (H the number of (labele H-free graphs on a fixe vertex set of size n. Erős conjecture that whenever
More informationApproximate Constraint Satisfaction Requires Large LP Relaxations
Approximate Constraint Satisfaction Requires Large LP Relaxations oah Fleming April 19, 2018 Linear programming is a very powerful tool for attacking optimization problems. Techniques such as the ellipsoi
More informationMoments Tensors, Hilbert s Identity, and k-wise Uncorrelated Random Variables
Moments Tensors, Hilbert s Ientity, an k-wise Uncorrelate Ranom Variables Bo JIANG Simai HE Zhening LI Shuzhong ZHANG First version January 011; final version September 013 Abstract In this paper we introuce
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 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 informationTraveling in randomly embedded random graphs.
Traveling in ranomly embee ranom graphs. Alan Frieze, Wesley Pegen Department of Mathematical Sciences, Carnegie Mellon University, Pittsburgh PA 15213, U.S.A. February 13, 2018 Abstract We consier the
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 informationLogarithmic spurious regressions
Logarithmic spurious regressions Robert M. e Jong Michigan State University February 5, 22 Abstract Spurious regressions, i.e. regressions in which an integrate process is regresse on another integrate
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 informationarxiv: v1 [math.co] 29 May 2009
arxiv:0905.4913v1 [math.co] 29 May 2009 simple Havel-Hakimi type algorithm to realize graphical egree sequences of irecte graphs Péter L. Erős an István Miklós. Rényi Institute of Mathematics, Hungarian
More informationOn the Maximum Number of Hamiltonian Paths in Tournaments
On the Maximum Number of Hamiltonian Paths in Tournaments Ilan Adler Noga Alon Sheldon M. Ross August 2000 Abstract By using the probabilistic method, we show that the maximum number of directed Hamiltonian
More informationCOUNTING VALUE SETS: ALGORITHM AND COMPLEXITY
COUNTING VALUE SETS: ALGORITHM AND COMPLEXITY QI CHENG, JOSHUA E. HILL, AND DAQING WAN Abstract. Let p be a prime. Given a polynomial in F p m[x] of egree over the finite fiel F p m, one can view it as
More informationON CONVERGENCE FOR GRAPHEXES
ON CONVERGENCE FOR GRAPHEXES SVANTE JANSON Abstract. We stuy four ifferent notions of convergence for graphexes, recently introuce by Borgs, Chayes, Cohn an Holen, an by Veitch an Roy. We give some properties
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 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 informationON HEILBRONN S PROBLEM IN HIGHER DIMENSION
COMBINATORICA Bolyai Society Spriger-Verlag Combiatorica 23 (4 (2003 669 680 ON HEILBRONN S PROBLEM IN HIGHER DIMENSION HANNO LEFMANN Received April 26, 2000 Heilbro cojectured that give arbitrary poits
More informationSublinear Time Width-Bounded Separators and Their Application to the Protein Side-Chain Packing Problem
Sublinear Time With-Boune Separators an Their Application to the rotein Sie-Chain acking roblem Bin Fu 1,2 an Zhixiang Chen 3 1 Dept. of Computer Science, University of New Orleans, LA 70148, USA. 2 Research
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 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 informationMonotonicity for excited random walk in high dimensions
Monotonicity for excite ranom walk in high imensions Remco van er Hofsta Mark Holmes March, 2009 Abstract We prove that the rift θ, β) for excite ranom walk in imension is monotone in the excitement parameter
More informationThe Complexity of Recognizing Tough Cubic Graphs
The Complexity of Recognizing Tough Cubic Graphs D. auer 1 J. van en Heuvel 2 A. Morgana 3 E. Schmeichel 4 1 Department of Mathematical Sciences, Stevens Institute of Technology Hoboken, NJ 07030, U.S.A.
More informationProf. Dr. Ibraheem Nasser electric_charhe 9/22/2017 ELECTRIC CHARGE
ELECTRIC CHARGE Introuction: Orinary matter consists of atoms. Each atom consists of a nucleus, consisting of protons an neutrons, surroune by a number of electrons. In electricity, the electric charge
More informationarxiv: v1 [math.co] 3 Jul 2018
On the number of coloure triangulations of -manifols Guillaume Chapuy CNRS, RF UMR 843, Université Paris-Dierot, France. Guillem Perarnau School of Mathematics, University of Birmingham, Unite Kingom.
More informationMatchings in hypergraphs of large minimum degree
Matchings in hypergraphs of large minimum degree Daniela Kühn Deryk Osthus Abstract It is well known that every bipartite graph with vertex classes of size n whose minimum degree is at least n/2 contains
More informationSelf-normalized Martingale Tail Inequality
Online-to-Confience-Set Conversions an Application to Sparse Stochastic Banits A Self-normalize Martingale Tail Inequality The self-normalize martingale tail inequality that we present here is the scalar-value
More informationModeling of Dependence Structures in Risk Management and Solvency
Moeling of Depenence Structures in Risk Management an Solvency University of California, Santa Barbara 0. August 007 Doreen Straßburger Structure. Risk Measurement uner Solvency II. Copulas 3. Depenent
More informationIntroduction to the Vlasov-Poisson system
Introuction to the Vlasov-Poisson system Simone Calogero 1 The Vlasov equation Consier a particle with mass m > 0. Let x(t) R 3 enote the position of the particle at time t R an v(t) = ẋ(t) = x(t)/t its
More informationAsymptotic determination of edge-bandwidth of multidimensional grids and Hamming graphs
Asymptotic etermination of ege-banwith of multiimensional gris an Hamming graphs Reza Akhtar Tao Jiang Zevi Miller. Revise on May 7, 007 Abstract The ege-banwith B (G) of a graph G is the banwith of the
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 informationModelling and simulation of dependence structures in nonlife insurance with Bernstein copulas
Moelling an simulation of epenence structures in nonlife insurance with Bernstein copulas Prof. Dr. Dietmar Pfeifer Dept. of Mathematics, University of Olenburg an AON Benfiel, Hamburg Dr. Doreen Straßburger
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 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 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 informationLARGE TYPICAL CELLS IN POISSON DELAUNAY MOSAICS
LARGE TYPICAL CELLS IN POISSON DELAUNAY MOSAICS DANIEL HUG an ROLF SCHNEIDER Deicate to Tuor Zamfirescu on the occasion of his sixtieth birthay It is prove that the shape of the typical cell of a Poisson
More informationAn Optimal Algorithm for Bandit and Zero-Order Convex Optimization with Two-Point Feedback
Journal of Machine Learning Research 8 07) - Submitte /6; Publishe 5/7 An Optimal Algorithm for Banit an Zero-Orer Convex Optimization with wo-point Feeback Oha Shamir Department of Computer Science an
More information1 Introduction and Results
Discussiones Mathematicae Graph Theory 20 (2000 ) 7 79 SOME NEWS ABOUT THE INDEPENDENCE NUMBER OF A GRAPH Jochen Harant Department of Mathematics, Technical University of Ilmenau D-98684 Ilmenau, Germany
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 informationThe Case of Equality in the Dobrushin Deutsch Zenger Bound
The Case of Equality in the Dobrushin Deutsch Zenger Boun Stephen J Kirklan Department of Mathematics an Statistics University of Regina Regina, Saskatchewan CANADA S4S 0A2 Michael Neumann Department of
More informationEXPLICIT BOUNDS ON MONOMIAL AND BINOMIAL EXPONENTIAL SUMS
EXPLICIT BOUNDS ON MONOMIAL AND BINOMIAL EXPONENTIAL SUMS TODD COCHRANE AND CHRISTOPHER PINNER Abstract. Let p be a prime an e p = e 2πi /p. First, we make explicit the monomial sum bouns of Heath-Brown
More informationCombinatorica 9(1)(1989) A New Lower Bound for Snake-in-the-Box Codes. Jerzy Wojciechowski. AMS subject classification 1980: 05 C 35, 94 B 25
Combinatorica 9(1)(1989)91 99 A New Lower Boun for Snake-in-the-Box Coes Jerzy Wojciechowski Department of Pure Mathematics an Mathematical Statistics, University of Cambrige, 16 Mill Lane, Cambrige, CB2
More informationProbabilistic Combinatorics. Jeong Han Kim
Probabilistic Combinatorics Jeong Han Kim 1 Tentative Plans 1. Basics for Probability theory Coin Tossing, Expectation, Linearity of Expectation, Probability vs. Expectation, Bool s Inequality 2. First
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 information