On stars and Steiner stars
|
|
- Dustin Watkins
- 6 years ago
- Views:
Transcription
1 On stars and Steiner stars Adrian Dumitrescu Csaba D. Tóth Guangwu Xu March 9, 9 Abstract A Steiner star for a set P of n points in R d connects an arbitrary point in R d to all points of P, while a star connects one of the points in P to the remaining n points of P. All connections are realized by straight line segments. Let the length of a graph be the total Euclidean length of its edges. Fekete and Meijer showed that the minimum star is at most times longer than the minimum Steiner star for any finite point configuration in R d. The supremum of the ratio between the two lengths, over all finite point configurations in R d, is called the star Steiner ratio in R d. It is conjectured that this ratio is / = in the plane and /3 = in three dimensions. Here we give upper bounds of.363 in the plane, and.3833 in 3-space. These estimates yield improved upper bounds on the maximum ratios between the minimum star and the maximum matching in two and three dimensions. We also verify that the conjectured bound / in the plane holds in two special cases. Our method exploits the connection with the classical problem of estimating the maximum sum of pairwise distances among n points on the unit sphere, first studied by László Fejes Tóth. It is quite general and yields the first non-trivial estimates below on the star Steiner ratios in arbitrary dimensions. We show, however, that the star Steiner ratio in R d tends to as d goes to infinity. As it turns out, our estimates are related to the classical infinite Wallis product: = n= Introduction ( n n = Let P be a set of n points in R d. A Steiner star for P connects an arbitrary point in R d to all points of P, while a star connects one of the points in P to the remaining n points of P. All connections are realized by straight line segments. The study of minimum Steiner stars and minimum stars is motivated by applications in facility location and computational statistics [7, 8, 9, ]. The Weber point (or Weber center, also known as the Fermat-Torricelli point or Euclidean median, is the point of the space that minimizes the sum of distances to n given points in R d. It is known that even in the plane, the Weber point cannot be computed exactly, already for n 5 [5, ]. For n = 3 and, resp., Torricelli and Fagnano gave algebraic solutions. The Weber point can however be approximated with arbitrary precision [8, 9], based on Weiszfeld s algorithm [9]. The problem of finding such a point can be asked in any metric space. The Fermat-Torricelli problem has been also studied in Minkowski spaces [8]. More information on the problem can be found in []. Preliminary versions of this article appeared in the Proceedings of the 9th and th ACM-SIAM Symposia on Discrete Algorithms [, 3]. Department of Computer Science, University of Wisconsin-Milwaukee, WI 53-78, USA. ad@cs.uwm.edu Supported in part by NSF CAREER grant CCF-88. Department of Mathematics, University of Calgary, AB, Canada TN N. cdtoth@ucalgary.ca Supported in part by NSERC grant RGPIN Cs. D. Tóth s research was conducted at the Massachusetts Institute of Technology. Department of Computer Science, University of Wisconsin-Milwaukee, WI 53-78, USA, gxuuwm@uwm.edu Supported in part by National 973 Project of China (No. 7CB8793.
2 Ratio Lower bound Old upper bound New upper bound ρ : L(S min /L(SS min = = ρ 3 : L(S min /L(SS min 3 = = ρ : L(S min /L(SS min 5 = = ρ 5 : L(S min /L(SS min 35 = = ρ : L(S min /L(SS min... = η : L(S min /L(M max 3 = η 3 : L(S min /L(M max = Table : Lower and upper bounds on star Steiner ratios ρ,ρ 3,ρ,ρ 5,ρ, and matching ratios η,η 3 for some small values of d. Those marked with are new. We now introduce some definitions and notations, following [6]. Consider a finite point set P in R d. Let S min denote a minimum star, SS min denote a minimum Steiner star, and M max denote a maximum matching (for an even number of points. Let ρ d (P denote the maximum ratio between the lengths of the minimum star and the minimum Steiner star for P. Let ρ d (n be the supremum of ρ d (P over all point sets of size n in R d. Finally, let ρ d be the supremum of ρ d (n over all positive integers n. Obviously ρ d (n ρ d, for each n. Fekete and Meijer [6] were the first to study the star Steiner ratio. They proved that ρ d holds for any dimension d. It is conjectured that ρ = / =.73..., and ρ 3 = /3 = , which are the limit ratios for a uniform mass distribution on a circle, and a sphere, respectively (in these cases the Weber point is the center of the circle, or sphere [6]. For a given finite even-size point set P in R d, let η d (P denote the maximum ratio between the lengths of the minimum star and that of a maximum matching of P. Let η d (n be the supremum of η d (P over all point sets of size n in R d (n even. Finally, let η d be the supremum of η d (n over all positive even integers n. Obviously η d (n η d, for each even n. By using their bounds on ρ d, Fekete and Meijer also established nontrivial bounds on η d in two and three dimensions (d =,3. In this paper we make further progress and obtain better bounds on the ratios ρ d and η d, by exploiting the connection with the classical problem of estimating the maximum sum of pairwise distances among n points on the unit sphere, first studied by László Fejes Tóth [5]. We first prove that ρ.363, and ρ We also show that the conjectured bound / in the plane holds in two special cases, corresponding to the lower bound construction. Based on the above estimates on ρ and ρ 3, we then further obtain improved estimates on η and η 3, using the method developed by Fekete and Meijer [6]. Our improvements are summarized in Table. Finally, our method yields the first non-trivial estimates below on the star Steiner ratios in arbitrary dimensions. Among others, we show that the upper bound on the star Steiner ratio given by Fekete and Meijer is in fact a very good approximation for higher dimensions d. Thus in this sense the problem in the plane is the most interesting one, and the gap between the upper and the lower bound on the star Steiner ratio is the largest. Among n points, q,q,...,q n, on the unit sphere S d in R d, the sum of pairwise Euclidean distances is i<j q iq j. Let G(d,n denote the maximum of i<j q iq j over all n-element point sets {q,q,...,q n } S d. As in [, 3, ], define the constant of uniform density for the sphere in R d, c d, as the average distance from a point of S d to all other points of S d. That is, c d = S pq dq d, for d S dq d for any point p S d. For example, c =, c = /, and c 3 = /3 (more details in Section 3. The
3 sequence c d, d, is increasing and our Theorem shows that lim d c d =. The connection with this problem will be evident in the next section. Björck and others [6] have shown that G(d,n c d G(d, n n and lim n n = c d. ( László Fejes Tóth [5] gave a nice closed formula for G(,n for every n : G(,n = n tan n = n 6 + O ( n. ( The exact determination of G(d, n for d 3 is considered to be a difficult geometric discrepancy problem [3, pp. 98]. For d = 3, Alexander [, ] has shown that Stars in R d 3 n n / < G(3,n < 3 n. (3 A geometric graph G in R d is a pair (V,E where V is a finite set of points in R d, and E is a set of segments (edges connecting points in V. The length of G, denoted L(G, is the sum of the Euclidean lengths of all edges in G. Let P = {p,...,p n } be a set of n points in R d. Let SS min be a minimal Steiner star for P, and assume that its center c is not an element of P. As noted in [6], the minimality of the Steiner star implies that the sum of the unit vectors rooted at c and oriented to the points vanishes, that is, n =. cp i For completeness, we include here the brief argument. Fix an arbitrary orthogonal coordinate system in R d. Assume that p i = (p i,p i,...,p id, for i =,,...,n. The length of the star S x centered at an arbitrary point x = (x,x,...,x d is n n L(S x = xp i = d (x j p ij. If c = (c,c,...,c d is the Weber point, then all partial derivatives of L(S x vanish at x = c: L(S x x j = x=c n j= cp i c j p ij d j= (c j p ij =, for j =,,...,d. ( Our setup is as follows. Refer to Figure for an example in the plane. We may assume that the Weber point is not in P, since otherwise the star Steiner ratio is. Choose the coordinate system such that the Weber point is the origin o and the closest point in P to o is p = (,,...,, hence L(SS min = ( + δn, for some δ. For i =,,...,n, let q i be the intersection point of line segment op i and the unit sphere S d in R d. Then oq i = op i op i, that is, oq i is the unit vector corresponding to op i. Let a i = op i, b i = p q i, and a i = p p i, for i =,,...,n. We have L(SS min = n a i. Finally, let α ij [,] be the angle between the positive x j -axis and line segment op i. Henceforth ( can be rewritten in the more convenient form n cos α ij =, for j =,,...,d. (5 3
4 p i p j a i q j q i a i p i b i q i α i o p o p Figure : Left: estimating the length of a star centered at p = (, P. Right: estimating pairwise distances. Let S i be the star centered at p i, for i =,,...,n. By definition, we have L(S min = min L(S i. i n Using the local optimality condition (5, Fekete and Meijer [6] show that if one moves the center of SS min from the Weber point to a closest point of P, the sum of distances increases by a factor of at most, and this bound is best possible. It follows (see [6] for details that for any d, ρ d (n, thus ρ d. (6 From the opposite direction, by considering a uniform mass distribution on the unit sphere in R d, one has for any d : c d ρ d. (7 Our new argument in a nutshell is as follows. If δ is large, we consider the star centered at a point in P closest to the Weber point, as a good candidate for approximating the minimum star. If δ is small, we upper bound the length of the minimum star by the average of all n stars. In the end we balance the two estimates obtained. Applying the averaging argument (for small δ leads naturally to the problem of maximizing the sum of pairwise distances among n points on the unit sphere (or unit circle. Theorem Let d, and let c d denote the constant of uniform density for the sphere in R d. The star Steiner ratio in R d is bounded as follows: c d ρ d c d + c d. (8 Proof. Consider an n-element point set P in R d, and the setup above. It is enough to show that L(S min L(SS min cd +. c d
5 By the triangle inequality (see also Fig. (left, we have a i b i + a i, for i =,...,n. Hence n n n L(S = a i (b i + a i = b i + δn. (9 By Lemma in [6], the local optimality condition (5 implies n b i n. It follows that L(S ( + δn. Hence the star Steiner ratio is at most L(S L(SS min + δ + δ. ( Clearly, the sum of the lengths of the n stars (centered at each of the n points equals twice the sum of pairwise distances among the points. n By the triangle inequality (see also Fig. (right L(S i = i<j p i p j. p i p j p i q i + q i q j + q j p j = (a i + q i q j + (a j. By summing over all pairs i < j, and using the upper bound on G(d,n in (, we obtain n L(S i i<j n q i q j + (n i = (a q i q j + δ(n n (c d + δn. i<j The minimum of the n stars, S min, clearly satisfies: L(S min n L(S i, hence L(S min (c d + δn. ( n It follows that the star Steiner ratio is at most L(S min L(SS min c d + δ + δ. ( Inequalities ( and ( imply ( L(S min + δ L(SS min max min δ + δ, c d + δ. + δ Observe that +δ +δ is a monotonically decreasing function of δ, and c d+δ +δ is a monotonically increasing function of δ, for every < c d <. Their minimum is maximized for a value of δ satisfying +δ +δ = c d+δ +δ. The solution δ = c d balances the two upper estimates in ( and (, and it yields ρ d ρ d (n c d +. c d (3 This completes the proof of Theorem. By substituting the values of c d for d = and d = 3, one obtains: and ρ + <.363, 3 ρ 3 7 (6 3 <
6 . Minimum star to maximum matching ratios in two and three dimensions First consider d =. Fekete and Meijer [6] showed that L(SS min 3 L(M max. By our Theorem, L(S min + L(SS min. Combining the two upper bounds yields the following new upper bound on η. Corollary The maximum ratio η between the minimum star and the maximum matching in the plane is less than That is, for any finite planar point set L(S min L(M max The best known lower bound for this ratio, /3, is given in [6]. It is obtained by placing n/3 points on each vertex of an equilateral triangle (for n divisible by 3. Note that this ratio can be approached arbitrarily close using distinct points. Let now d = 3. Fekete and Meijer [6] showed that L(SS min L(M max. By our Theorem, L(S min 7 (6 3 L(SS min. Combining the two yields the following new upper bound on η 3. Corollary The maximum ratio η 3 between the minimum star and the maximum matching in R 3 is less than.956. That is, for any finite point set in R 3 L(S min L(M max 7 (6 3 = 7 (8 3 <.956. The best known lower bound for this ratio, 3/, is given in [6]. It is obtained by placing n/ points on each vertex of a regular tetrahedron (for n divisible by. Again, this ratio can be approached arbitrarily close using distinct points. 3 Asymptotic results and approximations Theorem Let c d be the constant of uniform density for the sphere in R d, for d. Then lim c d = lim ρ d =. d d The following closed formula approximations hold for d 3: e (d 3 ρ d e 5(d + e 5(d Proof. In order to establish the limits, we start by computing the constant of uniform density c d. Recall that c d equals the average distance from a point on the unit sphere in R d to all the other points on the same sphere. It is easy to verify that c d is given by the following integral formula: c d = / sin d (α sin α dα /, for. ( sin d (α dα 6.
7 Some initial values are c =, c = =.73..., c 3 = 3 = , c = 6 5 = , c 5 = 8 35 = In order to establish a recurrence on c d, define Some initial values are a ij = / sin i α cos j α dα, i,j. Expanding sin α yields then a =, a = a =, a =, a = a =. c d = a d,d a d,d. Recall that integration by parts leads to the well-known recurrence relations for a ij, for i,j : a ij = / sin i α cos j α dα = sini α cos j+ α i + j = sini+ α cos j α i + j / / + i i + j + j i + j / / Plugging these in the formula for c d immediately gives a recurrence for c d. For any d : d d+ d c d+ = d a d,d d d d d a d,d Recall at this point the infinite Wallis product [7]: Let = W n = k= ( k k n ( k k= k ( = d d c d = + d c d. = , and Z n = k=n+ ( k k sin i α cos j α dα sin i α cos j α dα. denote the partial finite and respectively partial infinite Wallis products, so that W n Z n = /, for every n. Our recurrence for c d yields that c d is an increasing sequence satisfying also c d+ c d+ = c c W d, for d. (5 Since c d is bounded, it converges to some limit c. The value of c can be obtained by solving the equation c = c c =., 7
8 We thus have lim d c d =. Since c d ρ d, we also have lim d ρ d =. From Equation (5, we also get that for d 3, c c W d c d c c W d or c c W d c d c c W d. (6 Observe that k=n+ k = k=n+ ( k = k + (n +. Standard inequalities e x/5 + x e x for x [,/3] now imply that for each n and Z n = Z n = k=n+ k=n+ Since W n = (//Z n, we have and consequently (6 gives ( + ( + k=n+ k ep k e P 5 k=n+ e (n+ W n e k = e (n+, k = e 5(n+. 5(n+, e (d 3 c d e 5(d, or equivalently e (d 3 c d e 5(d. Taking into account (8 and substituting the above upper bound on c d, we get the final estimate The proof of Theorem is now complete. e (d 3 ρ d e 5(d + e 5(d, for d 3. Verification of Conjecture in two special cases We show that the bound c = in R is best possible in two special cases, corresponding to the lower /n bound construction. Specifically, we show that the star Steiner ratio is at most tan(/n < (i for any finite point set on a circle centered at the Weber point in R, and (ii for any finite point set in the plane where the angles from the Weber center to the n points are uniformly distributed (that is, α i = i/n, for i =,,...,n. The two tight bounds in the plane essentially follow from the closed formula ( for G(,n due to László Fejes Tóth [5] and mentioned in the Introduction. We also give suitable generalizations of these two planar results for points in R d. Here we have chosen x/5 to simplify the resulting expressions. 8
9 Theorem 3 Let P = {p,p,...,p n } be set of n (not necessarily distinct points in R d such that their Weber point is the origin o, and a closest point to o in P is p, at unit distance from o. For i =,,...,n, let q i be the intersection point of line segment op i and the unit sphere S d in R d ; in particular, q = p. If the star over Q = {q,q,...,q n } centered at q has length n i= q oq i n G(d,n, then the star Steiner ratio of P is at most G(d,n c n d. Proof. Let a i = op i, for i =,,...,n, as in our general setup in Section. We have L(SS min = n a i = ( + δn = n + δn, for some δ. By the triangle inequality, p p i p q i + q i p i = q q i + (a i. Therefore, the length of the star over P centered at p is n n p p i n q q i + (a i G(d,n n + δn. It is easy to see that G(d,n n, or equivalently, n G(d,n n. Using this and the previous inequality, we deduce that the star Steiner ratio in this special case is: G(d,n/n + δn n + δn G(d,n n c d. Corollary 3 (i The star Steiner ratio for a set of n points in R d that lie on a sphere centered at the Weber center is at most G(d,n c n d. (ii In particular, the star Steiner ratio for a set of n points in the plane that lie on a circle centered at the Weber center is at most G(, n n = < = c. n tan n Proof. (i We may assume that the points in P lie on a unit sphere S d centered at the origin. The total length of the n stars for P is at most G(d,n, by the definition of G(d,n. By using the first inequality in (, there is a point p P such that the length of the star centered at p is at most n G(d,n. An application of Theorem 3 with p = p completes the proof. (ii By the closed formula (, we have G(,n = n tan, and the bound follows as in part (i. n Corollary The star Steiner ratio for a set P = {p,p,...,p n } of n points in the plane where point p i is visible from the origin under angle i/n, for i =,,...,n, is at most n tan n <. Proof. We may assume w.l.o.g. that p = (, is a closest point in P to the origin o. By equation (5, the Weber center of P is the origin o. For i =,,...,n, let q i be the intersection point of line segment op i and the unit circle S in R ; in particular, q = p. Note that the point set Q is symmetric under rotation by /n about the origin. It follows that every star of Q has the same length. The total length of all stars of Q is at most G(,n, by the definition of G(,d. Hence, the length of the star of Q centered at q is at most n G(,n. An application of Theorem 3 completes the proof. The earlier proof of this result in [] had an error. 9
10 5 Conclusion We think that the sharper upper bound on the star Steiner ratio in the plane in the two special cases (in Corollary 3 and Corollary always holds, so we venture here a slightly stronger version of the conjecture proposed by Fekete and Meijer [6]: Conjecture The star Steiner ratio for n points in the plane is ρ (n = n tan n Fekete and Meijer [6] conjectured that ρ = / and ρ 3 = /3, where these values coincide with c and c 3, respectively. We extend their conjecture to all dimensions d : Conjecture The star Steiner ratio in R d equals the constant of uniform density for the sphere in R d, that is, ρ d = c d for every d.. References [] R. Alexander: On the sum of distances between n points on a sphere, Acta Mathematica Academiae Scientiarum Hungaricae 3 (97, 3 8. [] R. Alexander: On the sum of distances between n points on a sphere. II, Acta Mathematica Academiae Scientiarum Hungaricae 9 (977, [3] R. Alexander, J. Beck, and W. Chen: Geometric discrepancy theory and uniform distribution, in J. Goodman and J. O Rourke (editors, Handbook of Discrete and Computational Geometry, pages 79 3, Chapman & Hall, second edition,. [] R. Alexander and K. Stolarsky: Extremal problems of distance geometry related to energy integrals, Transactions of the American Mathematical Society 93 (97, 3. [5] C. Bajaj: The algebraic degree of geometric optimization problems, Discrete & Computational Geometry 3 (988, [6] G. Björck: Distributions of positive mass which maximize a certain generalized energy integral, Arkiv för Matematik 3 (956, [7] V. Boltyanski, H. Martini, and V. Soltan: Geometric Methods and Optimization Problems, Kluwer Acad. Publ., 999. [8] P. Bose, A. Maheshwari, and P. Morin: Fast approximations for sums of distances, clustering and the Fermat-Weber problem, Computational Geometry: Theory and Applications (3, [9] R. Chandrasekaran and A. Tamir: Algebraic optimization: The Fermat-Weber problem, Mathematical Programming 6 (99, 9. [] E. J. Cockayne and Z. A. Melzak: Euclidean constructibility in graph-minimization problems, Mathematical Magazine (969, 6 8.
11 [] Z. Drezner, K. Klamroth, A. Schöbel, and G. O. Wesolowsky: The Weber problem, in Facility Location: Applications And Theory (H. W. Hamacher and Zvi Drezner, eds., Springer, Berlin,, pp. 36. [] A. Dumitrescu and Cs. D. Tóth: On stars and Steiner stars, Proceedings of the 9th ACM-SIAM Symposium on Discrete Algorithms (SODA 8, San Francisco, January 8, ACM Press, 33. [3] A. Dumitrescu, Cs. D. Tóth and G. Xu: On stars and Steiner stars. II, Proceedings of the th ACM- SIAM Symposium on Discrete Algorithms (SODA 9, New York, January 9, ACM Press, [] D. Eppstein: Spanning trees and spanners, in Handbook of Computational Geometry (J.-R. Sack and J. Urrutia, eds., Elsevier, Amsterdam,, pp [5] L. Fejes Tóth: On the sum of distances determined by a pointset, Acta Mathematica Academiae Scientiarum Hungaricae 7 (956, 397. [6] S. Fekete and H. Meijer: On minimum stars and maximum matchings, Discrete & Computational Geometry 3 (, [7] G. H. Hardy and E. M. Wright: An Introduction to the Theory of Numbers, fifth edition, Oxford University Press, 979. [8] H. Martini, K. Swanepoel, and G. Weiss, The Fermat-Torricelli problem in normed planes and spaces, Journal of Optimization Theory and Applications 5( (, [9] E. Weiszfeld: Sur le point pour lequel les sommes des distances de n points donné est minimum, Tˆohoku Mathematical Journal 3 (937,
On stars and Steiner stars. II
On stars and Steiner stars. II Adrian Dumitrescu Csaba D. Tóth Guangwu Xu June 6, 8 Abstract A Steiner star for a set P of n points in R d connects an arbitrary center point to all points of P, while a
More informationOn stars and Steiner stars. II
Downloaded //7 to 69 Redistribution subject to SIAM license or copyright; see http://wwwsiamorg/journals/ojsaphp Abstract On stars and Steiner stars II Adrian Dumitrescu Csaba D Tóth Guangwu Xu A Steiner
More informationNew bounds on the average distance from the Fermat-Weber center of a planar convex body
New bounds on the average distance from the Fermat-Weber center of a planar convex body Adrian Dumitrescu Minghui Jiang Csaba D. Tóth March 4, 0 Abstract The Fermat-Weber center of a planar body Q is a
More informationMinimum-Dilation Tour (and Path) is NP-hard
Minimum-Dilation Tour (and Path) is NP-hard Panos Giannopoulos Christian Knauer Dániel Marx Abstract We prove that computing a minimum-dilation (Euclidean) Hamilton circuit or path on a given set of points
More informationarxiv: v1 [cs.cg] 16 May 2011
Collinearities in Kinetic Point Sets arxiv:1105.3078v1 [cs.cg] 16 May 2011 Ben D. Lund George B. Purdy Justin W. Smith Csaba D. Tóth August 24, 2018 Abstract Let P be a set of n points in the plane, each
More informationComputing a Minimum-Dilation Spanning Tree is NP-hard
Computing a Minimum-Dilation Spanning Tree is NP-hard Otfried Cheong 1 Herman Haverkort 2 Mira Lee 1 October 0, 2008 Abstract In a geometric network G = (S, E), the graph distance between two vertices
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 informationMonochromatic simplices of any volume
Monochromatic simplices of any volume Adrian Dumitrescu Department of Computer Science University of Wisconsin Milwaukee WI 53201-0784, USA Email: ad@cs.uwm.edu Minghui Jiang Department of Computer Science
More informationCovering a disk by disks
Covering a disk by disks Adrian Dumitrescu Minghui Jiang February 19, 2009 Abstract For a convex body C in R d, what is the smallest number f = f d (C) such that any sequence of smaller homothetic copies
More informationALGORITHM FOR CONSTRAINED WEBER PROBLEM WITH FEASIBLE REGION BOUNDED BY ARCS. Lev A. Kazakovtsev. 1. Introduction
FACTA UNIVERSITATIS (NIŠ) Ser. Math. Inform. Vol. 28, No 3 (2013), 271 284 ALGORITHM FOR CONSTRAINED WEBER PROBLEM WITH FEASIBLE REGION BOUNDED BY ARCS Lev A. Kazakovtsev Abstract. The author proposes
More informationComputing a Minimum-Dilation Spanning Tree is NP-hard
Computing a Minimum-Dilation Spanning Tree is NP-hard Otfried Cheong Herman Haverkort Mira Lee Dept. of Computer Science, Korea Advanced Institute of Science & Technology, Daejeon, South Korea. Email:
More informationOn the Spanning Ratio of Theta-Graphs
On the Spanning Ratio of Theta-Graphs Prosenjit Bose, André van Renssen, and Sander Verdonschot School of Computer Science, Carleton University, Ottawa, Canada. jit@scs.carleton.ca, andre@cg.scs.carleton.ca,
More informationTHE NEWTON BRACKETING METHOD FOR THE MINIMIZATION OF CONVEX FUNCTIONS SUBJECT TO AFFINE CONSTRAINTS
THE NEWTON BRACKETING METHOD FOR THE MINIMIZATION OF CONVEX FUNCTIONS SUBJECT TO AFFINE CONSTRAINTS ADI BEN-ISRAEL AND YURI LEVIN Abstract. The Newton Bracketing method [9] for the minimization of convex
More informationThe Newton Bracketing method for the minimization of convex functions subject to affine constraints
Discrete Applied Mathematics 156 (2008) 1977 1987 www.elsevier.com/locate/dam The Newton Bracketing method for the minimization of convex functions subject to affine constraints Adi Ben-Israel a, Yuri
More informationTactical Decompositions of Steiner Systems and Orbits of Projective Groups
Journal of Algebraic Combinatorics 12 (2000), 123 130 c 2000 Kluwer Academic Publishers. Manufactured in The Netherlands. Tactical Decompositions of Steiner Systems and Orbits of Projective Groups KELDON
More informationFly Cheaply: On the Minimum Fuel Consumption Problem
Journal of Algorithms 41, 330 337 (2001) doi:10.1006/jagm.2001.1189, available online at http://www.idealibrary.com on Fly Cheaply: On the Minimum Fuel Consumption Problem Timothy M. Chan Department of
More informationPacking and Minkowski Covering of Congruent Spherical Caps on a Sphere for N = 2,..., 9
Original Paper Forma, 1, 197 5, 006 Packing and Minkowski Covering of Congruent Spherical Caps on a Sphere for N =,..., 9 Teruhisa SUGIMOTO 1 * and Masaharu TANEMURA 1, 1 The Institute of Statistical Mathematics,
More informationEuclidean Shortest Path Algorithm for Spherical Obstacles
Euclidean Shortest Path Algorithm for Spherical Obstacles Fajie Li 1, Gisela Klette 2, and Reinhard Klette 3 1 College of Computer Science and Technology, Huaqiao University Xiamen, Fujian, China 2 School
More informationCovering the Plane with Translates of a Triangle
Discrete Comput Geom (2010) 43: 167 178 DOI 10.1007/s00454-009-9203-1 Covering the Plane with Translates of a Triangle Janusz Januszewski Received: 20 December 2007 / Revised: 22 May 2009 / Accepted: 10
More informationarxiv: v1 [cs.cg] 25 Dec 2018
Evacuating Equilateral Triangles and Squares in the Face-to-Face Model Huda Chuangpishit 1, Saeed Mehrabi 2, Lata Narayanan 3, and Jaroslav Opatrny 3 1 Department of Mathematics, Ryerson University, Toronto,
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 informationGeometric Spanners With Small Chromatic Number
Geometric Spanners With Small Chromatic Number Prosenjit Bose 1, Paz Carmi 1, Mathieu Couture 1, Anil Maheshwari 1, Michiel Smid 1, and Norbert Zeh 2 1 School of Computer Science, Carleton University 2
More informationDeviation Measures and Normals of Convex Bodies
Beiträge zur Algebra und Geometrie Contributions to Algebra Geometry Volume 45 (2004), No. 1, 155-167. Deviation Measures Normals of Convex Bodies Dedicated to Professor August Florian on the occasion
More informationOn the mean connected induced subgraph order of cographs
AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 71(1) (018), Pages 161 183 On the mean connected induced subgraph order of cographs Matthew E Kroeker Lucas Mol Ortrud R Oellermann University of Winnipeg Winnipeg,
More informationA modified Weiszfeld algorithm for the Fermat-Weber location problem
Math. Program., Ser. A 9: 559 566 (21) Digital Object Identifier (DOI) 1.17/s1171222 Yehuda Vardi Cun-Hui Zhang A modified Weiszfeld algorithm for the Fermat-Weber location problem Received: September
More informationA note on the minimal volume of almost cubic parallelepipeds
A note on the minimal volume of almost cubic parallelepipeds Daniele Micciancio Abstract We prove that the best way to reduce the volume of the n-dimensional unit cube by a linear transformation that maps
More informationTHE MEAN MINKOWSKI MEASURES FOR CONVEX BODIES OF CONSTANT WIDTH. HaiLin Jin and Qi Guo 1. INTRODUCTION
TAIWANESE JOURNAL OF MATHEMATICS Vol. 8, No. 4, pp. 83-9, August 04 DOI: 0.650/tjm.8.04.498 This paper is available online at http://journal.taiwanmathsoc.org.tw THE MEAN MINKOWSKI MEASURES FOR CONVEX
More information12-neighbour packings of unit balls in E 3
12-neighbour packings of unit balls in E 3 Károly Böröczky Department of Geometry Eötvös Loránd University Pázmány Péter sétány 1/c H-1117 Budapest Hungary László Szabó Institute of Informatics and Economics
More informationThe Hausdorff measure of a Sierpinski-like fractal
Hokkaido Mathematical Journal Vol. 6 (2007) p. 9 19 The Hausdorff measure of a Sierpinski-like fractal Ming-Hua Wang (Received May 12, 2005; Revised October 18, 2005) Abstract. Let S be a Sierpinski-like
More informationOn self-circumferences in Minkowski planes
extracta mathematicae Article in press On self-circumferences in Minkowski planes Mostafa Ghandehari, Horst Martini Department of Mathematics, University of Texas at Arlington, TX 76019, U.S.A. Faculty
More informationSuccinct Data Structures for Approximating Convex Functions with Applications
Succinct Data Structures for Approximating Convex Functions with Applications Prosenjit Bose, 1 Luc Devroye and Pat Morin 1 1 School of Computer Science, Carleton University, Ottawa, Canada, K1S 5B6, {jit,morin}@cs.carleton.ca
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 informationIntroduction to Real Analysis Alternative Chapter 1
Christopher Heil Introduction to Real Analysis Alternative Chapter 1 A Primer on Norms and Banach Spaces Last Updated: March 10, 2018 c 2018 by Christopher Heil Chapter 1 A Primer on Norms and Banach Spaces
More informationColoring translates and homothets of a convex body
Coloring translates and homothets of a convex body Adrian Dumitrescu Minghui Jiang August 7, 2010 Abstract We obtain improved upper bounds and new lower bounds on the chromatic number as a linear function
More informationA Pair in a Crowd of Unit Balls
Europ. J. Combinatorics (2001) 22, 1083 1092 doi:10.1006/eujc.2001.0547 Available online at http://www.idealibrary.com on A Pair in a Crowd of Unit Balls K. HOSONO, H. MAEHARA AND K. MATSUDA Let F be a
More informationA Combinatorial Algorithm for the 1-Median Problem in R d with the Chebyshev-Norm
A Combinatorial Algorithm for the 1-Median Problem in R d with the Chebyshev-Norm Johannes Hatzl a,, Andreas Karrenbauer b a Department of Optimization Discrete Mathematics, Graz University of Technology,
More informationDECAY AND GROWTH FOR A NONLINEAR PARABOLIC DIFFERENCE EQUATION
PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 133, Number 9, Pages 2613 2620 S 0002-9939(05)08052-4 Article electronically published on April 19, 2005 DECAY AND GROWTH FOR A NONLINEAR PARABOLIC
More information(x 1, y 1 ) = (x 2, y 2 ) if and only if x 1 = x 2 and y 1 = y 2.
1. Complex numbers A complex number z is defined as an ordered pair z = (x, y), where x and y are a pair of real numbers. In usual notation, we write z = x + iy, where i is a symbol. The operations of
More informationResearch Article Translative Packing of Unit Squares into Squares
International Mathematics and Mathematical Sciences Volume 01, Article ID 61301, 7 pages doi:10.1155/01/61301 Research Article Translative Packing of Unit Squares into Squares Janusz Januszewski Institute
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 informationResearch Article The Weighted Fermat Triangle Problem
Hindawi Publishing Corporation International Journal of Mathematics and Mathematical Sciences Volume 2008, Article ID 283846, 16 pages doi:10.1155/2008/283846 Research Article The Weighted Fermat Triangle
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 informationSome Remarks on an Efficient Algorithm to Find a Centroid in a k-dimensional Real Space
Applied Mathematical Sciences, Vol. 10, 2016, no. 33, 1619-1641 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ams.2016.6263 Some Remarks on an Efficient Algorithm to Find a Centroid in a k-dimensional
More informationMATH 243 Winter 2008 Geometry II: Transformation Geometry Solutions to Problem Set 1 Completion Date: Monday January 21, 2008
MTH 4 Winter 008 Geometry II: Transformation Geometry Solutions to Problem Set 1 ompletion Date: Monday January 1, 008 Department of Mathematical Statistical Sciences University of lberta Question 1. Let
More informationSHORTEST PERIODIC BILLIARD TRAJECTORIES IN CONVEX BODIES
SHORTEST PERIODIC BILLIARD TRAJECTORIES IN CONVEX BODIES MOHAMMAD GHOMI Abstract. We show that the length of any periodic billiard trajectory in any convex body K R n is always at least 4 times the inradius
More informationRelating minimum degree and the existence of a k-factor
Relating minimum degree and the existence of a k-factor Stephen G Hartke, Ryan Martin, and Tyler Seacrest October 6, 010 Abstract A k-factor in a graph G is a spanning regular subgraph in which every vertex
More informationGeometry. The k Most Frequent Distances in the Plane. József Solymosi, 1 Gábor Tardos, 2 and Csaba D. Tóth Introduction
Discrete Comput Geom 8:639 648 (00 DOI: 10.1007/s00454-00-896-z Discrete & Computational Geometry 00 Springer-Verlag New York Inc. The k Most Frequent Distances in the Plane József Solymosi, 1 Gábor Tardos,
More informationGeneralizations of Product-Free Subsets
Generalizations of Product-Free Subsets The MIT Faculty has made this article openly available. Please share how this access benefits you. Your story matters. Citation As Published Publisher Kedlaya, Kiran
More informationarxiv: v1 [math.co] 29 Nov 2018
ON THE INDUCIBILITY OF SMALL TREES AUDACE A. V. DOSSOU-OLORY AND STEPHAN WAGNER arxiv:1811.1010v1 [math.co] 9 Nov 018 Abstract. The quantity that captures the asymptotic value of the maximum number of
More informationTesting Equality in Communication Graphs
Electronic Colloquium on Computational Complexity, Report No. 86 (2016) Testing Equality in Communication Graphs Noga Alon Klim Efremenko Benny Sudakov Abstract Let G = (V, E) be a connected undirected
More informationSpanning Paths in Infinite Planar Graphs
Spanning Paths in Infinite Planar Graphs Nathaniel Dean AT&T, ROOM 2C-415 600 MOUNTAIN AVENUE MURRAY HILL, NEW JERSEY 07974-0636, USA Robin Thomas* Xingxing Yu SCHOOL OF MATHEMATICS GEORGIA INSTITUTE OF
More informationJanusz Januszewski TRANSLATIVE PACKING OF UNIT SQUARES INTO EQUILATERAL TRIANGLES
DEMONSTRATIO MATHEMATICA Vol. XLVIII No 015 Janusz Januszewski TRANSLATIVE PACKING OF UNIT SQUARES INTO EQUILATERAL TRIANGLES Communicated by Z. Pasternak-Winiarski Abstract. Every collection of n (arbitrary-oriented)
More informationWord-representability of line graphs
Word-representability of line graphs Sergey Kitaev,1,3, Pavel Salimov,1,2, Christopher Severs,1, and Henning Úlfarsson,1 1 Reykjavik University, School of Computer Science, Menntavegi 1, 101 Reykjavik,
More informationIntroduction The Poissonian City Variance and efficiency Flows Conclusion References. The Poissonian City. Wilfrid Kendall.
The Poissonian City Wilfrid Kendall w.s.kendall@warwick.ac.uk Mathematics of Phase Transitions Past, Present, Future 13 November 2009 A problem in frustrated optimization Consider N cities x (N) = {x 1,...,
More informationNotes on Geometry and Spacetime
Notes on Geometry and Spacetime Version 2.7, November 2009 David B. Malament Department of Logic and Philosophy of Science University of California, Irvine dmalamen@uci.edu Contents 1 Preface 2 2 Preliminary
More informationNotes taken by Costis Georgiou revised by Hamed Hatami
CSC414 - Metric Embeddings Lecture 6: Reductions that preserve volumes and distance to affine spaces & Lower bound techniques for distortion when embedding into l Notes taken by Costis Georgiou revised
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 informationNear-Optimal Algorithms for Maximum Constraint Satisfaction Problems
Near-Optimal Algorithms for Maximum Constraint Satisfaction Problems Moses Charikar Konstantin Makarychev Yury Makarychev Princeton University Abstract In this paper we present approximation algorithms
More informationOn the discrepancy of circular sequences of reals
On the discrepancy of circular sequences of reals Fan Chung Ron Graham Abstract In this paper we study a refined measure of the discrepancy of sequences of real numbers in [0, ] on a circle C of circumference.
More informationGeometry. On Galleries with No Bad Points. P. Valtr. 1. Introduction
Discrete Comput Geom 21:13 200 (1) Discrete & Computational Geometry 1 Springer-Verlag New York Inc. On Galleries with No Bad Points P. Valtr Department of Applied Mathematics, Charles University, Malostranské
More informationA METHOD FOR ESTABLISHING CERTAIN TRIGONOMETRIC INEQUALITIES
Volume 8 (007), Issue 1, Article 9, 11 pp. A METHOD FOR ESTABLISHING CERTAIN TRIGONOMETRIC INEQUALITIES MOWAFFAQ HAJJA DEPARTMENT OF MATHEMATICS YARMOUK UNIVERSITY IRBID, JORDAN. mowhajja@yahoo.com Received
More informationTight Stretch Factors for L 1 - and L -Delaunay Triangulations
Tight Stretch Factors for L - and L -Delaunay Triangulations Nicolas Bonichon a, Cyril Gavoille a,, Nicolas Hanusse b, Ljubomir Perković c,2, a LaBRI - INRIA Bordeaux Sud-Ouest - University of Bordeaux,
More informationarxiv: v1 [math.gr] 2 Aug 2017
RANDOM GROUP COBORDISMS OF RANK 7 arxiv:1708.0091v1 [math.gr] 2 Aug 2017 SYLVAIN BARRÉ AND MIKAËL PICHOT Abstract. We construct a model of random groups of rank 7, and show that in this model the random
More information4488 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 54, NO. 10, OCTOBER /$ IEEE
4488 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 54, NO. 10, OCTOBER 2008 List Decoding of Biorthogonal Codes the Hadamard Transform With Linear Complexity Ilya Dumer, Fellow, IEEE, Grigory Kabatiansky,
More informationInternational Mathematics TOURNAMENT OF THE TOWNS
International Mathematics TOURNAMENT OF THE TOWNS Senior A-Level Paper Fall 2011 1 Pete has marked at least 3 points in the plane such that all distances between them are different A pair of marked points
More informationThe Densest Packing of 13 Congruent Circles in a Circle
Beiträge zur Algebra und Geometrie Contributions to Algebra and Geometry Volume 44 (003), No., 431-440. The Densest Packing of 13 Congruent Circles in a Circle Ferenc Fodor Feherviz u. 6, IV/13 H-000 Szentendre,
More informationOn Minimal Tilings with Convex Cells Each Containing a Unit Ball
On Minimal Tilings with Convex Cells Each Containing a Unit Ball Károly Bezdek Abstract We investigate the following problem that one can regard as a very close relative of the densest sphere packing problem.
More informationExistence and Uniqueness
Chapter 3 Existence and Uniqueness An intellect which at a certain moment would know all forces that set nature in motion, and all positions of all items of which nature is composed, if this intellect
More informationJoseph B. Keller and Ravi Vakil. Department of Mathematics. Stanford University, Stanford, CA February 15, 2008
π p, the value of π in l p Joseph B. Keller and Ravi Vakil Department of Mathematics Stanford University, Stanford, CA 9345-15 February 15, 8 The two dimensional space l p is the set of points in the plane,
More informationActa Mathematica Academiae Paedagogicae Nyíregyháziensis 26 (2010), ISSN
Acta Mathematica Academiae Paedagogicae Nyíregyháziensis 6 (010), 359 375 www.emis.de/journals ISSN 1786-0091 EXAMPLES AND NOTES ON GENERALIZED CONICS AND THEIR APPLICATIONS Á NAGY AND CS. VINCZE Abstract.
More informationOn the Waring problem for polynomial rings
On the Waring problem for polynomial rings Boris Shapiro jointly with Ralf Fröberg, Giorgio Ottaviani Université de Genève, March 21, 2016 Introduction In this lecture we discuss an analog of the classical
More informationLecture 9: Random sampling, ɛ-approximation and ɛ-nets
CPS296.2 Geometric Optimization February 13, 2007 Lecture 9: Random sampling, -approximation and -nets Lecturer: Pankaj K. Agarwal Scribe: Shashidhara K. Ganjugunte In the next few lectures we will be
More informationTEST CODE: MMA (Objective type) 2015 SYLLABUS
TEST CODE: MMA (Objective type) 2015 SYLLABUS Analytical Reasoning Algebra Arithmetic, geometric and harmonic progression. Continued fractions. Elementary combinatorics: Permutations and combinations,
More informationAbstract. 2. We construct several transcendental numbers.
Abstract. We prove Liouville s Theorem for the order of approximation by rationals of real algebraic numbers. 2. We construct several transcendental numbers. 3. We define Poissonian Behaviour, and study
More informationTHE INVERSE FUNCTION THEOREM
THE INVERSE FUNCTION THEOREM W. PATRICK HOOPER The implicit function theorem is the following result: Theorem 1. Let f be a C 1 function from a neighborhood of a point a R n into R n. Suppose A = Df(a)
More informationMath 320: Real Analysis MWF 1pm, Campion Hall 302 Homework 8 Solutions Please write neatly, and in complete sentences when possible.
Math 320: Real Analysis MWF pm, Campion Hall 302 Homework 8 Solutions Please write neatly, and in complete sentences when possible. Do the following problems from the book: 4.3.5, 4.3.7, 4.3.8, 4.3.9,
More informationEstimates for probabilities of independent events and infinite series
Estimates for probabilities of independent events and infinite series Jürgen Grahl and Shahar evo September 9, 06 arxiv:609.0894v [math.pr] 8 Sep 06 Abstract This paper deals with finite or infinite sequences
More informationarxiv: v1 [math.co] 2 Dec 2013
What is Ramsey-equivalent to a clique? Jacob Fox Andrey Grinshpun Anita Liebenau Yury Person Tibor Szabó arxiv:1312.0299v1 [math.co] 2 Dec 2013 November 4, 2018 Abstract A graph G is Ramsey for H if every
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 informationCollinearities in Kinetic Point Sets
Collinearities in Kinetic Point Sets Ben Lund 1 George Purdy 1 Justin Smith 1 Csaba Tóth 2 1 Department of Computer Science 2 Department of Mathematics University of Cincinnati University of Calgary k-collinearities
More informationLong non-crossing configurations in the plane
Long non-crossing configurations in the plane Adrian Dumitrescu Csaa D. Tóth July 4, 00 Astract We revisit some maximization prolems for geometric networks design under the non-crossing constraint, first
More informationCyclic Central Configurations in the Four-Body Problem
Cyclic Central Configurations in the Four-Body Problem Gareth E. Roberts Department of Mathematics and Computer Science College of the Holy Cross Josep Cors (Universitat Politècnica de Catalunya) NSF DMS-0708741
More informationOn the Properties of a Tree-Structured Server Process
On the Properties of a Tree-Structured Server Process J. Komlos Rutgers University A. Odlyzko L. Ozarow L. A. Shepp AT&T Bell Laboratories Murray Hill, New Jersey 07974 I. INTRODUCTION In this paper we
More informationTHE UNIT DISTANCE PROBLEM ON SPHERES
THE UNIT DISTANCE PROBLEM ON SPHERES KONRAD J. SWANEPOEL AND PAVEL VALTR Abstract. For any D > 1 and for any n 2 we construct a set of n points on a sphere in R 3 of diameter D determining at least cn
More informationTopological properties
CHAPTER 4 Topological properties 1. Connectedness Definitions and examples Basic properties Connected components Connected versus path connected, again 2. Compactness Definition and first examples Topological
More informationPart III. 10 Topological Space Basics. Topological Spaces
Part III 10 Topological Space Basics Topological Spaces Using the metric space results above as motivation we will axiomatize the notion of being an open set to more general settings. Definition 10.1.
More informationarxiv: v1 [math.nt] 10 Dec 2009
Ford circles, continued fractions, and best approximation of the second kind arxiv:092.997v [math.nt] 0 Dec 2009 Ian Short Centre for Mathematical Sciences Wilberforce Road Cambridge CB3 0WB United Kingdom
More information13 Spherical geometry
13 Spherical geometry Let ABC be a triangle in the Euclidean plane. From now on, we indicate the interior angles A = CAB, B = ABC, C = BCA at the vertices merely by A, B, C. The sides of length a = BC
More informationSome Nordhaus-Gaddum-type Results
Some Nordhaus-Gaddum-type Results Wayne Goddard Department of Mathematics Massachusetts Institute of Technology Cambridge, USA Michael A. Henning Department of Mathematics University of Natal Pietermaritzburg,
More informationInverse Median Location Problems with Variable Coordinates. Fahimeh Baroughi Bonab, Rainer Ernst Burkard, and Behrooz Alizadeh
FoSP Algorithmen & mathematische Modellierung FoSP Forschungsschwerpunkt Algorithmen und mathematische Modellierung Inverse Median Location Problems with Variable Coordinates Fahimeh Baroughi Bonab, Rainer
More informationContainment restrictions
Containment restrictions Tibor Szabó Extremal Combinatorics, FU Berlin, WiSe 207 8 In this chapter we switch from studying constraints on the set operation intersection, to constraints on the set relation
More informationLinear Algebra and its Applications
Linear Algebra and its Applications 432 (2010) 770 776 Contents lists available at ScienceDirect Linear Algebra and its Applications journal homepage: www.elsevier.com/locate/laa A dual transformation
More informationU.C. Berkeley CS294: Spectral Methods and Expanders Handout 11 Luca Trevisan February 29, 2016
U.C. Berkeley CS294: Spectral Methods and Expanders Handout Luca Trevisan February 29, 206 Lecture : ARV In which we introduce semi-definite programming and a semi-definite programming relaxation of sparsest
More informationOn the sum of two largest eigenvalues of a symmetric matrix
On the sum of two largest eigenvalues of a symmetric matrix Javad Ebrahimi B. Department of Mathematics Simon Fraser University Burnaby, B.C. V5A 1S6 Vladimir Nikiforov Department of Mathematical Sci.
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 informationOperations Research Letters. A generalized Weiszfeld method for the multi-facility location problem
Operations Research Letters 38 ) 7 4 Contents lists available at ScienceDirect Operations Research Letters journal homepage: www.elsevier.com/locate/orl A generalized Weiszfeld method for the multi-facility
More informationOn Locating-Dominating Codes in Binary Hamming Spaces
Discrete Mathematics and Theoretical Computer Science 6, 2004, 265 282 On Locating-Dominating Codes in Binary Hamming Spaces Iiro Honkala and Tero Laihonen and Sanna Ranto Department of Mathematics and
More informationLIMITS AND DERIVATIVES
2 LIMITS AND DERIVATIVES LIMITS AND DERIVATIVES The intuitive definition of a limit given in Section 2.2 is inadequate for some purposes.! This is because such phrases as x is close to 2 and f(x) gets
More informationarxiv: v1 [math.co] 28 Jan 2019
THE BROWN-ERDŐS-SÓS CONJECTURE IN FINITE ABELIAN GROUPS arxiv:191.9871v1 [math.co] 28 Jan 219 JÓZSEF SOLYMOSI AND CHING WONG Abstract. The Brown-Erdős-Sós conjecture, one of the central conjectures in
More informationA Construction of Almost Steiner Systems
A Construction of Almost Steiner Systems Asaf Ferber, 1 Rani Hod, 2 Michael Krivelevich, 1 and Benny Sudakov 3,4 1 School of Mathematical Sciences, Raymond and Beverly Sackler Faculty of Exact Sciences,
More information