Geometric drawings of K n with few crossings
|
|
- Leslie Baldwin
- 6 years ago
- Views:
Transcription
1 Geometrc drawngs of K n wth few crossngs Bernardo M. Ábrego, Slva Fernández-Merchant Calforna State Unversty Northrdge {bernardo.abrego,slva.fernandez}@csun.edu ver 9 Abstract We gve a new upper bound for the rectlnear crossng number cr(n) of the complete geometrc graph K n.weprovethatcr(n) n + Θ(n 3 ) by means of a new constructon based on an teratve duplcaton strategy startng wth a set havng a certan structure of halvng lnes. Keywords: Rectlnear crossng number, crossng number, geometrc graph, complete graph, convex quadrlateral. AMS Subect Classfcaton: 05C62, 52A10, 52A22, 52C10. 1 Introducton The crossng number cr (G) of a smple graph G s the mnmum number of edge crossngs n any drawng of G n the plane, where each edge s a smple curve. The rectlnear crossng number cr (G) s the mnmum number of edge crossngs n any geometrc drawng of G, thatsadrawngofg n the plane where the vertces are ponts n general poston and the edges are straght segments. The crossng numbers have many applcatons to Dscrete Geometry and Computer Scence, see for example [9] and [10]. In ths paper we contrbute to the problem of determnng cr (K n ),wherek n denotes the complete graph on n vertces. Specfcally, we construct geometrc drawngs of K n wth a small number of crossngs. For smplcty we wrte cr (n) =cr (K n ). We note that a geometrc drawng of K n s determned by the locaton of ts vertces and two edges cross each other f and only f the quadrlateral determned by ther vertces s convex. Thus our drawngs also provde constructons of n-element pont sets wth small number of convex quadrlaterals determned by the n ponts. The problem of fndng the asymptotc behavor of cr (n) s also mportant because of ts close relaton to Sylvester s four pont problem [13]: determne the probablty that four ponts selected unformly at random on a gven doman, form a convex quadrlateral. It s easy to see that {cr (n) / n } s a non-decreasng sequence bounded above by 1. Thus v = lm n cr (n) / n exsts, and Schenerman and Wlf [12] proved that v s the nfmum, over all open sets R wth fnte area, of the probablty that four randomly chosen ponts n R are n convex poston. When ths problem was frst nvestgated, the best lower bounds were obtaned by usng an averagng argument over subsets whose crossng numbers were known. For example, t s well known that cr(5) = 1, so by countng the crossngs generated by every subset of sze 5 t s easy to get cr(n) (1/5) n. Wagner [1] was the frsttouseadfferent approach, he proved v Then the authors [1] and ndependently Lovasz et al. [8], used allowable sequences to prove v 3/8 = Lovasz et al. [8] managed to even mprove ths v by 10 5, and Balogh and Salazar [5] refned ths technque even further to obtan the currently best bound of v The hstory of the mprovements on the upper bounds s as follows: In the early seventes Jensen [7] and Snger [11] obtaned v 7/18 < , andv 5/13 < respectvely. Much later Brodsky et al. [6] constructed pont sets wth nested non-concentrc trangles yeldng 1
2 v 667/1688 < Then Achholzer et al. [3] devsed a lense-replacement constructon dependng on a sutable ntal set. They obtaned v and later on Jensen provded a better ntal set [], whch gave the prevously known best bound of v In ths paper we prove the followng, Theorem 1 cr(n) n + Θ(n 3 ) < ( ) n Ths theorem s based on the followng stronger result whch may mprove the upper bound n the future. To accomplsh ths we would only need a pont-set P havng a halvng-lne matchng (defnednext)andwthabetter n coeffcent. Theorem 2 If P s a N-element pont set n general poston, wth N even, and P has a halvng-lne matchng; then µ 2 cr(p )+3N 3 7N 2 +(30/7)N cr(n) N µ n Let P = {p 1,p 2,...,p N } be a general poston pont set n the plane. We defne a halvng lne of P as a lne passng through two ponts n P and leavng the same number of ponts of P on ether sde of the lne. Accordng to ths, N needs to be even for P to have a halvng lne. Consder a bpartte graph G =(P, H) where H s the set of halvng lnes of P and p P s adacent to l H f p s on the lne l. If there s a matchng for P n the graph G we say that ths matchng s a halvng-lne matchng of P. Note that such a matchng nduces a functon on P, p 7 p f(),suchthatp p f() s a halvng lne of P. In general, most even sets P mnmzng the crossng number have a large number of halvng lnes and consequently most of these sets have a halvng-lne matchng. The only excepton seems to be P, the set consstng of a trangle wth a pont nsde. Ths set acheves cr() = 0 but t only has three halvng lnes. The prevously best upper bound, obtaned by Achholzer et al. [3], used a lens-replacement constructon yeldng µ 2 cr(p )+3N 3 7N 2 µ +6N n cr(n) N + Θ(n 3 ) (1) for any ntal pont set P wth N elements, N even. Jensen (reported n []) dscovered a set of 36 ponts wth crossngs whch happened to be the best ntal set known at the tme. The bound obtaned s cr(n) ( ) n Note that our constructon from Theorem 2 always gves a better bound compared to (1) as long as the startng set P has a halvng-lne matchng. 2 The Constructon The constructon s based on the followng lemma, Lemma 3 If P s a N-element pont set, N even, and P has a halvng-lne matchng; then there s a pont set Q = Q(P ) n general poston, Q =2N, Q also has a halvng-lne matchng, and cr(q) =16cr(P )+(N/2)(2N 2 7N +5). Proof. Q s constructed as follows. Each pont p P wll be replaced by a par of ponts q 1 and q 2. Usng the functon f nducedbythehalvng-lnematchngwedefne q 1 = p + ε p f() p p f() p and q 2 = p ε p f() p p f() p, where ε s small enough so that all ponts q 1,q 2 comng from a pont p located to the left (rght) of p p f() ; are also located to the left (rght) of the lnes q 1 q f()1 and q 1 q f()2. In other words, the 2
3 cone wth vertex q 1 spanned by the segment q f()1 q f()2 does not contan any of the ponts q x wth 6=, f(). One way to fnd such an ε s the followng: suppose that P scontanednadskwth dameter D, sncep s n general poston there s δ>0 so that the strps of wdth δ centered at the lnes p p f() have only the ponts p and p f() wth P n common. The porton contaned n the dsk of any cone wth center n the lne p p f(),axsp p f(), and wth an openng angle of 2arctan(δ/2D); s a subset of the strp of wdth δ around p p f(). Thus we can start wth a small arbtrary value ε 0 <δsuch that all ponts q 1,q 2 arensdethedsk. Obtanε as the dstance from p f() to the lnes subtendng the cone wth center q 1,axsp p f(), and angle 2arctan(δ/2D). And fnally set ε as the mnmum of all the ε. Fgure 1: Constructon of the set Q From the halvng-lne matchng defnton we deduce that no two ponts n P are assocated to the same halvng lne. Ths, together wth the choce of ε, guarantees that Q s n general poston whenever P s n general poston. By constructon the lne q 1 q 2 s a halvng lne of Q. In addton, snce q 1 s n the nteror of the trangle q 2,q f()1,q f()2 the lne q 1 q f()1 (and also the lne q 1 q f()2 ) s a halvng lne of Q. Then { q 1, q 1 q f()1 : =1, 2,...,N} {(q2, q 1 q 2 ): =1, 2,...,N} s a halvng-lne matchng of Q. Now we proceed to calculate cr(q) by countng crossngs accordng to three dfferent types: Type I Type II(1) Type II(2) Type III = f( ) k k Fgure 2: Dfferent types of crossngs Type I. Two ponts n par and two n par 6=. Thereare N 2 ways of choosng pars and and all of them determne a crossng except when = f() or = f(). Snce there are exactly N pars (, f()), the total number of crossngs n ths case s N 2 N. Type II Two ponts n par and the two other n pars and k all pars dstnct. Frst there are N choces for the par. Thenwehavetwocases,when, k 6= f(), and when ether or k 3
4 equals f(). Inthefrstcase(seeFgure2,TypeII(1)),tohaveacrossng,bothp and p k must be on the same sde of the lne q 1 q 2. Thus there are 2 N/2 1 2 ways of choosng and k and then choces for the second ndces x and y for the ponts q x and q ky. In the second case (see Fgure 2, TypeII(2)) we can assume = f(). Then there are 2 choces for the second ndex x of q x. Agan, to have a crossng, we need q x and p k on the same sde of q 1 q 2. So there are N/2 1 ways of choosng ³ k and 2 choces for the second ndex y of q ky. The total number of Type II crossngs s N 8 N/ (N/2 1). Type III Each pont n a dfferent par. To have a crossng each of the four pars must come from acrossngnp,sotherearecr(p ) possble pars, and there are 2 choces for the second ndex n each par. Thus there are 16cr(P ) number of crossngs of Type III. The lst of crossngs types s complete snce by constructon none of the segments q 1 q 2 partcpate n any crossng. Addng Types I-III yelds the result. n cr(p n ) cr(q(p n )) old bound for cr(2n) new bound for cr(2n) Table 1: Improved bounds for 60,72,and 96 ponts. The strength of ths Lemma can be easly seen when t s appled to the set P 6 that mnmzes cr(6) = 3. We obtan cr(12) cr(q) = 153 whch happens to be the correct value of cr(12) (a drawng s shown n Fgure 1). It took some effort [3] to fnd ths pont set n the past. In addton, f we use the sets P 30,P 36,P 8 obtaned by Acholzer et al., and reported n web page [2], we obtan sets P 60,P 72,P 96 wth less number of crossngs than those prevously known (see Table 1). th pont = p =(x-coordnate,y-coordnate) p 1 = (9259, 16598) p 9 = (2877, 16613) p 17 = (511, 23755) p 25 = (9075, 15320) p 2 = (9763, 16199) p 10 = (15909, 1615) p 18 = (915, 17055) p 26 = (7921, 1307) p 3 = (9977, 16397) p 11 = (96, 15905) p 19 =(0, 3239) p 27 = (5206, 851) p = (1028, 16225) p 12 = (950, 1651) p 20 = (6820, 20921) p 28 = (9121, 15603) p 5 = (10666, 16385) p 13 = (9262, 16627) p 21 = (999, 1615) p 29 = (80, 0) p 6 = (1289, 16335) p 1 = (9282, 1697) p 22 = (9355, 16177) p 30 = (632, 10637) p 7 = (18577, 1651) p 15 = (8912, 17261) p 23 = (919, 15893) p 8 = (10391, 16281) p 16 = (782, 19232) p 2 = (916, 15771) Table 2: Coordnates of pont set P 30 wth 9776 crossngs 3 Proof of the Theorems Let S 0 = P and S k+1 = Q(S k ) for k 0, whereq(s k ) s the set gven by Lemma 3. By nducton and Lemma 3 t follows that cr(s k )=16 k cr(p )+N 3 8 k 1 2 k N 2 k 1 k N2k 1 8 k 1. Lettng n = S k =2 k N we get µ 2cr(P )+3N 3 7N 2 +(30/7)N cr(n) cr(s k )= 2N n 1 8 n n n.
5 a, (a, b) means (p a,p a p b ) 1, (1, 3) 9, (9, 13) 17, (17, 18) 25, (25, 26) 2, (2, ) 10, (10, 11) 18, (18, 19) 26, (26, 27) 3, (3, 7) 11, (11, 12) 19, (19, 21) 27, (27, 28), (, 5) 12, (12, 1) 20, (20, 21) 28, (28, 29) 5, (5, 8) 13, (13, 1) 21, (21, 23) 29, (29, 27) 6, (6, 7) 1, (1, 15) 22, (22, 23) 30, (30, 29) 7, (7, 9) 15, (15, 16) 23, (23, 2) 8, (8, 10) 16, (16, 20) 2, (2, 25) Table 3: Halvng-lne matchng of P 30 Ths proves Theorem 2. Now, to prove Theorem 1, consder the set P = P 30 wth coordnates n Table 2 obtaned from [2]. It satsfes that cr(p 30 ) = 9726 and t can be verfed that the set of pont-lne pars n Table 3 represents a halvng-lne matchng of P 30.Wethenget cr(n) µ n References [1] Ábrego, B., Fernández-Merchant, S.: A Lower Bound for the Rectlnear Crossng Number, Graphs and Combnatorcs, to appear (2005). [2] Achholzer, O.: Rectlnear Crossng Number Page. [3] Achholzer, O., Aurenhammer, F., Krasser, H.: On the crossng number of complete graphs. In: Proc. 18th Ann ACMSympCompGeom., pp. 19-2, Barcelona Span, [] Achholzer, O., Krasser, H.: Abstract order type extensons and new results on the rectlnear crossng number. Submtted. [5] Balogh, J., Salazar G.: On k-sets, quadrlaterals and the rectlnear crossng number of K n.manuscrpt,submtted. [6] Brodsky, A., Durocher, S., Gethner, E.: Toward the rectlnear crossng number of K n : new drawngs, upper bounds, and asymptotcs. Dscrete Mathematcs 262, (2003) [7] Jensen, H.F.: An upper bound for the rectlnear crossng number of the complete graph. J. Combn. Theory Ser B 10, (1971) [8] Lovász, L., Vesztergomb, K., Wagner, U., Welzl, E.: Convex quadrlaterals and k-sets. In: Pach, J. edtor: Towards a theory of geometrc graphs, (Contemporary Mathematcs Seres, vol. 32, pp ) AMS 200. [9] Matoušek, J.: Lectures on Dscrete Geometry, New York, N.Y.: Sprnger-Verlag [10] Pach, J., Tóth, G.: Thrteen problems on crossng numbers. Geombnatorcs 9, (2000) [11] Snger, D.: Rectlnear crossng numbers. Manuscrpt (1971) [12] Schenerman, E. R., Wlf, H. S., The rectlnear crossng number of a complete graph and Sylvester s four pont problem of geometrc probablty, Amer. Math. Monthly 101 (199), [13] Sylvester, J.J., On a specal class of questons n the theory of probabltes, Brmngham Brtsh Assoc., Report 35, 8-9 (1865). [1] Wagner, U.: On the rectlnear crossng number of complete graphs. In: Proc. of the 1th Annual ACM-SIAM Symposum on Dscrete Mathematcs (SODA), pp , [15] Zarankewcz, K.: On a problem of P. Turán concernng graphs. Fund. Math. 1, (195) 5
More metrics on cartesian products
More metrcs on cartesan products If (X, d ) are metrc spaces for 1 n, then n Secton II4 of the lecture notes we defned three metrcs on X whose underlyng topologes are the product topology The purpose of
More informationAffine transformations and convexity
Affne transformatons and convexty The purpose of ths document s to prove some basc propertes of affne transformatons nvolvng convex sets. Here are a few onlne references for background nformaton: http://math.ucr.edu/
More informationarxiv: v1 [math.co] 1 Mar 2014
Unon-ntersectng set systems Gyula O.H. Katona and Dánel T. Nagy March 4, 014 arxv:1403.0088v1 [math.co] 1 Mar 014 Abstract Three ntersecton theorems are proved. Frst, we determne the sze of the largest
More informationEvery planar graph is 4-colourable a proof without computer
Peter Dörre Department of Informatcs and Natural Scences Fachhochschule Südwestfalen (Unversty of Appled Scences) Frauenstuhlweg 31, D-58644 Iserlohn, Germany Emal: doerre(at)fh-swf.de Mathematcs Subject
More informationComplete subgraphs in multipartite graphs
Complete subgraphs n multpartte graphs FLORIAN PFENDER Unverstät Rostock, Insttut für Mathematk D-18057 Rostock, Germany Floran.Pfender@un-rostock.de Abstract Turán s Theorem states that every graph G
More informationMaximizing the number of nonnegative subsets
Maxmzng the number of nonnegatve subsets Noga Alon Hao Huang December 1, 213 Abstract Gven a set of n real numbers, f the sum of elements of every subset of sze larger than k s negatve, what s the maxmum
More information= z 20 z n. (k 20) + 4 z k = 4
Problem Set #7 solutons 7.2.. (a Fnd the coeffcent of z k n (z + z 5 + z 6 + z 7 + 5, k 20. We use the known seres expanson ( n+l ( z l l z n below: (z + z 5 + z 6 + z 7 + 5 (z 5 ( + z + z 2 + z + 5 5
More informationEdge Isoperimetric Inequalities
November 7, 2005 Ross M. Rchardson Edge Isopermetrc Inequaltes 1 Four Questons Recall that n the last lecture we looked at the problem of sopermetrc nequaltes n the hypercube, Q n. Our noton of boundary
More informationMATH 5707 HOMEWORK 4 SOLUTIONS 2. 2 i 2p i E(X i ) + E(Xi 2 ) ä i=1. i=1
MATH 5707 HOMEWORK 4 SOLUTIONS CİHAN BAHRAN 1. Let v 1,..., v n R m, all lengths v are not larger than 1. Let p 1,..., p n [0, 1] be arbtrary and set w = p 1 v 1 + + p n v n. Then there exst ε 1,..., ε
More informationProblem Set 9 Solutions
Desgn and Analyss of Algorthms May 4, 2015 Massachusetts Insttute of Technology 6.046J/18.410J Profs. Erk Demane, Srn Devadas, and Nancy Lynch Problem Set 9 Solutons Problem Set 9 Solutons Ths problem
More informationAnother converse of Jensen s inequality
Another converse of Jensen s nequalty Slavko Smc Abstract. We gve the best possble global bounds for a form of dscrete Jensen s nequalty. By some examples ts frutfulness s shown. 1. Introducton Throughout
More informationVolume 18 Figure 1. Notation 1. Notation 2. Observation 1. Remark 1. Remark 2. Remark 3. Remark 4. Remark 5. Remark 6. Theorem A [2]. Theorem B [2].
Bulletn of Mathematcal Scences and Applcatons Submtted: 016-04-07 ISSN: 78-9634, Vol. 18, pp 1-10 Revsed: 016-09-08 do:10.1805/www.scpress.com/bmsa.18.1 Accepted: 016-10-13 017 ScPress Ltd., Swtzerland
More informationLectures - Week 4 Matrix norms, Conditioning, Vector Spaces, Linear Independence, Spanning sets and Basis, Null space and Range of a Matrix
Lectures - Week 4 Matrx norms, Condtonng, Vector Spaces, Lnear Independence, Spannng sets and Bass, Null space and Range of a Matrx Matrx Norms Now we turn to assocatng a number to each matrx. We could
More informationModule 14: THE INTEGRAL Exploring Calculus
Module 14: THE INTEGRAL Explorng Calculus Part I Approxmatons and the Defnte Integral It was known n the 1600s before the calculus was developed that the area of an rregularly shaped regon could be approxmated
More informationA new construction of 3-separable matrices via an improved decoding of Macula s construction
Dscrete Optmzaton 5 008 700 704 Contents lsts avalable at ScenceDrect Dscrete Optmzaton journal homepage: wwwelsevercom/locate/dsopt A new constructon of 3-separable matrces va an mproved decodng of Macula
More informationMin Cut, Fast Cut, Polynomial Identities
Randomzed Algorthms, Summer 016 Mn Cut, Fast Cut, Polynomal Identtes Instructor: Thomas Kesselhem and Kurt Mehlhorn 1 Mn Cuts n Graphs Lecture (5 pages) Throughout ths secton, G = (V, E) s a mult-graph.
More informationRandić Energy and Randić Estrada Index of a Graph
EUROPEAN JOURNAL OF PURE AND APPLIED MATHEMATICS Vol. 5, No., 202, 88-96 ISSN 307-5543 www.ejpam.com SPECIAL ISSUE FOR THE INTERNATIONAL CONFERENCE ON APPLIED ANALYSIS AND ALGEBRA 29 JUNE -02JULY 20, ISTANBUL
More informationREAL ANALYSIS I HOMEWORK 1
REAL ANALYSIS I HOMEWORK CİHAN BAHRAN The questons are from Tao s text. Exercse 0.0.. If (x α ) α A s a collecton of numbers x α [0, + ] such that x α
More informationCollege of Computer & Information Science Fall 2009 Northeastern University 20 October 2009
College of Computer & Informaton Scence Fall 2009 Northeastern Unversty 20 October 2009 CS7880: Algorthmc Power Tools Scrbe: Jan Wen and Laura Poplawsk Lecture Outlne: Prmal-dual schema Network Desgn:
More informationYong Joon Ryang. 1. Introduction Consider the multicommodity transportation problem with convex quadratic cost function. 1 2 (x x0 ) T Q(x x 0 )
Kangweon-Kyungk Math. Jour. 4 1996), No. 1, pp. 7 16 AN ITERATIVE ROW-ACTION METHOD FOR MULTICOMMODITY TRANSPORTATION PROBLEMS Yong Joon Ryang Abstract. The optmzaton problems wth quadratc constrants often
More informationLecture Notes on Linear Regression
Lecture Notes on Lnear Regresson Feng L fl@sdueducn Shandong Unversty, Chna Lnear Regresson Problem In regresson problem, we am at predct a contnuous target value gven an nput feature vector We assume
More information3.1 Expectation of Functions of Several Random Variables. )' be a k-dimensional discrete or continuous random vector, with joint PMF p (, E X E X1 E X
Statstcs 1: Probablty Theory II 37 3 EPECTATION OF SEVERAL RANDOM VARIABLES As n Probablty Theory I, the nterest n most stuatons les not on the actual dstrbuton of a random vector, but rather on a number
More informationarxiv: v1 [math.co] 12 Sep 2014
arxv:1409.3707v1 [math.co] 12 Sep 2014 On the bnomal sums of Horadam sequence Nazmye Ylmaz and Necat Taskara Department of Mathematcs, Scence Faculty, Selcuk Unversty, 42075, Campus, Konya, Turkey March
More informationFACTORIZATION IN KRULL MONOIDS WITH INFINITE CLASS GROUP
C O L L O Q U I U M M A T H E M A T I C U M VOL. 80 1999 NO. 1 FACTORIZATION IN KRULL MONOIDS WITH INFINITE CLASS GROUP BY FLORIAN K A I N R A T H (GRAZ) Abstract. Let H be a Krull monod wth nfnte class
More informationAPPENDIX A Some Linear Algebra
APPENDIX A Some Lnear Algebra The collecton of m, n matrces A.1 Matrces a 1,1,..., a 1,n A = a m,1,..., a m,n wth real elements a,j s denoted by R m,n. If n = 1 then A s called a column vector. Smlarly,
More informationStatistical Mechanics and Combinatorics : Lecture III
Statstcal Mechancs and Combnatorcs : Lecture III Dmer Model Dmer defntons Defnton A dmer coverng (perfect matchng) of a fnte graph s a set of edges whch covers every vertex exactly once, e every vertex
More informationNP-Completeness : Proofs
NP-Completeness : Proofs Proof Methods A method to show a decson problem Π NP-complete s as follows. (1) Show Π NP. (2) Choose an NP-complete problem Π. (3) Show Π Π. A method to show an optmzaton problem
More informationApproximate Smallest Enclosing Balls
Chapter 5 Approxmate Smallest Enclosng Balls 5. Boundng Volumes A boundng volume for a set S R d s a superset of S wth a smple shape, for example a box, a ball, or an ellpsod. Fgure 5.: Boundng boxes Q(P
More informationThe L(2, 1)-Labeling on -Product of Graphs
Annals of Pure and Appled Mathematcs Vol 0, No, 05, 9-39 ISSN: 79-087X (P, 79-0888(onlne Publshed on 7 Aprl 05 wwwresearchmathscorg Annals of The L(, -Labelng on -Product of Graphs P Pradhan and Kamesh
More informationDiscrete Mathematics
Dscrete Mathematcs 30 (00) 48 488 Contents lsts avalable at ScenceDrect Dscrete Mathematcs journal homepage: www.elsever.com/locate/dsc The number of C 3 -free vertces on 3-partte tournaments Ana Paulna
More information2.3 Nilpotent endomorphisms
s a block dagonal matrx, wth A Mat dm U (C) In fact, we can assume that B = B 1 B k, wth B an ordered bass of U, and that A = [f U ] B, where f U : U U s the restrcton of f to U 40 23 Nlpotent endomorphsms
More informationNUMERICAL DIFFERENTIATION
NUMERICAL DIFFERENTIATION 1 Introducton Dfferentaton s a method to compute the rate at whch a dependent output y changes wth respect to the change n the ndependent nput x. Ths rate of change s called the
More informationFor all questions, answer choice E) NOTA" means none of the above answers is correct.
0 MA Natonal Conventon For all questons, answer choce " means none of the above answers s correct.. In calculus, one learns of functon representatons that are nfnte seres called power 3 4 5 seres. For
More informationBeyond Zudilin s Conjectured q-analog of Schmidt s problem
Beyond Zudln s Conectured q-analog of Schmdt s problem Thotsaporn Ae Thanatpanonda thotsaporn@gmalcom Mathematcs Subect Classfcaton: 11B65 33B99 Abstract Usng the methodology of (rgorous expermental mathematcs
More informationA New Refinement of Jacobi Method for Solution of Linear System Equations AX=b
Int J Contemp Math Scences, Vol 3, 28, no 17, 819-827 A New Refnement of Jacob Method for Soluton of Lnear System Equatons AX=b F Naem Dafchah Department of Mathematcs, Faculty of Scences Unversty of Gulan,
More informationHMMT February 2016 February 20, 2016
HMMT February 016 February 0, 016 Combnatorcs 1. For postve ntegers n, let S n be the set of ntegers x such that n dstnct lnes, no three concurrent, can dvde a plane nto x regons (for example, S = {3,
More informationAnti-van der Waerden numbers of 3-term arithmetic progressions.
Ant-van der Waerden numbers of 3-term arthmetc progressons. Zhanar Berkkyzy, Alex Schulte, and Mchael Young Aprl 24, 2016 Abstract The ant-van der Waerden number, denoted by aw([n], k), s the smallest
More informationFoundations of Arithmetic
Foundatons of Arthmetc Notaton We shall denote the sum and product of numbers n the usual notaton as a 2 + a 2 + a 3 + + a = a, a 1 a 2 a 3 a = a The notaton a b means a dvdes b,.e. ac = b where c s an
More informationDifference Equations
Dfference Equatons c Jan Vrbk 1 Bascs Suppose a sequence of numbers, say a 0,a 1,a,a 3,... s defned by a certan general relatonshp between, say, three consecutve values of the sequence, e.g. a + +3a +1
More informationCOMPLEX NUMBERS AND QUADRATIC EQUATIONS
COMPLEX NUMBERS AND QUADRATIC EQUATIONS INTRODUCTION We know that x 0 for all x R e the square of a real number (whether postve, negatve or ero) s non-negatve Hence the equatons x, x, x + 7 0 etc are not
More informationTHE WEIGHTED WEAK TYPE INEQUALITY FOR THE STRONG MAXIMAL FUNCTION
THE WEIGHTED WEAK TYPE INEQUALITY FO THE STONG MAXIMAL FUNCTION THEMIS MITSIS Abstract. We prove the natural Fefferman-Sten weak type nequalty for the strong maxmal functon n the plane, under the assumpton
More informationMath 217 Fall 2013 Homework 2 Solutions
Math 17 Fall 013 Homework Solutons Due Thursday Sept. 6, 013 5pm Ths homework conssts of 6 problems of 5 ponts each. The total s 30. You need to fully justfy your answer prove that your functon ndeed has
More informationON A DETERMINATION OF THE INITIAL FUNCTIONS FROM THE OBSERVED VALUES OF THE BOUNDARY FUNCTIONS FOR THE SECOND-ORDER HYPERBOLIC EQUATION
Advanced Mathematcal Models & Applcatons Vol.3, No.3, 2018, pp.215-222 ON A DETERMINATION OF THE INITIAL FUNCTIONS FROM THE OBSERVED VALUES OF THE BOUNDARY FUNCTIONS FOR THE SECOND-ORDER HYPERBOLIC EUATION
More informationA new Approach for Solving Linear Ordinary Differential Equations
, ISSN 974-57X (Onlne), ISSN 974-5718 (Prnt), Vol. ; Issue No. 1; Year 14, Copyrght 13-14 by CESER PUBLICATIONS A new Approach for Solvng Lnear Ordnary Dfferental Equatons Fawz Abdelwahd Department of
More informationFinding Dense Subgraphs in G(n, 1/2)
Fndng Dense Subgraphs n Gn, 1/ Atsh Das Sarma 1, Amt Deshpande, and Rav Kannan 1 Georga Insttute of Technology,atsh@cc.gatech.edu Mcrosoft Research-Bangalore,amtdesh,annan@mcrosoft.com Abstract. Fndng
More informationSpectral Graph Theory and its Applications September 16, Lecture 5
Spectral Graph Theory and ts Applcatons September 16, 2004 Lecturer: Danel A. Spelman Lecture 5 5.1 Introducton In ths lecture, we wll prove the followng theorem: Theorem 5.1.1. Let G be a planar graph
More informationRandom Walks on Digraphs
Random Walks on Dgraphs J. J. P. Veerman October 23, 27 Introducton Let V = {, n} be a vertex set and S a non-negatve row-stochastc matrx (.e. rows sum to ). V and S defne a dgraph G = G(V, S) and a drected
More informationSelf-complementing permutations of k-uniform hypergraphs
Dscrete Mathematcs Theoretcal Computer Scence DMTCS vol. 11:1, 2009, 117 124 Self-complementng permutatons of k-unform hypergraphs Artur Szymańsk A. Paweł Wojda Faculty of Appled Mathematcs, AGH Unversty
More informationU.C. Berkeley CS294: Spectral Methods and Expanders Handout 8 Luca Trevisan February 17, 2016
U.C. Berkeley CS94: Spectral Methods and Expanders Handout 8 Luca Trevsan February 7, 06 Lecture 8: Spectral Algorthms Wrap-up In whch we talk about even more generalzatons of Cheeger s nequaltes, and
More informationSection 3.6 Complex Zeros
04 Chapter Secton 6 Comple Zeros When fndng the zeros of polynomals, at some pont you're faced wth the problem Whle there are clearly no real numbers that are solutons to ths equaton, leavng thngs there
More informationarxiv: v3 [cs.dm] 7 Jul 2012
Perfect matchng n -unform hypergraphs wth large vertex degree arxv:1101.580v [cs.dm] 7 Jul 01 Imdadullah Khan Department of Computer Scence College of Computng and Informaton Systems Umm Al-Qura Unversty
More informationModule 9. Lecture 6. Duality in Assignment Problems
Module 9 1 Lecture 6 Dualty n Assgnment Problems In ths lecture we attempt to answer few other mportant questons posed n earler lecture for (AP) and see how some of them can be explaned through the concept
More informationChapter Twelve. Integration. We now turn our attention to the idea of an integral in dimensions higher than one. Consider a real-valued function f : D
Chapter Twelve Integraton 12.1 Introducton We now turn our attenton to the dea of an ntegral n dmensons hgher than one. Consder a real-valued functon f : R, where the doman s a nce closed subset of Eucldean
More informationAPPENDIX 2 FITTING A STRAIGHT LINE TO OBSERVATIONS
Unversty of Oulu Student Laboratory n Physcs Laboratory Exercses n Physcs 1 1 APPEDIX FITTIG A STRAIGHT LIE TO OBSERVATIOS In the physcal measurements we often make a seres of measurements of the dependent
More informationGraph Reconstruction by Permutations
Graph Reconstructon by Permutatons Perre Ille and Wllam Kocay* Insttut de Mathémathques de Lumny CNRS UMR 6206 163 avenue de Lumny, Case 907 13288 Marselle Cedex 9, France e-mal: lle@ml.unv-mrs.fr Computer
More informationA CHARACTERIZATION OF ADDITIVE DERIVATIONS ON VON NEUMANN ALGEBRAS
Journal of Mathematcal Scences: Advances and Applcatons Volume 25, 2014, Pages 1-12 A CHARACTERIZATION OF ADDITIVE DERIVATIONS ON VON NEUMANN ALGEBRAS JIA JI, WEN ZHANG and XIAOFEI QI Department of Mathematcs
More informationAppendix B. Criterion of Riemann-Stieltjes Integrability
Appendx B. Crteron of Remann-Steltes Integrablty Ths note s complementary to [R, Ch. 6] and [T, Sec. 3.5]. The man result of ths note s Theorem B.3, whch provdes the necessary and suffcent condtons for
More informationModulo Magic Labeling in Digraphs
Gen. Math. Notes, Vol. 7, No., August, 03, pp. 5- ISSN 9-784; Copyrght ICSRS Publcaton, 03 www.-csrs.org Avalable free onlne at http://www.geman.n Modulo Magc Labelng n Dgraphs L. Shobana and J. Baskar
More informationGeneralized Linear Methods
Generalzed Lnear Methods 1 Introducton In the Ensemble Methods the general dea s that usng a combnaton of several weak learner one could make a better learner. More formally, assume that we have a set
More informationModule 3 LOSSY IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur
Module 3 LOSSY IMAGE COMPRESSION SYSTEMS Verson ECE IIT, Kharagpur Lesson 6 Theory of Quantzaton Verson ECE IIT, Kharagpur Instructonal Objectves At the end of ths lesson, the students should be able to:
More informationThe path of ants Dragos Crisan, Andrei Petridean, 11 th grade. Colegiul National "Emil Racovita", Cluj-Napoca
Ths artcle s wrtten by students. It may nclude omssons and mperfectons, whch were dentfed and reported as mnutely as possble by our revewers n the edtoral notes. The path of ants 07-08 Students names and
More informationSUCCESSIVE MINIMA AND LATTICE POINTS (AFTER HENK, GILLET AND SOULÉ) M(B) := # ( B Z N)
SUCCESSIVE MINIMA AND LATTICE POINTS (AFTER HENK, GILLET AND SOULÉ) S.BOUCKSOM Abstract. The goal of ths note s to present a remarably smple proof, due to Hen, of a result prevously obtaned by Gllet-Soulé,
More informationLaboratory 1c: Method of Least Squares
Lab 1c, Least Squares Laboratory 1c: Method of Least Squares Introducton Consder the graph of expermental data n Fgure 1. In ths experment x s the ndependent varable and y the dependent varable. Clearly
More informationConvexity preserving interpolation by splines of arbitrary degree
Computer Scence Journal of Moldova, vol.18, no.1(52), 2010 Convexty preservng nterpolaton by splnes of arbtrary degree Igor Verlan Abstract In the present paper an algorthm of C 2 nterpolaton of dscrete
More informationComplex Numbers Alpha, Round 1 Test #123
Complex Numbers Alpha, Round Test #3. Wrte your 6-dgt ID# n the I.D. NUMBER grd, left-justfed, and bubble. Check that each column has only one number darkened.. In the EXAM NO. grd, wrte the 3-dgt Test
More informationCase A. P k = Ni ( 2L i k 1 ) + (# big cells) 10d 2 P k.
THE CELLULAR METHOD In ths lecture, we ntroduce the cellular method as an approach to ncdence geometry theorems lke the Szemeréd-Trotter theorem. The method was ntroduced n the paper Combnatoral complexty
More informationDIFFERENTIAL FORMS BRIAN OSSERMAN
DIFFERENTIAL FORMS BRIAN OSSERMAN Dfferentals are an mportant topc n algebrac geometry, allowng the use of some classcal geometrc arguments n the context of varetes over any feld. We wll use them to defne
More informationThe Number of Ways to Write n as a Sum of ` Regular Figurate Numbers
Syracuse Unversty SURFACE Syracuse Unversty Honors Program Capstone Projects Syracuse Unversty Honors Program Capstone Projects Sprng 5-1-01 The Number of Ways to Wrte n as a Sum of ` Regular Fgurate Numbers
More information2E Pattern Recognition Solutions to Introduction to Pattern Recognition, Chapter 2: Bayesian pattern classification
E395 - Pattern Recognton Solutons to Introducton to Pattern Recognton, Chapter : Bayesan pattern classfcaton Preface Ths document s a soluton manual for selected exercses from Introducton to Pattern Recognton
More information20. Mon, Oct. 13 What we have done so far corresponds roughly to Chapters 2 & 3 of Lee. Now we turn to Chapter 4. The first idea is connectedness.
20. Mon, Oct. 13 What we have done so far corresponds roughly to Chapters 2 & 3 of Lee. Now we turn to Chapter 4. The frst dea s connectedness. Essentally, we want to say that a space cannot be decomposed
More informationIntroduction to Vapor/Liquid Equilibrium, part 2. Raoult s Law:
CE304, Sprng 2004 Lecture 4 Introducton to Vapor/Lqud Equlbrum, part 2 Raoult s Law: The smplest model that allows us do VLE calculatons s obtaned when we assume that the vapor phase s an deal gas, and
More informationCurvature and isoperimetric inequality
urvature and sopermetrc nequalty Julà ufí, Agustí Reventós, arlos J Rodríguez Abstract We prove an nequalty nvolvng the length of a plane curve and the ntegral of ts radus of curvature, that has as a consequence
More informationU.C. Berkeley CS294: Beyond Worst-Case Analysis Handout 6 Luca Trevisan September 12, 2017
U.C. Berkeley CS94: Beyond Worst-Case Analyss Handout 6 Luca Trevsan September, 07 Scrbed by Theo McKenze Lecture 6 In whch we study the spectrum of random graphs. Overvew When attemptng to fnd n polynomal
More informationCalculation of time complexity (3%)
Problem 1. (30%) Calculaton of tme complexty (3%) Gven n ctes, usng exhaust search to see every result takes O(n!). Calculaton of tme needed to solve the problem (2%) 40 ctes:40! dfferent tours 40 add
More informationA combinatorial proof of multiple angle formulas involving Fibonacci and Lucas numbers
Notes on Number Theory and Dscrete Mathematcs ISSN 1310 5132 Vol. 20, 2014, No. 5, 35 39 A combnatoral proof of multple angle formulas nvolvng Fbonacc and Lucas numbers Fernando Córes 1 and Dego Marques
More informationχ x B E (c) Figure 2.1.1: (a) a material particle in a body, (b) a place in space, (c) a configuration of the body
Secton.. Moton.. The Materal Body and Moton hyscal materals n the real world are modeled usng an abstract mathematcal entty called a body. Ths body conssts of an nfnte number of materal partcles. Shown
More informationProblem Do any of the following determine homomorphisms from GL n (C) to GL n (C)?
Homework 8 solutons. Problem 16.1. Whch of the followng defne homomomorphsms from C\{0} to C\{0}? Answer. a) f 1 : z z Yes, f 1 s a homomorphsm. We have that z s the complex conjugate of z. If z 1,z 2
More informationU.C. Berkeley CS294: Beyond Worst-Case Analysis Luca Trevisan September 5, 2017
U.C. Berkeley CS94: Beyond Worst-Case Analyss Handout 4s Luca Trevsan September 5, 07 Summary of Lecture 4 In whch we ntroduce semdefnte programmng and apply t to Max Cut. Semdefnte Programmng Recall that
More informationCanonical transformations
Canoncal transformatons November 23, 2014 Recall that we have defned a symplectc transformaton to be any lnear transformaton M A B leavng the symplectc form nvarant, Ω AB M A CM B DΩ CD Coordnate transformatons,
More informationIntroductory Cardinality Theory Alan Kaylor Cline
Introductory Cardnalty Theory lan Kaylor Clne lthough by name the theory of set cardnalty may seem to be an offshoot of combnatorcs, the central nterest s actually nfnte sets. Combnatorcs deals wth fnte
More informationOn cyclic of Steiner system (v); V=2,3,5,7,11,13
On cyclc of Stener system (v); V=,3,5,7,,3 Prof. Dr. Adl M. Ahmed Rana A. Ibraham Abstract: A stener system can be defned by the trple S(t,k,v), where every block B, (=,,,b) contans exactly K-elementes
More informationLinear Regression Analysis: Terminology and Notation
ECON 35* -- Secton : Basc Concepts of Regresson Analyss (Page ) Lnear Regresson Analyss: Termnology and Notaton Consder the generc verson of the smple (two-varable) lnear regresson model. It s represented
More informationCALCULUS CLASSROOM CAPSULES
CALCULUS CLASSROOM CAPSULES SESSION S86 Dr. Sham Alfred Rartan Valley Communty College salfred@rartanval.edu 38th AMATYC Annual Conference Jacksonvlle, Florda November 8-, 202 2 Calculus Classroom Capsules
More informationSL n (F ) Equals its Own Derived Group
Internatonal Journal of Algebra, Vol. 2, 2008, no. 12, 585-594 SL n (F ) Equals ts Own Derved Group Jorge Macel BMCC-The Cty Unversty of New York, CUNY 199 Chambers street, New York, NY 10007, USA macel@cms.nyu.edu
More informationTHE CHVÁTAL-ERDŐS CONDITION AND 2-FACTORS WITH A SPECIFIED NUMBER OF COMPONENTS
Dscussones Mathematcae Graph Theory 27 (2007) 401 407 THE CHVÁTAL-ERDŐS CONDITION AND 2-FACTORS WITH A SPECIFIED NUMBER OF COMPONENTS Guantao Chen Department of Mathematcs and Statstcs Georga State Unversty,
More informationTHE CHINESE REMAINDER THEOREM. We should thank the Chinese for their wonderful remainder theorem. Glenn Stevens
THE CHINESE REMAINDER THEOREM KEITH CONRAD We should thank the Chnese for ther wonderful remander theorem. Glenn Stevens 1. Introducton The Chnese remander theorem says we can unquely solve any par of
More informationFormulas for the Determinant
page 224 224 CHAPTER 3 Determnants e t te t e 2t 38 A = e t 2te t e 2t e t te t 2e 2t 39 If 123 A = 345, 456 compute the matrx product A adj(a) What can you conclude about det(a)? For Problems 40 43, use
More informationThe Geometry of Logit and Probit
The Geometry of Logt and Probt Ths short note s meant as a supplement to Chapters and 3 of Spatal Models of Parlamentary Votng and the notaton and reference to fgures n the text below s to those two chapters.
More informationUsing T.O.M to Estimate Parameter of distributions that have not Single Exponential Family
IOSR Journal of Mathematcs IOSR-JM) ISSN: 2278-5728. Volume 3, Issue 3 Sep-Oct. 202), PP 44-48 www.osrjournals.org Usng T.O.M to Estmate Parameter of dstrbutons that have not Sngle Exponental Famly Jubran
More informationMath1110 (Spring 2009) Prelim 3 - Solutions
Math 1110 (Sprng 2009) Solutons to Prelm 3 (04/21/2009) 1 Queston 1. (16 ponts) Short answer. Math1110 (Sprng 2009) Prelm 3 - Solutons x a 1 (a) (4 ponts) Please evaluate lm, where a and b are postve numbers.
More informationIntegrated approach in solving parallel machine scheduling and location (ScheLoc) problem
Internatonal Journal of Industral Engneerng Computatons 7 (2016) 573 584 Contents lsts avalable at GrowngScence Internatonal Journal of Industral Engneerng Computatons homepage: www.growngscence.com/ec
More informationThe Jacobsthal and Jacobsthal-Lucas Numbers via Square Roots of Matrices
Internatonal Mathematcal Forum, Vol 11, 2016, no 11, 513-520 HIKARI Ltd, wwwm-hkarcom http://dxdoorg/1012988/mf20166442 The Jacobsthal and Jacobsthal-Lucas Numbers va Square Roots of Matrces Saadet Arslan
More informationLinear Approximation with Regularization and Moving Least Squares
Lnear Approxmaton wth Regularzaton and Movng Least Squares Igor Grešovn May 007 Revson 4.6 (Revson : March 004). 5 4 3 0.5 3 3.5 4 Contents: Lnear Fttng...4. Weghted Least Squares n Functon Approxmaton...
More informationn ). This is tight for all admissible values of t, k and n. k t + + n t
MAXIMIZING THE NUMBER OF NONNEGATIVE SUBSETS NOGA ALON, HAROUT AYDINIAN, AND HAO HUANG Abstract. Gven a set of n real numbers, f the sum of elements of every subset of sze larger than k s negatve, what
More informationAsymptotics of the Solution of a Boundary Value. Problem for One-Characteristic Differential. Equation Degenerating into a Parabolic Equation
Nonl. Analyss and Dfferental Equatons, ol., 4, no., 5 - HIKARI Ltd, www.m-har.com http://dx.do.org/.988/nade.4.456 Asymptotcs of the Soluton of a Boundary alue Problem for One-Characterstc Dfferental Equaton
More informationLaboratory 3: Method of Least Squares
Laboratory 3: Method of Least Squares Introducton Consder the graph of expermental data n Fgure 1. In ths experment x s the ndependent varable and y the dependent varable. Clearly they are correlated wth
More informationRemarks on the Properties of a Quasi-Fibonacci-like Polynomial Sequence
Remarks on the Propertes of a Quas-Fbonacc-lke Polynomal Sequence Brce Merwne LIU Brooklyn Ilan Wenschelbaum Wesleyan Unversty Abstract Consder the Quas-Fbonacc-lke Polynomal Sequence gven by F 0 = 1,
More informationarxiv: v1 [math.ho] 18 May 2008
Recurrence Formulas for Fbonacc Sums Adlson J. V. Brandão, João L. Martns 2 arxv:0805.2707v [math.ho] 8 May 2008 Abstract. In ths artcle we present a new recurrence formula for a fnte sum nvolvng the Fbonacc
More informationLinear, affine, and convex sets and hulls In the sequel, unless otherwise specified, X will denote a real vector space.
Lnear, affne, and convex sets and hulls In the sequel, unless otherwse specfed, X wll denote a real vector space. Lnes and segments. Gven two ponts x, y X, we defne xy = {x + t(y x) : t R} = {(1 t)x +
More informationAn Interactive Optimisation Tool for Allocation Problems
An Interactve Optmsaton ool for Allocaton Problems Fredr Bonäs, Joam Westerlund and apo Westerlund Process Desgn Laboratory, Faculty of echnology, Åbo Aadem Unversty, uru 20500, Fnland hs paper presents
More information