Packing Plane Spanning Trees into a Point Set
|
|
- Caren Nelson
- 5 years ago
- Views:
Transcription
1 Paking Plane Spanning Trees into a Point Set Ahmad Biniaz Alfredo Garía Abstrat Let P be a set of n points in the plane in general position. We show that at least n/3 plane spanning trees an be paked into the omplete geometri graph on P. This improves the previous best known lower bound Ω ( n). Towards our proof of this lower bound we show that the enter of a set of points, in the d-dimensional spae in general position, is of dimension either 0 or d. 1 Introdution In the two-dimensional spae, a geometri graph G is a graph whose verties are points in the plane and whose edges are straight-line segments onneting the points. A subgraph S of G is plane if no pair of its edges ross eah other. Two subgraphs S 1 and S 2 of G are edgedisjoint if they do not share any edge. Let P be a set of n points in the plane. The omplete geometri graph K(P ) is the geometri graph with vertex set P that has a straight-line edge between every pair of points in P. We say that a sequene S 1, S 2, S 3,... of subgraphs of K(P ) is paked into K(P ), if the subgraphs in this sequene are pairwise edge-disjoint. In a paking problem, we ask for the largest number of subgraphs of a given type that an be paked into K(P ). Among all subgraphs, plane spanning trees, plane Hamiltonian paths, and plane perfet mathings are of interest. Sine K(P ) has n(n 1)/2 edges, at most n/2 spanning trees, at most n/2 Hamiltonian paths, and at most n 1 perfet mathings an be paked into it. A long-standing open question is to determine whether or not it is possible to pak n/2 plane spanning trees into K(P ). If P is in onvex position, the answer in the affirmative follows from the result of Bernhart and Kanien [3], and a haraterization of suh plane spanning trees is given by Bose et al. [5]. In CCCG 2014, Aihholzer et al. [1] showed that if P is in general position (no three points on a line), then Ω( n) plane spanning trees an be paked into K(P ); this bound is obtained by a lever ombination of rossing family (a set of pairwise rossing edges) [2] and double-stars University of Waterloo, Canada. Supported by NSERC Postdotoral Fellowship. ahmad.biniaz@gmail.om Universidad de Zaragoza, Spain. Partially supported by H2020-MSCA-RISE projet CONNECT and MINECO projet MTM R. olaverri@unizar.es (trees with only two interior nodes) [5]. Shnider [12] showed that it is not always possible to pak n/2 plane spanning double stars into K(P ), and gave a neessary and suffiient ondition for the existene of suh a paking. As for paking other spanning strutures into K(P ), Aihholzer et al. [1] and Biniaz et al. [4] showed a paking of 2 plane Hamiltonian yles and a paking of log 2 n 2 plane perfet mathings, respetively. The problem of paking spanning trees into (abstrat) graphs is studied by Nash-Williams [11] and Tutte [13] who independently obtained neessary and suffiient onditions to pak k spanning trees into a graph. Kundu [10] showed that at least (k 1)/2 spanning trees an be paked into any k-edge-onneted graph. In this paper we show how to pak n/3 plane spanning trees into K(P ) when P is in general position. This improves the previous Ω( n) lower bound. 2 Paking Plane Spanning Trees In this setion we show how to pak n/3 plane spanning tree into K(P ), where P is a set of n 3 points in the plane in general position (no three points on a line). If n {3, 4, 5} then one an easily find a plane spanning tree on P. Thus, we may assume that n 6. The enter of P is a subset C of the plane suh that any losed halfplane interseting C ontains at least n/3 points of P. A enterpoint of P is a member of C, whih does not neessarily belong to P. Thus, any halfplane that ontains a enterpoint, has at least n/3 points of P. It is well known that every point set in the plane has a enterpoint; see e.g. [7, Chapter 4]. We use the following orollary and lemma in our proof of the n/3 lower bound; the orollary follows from Theorem 4 that we will prove later in Setion 3. Corollary 1 Let P be a set of n 6 points in the plane in general position, and let C be the enter of P. Then, C is either 2-dimensional or 0-dimensional. If C is 0- dimensional, then it onsists of one point that belongs to P, moreover n is of the form 3k + 1 for some integer k 2. Lemma 1 Let P be a set of n points in the plane in general position, and let be a enterpoint of P. Then, for every point p P, eah of the two losed halfplanes, that are determined by the line through and p, ontains at least n/3 + 1 points of P.
2 30 th Canadian Conferene on Computational Geometry, 2018 H p Figure 1: Illustration of the proof of Lemma 1. from to p i+2k. Thus, all the k edges outgoing from p i are in the onvex wedge bounded by the rays p i and p i+k, all the edges outgoing from p i+k are in the onvex wedge bounded by p i+k and i+2k, and all the edges from p i+2k are in the onvex wedge bounded by p i+2k and i+3k. Therefore, the spanning direted graph G i is plane. As depited in Figure 2, by removing the edge (p i+2k, p i ) from G i we obtain a plane spanning (direted) tree T i. This is the end of our onstrution of k plane spanning trees. Proof. For the sake of ontradition assume that a losed halfplane H, that is determined by the line through and p, ontains less than n/3 + 1 points of P. By symmetry assume that H is to the left side of this line oriented from to p as depited in Figure 1. Sine is a enterpoint and H ontains, the definition of enterpoint implies that H ontains exatly n/3 points of P (inluding p and any other point of P that may lie on the boundary of H). By slightly rotating H ounterlokwise around, while keeping on the boundary of H, we obtain a new losed halfplane that ontains but misses p. This new halfplane ontains less than n/3 points of P ; this ontradits being a enterpoint of P. p 1+k p 3 p 3 p 2 p 1 p 1+2k p 1 Now we proeed with our proof of the lower bound. We distinguish between two ases depending on whether the enter C of P is 2-dimensional or 0-dimensional. First suppose that C is 2-dimensional. Then, C ontains a enterpoint, say, that does not belong to P. Let p 1,..., p n be a ounter-lokwise radial ordering of points in P around. For two points p and q in the plane, we denote by pq, the ray emanating from p that passes through q. Sine every integer n 3 has one of the forms 3k, 3k + 1, and 3k + 2, for some k 1, we will onsider three ases. In eah ase, we show how to onstrut k plane spanning direted graphs G 1,..., G k that are edge-disjoint. Then, for every i {1,..., k}, we obtain a plane spanning tree T i from G i. First assume that n = 3k. To build G i, onnet p i by outgoing edges to p i+1, p i+2,..., p i+k, then onnet p i+k by outgoing edges to p i+k+1, p i+k+2,..., p i+2k, and then onnet p i+2k by outgoing edges to p i+2k+1, p i+2k+2,..., p i+3k, where all the indies are modulo n, and thus p i+3k = p i. The graph G i, that is obtained this way, has one yle (p i, p i+k, p i+2k, p i ); see Figure 2. By Lemma 1, every losed halfplane, that is determined by the line through and a point of P, ontains at least k + 1 points of P. Thus, all points p i, p i+1,..., p i+k lie in the losed halfplane to the left of the line through and p i that is oriented from to p i. Similarly, the points p i+k,..., p i+2k lie in the losed halfplane to the left of the oriented line from to p i+k, and the points p i+2k,..., p i+3k lie in the losed halfplane to the left of the oriented line p 1+k p 2 p 2+k p 2+2k p 1+2k Figure 2: The plane spanning trees T 1 (the top) and T 2 (the bottom) are obtained by removing the edges (p 1+2k, p 1 ) and (p 2+2k, p 2 ) from G 1 and G 2, respetively. To verify that the k spanning trees obtained above are edge-disjoint, we show that two trees T i and T j, with i j, do not share any edge. Notie that the tail of every edge in T i belongs to the set I = {p i, p i+k, p i+2k }, and the tail of every edge in T j belongs to the set J = {p j, p j+k, p j+2k }, and I J =. For ontrary, suppose that some edge (p r, p s ) belongs to both T i and T j, and without loss of generality assume that in T i this edge is oriented from p r to p s while in T j it is oriented from p s to p r. Then p r I and p s J. Sine (p r, p s ) T i and the largest index of the head of every outgoing edge from p r is r + k, we have that s (r + k) mod n. Similarly, sine (p s, p r ) T j and the largest index of the head of every outgoing edge from p s is s + k, we have that r (s + k) mod n. However, these two inequalities annot hold together; this ontradits our assumption
3 C C C Figure 3: The dimension of a point set in the plane, that is not in general position, an be any number in {0, 1, 2}. that (p r, p s ) belongs to both trees. Thus, our laim, that T 1,..., T k are edge-disjoint, follows. This finishes our proof for the ase where n = 3k. If n = 3k+1, then by Lemma 1, every losed halfplane that is determined by the line through and a point of P ontains at least k + 2 points of P. In this ase, we onstrut G i by onneting p i to its following k + 1 points, i.e., p i+1,..., p i+k+1, and then onneting eah of p i+k+1 and p i+2k+1 to their following k points. If n = 3k + 2, then we onstrut G i by onneting eah of p i and p i+k+1 to their following k + 1 points, and then onneting p i+2k+2 to its following k points. This is the end of our proof for the ase where C is 2-dimensional. Now we onsider the ase where C is 0-dimensional. By Corollary 1, C onsists of one point that belongs to P, and moreover n = 3k + 1 for some k 2. Let p P be the only point of C, and let p 1,..., p n 1 be a ounterlokwise radial ordering of points in P \ {p} around p. As in our first ase (where C was 2-dimensional, was not in P, and n was of the form 3k) we onstrut k edgedisjoint plane spanning trees T 1,..., T k on P \{p} where p playing the role of. Then, for every i {1,..., k}, by onneting p to p i, we obtain a plane spanning tree for P. These plane spanning trees are edge-disjoint. This is the end of our proof. In this setion we have proved the following theorem. Theorem 2 Every omplete geometri graph, on a set of n points in the plane in general position, ontains at least n/3 edge-disjoint plane spanning trees. 3 The Dimension of the Center of a Point Set The enter of a set P of n d + 1 points in R d is a subset C of R d suh that any losed halfspae interseting C ontains at least α = n/(d + 1) points of P. Based on this definition, one an haraterize C as the intersetion of all losed halfspaes suh that their omplementary open halfspaes ontain less than α points of P. More preisely (see [7, Chapter 4]) C is the intersetion of a finite set of losed halfspaes H 1, H 2,..., H m suh that for eah H i 1. the boundary of H i ontains at least d affinely independent points of P, and 2. the omplementary open halfspae H i ontains at most α 1 points of P, and the losure of H i ontains at least α points of P. Being the intersetion of losed halfspaes, C is a onvex polyhedron. A enterpoint of P is a member of C, whih does not neessarily belong to P. It follows, from the definition of the enter, that any halfspae ontaining a enterpoint has at least α points of P. It is well known that every point set in the plane has a enterpoint [7, Chapter 4]. In dimensions 2 and 3, a enterpoint an be omputed in O(n) time [9] and in O(n 2 ) expeted time [6], respetively. A set of points in R d, with d 2, is said to be in general position if no k+2 of them lie in a k-dimensional flat for every k {1,..., d 1}. 1 Alternatively, for a set of points in R d to be in general position, it suffies that no d + 1 of them lie on the same hyperplane. In this setion we prove that if a point set P in R d is in general position, then the enter of P is of dimension either 0 or d. Our proof of this laim uses the following result of Grünbaum. Theorem 3 (Grünbaum, 1962 [8]) Let F be a finite family of onvex polyhedra in R d, let I be their intersetion, and let s be an integer in {1,..., d}. If every intersetion of s members of F is of dimension d, but I is (d s)-dimensional, then there exist s + 1 members of F suh that their intersetion is (d s)-dimensional. Before proeeding to our proof, we note that if P is not in general position, then the dimension of C an be any number in {0, 1,..., d}; see e.g. Figure 3 for the ase where d = 2. Observation 1 For every k {1,..., d+1} the dimension of the intersetion of every k losed halfspaes in R d is in the range [d k + 1, d]. Theorem 4 Let P be a set of n d + 1 points in R d, and let C be the enter of P. Then, C is either d-dimensional, or ontained in a (d s)-dimensional polyhedron that has at least n (s + 1)(α 1) points of P for some s {1,..., d} and α = n/(d + 1). In the latter ase if P is in general position and n d + 3, then C onsists of one point that belongs to P, and n is of the form k(d + 1) + 1 for some integer k 2. 1 A flat is a subset of d-dimensional spae that is ongruent to a Eulidean spae of lower dimension. The flats in 2-dimensional spae are points and lines, whih have dimensions 0 and 1.
4 30 th Canadian Conferene on Computational Geometry, 2018 Proof. The enter C is a onvex polyhedron that is the intersetion of a finite family H of losed halfspaes suh that eah of their omplementary open halfspaes ontains at most α 1 points of P [7, Chapter 4]. Sine C is a onvex polyhedron in R d, its dimension is in the range [0, d]. For the rest of the proof we onsider the following two ases. (a) The intersetion of every d + 1 members of H is of dimension d. (b) The intersetion of some d + 1 members of H is of dimension less than d. First assume that we are in ase (a). We prove that C is d-dimensional. Our proof follows from Theorem 3 and a ontrary argument. Assume that C is not d- dimensional. Then, C is (d s)-dimensional for some s {1,..., d}. Sine the intersetion of every s members of H is d-dimensional, by Theorem 3 there exist s + 1 members of H whose intersetion is (d s)- dimensional. This ontradits the assumption of ase (a) that the intersetion of every d + 1 members of H is d-dimensional. Therefore, C is d-dimensional in this ase. Now assume that we are in ase (b). Let s be the largest integer in {1,..., d} suh that every intersetion of s members of H is d-dimensional; notie that suh an integer exists beause every single halfspae in H is d-dimensional. Our hoie of s implies the existene of a subfamily H of s+1 members of H whose intersetion is d -dimensional for some d < d. Let s be an integer suh that d = d s. By Observation 1, we have that d d s, and equivalently d s d s; this implies s s. To this end we have a family H with s + 1 members for whih every intersetion of s members is d-dimensional (beause s s and H H), but the intersetion of all members of H is (d s )-dimensional. Applying Theorem 3 on H implies the existene of s +1 members of H whose intersetion is (d s )-dimensional. If s < s, then this implies the existene of s + 1 s members of H H, whose intersetion is of dimension d s < d. This ontradits the fat that the intersetion of every s members of H is d-dimensional. Thus, s = s, and onsequently, d = d s = d s. Therefore C is ontained in a (d s)-dimensional polyhedron I whih is the intersetion of the s + 1 losed halfspaes of H. Let H 1,..., H s+1 be the omplementary open halfspaes of members of H, and reall that eah H i ontains at most α 1 points of P. Let I be the omplement of I. Then, n = I I = I H 1 H s+1 I + H H s+1 I + (s + 1)(α 1), where we abuse the notations I, I, and H i to refer to the subset of points of P that they ontain. This inequality implies that I ontains at least n (s + 1)(α 1) points of P. This finishes the proof of the theorem exept for the part that P is in general position. Now, assume that P is in general position and n d + 3. By the definition of general position, the number of points of P in a (d s)-dimensional flat is not more than d s+1. Sine I is (d s)-dimensional, this implies that n (s + 1)(α 1) d s + 1. Notie that n is of the form k(d + 1) + i for some integer k 1 and some i {0, 1,..., d}. Moreover, if i is 0 or 1, then k 2 beause n d + 3. Now we onsider two ases depending on whether or not i is 0. If i = 0, then α = k. In this ase, the above inequality simplifies to k(d s) d 2s, whih is not possible beause k 2 and d s 1. If i {1,..., d}, then α = k + 1. In this ase, the above inequality simplifies to (k 1)(d s) + i 1, whih is not possible unless d = s and i = 1. Thus, for the above inequality to hold we should have d = s and i = 1. These two assertions imply that n = k(d + 1) + 1, and that I is 0-dimensional and onsists of one point of P. Sine C I and C is not empty, C also onsists of one point of P. Referenes [1] O. Aihholzer, T. Hakl, M. Korman, M. J. van Kreveld, M. Löffler, A. Pilz, B. Spekmann, and E. Welzl. Paking plane spanning trees and paths in omplete geometri graphs. Information Proessing Letters, 124:35 41, Also in CCCG 14, pages [2] B. Aronov, P. Erdös, W. Goddard, D. J. Kleitman, M. Klugerman, J. Pah, and L. J. Shulman. Crossing families. Combinatoria, 14(2): , Also in SoCG 91, pages [3] F. Bernhart and P. C. Kainen. The book thikness of a graph. Journal of Combinatorial Theory, Series B, 27(3): , [4] A. Biniaz, P. Bose, A. Maheshwari, and M. H. M. Smid. Paking plane perfet mathings into a point set. Disrete Mathematis & Theoretial Computer Siene, 17(2): , [5] P. Bose, F. Hurtado, E. Rivera-Campo, and D. R. Wood. Partitions of omplete geometri graphs into plane trees. Computational Geometry: Theory and Appliations, 34(2): , [6] T. M. Chan. An optimal randomized algorithm for maximum tukey depth. In Proeedings of the 15th Annual ACM-SIAM Symposium on Disrete Algorithms, SODA, pages , [7] H. Edelsbrunner. Algorithms in Combinatorial Geometry. Springer, [8] B. Grünbaum. The dimension of intersetions of onvex sets. Paifi Journal of Mathematis, 12(1): , 1962.
5 [9] S. Jadhav and A. Mukhopadhyay. Computing a enterpoint of a finite planar set of points in linear time. Disrete & Computational Geometry, 12: , [10] S. Kundu. Bounds on the number of disjoint spanning trees. Journal of Combinatorial Theory, Series B, 17(2): , [11] C. St. J. A. Nash-Williams. Edge-disjoint spanning trees of finite graphs. Journal of the London Mathematial Soiety, 36(1): , [12] P. Shnider. Paking plane spanning double stars into omplete geometri graphs. In Proeedings of the 32nd European Workshop on Computational Geometry, EuroCG, pages 91 94, [13] W. T. Tutte. On the problem of deomposing a graph into n onneted fators. Journal of the London Mathematial Soiety, 36(1): , 1961.
Ordered fields and the ultrafilter theorem
F U N D A M E N T A MATHEMATICAE 59 (999) Ordered fields and the ultrafilter theorem by R. B e r r (Dortmund), F. D e l o n (Paris) and J. S h m i d (Dortmund) Abstrat. We prove that on the basis of ZF
More informationOn Component Order Edge Reliability and the Existence of Uniformly Most Reliable Unicycles
Daniel Gross, Lakshmi Iswara, L. William Kazmierzak, Kristi Luttrell, John T. Saoman, Charles Suffel On Component Order Edge Reliability and the Existene of Uniformly Most Reliable Uniyles DANIEL GROSS
More informationNonreversibility of Multiple Unicast Networks
Nonreversibility of Multiple Uniast Networks Randall Dougherty and Kenneth Zeger September 27, 2005 Abstrat We prove that for any finite direted ayli network, there exists a orresponding multiple uniast
More informationA Characterization of Wavelet Convergence in Sobolev Spaces
A Charaterization of Wavelet Convergene in Sobolev Spaes Mark A. Kon 1 oston University Louise Arakelian Raphael Howard University Dediated to Prof. Robert Carroll on the oasion of his 70th birthday. Abstrat
More informationSufficient Conditions for a Flexible Manufacturing System to be Deadlocked
Paper 0, INT 0 Suffiient Conditions for a Flexile Manufaturing System to e Deadloked Paul E Deering, PhD Department of Engineering Tehnology and Management Ohio University deering@ohioedu Astrat In reent
More informationEDGE-DISJOINT CLIQUES IN GRAPHS WITH HIGH MINIMUM DEGREE
EDGE-DISJOINT CLIQUES IN GRAPHS WITH HIGH MINIMUM DEGREE RAPHAEL YUSTER Abstrat For a graph G and a fixed integer k 3, let ν k G) denote the maximum number of pairwise edge-disjoint opies of K k in G For
More informationLECTURE NOTES FOR , FALL 2004
LECTURE NOTES FOR 18.155, FALL 2004 83 12. Cone support and wavefront set In disussing the singular support of a tempered distibution above, notie that singsupp(u) = only implies that u C (R n ), not as
More informationWe will show that: that sends the element in π 1 (P {z 1, z 2, z 3, z 4 }) represented by l j to g j G.
1. Introdution Square-tiled translation surfaes are lattie surfaes beause they are branhed overs of the flat torus with a single branhed point. Many non-square-tiled examples of lattie surfaes arise from
More informationarxiv: v2 [cs.dm] 4 May 2018
Disrete Morse theory for the ollapsibility of supremum setions Balthazar Bauer INRIA, DIENS, PSL researh, CNRS, Paris, Frane Luas Isenmann LIRMM, Université de Montpellier, CNRS, Montpellier, Frane arxiv:1803.09577v2
More informationarxiv:math/ v1 [math.ca] 27 Nov 2003
arxiv:math/011510v1 [math.ca] 27 Nov 200 Counting Integral Lamé Equations by Means of Dessins d Enfants Sander Dahmen November 27, 200 Abstrat We obtain an expliit formula for the number of Lamé equations
More informationSome GIS Topological Concepts via Neutrosophic Crisp Set Theory
New Trends in Neutrosophi Theory and Appliations A.A.SALAMA, I.M.HANAFY, HEWAYDA ELGHAWALBY 3, M.S.DABASH 4,2,4 Department of Mathematis and Computer Siene, Faulty of Sienes, Port Said University, Egypt.
More informationHankel Optimal Model Order Reduction 1
Massahusetts Institute of Tehnology Department of Eletrial Engineering and Computer Siene 6.245: MULTIVARIABLE CONTROL SYSTEMS by A. Megretski Hankel Optimal Model Order Redution 1 This leture overs both
More informationModal Horn Logics Have Interpolation
Modal Horn Logis Have Interpolation Marus Kraht Department of Linguistis, UCLA PO Box 951543 405 Hilgard Avenue Los Angeles, CA 90095-1543 USA kraht@humnet.ula.de Abstrat We shall show that the polymodal
More informationSome Properties on Nano Topology Induced by Graphs
AASCIT Journal of anosiene 2017; 3(4): 19-23 http://wwwaasitorg/journal/nanosiene ISS: 2381-1234 (Print); ISS: 2381-1242 (Online) Some Properties on ano Topology Indued by Graphs Arafa asef 1 Abd El Fattah
More informationc-perfect Hashing Schemes for Binary Trees, with Applications to Parallel Memories
-Perfet Hashing Shemes for Binary Trees, with Appliations to Parallel Memories (Extended Abstrat Gennaro Cordaso 1, Alberto Negro 1, Vittorio Sarano 1, and Arnold L.Rosenberg 2 1 Dipartimento di Informatia
More information(q) -convergence. Comenius University, Bratislava, Slovakia
Annales Mathematiae et Informatiae 38 (2011) pp. 27 36 http://ami.ektf.hu On I (q) -onvergene J. Gogola a, M. Mačaj b, T. Visnyai b a University of Eonomis, Bratislava, Slovakia e-mail: gogola@euba.sk
More informationSolutions Manual. Selected odd-numbered problems in. Chapter 2. for. Proof: Introduction to Higher Mathematics. Seventh Edition
Solutions Manual Seleted odd-numbered problems in Chapter for Proof: Introdution to Higher Mathematis Seventh Edition Warren W. Esty and Norah C. Esty 5 4 3 1 Setion.1. Sentenes with One Variable Chapter
More informationJournal of Inequalities in Pure and Applied Mathematics
Journal of Inequalities in Pure and Applied Mathematis A NEW ARRANGEMENT INEQUALITY MOHAMMAD JAVAHERI University of Oregon Department of Mathematis Fenton Hall, Eugene, OR 97403. EMail: javaheri@uoregon.edu
More informationWhere as discussed previously we interpret solutions to this partial differential equation in the weak sense: b
Consider the pure initial value problem for a homogeneous system of onservation laws with no soure terms in one spae dimension: Where as disussed previously we interpret solutions to this partial differential
More informationEstimating the probability law of the codelength as a function of the approximation error in image compression
Estimating the probability law of the odelength as a funtion of the approximation error in image ompression François Malgouyres Marh 7, 2007 Abstrat After some reolletions on ompression of images using
More informationarxiv:math.co/ v1 2 Aug 2006
A CHARACTERIZATION OF THE TUTTE POLYNOMIAL VIA COMBINATORIAL EMBEDDINGS OLIVIER BERNARDI arxiv:math.co/0608057 v1 2 Aug 2006 Abstrat. We give a new haraterization of the Tutte polynomial of graphs. Our
More informationChapter 8 Hypothesis Testing
Leture 5 for BST 63: Statistial Theory II Kui Zhang, Spring Chapter 8 Hypothesis Testing Setion 8 Introdution Definition 8 A hypothesis is a statement about a population parameter Definition 8 The two
More informationA Functional Representation of Fuzzy Preferences
Theoretial Eonomis Letters, 017, 7, 13- http://wwwsirporg/journal/tel ISSN Online: 16-086 ISSN Print: 16-078 A Funtional Representation of Fuzzy Preferenes Susheng Wang Department of Eonomis, Hong Kong
More informationAfter the completion of this section the student should recall
Chapter I MTH FUNDMENTLS I. Sets, Numbers, Coordinates, Funtions ugust 30, 08 3 I. SETS, NUMERS, COORDINTES, FUNCTIONS Objetives: fter the ompletion of this setion the student should reall - the definition
More informationSQUARE ROOTS AND AND DIRECTIONS
SQUARE ROOS AND AND DIRECIONS We onstrut a lattie-like point set in the Eulidean plane that eluidates the relationship between the loal statistis of the frational parts of n and diretions in a shifted
More informationSensitivity Analysis in Markov Networks
Sensitivity Analysis in Markov Networks Hei Chan and Adnan Darwihe Computer Siene Department University of California, Los Angeles Los Angeles, CA 90095 {hei,darwihe}@s.ula.edu Abstrat This paper explores
More informationSearching All Approximate Covers and Their Distance using Finite Automata
Searhing All Approximate Covers and Their Distane using Finite Automata Ondřej Guth, Bořivoj Melihar, and Miroslav Balík České vysoké učení tehniké v Praze, Praha, CZ, {gutho1,melihar,alikm}@fel.vut.z
More informationSuper edge-magic total labeling of a tree
Super edge-magi total labeling of a tree K. Ali, M. Hussain, A. Razzaq Department of Mathematis, COMSATS Institute of Information Tehnology, Lahore, Pakistan. {akashifali, mhmaths, asimrzq}@gmail.om Abstrat.
More informationTight bounds for selfish and greedy load balancing
Tight bounds for selfish and greedy load balaning Ioannis Caragiannis Mihele Flammini Christos Kaklamanis Panagiotis Kanellopoulos Lua Mosardelli Deember, 009 Abstrat We study the load balaning problem
More informationarxiv:math/ v4 [math.ca] 29 Jul 2006
arxiv:math/0109v4 [math.ca] 9 Jul 006 Contiguous relations of hypergeometri series Raimundas Vidūnas University of Amsterdam Abstrat The 15 Gauss ontiguous relations for F 1 hypergeometri series imply
More informationComputer Science 786S - Statistical Methods in Natural Language Processing and Data Analysis Page 1
Computer Siene 786S - Statistial Methods in Natural Language Proessing and Data Analysis Page 1 Hypothesis Testing A statistial hypothesis is a statement about the nature of the distribution of a random
More informationComplexity of Regularization RBF Networks
Complexity of Regularization RBF Networks Mark A Kon Department of Mathematis and Statistis Boston University Boston, MA 02215 mkon@buedu Leszek Plaskota Institute of Applied Mathematis University of Warsaw
More informationCounting Idempotent Relations
Counting Idempotent Relations Beriht-Nr. 2008-15 Florian Kammüller ISSN 1436-9915 2 Abstrat This artile introdues and motivates idempotent relations. It summarizes haraterizations of idempotents and their
More informationMaximum Entropy and Exponential Families
Maximum Entropy and Exponential Families April 9, 209 Abstrat The goal of this note is to derive the exponential form of probability distribution from more basi onsiderations, in partiular Entropy. It
More informationG-subsets and G-orbits of Q ( n) under action of the Modular Group.
arxiv:1009.4619v1 [math.gr] 23 Sep 2010 G-subsets and G-orbits of Q ( n) under ation of the Modular Group. M. Aslam Malik and M. Riaz Department of Mathematis, University of the Punjab, Quaid-e-Azam Campus,
More information15.12 Applications of Suffix Trees
248 Algorithms in Bioinformatis II, SoSe 07, ZBIT, D. Huson, May 14, 2007 15.12 Appliations of Suffix Trees 1. Searhing for exat patterns 2. Minimal unique substrings 3. Maximum unique mathes 4. Maximum
More informationVolume 29, Issue 3. On the definition of nonessentiality. Udo Ebert University of Oldenburg
Volume 9, Issue 3 On the definition of nonessentiality Udo Ebert University of Oldenburg Abstrat Nonessentiality of a good is often used in welfare eonomis, ost-benefit analysis and applied work. Various
More informationCOMPARISON OF GEOMETRIC FIGURES
COMPARISON OF GEOMETRIC FIGURES Spyros Glenis M.Ed University of Athens, Department of Mathematis, e-mail spyros_glenis@sh.gr Introdution the figures: In Eulid, the geometri equality is based on the apability
More informationQuasi-Monte Carlo Algorithms for unbounded, weighted integration problems
Quasi-Monte Carlo Algorithms for unbounded, weighted integration problems Jürgen Hartinger Reinhold F. Kainhofer Robert F. Tihy Department of Mathematis, Graz University of Tehnology, Steyrergasse 30,
More informationThe Effectiveness of the Linear Hull Effect
The Effetiveness of the Linear Hull Effet S. Murphy Tehnial Report RHUL MA 009 9 6 Otober 009 Department of Mathematis Royal Holloway, University of London Egham, Surrey TW0 0EX, England http://www.rhul.a.uk/mathematis/tehreports
More informationA note on the Brownian loop measure
A note on the Brownian loop measure Gregory F. Lawler Department of Mathematis University of Chiago Marh 23, 2009 Abstrat The Brownian loop measure is a onformally invariant measure on loops that also
More informationCMSC 451: Lecture 9 Greedy Approximation: Set Cover Thursday, Sep 28, 2017
CMSC 451: Leture 9 Greedy Approximation: Set Cover Thursday, Sep 28, 2017 Reading: Chapt 11 of KT and Set 54 of DPV Set Cover: An important lass of optimization problems involves overing a ertain domain,
More informationLECTURE 22: MAPPING DEGREE, POINCARE DUALITY
LECTURE 22: APPING DEGREE, POINCARE DUALITY 1. The mapping degree and its appliations Let, N be n-dimensional onneted oriented manifolds, and f : N a proper map. (If is ompat, then any smooth map f : N
More informationControl Theory association of mathematics and engineering
Control Theory assoiation of mathematis and engineering Wojieh Mitkowski Krzysztof Oprzedkiewiz Department of Automatis AGH Univ. of Siene & Tehnology, Craow, Poland, Abstrat In this paper a methodology
More informationarxiv: v1 [cs.fl] 5 Dec 2009
Quotient Complexity of Closed Languages Janusz Brzozowski 1, Galina Jirásková 2, and Chenglong Zou 1 arxiv:0912.1034v1 [s.fl] 5 De 2009 1 David R. Cheriton Shool of Computer Siene, University of Waterloo,
More informationParallel disrete-event simulation is an attempt to speed-up the simulation proess through the use of multiple proessors. In some sense parallel disret
Exploiting intra-objet dependenies in parallel simulation Franeso Quaglia a;1 Roberto Baldoni a;2 a Dipartimento di Informatia e Sistemistia Universita \La Sapienza" Via Salaria 113, 198 Roma, Italy Abstrat
More informationSOA/CAS MAY 2003 COURSE 1 EXAM SOLUTIONS
SOA/CAS MAY 2003 COURSE 1 EXAM SOLUTIONS Prepared by S. Broverman e-mail 2brove@rogers.om website http://members.rogers.om/2brove 1. We identify the following events:. - wathed gymnastis, ) - wathed baseball,
More informationWord of Mass: The Relationship between Mass Media and Word-of-Mouth
Word of Mass: The Relationship between Mass Media and Word-of-Mouth Roman Chuhay Preliminary version Marh 6, 015 Abstrat This paper studies the optimal priing and advertising strategies of a firm in the
More informationUNIVERSAL POISSON AND NORMAL LIMIT THEOREMS IN GRAPH COLORING PROBLEMS WITH CONNECTIONS TO EXTREMAL COMBINATORICS
UNIVERSAL POISSON AND NORMAL LIMIT THEOREMS IN GRAPH COLORING PROBLEMS WITH CONNECTIONS TO EXTREMAL COMBINATORICS BHASWAR B. BHATTACHARYA, PERSI DIACONIS, AND SUMIT MUKHERJEE Abstrat. This paper proves
More informationarxiv:math/ v1 [math.ac] 10 Mar 2005
arxiv:math/0503187v1 [math.ac] 10 Mar 2005 STANLEY REISNER RINGS WITH LARGE MULTIPLICITIES ARE COHEN MACAULAY NAOKI TERAI AND KEN-ICHI YOSHIDA Abstrat. We prove that ertain lass of Stanley Reisner rings
More informationConvergence of reinforcement learning with general function approximators
Convergene of reinforement learning with general funtion approximators assilis A. Papavassiliou and Stuart Russell Computer Siene Division, U. of California, Berkeley, CA 94720-1776 fvassilis,russellg@s.berkeley.edu
More informationCounting Arbitrary Subgraphs in Data Streams
Counting Arbitrary Subgraphs in Data Streams Daniel M. Kane 1, Kurt Mehlhorn, Thomas Sauerwald, and He Sun 1 Department of Mathematis, Stanford University, USA Max Plank Institute for Informatis, Germany
More informationThe law of the iterated logarithm for c k f(n k x)
The law of the iterated logarithm for k fn k x) Christoph Aistleitner Abstrat By a lassial heuristis, systems of the form osπn k x) k 1 and fn k x)) k 1, where n k ) k 1 is a rapidly growing sequene of
More informationA Recursive Approach to the Kauffman Bracket
Applied Mathematis, 204, 5, 2746-2755 Published Online Otober 204 in SiRes http://wwwsirporg/journal/am http://ddoiorg/04236/am20457262 A Reursive Approah to the Kauffman Braet Abdul Rauf Nizami, Mobeen
More informationG /G Advanced Cryptography 10/21/2009. Lecture 7
G22.3220-001/G63.2180 Advaned Cryptography 10/21/2009 Leturer: Yevgeniy Dodis Leture 7 Sribe: Aris Tentes In this leture we will over the following topis: Witness Hiding Σ-protools Alternative Constrution
More informationa n z n, (1.1) As usual, we denote by S the subclass of A consisting of functions which are also univalent in U.
MATEMATIQKI VESNIK 65, 3 (2013), 373 382 September 2013 originalni nauqni rad researh paper CERTAIN SUFFICIENT CONDITIONS FOR A SUBCLASS OF ANALYTIC FUNCTIONS ASSOCIATED WITH HOHLOV OPERATOR S. Sivasubramanian,
More informationFlexible Word Design and Graph Labeling
Flexible Word Design and Graph Labeling Ming-Yang Kao Manan Sanghi Robert Shweller Abstrat Motivated by emerging appliations for DNA ode word design, we onsider a generalization of the ode word design
More informationREFINED UPPER BOUNDS FOR THE LINEAR DIOPHANTINE PROBLEM OF FROBENIUS. 1. Introduction
Version of 5/2/2003 To appear in Advanes in Applied Mathematis REFINED UPPER BOUNDS FOR THE LINEAR DIOPHANTINE PROBLEM OF FROBENIUS MATTHIAS BECK AND SHELEMYAHU ZACKS Abstrat We study the Frobenius problem:
More informationThe Unified Geometrical Theory of Fields and Particles
Applied Mathematis, 014, 5, 347-351 Published Online February 014 (http://www.sirp.org/journal/am) http://dx.doi.org/10.436/am.014.53036 The Unified Geometrial Theory of Fields and Partiles Amagh Nduka
More informationKRANNERT GRADUATE SCHOOL OF MANAGEMENT
KRANNERT GRADUATE SCHOOL OF MANAGEMENT Purdue University West Lafayette, Indiana A Comment on David and Goliath: An Analysis on Asymmetri Mixed-Strategy Games and Experimental Evidene by Emmanuel Dehenaux
More informationProduct Policy in Markets with Word-of-Mouth Communication. Technical Appendix
rodut oliy in Markets with Word-of-Mouth Communiation Tehnial Appendix August 05 Miro-Model for Inreasing Awareness In the paper, we make the assumption that awareness is inreasing in ustomer type. I.e.,
More informationarxiv: v1 [math.co] 16 May 2016
arxiv:165.4694v1 [math.co] 16 May 216 EHRHART POLYNOMIALS OF 3-DIMENSIONAL SIMPLE INTEGRAL CONVEX POLYTOPES YUSUKE SUYAMA Abstrat. We give an expliit formula on the Ehrhart polynomial of a 3- dimensional
More informationON LOWER LIPSCHITZ CONTINUITY OF MINIMAL POINTS. Ewa M. Bednarczuk
Disussiones Mathematiae Differential Inlusions, Control and Optimization 20 2000 ) 245 255 ON LOWER LIPSCHITZ CONTINUITY OF MINIMAL POINTS Ewa M. Bednarzuk Systems Researh Institute, PAS 01 447 Warsaw,
More informationRobust Flight Control Design for a Turn Coordination System with Parameter Uncertainties
Amerian Journal of Applied Sienes 4 (7): 496-501, 007 ISSN 1546-939 007 Siene Publiations Robust Flight ontrol Design for a urn oordination System with Parameter Unertainties 1 Ari Legowo and Hiroshi Okubo
More informationSensitivity analysis for linear optimization problem with fuzzy data in the objective function
Sensitivity analysis for linear optimization problem with fuzzy data in the objetive funtion Stephan Dempe, Tatiana Starostina May 5, 2004 Abstrat Linear programming problems with fuzzy oeffiients in the
More informationarxiv:physics/ v1 [physics.class-ph] 8 Aug 2003
arxiv:physis/0308036v1 [physis.lass-ph] 8 Aug 003 On the meaning of Lorentz ovariane Lszl E. Szab Theoretial Physis Researh Group of the Hungarian Aademy of Sienes Department of History and Philosophy
More informationStudy of EM waves in Periodic Structures (mathematical details)
Study of EM waves in Periodi Strutures (mathematial details) Massahusetts Institute of Tehnology 6.635 partial leture notes 1 Introdution: periodi media nomenlature 1. The spae domain is defined by a basis,(a
More informationA NETWORK SIMPLEX ALGORITHM FOR THE MINIMUM COST-BENEFIT NETWORK FLOW PROBLEM
NETWORK SIMPLEX LGORITHM FOR THE MINIMUM COST-BENEFIT NETWORK FLOW PROBLEM Cen Çalışan, Utah Valley University, 800 W. University Parway, Orem, UT 84058, 801-863-6487, en.alisan@uvu.edu BSTRCT The minimum
More informationLightpath routing for maximum reliability in optical mesh networks
Vol. 7, No. 5 / May 2008 / JOURNAL OF OPTICAL NETWORKING 449 Lightpath routing for maximum reliability in optial mesh networks Shengli Yuan, 1, * Saket Varma, 2 and Jason P. Jue 2 1 Department of Computer
More informationQ2. [40 points] Bishop-Hill Model: Calculation of Taylor Factors for Multiple Slip
27-750, A.D. Rollett Due: 20 th Ot., 2011. Homework 5, Volume Frations, Single and Multiple Slip Crystal Plastiity Note the 2 extra redit questions (at the end). Q1. [40 points] Single Slip: Calulating
More informationThe Hanging Chain. John McCuan. January 19, 2006
The Hanging Chain John MCuan January 19, 2006 1 Introdution We onsider a hain of length L attahed to two points (a, u a and (b, u b in the plane. It is assumed that the hain hangs in the plane under a
More informationDiscrete Bessel functions and partial difference equations
Disrete Bessel funtions and partial differene equations Antonín Slavík Charles University, Faulty of Mathematis and Physis, Sokolovská 83, 186 75 Praha 8, Czeh Republi E-mail: slavik@karlin.mff.uni.z Abstrat
More informationSURFACE WAVES OF NON-RAYLEIGH TYPE
SURFACE WAVES OF NON-RAYLEIGH TYPE by SERGEY V. KUZNETSOV Institute for Problems in Mehanis Prosp. Vernadskogo, 0, Mosow, 75 Russia e-mail: sv@kuznetsov.msk.ru Abstrat. Existene of surfae waves of non-rayleigh
More informationMaxmin expected utility through statewise combinations
Eonomis Letters 66 (2000) 49 54 www.elsevier.om/ loate/ eonbase Maxmin expeted utility through statewise ombinations Ramon Casadesus-Masanell, Peter Klibanoff, Emre Ozdenoren* Department of Managerial
More informationKakimizu complexes of Surfaces and 3-Manifolds
Kakimizu omplexes of Surfaes and 3-Manifolds Jennifer Shultens April 29, 2016 Abstrat The Kakimizu omplex is usually defined in the ontext of knots, where it is known to be quasi-eulidean. We here generalize
More informationSequence Analysis, WS 14/15, D. Huson & R. Neher (this part by D. Huson & J. Fischer) January 21,
Sequene Analysis, WS 14/15, D. Huson & R. Neher (this part by D. Huson & J. Fisher) January 21, 201511 9 Suffix Trees and Suffix Arrays This leture is based on the following soures, whih are all reommended
More informationmax min z i i=1 x j k s.t. j=1 x j j:i T j
AM 221: Advaned Optimization Spring 2016 Prof. Yaron Singer Leture 22 April 18th 1 Overview In this leture, we will study the pipage rounding tehnique whih is a deterministi rounding proedure that an be
More informationStochastic Combinatorial Optimization with Risk Evdokia Nikolova
Computer Siene and Artifiial Intelligene Laboratory Tehnial Report MIT-CSAIL-TR-2008-055 September 13, 2008 Stohasti Combinatorial Optimization with Risk Evdokia Nikolova massahusetts institute of tehnology,
More informationTHE BORELL-EHRHARD GAME
THE BORELL-EHRHARD GAME RAMON VAN HANDEL Abstrat. A preise desription of the onvexity of Gaussian measures is provided by sharp Brunn-Minkowski type inequalities due to Ehrhard and Borell. We show that
More informationConformal Mapping among Orthogonal, Symmetric, and Skew-Symmetric Matrices
AAS 03-190 Conformal Mapping among Orthogonal, Symmetri, and Skew-Symmetri Matries Daniele Mortari Department of Aerospae Engineering, Texas A&M University, College Station, TX 77843-3141 Abstrat This
More informationCoefficients of the Inverse of Strongly Starlike Functions
BULLETIN of the MALAYSIAN MATHEMATICAL SCIENCES SOCIETY Bull. Malaysian Math. S. So. (Seond Series) 6 (00) 6 7 Coeffiients of the Inverse of Strongly Starlie Funtions ROSIHAN M. ALI Shool of Mathematial
More informationOn maximal inequalities via comparison principle
Makasu Journal of Inequalities and Appliations (2015 2015:348 DOI 10.1186/s13660-015-0873-3 R E S E A R C H Open Aess On maximal inequalities via omparison priniple Cloud Makasu * * Correspondene: makasu@uw.a.za
More informationMath 225B: Differential Geometry, Homework 6
ath 225B: Differential Geometry, Homework 6 Ian Coley February 13, 214 Problem 8.7. Let ω be a 1-form on a manifol. Suppose that ω = for every lose urve in. Show that ω is exat. We laim that this onition
More informationIndian Institute of Technology Bombay. Department of Electrical Engineering. EE 325 Probability and Random Processes Lecture Notes 3 July 28, 2014
Indian Institute of Tehnology Bombay Department of Eletrial Engineering Handout 5 EE 325 Probability and Random Proesses Leture Notes 3 July 28, 2014 1 Axiomati Probability We have learned some paradoxes
More informationComputing 2-Walks in Cubic Time
Computing 2-Walks in Cubi Time Anreas Shmi Max Plank Institute for Informatis Jens M. Shmit Tehnishe Universität Ilmenau Abstrat A 2-walk of a graph is a walk visiting every vertex at least one an at most
More informationAdvanced Computational Fluid Dynamics AA215A Lecture 4
Advaned Computational Fluid Dynamis AA5A Leture 4 Antony Jameson Winter Quarter,, Stanford, CA Abstrat Leture 4 overs analysis of the equations of gas dynamis Contents Analysis of the equations of gas
More informationWHAT DOES THE CLASSIFYING SPACE OF A CATEGORY CLASSIFY? Introduction. Homology, Homotopy and Applications, vol. 7(1), 2005, pp MICHAEL WEISS
Homology, Homotopy and Appliations, vol. 7(1), 2005, pp.185 195 Introdution WHAT DOES THE CLASSIFYING SPACE OF A CATEGORY CLASSIFY? MICHAEL WEISS (ommuniated by Graham Ellis) Abstrat The lassifying spae
More informationEffective Resistances for Ladder Like Chains
Effetive Resistanes for Ladder Like Chains Carmona, A., Eninas, A.M., Mitjana, M. May 9, 04 Abstrat Here we onsider a lass of generalized linear hains; that is, the ladder like hains as a perturbation
More informationSingular Event Detection
Singular Event Detetion Rafael S. Garía Eletrial Engineering University of Puerto Rio at Mayagüez Rafael.Garia@ee.uprm.edu Faulty Mentor: S. Shankar Sastry Researh Supervisor: Jonathan Sprinkle Graduate
More informationDifferential Equations 8/24/2010
Differential Equations A Differential i Equation (DE) is an equation ontaining one or more derivatives of an unknown dependant d variable with respet to (wrt) one or more independent variables. Solution
More informationMoments and Wavelets in Signal Estimation
Moments and Wavelets in Signal Estimation Edward J. Wegman 1 Center for Computational Statistis George Mason University Hung T. Le 2 International usiness Mahines Abstrat: The problem of generalized nonparametri
More informationSoft BCL-Algebras of the Power Sets
International Journal of lgebra, Vol. 11, 017, no. 7, 39-341 HIKRI Ltd, www.m-hikari.om https://doi.org/10.1988/ija.017.7735 Soft BCL-lgebras of the Power Sets Shuker Mahmood Khalil 1 and bu Firas Muhamad
More informationAharonov-Bohm effect. Dan Solomon.
Aharonov-Bohm effet. Dan Solomon. In the figure the magneti field is onfined to a solenoid of radius r 0 and is direted in the z- diretion, out of the paper. The solenoid is surrounded by a barrier that
More information7 Max-Flow Problems. Business Computing and Operations Research 608
7 Max-Flow Problems Business Computing and Operations Researh 68 7. Max-Flow Problems In what follows, we onsider a somewhat modified problem onstellation Instead of osts of transmission, vetor now indiates
More informationTests of fit for symmetric variance gamma distributions
Tests of fit for symmetri variane gamma distributions Fragiadakis Kostas UADPhilEon, National and Kapodistrian University of Athens, 4 Euripidou Street, 05 59 Athens, Greee. Keywords: Variane Gamma Distribution,
More informationProbabilistic and nondeterministic aspects of Anonymity 1
MFPS XX1 Preliminary Version Probabilisti and nondeterministi aspets of Anonymity 1 Catusia Palamidessi 2 INRIA and LIX Éole Polytehnique, Rue de Salay, 91128 Palaiseau Cedex, FRANCE Abstrat Anonymity
More informationMost results in this section are stated without proof.
Leture 8 Level 4 v2 he Expliit formula. Most results in this setion are stated without proof. Reall that we have shown that ζ (s has only one pole, a simple one at s =. It has trivial zeros at the negative
More informationSINCE Zadeh s compositional rule of fuzzy inference
IEEE TRANSACTIONS ON FUZZY SYSTEMS, VOL. 14, NO. 6, DECEMBER 2006 709 Error Estimation of Perturbations Under CRI Guosheng Cheng Yuxi Fu Abstrat The analysis of stability robustness of fuzzy reasoning
More informationMillennium Relativity Acceleration Composition. The Relativistic Relationship between Acceleration and Uniform Motion
Millennium Relativity Aeleration Composition he Relativisti Relationship between Aeleration and niform Motion Copyright 003 Joseph A. Rybzyk Abstrat he relativisti priniples developed throughout the six
More informationParametric Linear Complementarity Problems. Klaus Tammer. Humboldt-Universitat Berlin, FB Mathematik, Unter den Linden 6, D Berlin, Germany
Parametri Linear Complementarity Problems Klaus Tammer Humboldt-Universitat Berlin, FB Mathematik, Unter den Linden 6, D-10099 Berlin, Germany Abstrat We study linear omplementarity problems depending
More information