On spanning trees and cycles of multicolored point sets with few intersections

Size: px
Start display at page:

Download "On spanning trees and cycles of multicolored point sets with few intersections"

Transcription

1 On spanning trs and cycls of multicolord point sts with fw intrsctions M. Kano, C. Mrino, and J. Urrutia April, 00 Abstract Lt P 1,..., P k b a collction of disjoint point sts in R in gnral position. W prov that for ach 1 i k w can find a plan spanning tr T i of P i such that th dgs of T 1,..., T k intrsct at most kn(k 1)(n k)+ (k)(k 1), whr n is th numbr of points in P 1... P k. If th intrsction of th convx hulls of P 1,..., P k is non mpty, w can find k spanning cycls such that thir dgs intrsct at most (k 1)n tims, this bound is tight. W also prov that if P and Q ar disjoint point sts in gnral position, thn th minimum wight spanning trs of P and Q intrsct at most n tims, whr P Q = n (th wight of an dg is its lngth). 1 Introduction Th study of gomtric graphs, that is graphs whos vrtx st is a collction of points on th plan in gnral position and its dgs ar straight lin sgmnts conncting pairs of vrtics, has rcivd a lot of attntion latly. Numrous problms in which w want to draw graphs on th plan such that thir vrtics li on th lmnts of a fixd point st hav bn studid. Ramsy typ problms in which w want to color th dgs or vrtics of a gomtric graph such that som spcific forbiddn subgraphs do not appar hav also bn studid. Th intrstd radr may consult a rcnt survy by J. Pach [9] containing many rsults in this fild. In this papr w ar intrstd in studying problms of mbddings of gomtric graphs on colord point sts. Ths problms hav bn studid for som tim now, for xampl in [1, ] th problm of mbdding trs and altrnating paths on bicolord point sts is studid. In [,, 5] matching problms on colord point sts ar studid. For two colord point sts w ar intrstd in obtaining matchings in which vry dg has its Dpartmnt of Computr and Information Scincs, Ibaraki Univrsity, Hitachi , Japan Instituto d Matmáticas Univrsidad Nacionál Autónoma d México, México D.F. México 1

2 ndpoints of diffrnt (or qual) color. A wll known rsult stats that givn a colction P n of n points in gnral position, n blu, and n rd, w can always match a blu with a rd point in P n such that th lin sgmnts joining matchd pairs of points do not intrsct. For a rcnt survy daling with numrous problms on colord point sts s [6]. Problms in which instad of coloring th vrtics, w color th dgs of gomtric graphs, ar studid in [, ]. Lt P n b a st with n points on th plan. A spanning tr of P n is a connctd gomtric graph with vrtx st P n containing xactly n 1 dgs. Lt P and Q b disjoint point st. Tokunaga, studid and solvd th problm of finding spanning trs for P and Q with th smallst possibl numbr of dg intrsctions. It turns out that this numbr dpnds only in th ordr in which th lmnts of P and Q lying on th convx hull Conv(P Q) of P Q appar. Mor spcifically, lt p 0,..., p r 1 b th points on Conv(P Q) in clockwis ordr, and lt i b th numbr of indxs j such that p j and p j+1 ar on in P and th othr in Q, addition takn mod r. Thn it is always possibl to find spanning trs for P and Q such that thir dgs do not intrsct if i, othrwis thy intrsct xactly i tims. This implis for xampl that if all th points on th convx hull ar th sam color, or all th points in P which blong to th convx hull appar in conscutiv ordr, thn w can find spanning trs for P and Q which do not intrsct, rgardlss of how many or whr th rmaining points of P and Q ar. In this papr w study th following problm: Lt P 1,..., P k b a family of disjoint point sts such that P 1... P k is in gnral position. Find spanning trs for P 1,..., P k such that thir dgs hav as fw intrsctions as possibl. In this papr w prov th following rsult: Thorm 1 Lt P 1,..., P k b a collction of disjoint point sts. Thn w can find for ach P i a spanning tr T i such that th total numbr of intrsctions among th dgs of T 1,..., T k is at most (k 1)(n k) + (k)(k 1) whr P 1... P k = n. This bound is tight within a factor of two from th optimal solution. W also giv similar rsults for spanning cycls of familis of point sts P 1,..., P k in which Conv(P 1 )... Conv(P k ) is non mpty. Sharp bounds for this problm ar obtaind. In th last sction of this papr, w prov th following rsult that is of indpndnt intrst: Lt P and Q b disjoint point sts, thn thir uclidan minimum wight spanning trs intrsct at most 1n tims. Using this w prov th following rsult: Lt P 1,..., P k b familis of disjoint point sts such that P 1... P k is in gnral position. For ach P i lt T i b its uclidan minimum wight spanning tr, i = 1,..., k. Thn thn th dgs of ths trs intrsct at most kn tims.

3 Spanning trs with fw intrsctions Givn two disjoint point sts P 1 and P it is not always possibl to find spanning trs for thm such that thir dgs do not intrsct. In fact if w hav s points which ar th vrtics of a convx polygon such that altrnatly thy blong to P 1 and P, thn it is asy to vrify that any spanning tr for P 1 intrscts any spanning tr for P at last s 1 tims, s Figur 1. From hr th following obsrvation follows: Obsrvation 1 Thr ar familis of point sts P 1,..., P k with P 1,..., P k = sk such that thir dgs intrsct at last k(k 1) (s 1) tims. Figur 1: Two sts of points, ach with six points such that any spanning tr of th st with solid points intrscts any spanning tr for th rmaining points at last fiv tims. If w considr a similar problm for thr or mor point sts our problm bcoms much hardr, vn for points in convx position. Lt P b a st of n = ks points in convx position lablld p 1,..., p sk. Split P into k substs P 1,..., P k such that th lmnt p i+rk blongs to P i, r = 0,..., s 1. Finding for ach P i a spanning tr T i, 1 i k, such such that thir dgs hav th fwst possibl numbr of intrsctions is hard. W now show a st of spanning trs T 1,..., T k such that thir dgs intrsct at most ( k k)(s 1) k(k ) tims if k is vn; othrwis thy intrsct ( (k 1) + k 1 (k 1) )(s 1) tims, i.. th numbr of tims thir dgs intrsct is at most tims th optimal solution. For i vn, lt T i b th tr containing th dgs joining p i+ak to p i+bk, a + b = s + 1 or a + b = s +, 1 a, b s. For i odd, T i, is th tr containing th dgs joining p i+ak to p i+bk, a + b = s or a + b = s + 1, 1 a, b s. Notic that two trs T i and T j intrsct s 1 tims if i and j hav diffrnt parity; othrwis thy intrsct (s 1) 1 = s tims. S Figur. Thrfor ths trs intrsct xactly ( k k)(s 1) k(k ) if k is vn; and ( (k) + k 1 (k 1) )(s 1) if k is odd. Morovr w bliv that this configuration is, in fact, clos to th optimal solution for point sts in convx position.

4 Figur : On th lft hand sid w hav T i, i odd, with dashd lins and T j, j vn, with solid lins; s = so, thy intrsct tims. On th right hand sid w hav T i and T j, i, j vn; as s = 9, thy intrsct 15 tims. W procd now to study our problm for point sts in gnral position. Suppos w.l.o.g. that th points in P 1... P k hav diffrnt x-coordinats, and P i, i = 1,..., k. Assum that for vry i th lmnts of P i ar labld p i,1, p i,,..., p i,ri such that if r < s thn th x-coordinat of p i,r is smallr than th x-coordinat of p i,s. Lt T i b th path with vrtx st P i in which p i,j is connctd to p i,j+1 by an dg dnotd by i,j, j = 1,..., r i 1. S Figur. Figur : A colction of four point sts and thir spanning trs. Th point sts ar th vrtics of our trs, which turn out to b paths. Lmma 1 Th dgs of T i and T j intrsct at most r i + r j tims. Proof: Our rsult is clarly tru if r i + r j, or on of T i or T j has xactly on dg. Suppos now that th x coordinat of p i, is smallr than that of p j,. Thn th dg i,1 of T i joining p i,1 to p i, intrscts at most on dg of T j, namly th dg j,1 joining p j,1 to p j,. Rmov p i,1 from p i, and by induction our rsult follows. In a similar way w can prov:

5 Lmma Th dgs of T 1,..., T k intrsct at most (k 1)(n k) + (k)(k 1) tims, whr P 1... P k = n Proof: Our rsult is tru if T 1,..., T k hav togthr at most k dgs, in fact in this cas if all of thm intrsct ach othr, thir total numbr of intrsctions is (k)(k 1). Suppos thn that our trs contain mor than k dgs, and lt i,1 b such that th x-coordinat of p i, is smallr than th x-coordinat of p j,, i j, 1 j k. Thn th dg i,1 joining p i,1 to p i, intrscts at most k 1 dgs, i.. in ach T j i,1 intrscts at most th dg j,1 joining p j,1 to p j,, j i. Rmoving this dg, and p i1 from P i, and procding by induction on P 1,..., P i {p i,1 },..., P k our rsult follows. Obsrv that th bound dtrmind in Lmma is within a factor of two of that in Obsrvation 1. Thorm 1 follows dirctly from Obsrvation 1 and Lmma. Spanning Cycls W now study th following problm: Lt P 1,..., P k b a family of disjoint point sts such that Conv(P 1 ),..., Conv(P k ). Find a family of spanning cycls C i,..., C k of P 1,..., P k rspctivly with fw intrsctions. W prov: Thorm Lt P 1,..., P k b a family of disjoint point st such that Conv(P 1 ),..., Conv(P k ). Thn for ach P i w can find a cycl C k which covrs th vrtics of P i such that th dgs of all cycls C i,..., C k intrsct at most (k 1)n tims. Our bound is optimal. Proof: Lt q b a point in th intrior of Conv(P 1 ),..., Conv(P k ). For ach P i dfin a cycl C q i as follows: Sort th lmnts of P i around q in th countrclockwis ordr according to thir slop and labl thm p i,1,..., p i,ri (s Figur (a)). A straightforward modification to our counting argumnt in Lmma shows that th dgs of C 1,..., C k intrsct at most (k 1)n tims. To show that our bound is tight, choos n = kr, and choos kr points on a unit circl labld p 1,..., p kr, and lt P i = {p i+ks : k = 0,..., r 1}. It is asy to s that th (uniqu) cycls C i that covr th vrtics of ach P i, i = 1,..., k intrsct (k 1)(kr) = (k 1)n tims, s Figur (b). 5

6 p i, p i,1 q p i,ri (a) (b) Figur : Minimum wight spanning trs Th uclidan minimum wight spanning tr of a point st P n is a tr with vrtx st P n such that th sum of th lngths of its dgs is minimizd. In this sction w prov that if P 1,..., P k ar disjoint point sts and T 1,..., T k ar thir corrsponding uclidan minimum wight spanning trs thn th total numbr of intrsctions among thir dgs is at most (k 1)(n k) whr P 1... P k = n. Our proof is basd on th following obsrvation that is asy to prov: Lt T i and T j b th minimum wight spanning trs of P i and P j. Lt b any dg of T i. Thn thr is a constant c such that intrscts at most c dgs of T j whos lngth is gratr than or qual to th lngth of. It follows that th dgs of T i and T j intrsct a linar numbr of tims. In fact, w can prov that c is at most 9, howvr th proof is long, tdious, and unnlightning. W skip th dtails, thy can b supplid by th authors upon rqust. Summarizing w hav: Lmma Lt T 1 and T b th minimum wight spanning trs of two point sts P 1 and P, and any dg of T 1. Thn intrscts at most 9 dgs of T whos lngth is grathr than or qual to th lnght of. W now prov: Thorm Lt T 1,..., T k b rspctivly th minimum wight spanning trs of k point sts P 1,..., P k such that P 1... P k = n. Thn th dgs of T 1,..., T k intrsct at most 9(k 1)(n k) tims. 6

7 Proof: Obsrv first that sinc P 1... P k = n, T 1,..., T k hav xactly n k dgs. Lt us construct th intrsction graph H of th st of dgs of T 1,..., T k, that is th graph whos vrtx st is th st of all dgs of T 1,..., T k, two of which ar adjacnt if thy intrsct. Orint th dgs of this graph as follows: If two dgs T i and T j intsct and is longr than orint th dg in H joining thm from to, s Figur (a) (b) Figur 5: Th intrsction graph of thr minimum wight spanning trs. By Lmma 6 vry dg in T i intrscts at most 9 dgs in ach T j, i j which ar th sam lnght or longr than itslf. Thus th out-dgr of ach vrtx of H is at most 9(k 1). Our rsult follows. Obsrv that for th cas whn w hav two point sts P and Q such that P Q = n, our prvious rsults implis that th dgs of thir minimum wight spanning trs intrsct at most 9(n ) tims. This bound is far from optimal. In fact w hav bn unabl to produc xampls in which th minimum wight spanning trs of P and Q intrsct mor than n tims. An xampl is constructd as follows: P consists of points r, s, t such that r and s ar quidistant from t, and th angl rts is slightly biggr than π. Th points of Q li on a zig-zag polygonal such that ach scond sgmnt of it is paralll, and th angl btwn two conscutiv sgmnts is π as shown in Figur 6. W conclud by posing th following qustion: Opn problm 1 Is it tru that th dgs of th minimum wight spanning trs of any two point sts P and Q such that P Q = n intrsct at most n c tims, c a constant?

8 Figur 6: P has points, and Q 5. Th numbr of lmnts of Q can b incrasd to n, n. Th numbr of dg intrsctions of th minimum wight spanning trs of P and Q is n. Rfrncs [1] M. Abllanas, J. García, G. Hrnándz, N. Noy, and P. Ramos, Bipartit mbddings of trs in th plan, in Graph Drawing 96, Lctur Nots in Computr Scinc, 1990 Springr Vrlag, Brlin, (199), [] J. Akiyama, and J. Urrutia, Simpl altrnating path problms, Discrt Math (1990) [] A. Dumitrscu, and J. Pach. Partitioning colord point sts into monochromatic parts, Int. J. of Computational Gomtry and Applications. [] A. Dumitrscu, and R. Kay, Matching colord points in th plan, som nw rsult, Comp. Gomtry, Thory and Applications 19 (1) (001), [5] A. Dumitrscu, and W. Stigr, On a matching problm on th plan, Discrt Math. 11 (000), [6] A. Kanko M. Kano, Som problms and rsults on graph thory and discrt gomtry, 001. (ps-fil in [] G. Karoli, J. Pach, and G. Tóth, Ramsy-typ rsults for gomtric graphs, I, Discrt and Comp. Gomtry 1, -55 (1995). [] G. Karoli, J. Pach, and G. Tóth, and P. Valtr, Ramsy-typ rsults for gomtric graphs, II, Discrt and Comp. Gomtry 0, 5- (199).

9 [9] J. Pach, Gomtric graph thory. Survys in combinatorics, 1999 (Cantrbury), 16 00, London Math. Soc. Lctur Not Sr., 6, Cambridg Univ. Prss, Cambridg, [10] S. Tokunaga, Crossing numbr of two-connctd gomtric graphs, Info. Proc. Lttrs 59 (1996) 1-. 9

Week 3: Connected Subgraphs

Week 3: Connected Subgraphs Wk 3: Connctd Subgraphs Sptmbr 19, 2016 1 Connctd Graphs Path, Distanc: A path from a vrtx x to a vrtx y in a graph G is rfrrd to an xy-path. Lt X, Y V (G). An (X, Y )-path is an xy-path with x X and y

More information

cycle that does not cross any edges (including its own), then it has at least

cycle that does not cross any edges (including its own), then it has at least W prov th following thorm: Thorm If a K n is drawn in th plan in such a way that it has a hamiltonian cycl that dos not cross any dgs (including its own, thn it has at last n ( 4 48 π + O(n crossings Th

More information

The Equitable Dominating Graph

The Equitable Dominating Graph Intrnational Journal of Enginring Rsarch and Tchnology. ISSN 0974-3154 Volum 8, Numbr 1 (015), pp. 35-4 Intrnational Rsarch Publication Hous http://www.irphous.com Th Equitabl Dominating Graph P.N. Vinay

More information

Basic Polyhedral theory

Basic Polyhedral theory Basic Polyhdral thory Th st P = { A b} is calld a polyhdron. Lmma 1. Eithr th systm A = b, b 0, 0 has a solution or thr is a vctorπ such that π A 0, πb < 0 Thr cass, if solution in top row dos not ist

More information

SCHUR S THEOREM REU SUMMER 2005

SCHUR S THEOREM REU SUMMER 2005 SCHUR S THEOREM REU SUMMER 2005 1. Combinatorial aroach Prhas th first rsult in th subjct blongs to I. Schur and dats back to 1916. On of his motivation was to study th local vrsion of th famous quation

More information

On Grids in Topological Graphs

On Grids in Topological Graphs On Grids in Topological Graphs Eyal Ackrman Dpartmnt of Computr Scinc Fri Univrsität Brlin Takustr. 9, 14195 Brlin, Grmany yal@inf.fu-brlin.d Jacob Fox Dpartmnt of Mathmatics Princton Univrsity Princton,

More information

Construction of asymmetric orthogonal arrays of strength three via a replacement method

Construction of asymmetric orthogonal arrays of strength three via a replacement method isid/ms/26/2 Fbruary, 26 http://www.isid.ac.in/ statmath/indx.php?modul=prprint Construction of asymmtric orthogonal arrays of strngth thr via a rplacmnt mthod Tian-fang Zhang, Qiaoling Dng and Alok Dy

More information

Introduction to Arithmetic Geometry Fall 2013 Lecture #20 11/14/2013

Introduction to Arithmetic Geometry Fall 2013 Lecture #20 11/14/2013 18.782 Introduction to Arithmtic Gomtry Fall 2013 Lctur #20 11/14/2013 20.1 Dgr thorm for morphisms of curvs Lt us rstat th thorm givn at th nd of th last lctur, which w will now prov. Thorm 20.1. Lt φ:

More information

On the irreducibility of some polynomials in two variables

On the irreducibility of some polynomials in two variables ACTA ARITHMETICA LXXXII.3 (1997) On th irrducibility of som polynomials in two variabls by B. Brindza and Á. Pintér (Dbrcn) To th mmory of Paul Erdős Lt f(x) and g(y ) b polynomials with intgral cofficints

More information

Square of Hamilton cycle in a random graph

Square of Hamilton cycle in a random graph Squar of Hamilton cycl in a random graph Andrzj Dudk Alan Friz Jun 28, 2016 Abstract W show that p = n is a sharp thrshold for th random graph G n,p to contain th squar of a Hamilton cycl. This improvs

More information

Finding low cost TSP and 2-matching solutions using certain half integer subtour vertices

Finding low cost TSP and 2-matching solutions using certain half integer subtour vertices Finding low cost TSP and 2-matching solutions using crtain half intgr subtour vrtics Sylvia Boyd and Robrt Carr Novmbr 996 Introduction Givn th complt graph K n = (V, E) on n nods with dg costs c R E,

More information

Outerplanar graphs and Delaunay triangulations

Outerplanar graphs and Delaunay triangulations CCCG 011, Toronto ON, August 10 1, 011 Outrplanar graphs and Dlaunay triangulations Ashraful Alam Igor Rivin Ilana Strinu Abstract Ovr 0 yars ago, Dillncourt [1] showd that all outrplanar graphs can b

More information

The second condition says that a node α of the tree has exactly n children if the arity of its label is n.

The second condition says that a node α of the tree has exactly n children if the arity of its label is n. CS 6110 S14 Hanout 2 Proof of Conflunc 27 January 2014 In this supplmntary lctur w prov that th λ-calculus is conflunt. This is rsult is u to lonzo Church (1903 1995) an J. arkly Rossr (1907 1989) an is

More information

SOME PARAMETERS ON EQUITABLE COLORING OF PRISM AND CIRCULANT GRAPH.

SOME PARAMETERS ON EQUITABLE COLORING OF PRISM AND CIRCULANT GRAPH. SOME PARAMETERS ON EQUITABLE COLORING OF PRISM AND CIRCULANT GRAPH. K VASUDEVAN, K. SWATHY AND K. MANIKANDAN 1 Dpartmnt of Mathmatics, Prsidncy Collg, Chnnai-05, India. E-Mail:vasu k dvan@yahoo.com. 2,

More information

Section 6.1. Question: 2. Let H be a subgroup of a group G. Then H operates on G by left multiplication. Describe the orbits for this operation.

Section 6.1. Question: 2. Let H be a subgroup of a group G. Then H operates on G by left multiplication. Describe the orbits for this operation. MAT 444 H Barclo Spring 004 Homwork 6 Solutions Sction 6 Lt H b a subgroup of a group G Thn H oprats on G by lft multiplication Dscrib th orbits for this opration Th orbits of G ar th right costs of H

More information

COUNTING TAMELY RAMIFIED EXTENSIONS OF LOCAL FIELDS UP TO ISOMORPHISM

COUNTING TAMELY RAMIFIED EXTENSIONS OF LOCAL FIELDS UP TO ISOMORPHISM COUNTING TAMELY RAMIFIED EXTENSIONS OF LOCAL FIELDS UP TO ISOMORPHISM Jim Brown Dpartmnt of Mathmatical Scincs, Clmson Univrsity, Clmson, SC 9634, USA jimlb@g.clmson.du Robrt Cass Dpartmnt of Mathmatics,

More information

1 Minimum Cut Problem

1 Minimum Cut Problem CS 6 Lctur 6 Min Cut and argr s Algorithm Scribs: Png Hui How (05), Virginia Dat: May 4, 06 Minimum Cut Problm Today, w introduc th minimum cut problm. This problm has many motivations, on of which coms

More information

(Upside-Down o Direct Rotation) β - Numbers

(Upside-Down o Direct Rotation) β - Numbers Amrican Journal of Mathmatics and Statistics 014, 4(): 58-64 DOI: 10593/jajms0140400 (Upsid-Down o Dirct Rotation) β - Numbrs Ammar Sddiq Mahmood 1, Shukriyah Sabir Ali,* 1 Dpartmnt of Mathmatics, Collg

More information

International Journal of Scientific & Engineering Research, Volume 6, Issue 7, July ISSN

International Journal of Scientific & Engineering Research, Volume 6, Issue 7, July ISSN Intrnational Journal of Scintific & Enginring Rsarch, Volum 6, Issu 7, July-25 64 ISSN 2229-558 HARATERISTIS OF EDGE UTSET MATRIX OF PETERSON GRAPH WITH ALGEBRAI GRAPH THEORY Dr. G. Nirmala M. Murugan

More information

The Matrix Exponential

The Matrix Exponential Th Matrix Exponntial (with xrciss) by D. Klain Vrsion 207.0.05 Corrctions and commnts ar wlcom. Th Matrix Exponntial For ach n n complx matrix A, dfin th xponntial of A to b th matrix A A k I + A + k!

More information

Mutually Independent Hamiltonian Cycles of Pancake Networks

Mutually Independent Hamiltonian Cycles of Pancake Networks Mutually Indpndnt Hamiltonian Cycls of Pancak Ntworks Chng-Kuan Lin Dpartmnt of Mathmatics National Cntral Univrsity, Chung-Li, Taiwan 00, R O C discipl@ms0urlcomtw Hua-Min Huang Dpartmnt of Mathmatics

More information

Searching Linked Lists. Perfect Skip List. Building a Skip List. Skip List Analysis (1) Assume the list is sorted, but is stored in a linked list.

Searching Linked Lists. Perfect Skip List. Building a Skip List. Skip List Analysis (1) Assume the list is sorted, but is stored in a linked list. 3 3 4 8 6 3 3 4 8 6 3 3 4 8 6 () (d) 3 Sarching Linkd Lists Sarching Linkd Lists Sarching Linkd Lists ssum th list is sortd, but is stord in a linkd list. an w us binary sarch? omparisons? Work? What if

More information

BINOMIAL COEFFICIENTS INVOLVING INFINITE POWERS OF PRIMES. 1. Statement of results

BINOMIAL COEFFICIENTS INVOLVING INFINITE POWERS OF PRIMES. 1. Statement of results BINOMIAL COEFFICIENTS INVOLVING INFINITE POWERS OF PRIMES DONALD M. DAVIS Abstract. If p is a prim and n a positiv intgr, lt ν p (n dnot th xponnt of p in n, and u p (n n/p νp(n th unit part of n. If α

More information

The Matrix Exponential

The Matrix Exponential Th Matrix Exponntial (with xrciss) by Dan Klain Vrsion 28928 Corrctions and commnts ar wlcom Th Matrix Exponntial For ach n n complx matrix A, dfin th xponntial of A to b th matrix () A A k I + A + k!

More information

arxiv: v1 [cs.cg] 28 Feb 2017

arxiv: v1 [cs.cg] 28 Feb 2017 On th Rlationship btwn k-planar and k-quasi Planar Graphs Patrizio Anglini 1, Michal A. Bkos 1, Franz J. Brandnburg 2, Giordano Da Lozzo 3, Giuspp Di Battista 4, Waltr Didimo 5, Giuspp Liotta 5, Fabrizio

More information

CPSC 665 : An Algorithmist s Toolkit Lecture 4 : 21 Jan Linear Programming

CPSC 665 : An Algorithmist s Toolkit Lecture 4 : 21 Jan Linear Programming CPSC 665 : An Algorithmist s Toolkit Lctur 4 : 21 Jan 2015 Lcturr: Sushant Sachdva Linar Programming Scrib: Rasmus Kyng 1. Introduction An optimization problm rquirs us to find th minimum or maximum) of

More information

Limiting value of higher Mahler measure

Limiting value of higher Mahler measure Limiting valu of highr Mahlr masur Arunabha Biswas a, Chris Monico a, a Dpartmnt of Mathmatics & Statistics, Txas Tch Univrsity, Lubbock, TX 7949, USA Abstract W considr th k-highr Mahlr masur m k P )

More information

BINOMIAL COEFFICIENTS INVOLVING INFINITE POWERS OF PRIMES

BINOMIAL COEFFICIENTS INVOLVING INFINITE POWERS OF PRIMES BINOMIAL COEFFICIENTS INVOLVING INFINITE POWERS OF PRIMES DONALD M. DAVIS Abstract. If p is a prim (implicit in notation and n a positiv intgr, lt ν(n dnot th xponnt of p in n, and U(n n/p ν(n, th unit

More information

3 Finite Element Parametric Geometry

3 Finite Element Parametric Geometry 3 Finit Elmnt Paramtric Gomtry 3. Introduction Th intgral of a matrix is th matrix containing th intgral of ach and vry on of its original componnts. Practical finit lmnt analysis rquirs intgrating matrics,

More information

Recall that by Theorems 10.3 and 10.4 together provide us the estimate o(n2 ), S(q) q 9, q=1

Recall that by Theorems 10.3 and 10.4 together provide us the estimate o(n2 ), S(q) q 9, q=1 Chaptr 11 Th singular sris Rcall that by Thorms 10 and 104 togthr provid us th stimat 9 4 n 2 111 Rn = SnΓ 2 + on2, whr th singular sris Sn was dfind in Chaptr 10 as Sn = q=1 Sq q 9, with Sq = 1 a q gcda,q=1

More information

Combinatorial Networks Week 1, March 11-12

Combinatorial Networks Week 1, March 11-12 1 Nots on March 11 Combinatorial Ntwors W 1, March 11-1 11 Th Pigonhol Principl Th Pigonhol Principl If n objcts ar placd in hols, whr n >, thr xists a box with mor than on objcts 11 Thorm Givn a simpl

More information

Strongly Connected Components

Strongly Connected Components Strongly Connctd Componnts Lt G = (V, E) b a dirctd graph Writ if thr is a path from to in G Writ if and is an quivalnc rlation: implis and implis s quivalnc classs ar calld th strongly connctd componnts

More information

COHORT MBA. Exponential function. MATH review (part2) by Lucian Mitroiu. The LOG and EXP functions. Properties: e e. lim.

COHORT MBA. Exponential function. MATH review (part2) by Lucian Mitroiu. The LOG and EXP functions. Properties: e e. lim. MTH rviw part b Lucian Mitroiu Th LOG and EXP functions Th ponntial function p : R, dfind as Proprtis: lim > lim p Eponntial function Y 8 6 - -8-6 - - X Th natural logarithm function ln in US- log: function

More information

Derangements and Applications

Derangements and Applications 2 3 47 6 23 Journal of Intgr Squncs, Vol. 6 (2003), Articl 03..2 Drangmnts and Applications Mhdi Hassani Dpartmnt of Mathmatics Institut for Advancd Studis in Basic Scincs Zanjan, Iran mhassani@iasbs.ac.ir

More information

Search sequence databases 3 10/25/2016

Search sequence databases 3 10/25/2016 Sarch squnc databass 3 10/25/2016 Etrm valu distribution Ø Suppos X is a random variabl with probability dnsity function p(, w sampl a larg numbr S of indpndnt valus of X from this distribution for an

More information

Area and Perimeter Derivatives of a Union of Disks

Area and Perimeter Derivatives of a Union of Disks Ara and rimtr Drivativs of a Union of Disks HoLun Chng and Hrbrt Edlsbrunnr Dpartmnt of Computr Scinc, ational Univrsity of Singapor, Singapor. Dpartmnt of Computr Scinc, Duk Univrsity, Durham, and Raindrop

More information

GEOMETRICAL PHENOMENA IN THE PHYSICS OF SUBATOMIC PARTICLES. Eduard N. Klenov* Rostov-on-Don, Russia

GEOMETRICAL PHENOMENA IN THE PHYSICS OF SUBATOMIC PARTICLES. Eduard N. Klenov* Rostov-on-Don, Russia GEOMETRICAL PHENOMENA IN THE PHYSICS OF SUBATOMIC PARTICLES Eduard N. Klnov* Rostov-on-Don, Russia Th articl considrs phnomnal gomtry figurs bing th carrirs of valu spctra for th pairs of th rmaining additiv

More information

MATHEMATICS PAPER IIB COORDINATE GEOMETRY AND CALCULUS. Note: This question paper consists of three sections A, B and C.

MATHEMATICS PAPER IIB COORDINATE GEOMETRY AND CALCULUS. Note: This question paper consists of three sections A, B and C. MATHEMATICS PAPER IIB COORDINATE GEOMETRY AND CALCULUS. Tim: 3hrs Ma. Marks.75 Not: This qustion papr consists of thr sctions A, B and C. SECTION -A Vry Short Answr Typ Qustions. 0 X = 0. Find th condition

More information

International Journal of Foundations of Computer Science c World Scientic Publishing Company Searching a Pseudo 3-Sided Solid Orthoconvex Grid ANTONIO

International Journal of Foundations of Computer Science c World Scientic Publishing Company Searching a Pseudo 3-Sided Solid Orthoconvex Grid ANTONIO Intrnational Journal of Foundations of Computr Scinc c World Scintic Publishing Company Sarching a Psudo 3-Sidd Solid Orthoconvx Grid ANTONIOS SYMVONIS Bassr Dpartmnt of Computr Scinc, Univrsity of Sydny

More information

EEO 401 Digital Signal Processing Prof. Mark Fowler

EEO 401 Digital Signal Processing Prof. Mark Fowler EEO 401 Digital Signal Procssing Prof. Mark Fowlr Dtails of th ot St #19 Rading Assignmnt: Sct. 7.1.2, 7.1.3, & 7.2 of Proakis & Manolakis Dfinition of th So Givn signal data points x[n] for n = 0,, -1

More information

CS 361 Meeting 12 10/3/18

CS 361 Meeting 12 10/3/18 CS 36 Mting 2 /3/8 Announcmnts. Homwork 4 is du Friday. If Friday is Mountain Day, homwork should b turnd in at my offic or th dpartmnt offic bfor 4. 2. Homwork 5 will b availabl ovr th wknd. 3. Our midtrm

More information

The graph of y = x (or y = ) consists of two branches, As x 0, y + ; as x 0, y +. x = 0 is the

The graph of y = x (or y = ) consists of two branches, As x 0, y + ; as x 0, y +. x = 0 is the Copyright itutcom 005 Fr download & print from wwwitutcom Do not rproduc by othr mans Functions and graphs Powr functions Th graph of n y, for n Q (st of rational numbrs) y is a straight lin through th

More information

LINEAR DELAY DIFFERENTIAL EQUATION WITH A POSITIVE AND A NEGATIVE TERM

LINEAR DELAY DIFFERENTIAL EQUATION WITH A POSITIVE AND A NEGATIVE TERM Elctronic Journal of Diffrntial Equations, Vol. 2003(2003), No. 92, pp. 1 6. ISSN: 1072-6691. URL: http://jd.math.swt.du or http://jd.math.unt.du ftp jd.math.swt.du (login: ftp) LINEAR DELAY DIFFERENTIAL

More information

1 Isoparametric Concept

1 Isoparametric Concept UNIVERSITY OF CALIFORNIA BERKELEY Dpartmnt of Civil Enginring Spring 06 Structural Enginring, Mchanics and Matrials Profssor: S. Govindj Nots on D isoparamtric lmnts Isoparamtric Concpt Th isoparamtric

More information

Computing and Communications -- Network Coding

Computing and Communications -- Network Coding 89 90 98 00 Computing and Communications -- Ntwork Coding Dr. Zhiyong Chn Institut of Wirlss Communications Tchnology Shanghai Jiao Tong Univrsity China Lctur 5- Nov. 05 0 Classical Information Thory Sourc

More information

Approximation and Inapproximation for The Influence Maximization Problem in Social Networks under Deterministic Linear Threshold Model

Approximation and Inapproximation for The Influence Maximization Problem in Social Networks under Deterministic Linear Threshold Model 20 3st Intrnational Confrnc on Distributd Computing Systms Workshops Approximation and Inapproximation for Th Influnc Maximization Problm in Social Ntworks undr Dtrministic Linar Thrshold Modl Zaixin Lu,

More information

That is, we start with a general matrix: And end with a simpler matrix:

That is, we start with a general matrix: And end with a simpler matrix: DIAGON ALIZATION OF THE STR ESS TEN SOR INTRO DUCTIO N By th us of Cauchy s thorm w ar abl to rduc th numbr of strss componnts in th strss tnsor to only nin valus. An additional simplification of th strss

More information

ON THE DISTRIBUTION OF THE ELLIPTIC SUBSET SUM GENERATOR OF PSEUDORANDOM NUMBERS

ON THE DISTRIBUTION OF THE ELLIPTIC SUBSET SUM GENERATOR OF PSEUDORANDOM NUMBERS INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 8 2008, #A3 ON THE DISTRIBUTION OF THE ELLIPTIC SUBSET SUM GENERATOR OF PSEUDORANDOM NUMBERS Edwin D. El-Mahassni Dpartmnt of Computing, Macquari

More information

NEW APPLICATIONS OF THE ABEL-LIOUVILLE FORMULA

NEW APPLICATIONS OF THE ABEL-LIOUVILLE FORMULA NE APPLICATIONS OF THE ABEL-LIOUVILLE FORMULA Mirca I CÎRNU Ph Dp o Mathmatics III Faculty o Applid Scincs Univrsity Polithnica o Bucharst Cirnumirca @yahoocom Abstract In a rcnt papr [] 5 th indinit intgrals

More information

Thus, because if either [G : H] or [H : K] is infinite, then [G : K] is infinite, then [G : K] = [G : H][H : K] for all infinite cases.

Thus, because if either [G : H] or [H : K] is infinite, then [G : K] is infinite, then [G : K] = [G : H][H : K] for all infinite cases. Homwork 5 M 373K Solutions Mark Lindbrg and Travis Schdlr 1. Prov that th ring Z/mZ (for m 0) is a fild if and only if m is prim. ( ) Proof by Contrapositiv: Hr, thr ar thr cass for m not prim. m 0: Whn

More information

Addition of angular momentum

Addition of angular momentum Addition of angular momntum April, 0 Oftn w nd to combin diffrnt sourcs of angular momntum to charactriz th total angular momntum of a systm, or to divid th total angular momntum into parts to valuat th

More information

Figure 1: Closed surface, surface with boundary, or not a surface?

Figure 1: Closed surface, surface with boundary, or not a surface? QUESTION 1 (10 marks) Two o th topological spacs shown in Figur 1 ar closd suracs, two ar suracs with boundary, and two ar not suracs. Dtrmin which is which. You ar not rquird to justiy your answr, but,

More information

DISTRIBUTION OF DIFFERENCE BETWEEN INVERSES OF CONSECUTIVE INTEGERS MODULO P

DISTRIBUTION OF DIFFERENCE BETWEEN INVERSES OF CONSECUTIVE INTEGERS MODULO P DISTRIBUTION OF DIFFERENCE BETWEEN INVERSES OF CONSECUTIVE INTEGERS MODULO P Tsz Ho Chan Dartmnt of Mathmatics, Cas Wstrn Rsrv Univrsity, Clvland, OH 4406, USA txc50@cwru.du Rcivd: /9/03, Rvisd: /9/04,

More information

Deift/Zhou Steepest descent, Part I

Deift/Zhou Steepest descent, Part I Lctur 9 Dift/Zhou Stpst dscnt, Part I W now focus on th cas of orthogonal polynomials for th wight w(x) = NV (x), V (x) = t x2 2 + x4 4. Sinc th wight dpnds on th paramtr N N w will writ π n,n, a n,n,

More information

arxiv: v1 [cs.cg] 25 Jun 2012

arxiv: v1 [cs.cg] 25 Jun 2012 A Nw Uppr Bound for th VC-Dimnsion of Visibility Rgions arxi:1206.56891 [cs.cg] 25 Jun 2012 Alxandr Gilbrs Institut of Computr Scinc Unirsity of Bonn 53113 Bonn, Grmany gilbrs@cs.uni-bonn.d May 2, 2014

More information

INCOMPLETE KLOOSTERMAN SUMS AND MULTIPLICATIVE INVERSES IN SHORT INTERVALS. xy 1 (mod p), (x, y) I (j)

INCOMPLETE KLOOSTERMAN SUMS AND MULTIPLICATIVE INVERSES IN SHORT INTERVALS. xy 1 (mod p), (x, y) I (j) INCOMPLETE KLOOSTERMAN SUMS AND MULTIPLICATIVE INVERSES IN SHORT INTERVALS T D BROWNING AND A HAYNES Abstract W invstigat th solubility of th congrunc xy (mod ), whr is a rim and x, y ar rstrictd to li

More information

Equidistribution and Weyl s criterion

Equidistribution and Weyl s criterion Euidistribution and Wyl s critrion by Brad Hannigan-Daly W introduc th ida of a sunc of numbrs bing uidistributd (mod ), and w stat and prov a thorm of Hrmann Wyl which charactrizs such suncs. W also discuss

More information

EXST Regression Techniques Page 1

EXST Regression Techniques Page 1 EXST704 - Rgrssion Tchniqus Pag 1 Masurmnt rrors in X W hav assumd that all variation is in Y. Masurmnt rror in this variabl will not ffct th rsults, as long as thy ar uncorrlatd and unbiasd, sinc thy

More information

Function Spaces. a x 3. (Letting x = 1 =)) a(0) + b + c (1) = 0. Row reducing the matrix. b 1. e 4 3. e 9. >: (x = 1 =)) a(0) + b + c (1) = 0

Function Spaces. a x 3. (Letting x = 1 =)) a(0) + b + c (1) = 0. Row reducing the matrix. b 1. e 4 3. e 9. >: (x = 1 =)) a(0) + b + c (1) = 0 unction Spacs Prrquisit: Sction 4.7, Coordinatization n this sction, w apply th tchniqus of Chaptr 4 to vctor spacs whos lmnts ar functions. Th vctor spacs P n and P ar familiar xampls of such spacs. Othr

More information

Multicoloured Hamilton cycles and perfect matchings in pseudo-random graphs

Multicoloured Hamilton cycles and perfect matchings in pseudo-random graphs Multicolourd Hamilton cycls and prfct matchings in psudo-random graphs Danila Kühn Dryk Osthus Abstract Givn 0 < p < 1, w prov that a psudo-random graph G with dg dnsity p and sufficintly larg ordr has

More information

Examples and applications on SSSP and MST

Examples and applications on SSSP and MST Exampls an applications on SSSP an MST Dan (Doris) H & Junhao Gan ITEE Univrsity of Qunslan COMP3506/7505, Uni of Qunslan Exampls an applications on SSSP an MST Dijkstra s Algorithm Th algorithm solvs

More information

SECTION where P (cos θ, sin θ) and Q(cos θ, sin θ) are polynomials in cos θ and sin θ, provided Q is never equal to zero.

SECTION where P (cos θ, sin θ) and Q(cos θ, sin θ) are polynomials in cos θ and sin θ, provided Q is never equal to zero. SETION 6. 57 6. Evaluation of Dfinit Intgrals Exampl 6.6 W hav usd dfinit intgrals to valuat contour intgrals. It may com as a surpris to larn that contour intgrals and rsidus can b usd to valuat crtain

More information

Lecture 6.4: Galois groups

Lecture 6.4: Galois groups Lctur 6.4: Galois groups Matthw Macauly Dpartmnt of Mathmatical Scincs Clmson Univrsity http://www.math.clmson.du/~macaul/ Math 4120, Modrn Algbra M. Macauly (Clmson) Lctur 6.4: Galois groups Math 4120,

More information

10. The Discrete-Time Fourier Transform (DTFT)

10. The Discrete-Time Fourier Transform (DTFT) Th Discrt-Tim Fourir Transform (DTFT Dfinition of th discrt-tim Fourir transform Th Fourir rprsntation of signals plays an important rol in both continuous and discrt signal procssing In this sction w

More information

Cramér-Rao Inequality: Let f(x; θ) be a probability density function with continuous parameter

Cramér-Rao Inequality: Let f(x; θ) be a probability density function with continuous parameter WHEN THE CRAMÉR-RAO INEQUALITY PROVIDES NO INFORMATION STEVEN J. MILLER Abstract. W invstigat a on-paramtr family of probability dnsitis (rlatd to th Parto distribution, which dscribs many natural phnomna)

More information

A Propagating Wave Packet Group Velocity Dispersion

A Propagating Wave Packet Group Velocity Dispersion Lctur 8 Phys 375 A Propagating Wav Packt Group Vlocity Disprsion Ovrviw and Motivation: In th last lctur w lookd at a localizd solution t) to th 1D fr-particl Schrödingr quation (SE) that corrsponds to

More information

REPRESENTATIONS OF LIE GROUPS AND LIE ALGEBRAS

REPRESENTATIONS OF LIE GROUPS AND LIE ALGEBRAS REPRESENTATIONS OF LIE GROUPS AND LIE ALGEBRAS JIAQI JIANG Abstract. This papr studis th rlationship btwn rprsntations of a Li group and rprsntations of its Li algbra. W will mak th corrspondnc in two

More information

Roadmap. XML Indexing. DataGuide example. DataGuides. Strong DataGuides. Multiple DataGuides for same data. CPS Topics in Database Systems

Roadmap. XML Indexing. DataGuide example. DataGuides. Strong DataGuides. Multiple DataGuides for same data. CPS Topics in Database Systems Roadmap XML Indxing CPS 296.1 Topics in Databas Systms Indx fabric Coopr t al. A Fast Indx for Smistructurd Data. VLDB, 2001 DataGuid Goldman and Widom. DataGuids: Enabling Qury Formulation and Optimization

More information

MATH 319, WEEK 15: The Fundamental Matrix, Non-Homogeneous Systems of Differential Equations

MATH 319, WEEK 15: The Fundamental Matrix, Non-Homogeneous Systems of Differential Equations MATH 39, WEEK 5: Th Fundamntal Matrix, Non-Homognous Systms of Diffrntial Equations Fundamntal Matrics Considr th problm of dtrmining th particular solution for an nsmbl of initial conditions For instanc,

More information

COMPUTER GENERATED HOLOGRAMS Optical Sciences 627 W.J. Dallas (Monday, April 04, 2005, 8:35 AM) PART I: CHAPTER TWO COMB MATH.

COMPUTER GENERATED HOLOGRAMS Optical Sciences 627 W.J. Dallas (Monday, April 04, 2005, 8:35 AM) PART I: CHAPTER TWO COMB MATH. C:\Dallas\0_Courss\03A_OpSci_67\0 Cgh_Book\0_athmaticalPrliminaris\0_0 Combath.doc of 8 COPUTER GENERATED HOLOGRAS Optical Scincs 67 W.J. Dallas (onday, April 04, 005, 8:35 A) PART I: CHAPTER TWO COB ATH

More information

Title: Vibrational structure of electronic transition

Title: Vibrational structure of electronic transition Titl: Vibrational structur of lctronic transition Pag- Th band spctrum sn in th Ultra-Violt (UV) and visibl (VIS) rgions of th lctromagntic spctrum can not intrprtd as vibrational and rotational spctrum

More information

perm4 A cnt 0 for for if A i 1 A i cnt cnt 1 cnt i j. j k. k l. i k. j l. i l

perm4 A cnt 0 for for if A i 1 A i cnt cnt 1 cnt i j. j k. k l. i k. j l. i l h 4D, 4th Rank, Antisytric nsor and th 4D Equivalnt to th Cross Product or Mor Fun with nsors!!! Richard R Shiffan Digital Graphics Assoc 8 Dunkirk Av LA, Ca 95 rrs@isidu his docunt dscribs th four dinsional

More information

Propositional Logic. Combinatorial Problem Solving (CPS) Albert Oliveras Enric Rodríguez-Carbonell. May 17, 2018

Propositional Logic. Combinatorial Problem Solving (CPS) Albert Oliveras Enric Rodríguez-Carbonell. May 17, 2018 Propositional Logic Combinatorial Problm Solving (CPS) Albrt Olivras Enric Rodríguz-Carbonll May 17, 2018 Ovrviw of th sssion Dfinition of Propositional Logic Gnral Concpts in Logic Rduction to SAT CNFs

More information

Objective Mathematics

Objective Mathematics x. Lt 'P' b a point on th curv y and tangnt x drawn at P to th curv has gratst slop in magnitud, thn point 'P' is,, (0, 0),. Th quation of common tangnt to th curvs y = 6 x x and xy = x + is : x y = 8

More information

Fourier Transforms and the Wave Equation. Key Mathematics: More Fourier transform theory, especially as applied to solving the wave equation.

Fourier Transforms and the Wave Equation. Key Mathematics: More Fourier transform theory, especially as applied to solving the wave equation. Lur 7 Fourir Transforms and th Wav Euation Ovrviw and Motivation: W first discuss a fw faturs of th Fourir transform (FT), and thn w solv th initial-valu problm for th wav uation using th Fourir transform

More information

MATHEMATICS PAPER IB COORDINATE GEOMETRY(2D &3D) AND CALCULUS. Note: This question paper consists of three sections A,B and C.

MATHEMATICS PAPER IB COORDINATE GEOMETRY(2D &3D) AND CALCULUS. Note: This question paper consists of three sections A,B and C. MATHEMATICS PAPER IB COORDINATE GEOMETRY(D &D) AND CALCULUS. TIME : hrs Ma. Marks.75 Not: This qustion papr consists of thr sctions A,B and C. SECTION A VERY SHORT ANSWER TYPE QUESTIONS. 0X =0.If th portion

More information

The van der Waals interaction 1 D. E. Soper 2 University of Oregon 20 April 2012

The van der Waals interaction 1 D. E. Soper 2 University of Oregon 20 April 2012 Th van dr Waals intraction D. E. Sopr 2 Univrsity of Orgon 20 pril 202 Th van dr Waals intraction is discussd in Chaptr 5 of J. J. Sakurai, Modrn Quantum Mchanics. Hr I tak a look at it in a littl mor

More information

Abstract Interpretation: concrete and abstract semantics

Abstract Interpretation: concrete and abstract semantics Abstract Intrprtation: concrt and abstract smantics Concrt smantics W considr a vry tiny languag that manags arithmtic oprations on intgrs valus. Th (concrt) smantics of th languags cab b dfind by th funzcion

More information

Calculus concepts derivatives

Calculus concepts derivatives All rasonabl fforts hav bn mad to mak sur th nots ar accurat. Th author cannot b hld rsponsibl for any damags arising from th us of ths nots in any fashion. Calculus concpts drivativs Concpts involving

More information

Homework #3. 1 x. dx. It therefore follows that a sum of the

Homework #3. 1 x. dx. It therefore follows that a sum of the Danil Cannon CS 62 / Luan March 5, 2009 Homwork # 1. Th natural logarithm is dfind by ln n = n 1 dx. It thrfor follows that a sum of th 1 x sam addnd ovr th sam intrval should b both asymptotically uppr-

More information

22/ Breakdown of the Born-Oppenheimer approximation. Selection rules for rotational-vibrational transitions. P, R branches.

22/ Breakdown of the Born-Oppenheimer approximation. Selection rules for rotational-vibrational transitions. P, R branches. Subjct Chmistry Papr No and Titl Modul No and Titl Modul Tag 8/ Physical Spctroscopy / Brakdown of th Born-Oppnhimr approximation. Slction ruls for rotational-vibrational transitions. P, R branchs. CHE_P8_M

More information

CLONES IN 3-CONNECTED FRAME MATROIDS

CLONES IN 3-CONNECTED FRAME MATROIDS CLONES IN 3-CONNECTED FRAME MATROIDS JAKAYLA ROBBINS, DANIEL SLILATY, AND XIANGQIAN ZHOU Abstract. W dtrmin th structur o clonal classs o 3-connctd ram matroids in trms o th structur o biasd graphs. Robbins

More information

u 3 = u 3 (x 1, x 2, x 3 )

u 3 = u 3 (x 1, x 2, x 3 ) Lctur 23: Curvilinar Coordinats (RHB 8.0 It is oftn convnint to work with variabls othr than th Cartsian coordinats x i ( = x, y, z. For xampl in Lctur 5 w mt sphrical polar and cylindrical polar coordinats.

More information

Solution: APPM 1360 Final (150 pts) Spring (60 pts total) The following parts are not related, justify your answers:

Solution: APPM 1360 Final (150 pts) Spring (60 pts total) The following parts are not related, justify your answers: APPM 6 Final 5 pts) Spring 4. 6 pts total) Th following parts ar not rlatd, justify your answrs: a) Considr th curv rprsntd by th paramtric quations, t and y t + for t. i) 6 pts) Writ down th corrsponding

More information

Supplementary Materials

Supplementary Materials 6 Supplmntary Matrials APPENDIX A PHYSICAL INTERPRETATION OF FUEL-RATE-SPEED FUNCTION A truck running on a road with grad/slop θ positiv if moving up and ngativ if moving down facs thr rsistancs: arodynamic

More information

1.2 Faraday s law A changing magnetic field induces an electric field. Their relation is given by:

1.2 Faraday s law A changing magnetic field induces an electric field. Their relation is given by: Elctromagntic Induction. Lorntz forc on moving charg Point charg moving at vlocity v, F qv B () For a sction of lctric currnt I in a thin wir dl is Idl, th forc is df Idl B () Elctromotiv forc f s any

More information

2008 AP Calculus BC Multiple Choice Exam

2008 AP Calculus BC Multiple Choice Exam 008 AP Multipl Choic Eam Nam 008 AP Calculus BC Multipl Choic Eam Sction No Calculator Activ AP Calculus 008 BC Multipl Choic. At tim t 0, a particl moving in th -plan is th acclration vctor of th particl

More information

WEIGHTED SZEGED INDEX OF GRAPHS

WEIGHTED SZEGED INDEX OF GRAPHS BULLETIN OF THE INTERNATIONAL MATHEMATICAL VIRTUAL INSTITUTE ISSN (p) 2303-4874, ISSN (o) 2303-4955 www.imvib.org /JOURNALS / BULLETIN Vo. 8(2018), 11-19 DOI: 10.7251/BIMVI1801011P Formr BULLETIN OF THE

More information

Mapping properties of the elliptic maximal function

Mapping properties of the elliptic maximal function Rv. Mat. Ibroamricana 19 (2003), 221 234 Mapping proprtis of th lliptic maximal function M. Burak Erdoğan Abstract W prov that th lliptic maximal function maps th Sobolv spac W 4,η (R 2 )intol 4 (R 2 )

More information

Some remarks on Kurepa s left factorial

Some remarks on Kurepa s left factorial Som rmarks on Kurpa s lft factorial arxiv:math/0410477v1 [math.nt] 21 Oct 2004 Brnd C. Kllnr Abstract W stablish a connction btwn th subfactorial function S(n) and th lft factorial function of Kurpa K(n).

More information

On the number of pairs of positive integers x,y H such that x 2 +y 2 +1, x 2 +y 2 +2 are square-free

On the number of pairs of positive integers x,y H such that x 2 +y 2 +1, x 2 +y 2 +2 are square-free arxiv:90.04838v [math.nt] 5 Jan 09 On th numbr of pairs of positiv intgrs x,y H such that x +y +, x +y + ar squar-fr S. I. Dimitrov Abstract In th prsnt papr w show that thr xist infinitly many conscutiv

More information

Solution of Assignment #2

Solution of Assignment #2 olution of Assignmnt #2 Instructor: Alirza imchi Qustion #: For simplicity, assum that th distribution function of T is continuous. Th distribution function of R is: F R ( r = P( R r = P( log ( T r = P(log

More information

y = 2xe x + x 2 e x at (0, 3). solution: Since y is implicitly related to x we have to use implicit differentiation: 3 6y = 0 y = 1 2 x ln(b) ln(b)

y = 2xe x + x 2 e x at (0, 3). solution: Since y is implicitly related to x we have to use implicit differentiation: 3 6y = 0 y = 1 2 x ln(b) ln(b) 4. y = y = + 5. Find th quation of th tangnt lin for th function y = ( + ) 3 whn = 0. solution: First not that whn = 0, y = (1 + 1) 3 = 8, so th lin gos through (0, 8) and thrfor its y-intrcpt is 8. y

More information

arxiv: v1 [cs.cg] 11 Dec 2013

arxiv: v1 [cs.cg] 11 Dec 2013 A Siml Sw Lin Algorithm for Counting Triangulations and Psudo-triangulations Victor Alvarz Karl Bringmann Saurabh Ray arxiv:1312.3188v1 [cs.cg] 11 Dc 2013 Dcmbr 12, 2013 Abstract Lt P R 2 b a st of n oints.

More information

Difference -Analytical Method of The One-Dimensional Convection-Diffusion Equation

Difference -Analytical Method of The One-Dimensional Convection-Diffusion Equation Diffrnc -Analytical Mthod of Th On-Dimnsional Convction-Diffusion Equation Dalabav Umurdin Dpartmnt mathmatic modlling, Univrsity of orld Economy and Diplomacy, Uzbistan Abstract. An analytical diffrncing

More information

PROOF OF FIRST STANDARD FORM OF NONELEMENTARY FUNCTIONS

PROOF OF FIRST STANDARD FORM OF NONELEMENTARY FUNCTIONS Intrnational Journal Of Advanc Rsarch In Scinc And Enginring http://www.ijars.com IJARSE, Vol. No., Issu No., Fbruary, 013 ISSN-319-8354(E) PROOF OF FIRST STANDARD FORM OF NONELEMENTARY FUNCTIONS 1 Dharmndra

More information

Hardy-Littlewood Conjecture and Exceptional real Zero. JinHua Fei. ChangLing Company of Electronic Technology Baoji Shannxi P.R.

Hardy-Littlewood Conjecture and Exceptional real Zero. JinHua Fei. ChangLing Company of Electronic Technology Baoji Shannxi P.R. Hardy-Littlwood Conjctur and Excptional ral Zro JinHua Fi ChangLing Company of Elctronic Tchnology Baoji Shannxi P.R.China E-mail: fijinhuayoujian@msn.com Abstract. In this papr, w assum that Hardy-Littlwood

More information

ON THE COMPLEXITY OF K-STEP AND K-HOP DOMINATING SETS IN GRAPHS

ON THE COMPLEXITY OF K-STEP AND K-HOP DOMINATING SETS IN GRAPHS MATEMATICA MONTISNIRI Vol XL (2017) MATEMATICS ON TE COMPLEXITY OF K-STEP AN K-OP OMINATIN SETS IN RAPS M FARAI JALALVAN AN N JAFARI RA partmnt of Mathmatcs Shahrood Unrsty of Tchnology Shahrood Iran Emals:

More information

Section 11.6: Directional Derivatives and the Gradient Vector

Section 11.6: Directional Derivatives and the Gradient Vector Sction.6: Dirctional Drivativs and th Gradint Vctor Practic HW rom Stwart Ttbook not to hand in p. 778 # -4 p. 799 # 4-5 7 9 9 35 37 odd Th Dirctional Drivativ Rcall that a b Slop o th tangnt lin to th

More information

64. A Conic Section from Five Elements.

64. A Conic Section from Five Elements. . onic Sction from Fiv Elmnts. To raw a conic sction of which fiv lmnts - points an tangnts - ar known. W consir th thr cass:. Fiv points ar known.. Four points an a tangnt lin ar known.. Thr points an

More information