Spanning tree congestion of some product graphs
|
|
- Earl Weaver
- 5 years ago
- Views:
Transcription
1 Spnning tree congestion of some product grphs Hiu-Fi Lw Mthemticl Institute Oxford University 4-9 St Giles Oxford, OX1 3LB, United Kingdom e-mil: nd Mikhil I. Ostrovskii Deprtment of Mthemtics nd Computer Science St. John s University 8000 Utopi Prkwy Queens, NY 11439, USA e-mil: ostrovsm@stjohns.edu September 9, 010 Abstrct. We estimte spnning tree congestion for crtesin products of pths nd complete grphs. Keywords: Crtesin products, minimum congestion spnning tree, spnning tree congestion 010 Mthemtics Subject Clssifiction. Primry: 05C05 1 Introduction nd bsic definitions Let G be grph nd let T be spnning tree in G (sying this we men tht T is subgrph of G). We follow the terminology nd nottion of []. For A, B V (G) by e G (A, B) we denote the number of edges in G with one end in A nd the other end in B. For ech edge e of T let A e nd B e be the vertex sets of the components of T \e. We define the edge congestion of G in T by ec(g : T ) = mx e E(T ) e G(A e, B e ). The number e G (A e, B e ) is clled the congestion in e. The nme comes from the following nlogy. Imgine tht edges of G re rods, nd edges of T re those rods which re clened from snow fter snowstorms. If we ssume tht 1
2 ech edge in G bers the sme mount of trffic between its vertices, nd tht fter snowstorm ech driver tkes the corresponding (unique) detour in T, then ec(g : T ) describes the trffic congestion t the most congested rod of T. It is cler tht for pplictions it is interesting to find spnning tree which minimizes the congestion. We define the spnning tree congestion of G by s(g) = min{ec(g : T ) : T is spnning tree of G}. (1) Ech spnning tree T in G stisfying ec(g : T ) = s(g) is clled minimum congestion spnning tree. The prmeters ec(g : T ) nd s(g) were introduced nd studied in [9]. Some versions of these prmeters were introduced nd studied before, see, for exmple, [5] nd [10]. One of the interesting problems bout the spnning tree congestion is to estimte/evlute it for some stndrd fmilies of grphs. In this pper we continue the study (see [3], [4], [6], [7], nd [8]) of the spnning tree congestion of crtesin products of complete grphs nd pths. An improvement of the upper bound for 3-dimensionl cubic grids By 3-dimensionl cubic grid [k] 3 we men the crtesin cube of pth of length (k 1), tht is, the grph whose vertex set is the set of ll triples in {0, 1,..., k 1} 3, nd vertices (x 1, x, x 3 ) nd (y 1, y, y 3 ) re djcent if for some i we hve x i y i = 1, nd x j = y j for ll j i. The spnning tree congestion of [k] 3 ws studied in [3] nd [7]. The min result of [3] on this mtter cn be stted s: 6 k o(1) s([k] 3 ) 7 8 k + O(k). () The estimte from below ws independently obtined in [7]. In both ppers the estimte from below is derived from inequlities of [1]. Our purpose now is to improve the upper estimte, replcing 7 by smller 8 number. In the sme wy s in [3] this result cn be derived from the following geometric result. A brick in R 3 is set of the form 3 i=1 [ i, b i ], where i < b i for ll i. A rectiliner body is finite union of bricks. For rectiliner body A [0, 1] 3 we write σ(a) for the surfce re of A in the interior of [0, 1] 3 nd m(a) for the volume (Lebesgue mesure) of A. We denote the re of -dimensionl set S by m (S). Theorem 1. There exists prtition of the solid cube [0, 1] 3 into 6 rectiliner bodies {A i } 6 i=1 such tht mx 1 i 6 m(a i ) 1 nd mx σ(a i) = (3) 1 i 6
3 S S 1 Figure 1: Cuts of [0, 1] [0, 1] Note. The min point of this result is tht the right-hnd side of (3) is < 7/8, simpler prtition for which the mximum in (3) is 7/8 ws found in [3]. Proof of Theorem 1. We let A 1 = [0, ] [1, 1] [0, 1], A = [1, 1] [0, ] [0, 1], where < 1. We cut the fces [0, 1] [0, 1] {0} nd [0, 1] [0, 1] {1} of the cube using rectiliner cuts shown in Figure 1 nd in such wy tht m (S 1 ) = m (S ). The remining elements of the prtition: A 3 = S 1 [ 0, 1 ], A 4 = S 1 [ 1, 1 ], A 5 = S [ 0, 1 ] [ ] 1, A 6 = S, 1. It is esy to see tht σ(a 1 ) = σ(a ) = nd tht σ(a 3 ) = σ(a 4 ) = σ(a 5 ) = σ(a 6 ). We pick in such wy tht σ(a 1 ) = = σ(a 6 ). It remins to find this number. We hve σ(a 3 ) = m (S 1 ) + (1 ) = 1 + (1 ). Equting σ(a 1 ) nd σ(a 3 ) we get = Crtesin products of complete grphs Spnning tree congestion of crtesin products of complete grphs ws studied in [6]. Our purpose here is to get upper estimtes for the spnning tree congestion of crtesin powers of complete grphs. Let d, n N, we introduce the grph H = H(d, n) s crtesin product of d copies of the complete grph K n. This mens tht vertices of H re d-tuples of vertices of K n ; two d-tuples 3
4 (v 1,..., v d ) nd (u 1,..., u d ) re djcent in H if nd only if u i = v i for ll but one i {1,..., d}. When n is cler from context we lso write H d for H(d, n). It ws shown in [6, Lemm 4.4] tht s(h) (n d 1) log n d/d for n, d 3. We use the pproch of [8] to show tht for fixed n nd lrge d ( ) logn d s(h d ) = O n d, (4) ( nd thus s(h d ) = Θ logn d n ). d d To estblish (4) we construct tree T such tht ec(h d : T ) hs suitble estimte from bove. We identify the vertex set of K n with {0, 1,..., n 1} nd denote by 0 d the d-tuple (0,..., 0). We ssume d, n 3. First we construct wht we cll stndrd spnning tree T d of H d, it is tree with centroid t 0 d nd such tht ec(h d : T d ) = (n 1)n d 1. Let T 1 be the spnning tree of H 1 with edge set {0i : i = 1,,, n 1}. Clerly, the congestion of T 1 is n 1. For j 1 nd 0 i n 1, let Tj i = T j {i} H j+1 nd S j+1 = 0 j T 1. Then T j+1 = ( n 1 i=0 T j i ) S j+1 is spnning tree of H j+1, with the property tht one of the components obtined fter deletion of ny of the edges is isomorphic to H for some 0 j. Counting edges joining such component with its complement we get ec(h j+1 : T j+1 ) = mx 0 j ((j + 1 )(n 1)n ) = (n 1)n j. Thus, we hve obtined preliminry estimte s(h d ) (n 1)n d 1. Now we describe our construction of spnning tree of lower congestion in H d for d lrge compred to n. Lter we shll lso use the observtion tht the rdius of the stndrd spnning tree is d nd tht 0 d is its centrl vertex. 1. We prtition V (H d ) = v V (Hk )V (H v ) where k = log n d(n 1) nd V (H v ) = {v} V (H d k ). In other words, we prtition H d into t most d(n 1) pieces which re isomorphic to crtesin powers of K n. The min ide behind this is tht the edge-boundry of ech such piece is close to the bound given by edge-isoperimetric inequlity; this is why we get close-to-optiml bound for congestion.. The spnning tree which we construct is union of trees S(v) which re close to stndrd spnning trees of H v nd tree F, which we cll frme, connecting H v with 0 d ; 0 d is centroid of the constructed tree. The tree F is constructed s subdivided str with V (H k ) leves, ech leve is in the corresponding V (H v ). 3. The tree F in ddition to lef in V (H v ) hs to contin some vertices of v V (H k ) V (Hv ) s vertices of degree. For this reson the union of F nd of ll stndrd spnning trees in H v is not tree, we hve to modify stndrd spnning trees in H v nd to show tht this modifiction does not ffect much the spnning tree congestion. d 4
5 Since we ssumed d, n 3, we hve k = log n d(n 1) 1. We turn to construction of F. Let T be stndrd spnning tree of H k. Since the degree of 0 k in T is p := k(n 1), we my choose leves l 1, l,, l p such tht the pths in T from 0 k to l 1, l,, l p re edge-disjoint. We construct pth in H d joining 0 d nd H l i (i = 1,,, p) in the following wy. Let 0 k T l i = 0 k v i1 v i l i be the pth joining 0 k nd l i in T. Then 0 d (v i1, 0 d k )(v i, 0 d k ) (l i, 0 d k ) is the desired pth, we denote it P (l i ). Let r 1 = 0 k, r,, r q be the remining vertices of T, where q = n k k(n 1) (n 1)(d k). Let ϕ : {r 1, r,, r q } {(, b) {1,..., d k}, b {1,..., n 1}} be n injection such tht ϕ(r 1 ) = (1, 1). For ech 1 j q, let f j = be where ϕ(r j ) = (, b) nd {e 1, e,, e d k } forms unit vector bsis of R d k. We identify f j with the corresponding vertex in H d k. We construct pths P (r j ) joining 0 d nd H r j s follows. We let P (r 1 ) = 0 d (0 k, f 1 ). If j nd 0 k T r j = 0 k u j1 u j r j is the corresponding pth in T, we let P (r j ) = 0 d (0 k, f j )(u j1, f j )(u j, f j ) (r j, f j ). The union of ll pths P (l i ) nd P (r j ) is subdivided str which is the desired frme F. We use the term connecting vertices for leves of F. Our next step is to find spnning tree S(v) in the reminder of ech H v. By the reminder we men H v from which we remove ll vertices hving degree in F. If v = l i, there re no vertices of F of degree in H v, nd we let S(v) to be stndrd spnning tree in H v with the centroid t the connecting vertex (v, 0 d k ). For v = r j the connecting vertex is neighbor of (v, 0 d k ), becuse f j hs only one non-zero coordinte. Some other neighbors of (v, 0 d k ) lso cn hve degree on F, they cn belong to some of the pths P (r k ), k j. The vertex (v, 0 d k ) itself cn belong to one of P (l i ). Since H d k is edge-trnsitive, it is esy to check tht there is n isomorphism of H d k onto H v which mps the stndrd spnning tree of H d k onto tree R(v) for which ll neighbors of (v, 0 d k ) re leves. Deleting from R(v) those of these leves which hve degree in F we get the desired tree S(v). Similr construction works for r 1 = 0 k nd f 1 = e 1. An importnt observtion which follows from our definition of f j is tht every edge of S(v) disconnects either copy of H, or copy of H with one vertex deleted for 0 d k 1. We form the desired spnning tree in H d s T = ( v H k S(v) ) F. Now we estimte ec(h d : T ). The congestion in n edge of S(l i ) which seprtes component isomorphic to H ( {1,..., d k 1}) is (n 1)(d )n. This quntity is mximized when = d k 1, so it does not exceed (n 1)(k + 1)n d k 1. 5
6 The congestion in n edge of S(r j ), which seprtes component isomorphic to H cn be estimted s bove. If the seprted component is H with one vertex deleted, it is esy to see tht the congestion does not exceed (n 1)(d )(n 1) + (n 1). As the derivtive of this function with respect to is positive, we conclude tht the congestion does not exceed (n 1) ( (k + 1)n d k 1 + d ). The congestion in n edge of F incident with connecting vertex of H v cn be estimted s follows. Let b {1,..., q} be the number of other vertices in V (H v ) V (F). The congestion does not exceed (n 1)k(n d k b) + b(n 1)(d k) < (n 1)(kn d k + bd) (n 1)[kn d k + (n k k(n 1))d] The length of the pth from the connecting vertex to 0 d in F does not exceed k + 1. The congestion increses by t most d(n 1) with ech edge on the wy from the connecting vertex to 0 d (becuse d(n 1) is the degree of vertex). Therefore, the congestion in n edge in F is t most (n 1) ( kn d k + (n k k(n 1))d + (k + 1)d ). Tking the mximum of these three estimtes we get ec(h d : T ) (n 1)[kn d k + d(n k kn + k + 1)]. Thus, we hve proved the following upper bound. As we observed bove, if n is fixed nd d is lrge, this bound is close to the corresponding lower bound from [6]. Theorem. If d, n 3, then {( ) } logn d(n 1) s(h d ) (n 1) min n d + d (n 1), n d 1. n log n d(n 1) References [1] B. Bollobás nd I. Leder, Edge-isoperimetric inequlities in the grid, Combintoric, 11 (1991), no. 4, [] J. A. Bondy, U. S. R. Murty, Grph theory, Grdute Texts in Mthemtics, 44, Springer, New York, 008. [3] A. Cstejón, M. I. Ostrovskii, Minimum congestion spnning trees of grids nd discrete toruses, Discussiones Mthemtice Grph Theory, 9 (009), [4] S. W. Hrusk, On tree congestion of grphs, Discrete Mth., 308 (008), [5] S. Khuller, B. Rghvchri, N. Young, Designing multi-commodity flow trees, Informtion Processing Letters, 50 (1994), [6] K. Kozw, Y. Otchi, On spnning tree congestion of Hmming grphs, preprint, 009. [7] K. Kozw, Y. Otchi, K. Ymzki, On spnning tree congestion of grphs, Discrete Mth., 309 (009), [8] H.-F. Lw, Spnning tree congestion of the hypercube, Discrete Mth., 309 (009),
7 [9] M. I. Ostrovskii, Miniml congestion trees, Discrete Mth., 85 (004), [10] S. Simonson, A vrition on the min cut liner rrngement problem, Mth. Systems Theory, 0 (1987), no. 4,
Riemann is the Mann! (But Lebesgue may besgue to differ.)
Riemnn is the Mnn! (But Lebesgue my besgue to differ.) Leo Livshits My 2, 2008 1 For finite intervls in R We hve seen in clss tht every continuous function f : [, b] R hs the property tht for every ɛ >
More informationBinding Numbers for all Fractional (a, b, k)-critical Graphs
Filomt 28:4 (2014), 709 713 DOI 10.2298/FIL1404709Z Published by Fculty of Sciences nd Mthemtics, University of Niš, Serbi Avilble t: http://www.pmf.ni.c.rs/filomt Binding Numbers for ll Frctionl (, b,
More informationAdvanced Calculus: MATH 410 Notes on Integrals and Integrability Professor David Levermore 17 October 2004
Advnced Clculus: MATH 410 Notes on Integrls nd Integrbility Professor Dvid Levermore 17 October 2004 1. Definite Integrls In this section we revisit the definite integrl tht you were introduced to when
More informationRiemann Sums and Riemann Integrals
Riemnn Sums nd Riemnn Integrls Jmes K. Peterson Deprtment of Biologicl Sciences nd Deprtment of Mthemticl Sciences Clemson University August 26, 2013 Outline 1 Riemnn Sums 2 Riemnn Integrls 3 Properties
More informationRiemann Sums and Riemann Integrals
Riemnn Sums nd Riemnn Integrls Jmes K. Peterson Deprtment of Biologicl Sciences nd Deprtment of Mthemticl Sciences Clemson University August 26, 203 Outline Riemnn Sums Riemnn Integrls Properties Abstrct
More informationW. We shall do so one by one, starting with I 1, and we shall do it greedily, trying
Vitli covers 1 Definition. A Vitli cover of set E R is set V of closed intervls with positive length so tht, for every δ > 0 nd every x E, there is some I V with λ(i ) < δ nd x I. 2 Lemm (Vitli covering)
More informationThe Regulated and Riemann Integrals
Chpter 1 The Regulted nd Riemnn Integrls 1.1 Introduction We will consider severl different pproches to defining the definite integrl f(x) dx of function f(x). These definitions will ll ssign the sme vlue
More informationBinding Number and Connected (g, f + 1)-Factors in Graphs
Binding Number nd Connected (g, f + 1)-Fctors in Grphs Jinsheng Ci, Guizhen Liu, nd Jinfeng Hou School of Mthemtics nd system science, Shndong University, Jinn 50100, P.R.Chin helthci@163.com Abstrct.
More informationCzechoslovak Mathematical Journal, 55 (130) (2005), , Abbotsford. 1. Introduction
Czechoslovk Mthemticl Journl, 55 (130) (2005), 933 940 ESTIMATES OF THE REMAINDER IN TAYLOR S THEOREM USING THE HENSTOCK-KURZWEIL INTEGRAL, Abbotsford (Received Jnury 22, 2003) Abstrct. When rel-vlued
More informationLinearly Similar Polynomials
Linerly Similr Polynomils rthur Holshouser 3600 Bullrd St. Chrlotte, NC, US Hrold Reiter Deprtment of Mthemticl Sciences University of North Crolin Chrlotte, Chrlotte, NC 28223, US hbreiter@uncc.edu stndrd
More informationMath 61CM - Solutions to homework 9
Mth 61CM - Solutions to homework 9 Cédric De Groote November 30 th, 2018 Problem 1: Recll tht the left limit of function f t point c is defined s follows: lim f(x) = l x c if for ny > 0 there exists δ
More informationODE: Existence and Uniqueness of a Solution
Mth 22 Fll 213 Jerry Kzdn ODE: Existence nd Uniqueness of Solution The Fundmentl Theorem of Clculus tells us how to solve the ordinry differentil eqution (ODE) du = f(t) dt with initil condition u() =
More informationarxiv: v1 [math.ra] 1 Nov 2014
CLASSIFICATION OF COMPLEX CYCLIC LEIBNIZ ALGEBRAS DANIEL SCOFIELD AND S MCKAY SULLIVAN rxiv:14110170v1 [mthra] 1 Nov 2014 Abstrct Since Leibniz lgebrs were introduced by Lody s generliztion of Lie lgebrs,
More informationMath 360: A primitive integral and elementary functions
Mth 360: A primitive integrl nd elementry functions D. DeTurck University of Pennsylvni October 16, 2017 D. DeTurck Mth 360 001 2017C: Integrl/functions 1 / 32 Setup for the integrl prtitions Definition:
More informationLecture 3 ( ) (translated and slightly adapted from lecture notes by Martin Klazar)
Lecture 3 (5.3.2018) (trnslted nd slightly dpted from lecture notes by Mrtin Klzr) Riemnn integrl Now we define precisely the concept of the re, in prticulr, the re of figure U(, b, f) under the grph of
More informationUNIFORM CONVERGENCE. Contents 1. Uniform Convergence 1 2. Properties of uniform convergence 3
UNIFORM CONVERGENCE Contents 1. Uniform Convergence 1 2. Properties of uniform convergence 3 Suppose f n : Ω R or f n : Ω C is sequence of rel or complex functions, nd f n f s n in some sense. Furthermore,
More informationImproper Integrals, and Differential Equations
Improper Integrls, nd Differentil Equtions October 22, 204 5.3 Improper Integrls Previously, we discussed how integrls correspond to res. More specificlly, we sid tht for function f(x), the region creted
More informationReview of Riemann Integral
1 Review of Riemnn Integrl In this chpter we review the definition of Riemnn integrl of bounded function f : [, b] R, nd point out its limittions so s to be convinced of the necessity of more generl integrl.
More informationLecture 2e Orthogonal Complement (pages )
Lecture 2e Orthogonl Complement (pges -) We hve now seen tht n orthonorml sis is nice wy to descrie suspce, ut knowing tht we wnt n orthonorml sis doesn t mke one fll into our lp. In theory, the process
More informationSelf-similarity and symmetries of Pascal s triangles and simplices mod p
Sn Jose Stte University SJSU ScholrWorks Fculty Publictions Mthemtics nd Sttistics Februry 2004 Self-similrity nd symmetries of Pscl s tringles nd simplices mod p Richrd P. Kubelk Sn Jose Stte University,
More informationHeat flux and total heat
Het flux nd totl het John McCun Mrch 14, 2017 1 Introduction Yesterdy (if I remember correctly) Ms. Prsd sked me question bout the condition of insulted boundry for the 1D het eqution, nd (bsed on glnce
More informationChapter 0. What is the Lebesgue integral about?
Chpter 0. Wht is the Lebesgue integrl bout? The pln is to hve tutoril sheet ech week, most often on Fridy, (to be done during the clss) where you will try to get used to the ides introduced in the previous
More informationLecture 1. Functional series. Pointwise and uniform convergence.
1 Introduction. Lecture 1. Functionl series. Pointwise nd uniform convergence. In this course we study mongst other things Fourier series. The Fourier series for periodic function f(x) with period 2π is
More informationII. Integration and Cauchy s Theorem
MTH6111 Complex Anlysis 2009-10 Lecture Notes c Shun Bullett QMUL 2009 II. Integrtion nd Cuchy s Theorem 1. Pths nd integrtion Wrning Different uthors hve different definitions for terms like pth nd curve.
More informationNote 16. Stokes theorem Differential Geometry, 2005
Note 16. Stokes theorem ifferentil Geometry, 2005 Stokes theorem is the centrl result in the theory of integrtion on mnifolds. It gives the reltion between exterior differentition (see Note 14) nd integrtion
More information13.3 CLASSICAL STRAIGHTEDGE AND COMPASS CONSTRUCTIONS
33 CLASSICAL STRAIGHTEDGE AND COMPASS CONSTRUCTIONS As simple ppliction of the results we hve obtined on lgebric extensions, nd in prticulr on the multiplictivity of extension degrees, we cn nswer (in
More informationN 0 completions on partial matrices
N 0 completions on prtil mtrices C. Jordán C. Mendes Arújo Jun R. Torregros Instituto de Mtemátic Multidisciplinr / Centro de Mtemátic Universidd Politécnic de Vlenci / Universidde do Minho Cmino de Ver
More informationEuler, Ioachimescu and the trapezium rule. G.J.O. Jameson (Math. Gazette 96 (2012), )
Euler, Iochimescu nd the trpezium rule G.J.O. Jmeson (Mth. Gzette 96 (0), 36 4) The following results were estblished in recent Gzette rticle [, Theorems, 3, 4]. Given > 0 nd 0 < s
More information38 Riemann sums and existence of the definite integral.
38 Riemnn sums nd existence of the definite integrl. In the clcultion of the re of the region X bounded by the grph of g(x) = x 2, the x-xis nd 0 x b, two sums ppered: ( n (k 1) 2) b 3 n 3 re(x) ( n These
More informationIntroduction to Group Theory
Introduction to Group Theory Let G be n rbitrry set of elements, typiclly denoted s, b, c,, tht is, let G = {, b, c, }. A binry opertion in G is rule tht ssocites with ech ordered pir (,b) of elements
More informationThis article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and
This rticle ppered in journl published by Elsevier. The ttched copy is furnished to the uthor for internl non-commercil reserch nd eduction use, including for instruction t the uthors institution nd shring
More informationA PROOF OF THE FUNDAMENTAL THEOREM OF CALCULUS USING HAUSDORFF MEASURES
INROADS Rel Anlysis Exchnge Vol. 26(1), 2000/2001, pp. 381 390 Constntin Volintiru, Deprtment of Mthemtics, University of Buchrest, Buchrest, Romni. e-mil: cosv@mt.cs.unibuc.ro A PROOF OF THE FUNDAMENTAL
More informationRecitation 3: More Applications of the Derivative
Mth 1c TA: Pdric Brtlett Recittion 3: More Applictions of the Derivtive Week 3 Cltech 2012 1 Rndom Question Question 1 A grph consists of the following: A set V of vertices. A set E of edges where ech
More informationChapter 14. Matrix Representations of Linear Transformations
Chpter 4 Mtrix Representtions of Liner Trnsformtions When considering the Het Stte Evolution, we found tht we could describe this process using multipliction by mtrix. This ws nice becuse computers cn
More informationWHEN IS A FUNCTION NOT FLAT? 1. Introduction. {e 1 0, x = 0. f(x) =
WHEN IS A FUNCTION NOT FLAT? YIFEI PAN AND MEI WANG Abstrct. In this pper we prove unique continution property for vector vlued functions of one vrible stisfying certin differentil inequlity. Key words:
More informationAdvanced Calculus: MATH 410 Uniform Convergence of Functions Professor David Levermore 11 December 2015
Advnced Clculus: MATH 410 Uniform Convergence of Functions Professor Dvid Levermore 11 December 2015 12. Sequences of Functions We now explore two notions of wht it mens for sequence of functions {f n
More informationf(x)dx . Show that there 1, 0 < x 1 does not exist a differentiable function g : [ 1, 1] R such that g (x) = f(x) for all
3 Definite Integrl 3.1 Introduction In school one comes cross the definition of the integrl of rel vlued function defined on closed nd bounded intervl [, b] between the limits nd b, i.e., f(x)dx s the
More informationFarey Fractions. Rickard Fernström. U.U.D.M. Project Report 2017:24. Department of Mathematics Uppsala University
U.U.D.M. Project Report 07:4 Frey Frctions Rickrd Fernström Exmensrete i mtemtik, 5 hp Hledre: Andres Strömergsson Exmintor: Jörgen Östensson Juni 07 Deprtment of Mthemtics Uppsl University Frey Frctions
More informationRecitation 3: Applications of the Derivative. 1 Higher-Order Derivatives and their Applications
Mth 1c TA: Pdric Brtlett Recittion 3: Applictions of the Derivtive Week 3 Cltech 013 1 Higher-Order Derivtives nd their Applictions Another thing we could wnt to do with the derivtive, motivted by wht
More informationp-adic Egyptian Fractions
p-adic Egyptin Frctions Contents 1 Introduction 1 2 Trditionl Egyptin Frctions nd Greedy Algorithm 2 3 Set-up 3 4 p-greedy Algorithm 5 5 p-egyptin Trditionl 10 6 Conclusion 1 Introduction An Egyptin frction
More informationReview of Calculus, cont d
Jim Lmbers MAT 460 Fll Semester 2009-10 Lecture 3 Notes These notes correspond to Section 1.1 in the text. Review of Clculus, cont d Riemnn Sums nd the Definite Integrl There re mny cses in which some
More informationAN INEQUALITY OF OSTROWSKI TYPE AND ITS APPLICATIONS FOR SIMPSON S RULE AND SPECIAL MEANS. I. Fedotov and S. S. Dragomir
RGMIA Reserch Report Collection, Vol., No., 999 http://sci.vu.edu.u/ rgmi AN INEQUALITY OF OSTROWSKI TYPE AND ITS APPLICATIONS FOR SIMPSON S RULE AND SPECIAL MEANS I. Fedotov nd S. S. Drgomir Astrct. An
More informationFrobenius numbers of generalized Fibonacci semigroups
Frobenius numbers of generlized Fiboncci semigroups Gretchen L. Mtthews 1 Deprtment of Mthemticl Sciences, Clemson University, Clemson, SC 29634-0975, USA gmtthe@clemson.edu Received:, Accepted:, Published:
More informationSection 6.1 INTRO to LAPLACE TRANSFORMS
Section 6. INTRO to LAPLACE TRANSFORMS Key terms: Improper Integrl; diverge, converge A A f(t)dt lim f(t)dt Piecewise Continuous Function; jump discontinuity Function of Exponentil Order Lplce Trnsform
More informationDuality # Second iteration for HW problem. Recall our LP example problem we have been working on, in equality form, is given below.
Dulity #. Second itertion for HW problem Recll our LP emple problem we hve been working on, in equlity form, is given below.,,,, 8 m F which, when written in slightly different form, is 8 F Recll tht we
More informationChapter 6 Notes, Larson/Hostetler 3e
Contents 6. Antiderivtives nd the Rules of Integrtion.......................... 6. Are nd the Definite Integrl.................................. 6.. Are............................................ 6. Reimnn
More informationNew Expansion and Infinite Series
Interntionl Mthemticl Forum, Vol. 9, 204, no. 22, 06-073 HIKARI Ltd, www.m-hikri.com http://dx.doi.org/0.2988/imf.204.4502 New Expnsion nd Infinite Series Diyun Zhng College of Computer Nnjing University
More informationMATH 101A: ALGEBRA I PART B: RINGS AND MODULES 35
MATH 101A: ALGEBRA I PART B: RINGS AND MODULES 35 9. Modules over PID This week we re proving the fundmentl theorem for finitely generted modules over PID, nmely tht they re ll direct sums of cyclic modules.
More informationDefinition of Continuity: The function f(x) is continuous at x = a if f(a) exists and lim
Mth 9 Course Summry/Study Guide Fll, 2005 [1] Limits Definition of Limit: We sy tht L is the limit of f(x) s x pproches if f(x) gets closer nd closer to L s x gets closer nd closer to. We write lim f(x)
More informationON A CONVEXITY PROPERTY. 1. Introduction Most general class of convex functions is defined by the inequality
Krgujevc Journl of Mthemtics Volume 40( (016, Pges 166 171. ON A CONVEXITY PROPERTY SLAVKO SIMIĆ Abstrct. In this rticle we proved n interesting property of the clss of continuous convex functions. This
More informationGraph Theory. Dr. Saad El-Zanati, Faculty Mentor Ryan Bunge Graduate Assistant Illinois State University REU. Graph Theory
Grph Theory Gibson, Ngel, Stnley, Zle Specil Types of Bckground Motivtion Grph Theory Dniel Gibson, Concordi University Jckelyn Ngel, Dominicn University Benjmin Stnley, New Mexico Stte University Allison
More informationODE: Existence and Uniqueness of a Solution
Mth 22 Fll 213 Jerry Kzdn ODE: Existence nd Uniqueness of Solution The Fundmentl Theorem of Clculus tells us how to solve the ordinry dierentil eqution (ODE) du f(t) dt with initil condition u() : Just
More information20 MATHEMATICS POLYNOMIALS
0 MATHEMATICS POLYNOMIALS.1 Introduction In Clss IX, you hve studied polynomils in one vrible nd their degrees. Recll tht if p(x) is polynomil in x, the highest power of x in p(x) is clled the degree of
More informationRiemann Integrals and the Fundamental Theorem of Calculus
Riemnn Integrls nd the Fundmentl Theorem of Clculus Jmes K. Peterson Deprtment of Biologicl Sciences nd Deprtment of Mthemticl Sciences Clemson University September 16, 2013 Outline Grphing Riemnn Sums
More informationGeneralized Fano and non-fano networks
Generlized Fno nd non-fno networks Nildri Ds nd Brijesh Kumr Ri Deprtment of Electronics nd Electricl Engineering Indin Institute of Technology Guwhti, Guwhti, Assm, Indi Emil: {d.nildri, bkri}@iitg.ernet.in
More informationTheoretical foundations of Gaussian quadrature
Theoreticl foundtions of Gussin qudrture 1 Inner product vector spce Definition 1. A vector spce (or liner spce) is set V = {u, v, w,...} in which the following two opertions re defined: (A) Addition of
More informationA product convergence theorem for Henstock Kurzweil integrals
A product convergence theorem for Henstock Kurzweil integrls Prsr Mohnty Erik Tlvil 1 Deprtment of Mthemticl nd Sttisticl Sciences University of Albert Edmonton AB Cnd T6G 2G1 pmohnty@mth.ulbert.c etlvil@mth.ulbert.c
More informationMath Calculus with Analytic Geometry II
orem of definite Mth 5.0 with Anlytic Geometry II Jnury 4, 0 orem of definite If < b then b f (x) dx = ( under f bove x-xis) ( bove f under x-xis) Exmple 8 0 3 9 x dx = π 3 4 = 9π 4 orem of definite Problem
More informationChapter 4 Contravariance, Covariance, and Spacetime Diagrams
Chpter 4 Contrvrince, Covrince, nd Spcetime Digrms 4. The Components of Vector in Skewed Coordintes We hve seen in Chpter 3; figure 3.9, tht in order to show inertil motion tht is consistent with the Lorentz
More informationOptimization Lecture 1 Review of Differential Calculus for Functions of Single Variable.
Optimiztion Lecture 1 Review of Differentil Clculus for Functions of Single Vrible http://users.encs.concordi.c/~luisrod, Jnury 14 Outline Optimiztion Problems Rel Numbers nd Rel Vectors Open, Closed nd
More informationConservation Law. Chapter Goal. 5.2 Theory
Chpter 5 Conservtion Lw 5.1 Gol Our long term gol is to understnd how mny mthemticl models re derived. We study how certin quntity chnges with time in given region (sptil domin). We first derive the very
More informationarxiv:math/ v2 [math.ho] 16 Dec 2003
rxiv:mth/0312293v2 [mth.ho] 16 Dec 2003 Clssicl Lebesgue Integrtion Theorems for the Riemnn Integrl Josh Isrlowitz 244 Ridge Rd. Rutherford, NJ 07070 jbi2@njit.edu Februry 1, 2008 Abstrct In this pper,
More informationWe partition C into n small arcs by forming a partition of [a, b] by picking s i as follows: a = s 0 < s 1 < < s n = b.
Mth 255 - Vector lculus II Notes 4.2 Pth nd Line Integrls We begin with discussion of pth integrls (the book clls them sclr line integrls). We will do this for function of two vribles, but these ides cn
More informationWell Centered Spherical Quadrangles
Beiträge zur Algebr und Geometrie Contributions to Algebr nd Geometry Volume 44 (003), No, 539-549 Well Centered Sphericl Qudrngles An M d Azevedo Bred 1 Altino F Sntos Deprtment of Mthemtics, University
More informationCalculus of Variations
Clculus of Vritions Com S 477/577 Notes) Yn-Bin Ji Dec 4, 2017 1 Introduction A functionl ssigns rel number to ech function or curve) in some clss. One might sy tht functionl is function of nother function
More informationAppendix to Notes 8 (a)
Appendix to Notes 8 () 13 Comprison of the Riemnn nd Lebesgue integrls. Recll Let f : [, b] R be bounded. Let D be prtition of [, b] such tht Let D = { = x 0 < x 1
More informationS. S. Dragomir. 2, we have the inequality. b a
Bull Koren Mth Soc 005 No pp 3 30 SOME COMPANIONS OF OSTROWSKI S INEQUALITY FOR ABSOLUTELY CONTINUOUS FUNCTIONS AND APPLICATIONS S S Drgomir Abstrct Compnions of Ostrowski s integrl ineulity for bsolutely
More informationAbstract inner product spaces
WEEK 4 Abstrct inner product spces Definition An inner product spce is vector spce V over the rel field R equipped with rule for multiplying vectors, such tht the product of two vectors is sclr, nd the
More information7.2 The Definite Integral
7.2 The Definite Integrl the definite integrl In the previous section, it ws found tht if function f is continuous nd nonnegtive, then the re under the grph of f on [, b] is given by F (b) F (), where
More informationCMDA 4604: Intermediate Topics in Mathematical Modeling Lecture 19: Interpolation and Quadrature
CMDA 4604: Intermedite Topics in Mthemticl Modeling Lecture 19: Interpoltion nd Qudrture In this lecture we mke brief diversion into the res of interpoltion nd qudrture. Given function f C[, b], we sy
More informationMath 426: Probability Final Exam Practice
Mth 46: Probbility Finl Exm Prctice. Computtionl problems 4. Let T k (n) denote the number of prtitions of the set {,..., n} into k nonempty subsets, where k n. Argue tht T k (n) kt k (n ) + T k (n ) by
More information. Double-angle formulas. Your answer should involve trig functions of θ, and not of 2θ. sin 2 (θ) =
Review of some needed Trig. Identities for Integrtion. Your nswers should be n ngle in RADIANS. rccos( 1 ) = π rccos( - 1 ) = 2π 2 3 2 3 rcsin( 1 ) = π rcsin( - 1 ) = -π 2 6 2 6 Cn you do similr problems?
More informationNotes on length and conformal metrics
Notes on length nd conforml metrics We recll how to mesure the Eucliden distnce of n rc in the plne. Let α : [, b] R 2 be smooth (C ) rc. Tht is α(t) (x(t), y(t)) where x(t) nd y(t) re smooth rel vlued
More informationREGULARITY OF NONLOCAL MINIMAL CONES IN DIMENSION 2
EGULAITY OF NONLOCAL MINIMAL CONES IN DIMENSION 2 OVIDIU SAVIN AND ENICO VALDINOCI Abstrct. We show tht the only nonlocl s-miniml cones in 2 re the trivil ones for ll s 0, 1). As consequence we obtin tht
More informationarxiv: v1 [math.ca] 7 Mar 2012
rxiv:1203.1462v1 [mth.ca] 7 Mr 2012 A simple proof of the Fundmentl Theorem of Clculus for the Lebesgue integrl Mrch, 2012 Rodrigo López Pouso Deprtmento de Análise Mtemátic Fcultde de Mtemátics, Universidde
More informationVariational Techniques for Sturm-Liouville Eigenvalue Problems
Vritionl Techniques for Sturm-Liouville Eigenvlue Problems Vlerie Cormni Deprtment of Mthemtics nd Sttistics University of Nebrsk, Lincoln Lincoln, NE 68588 Emil: vcormni@mth.unl.edu Rolf Ryhm Deprtment
More informationThe First Fundamental Theorem of Calculus. If f(x) is continuous on [a, b] and F (x) is any antiderivative. f(x) dx = F (b) F (a).
The Fundmentl Theorems of Clculus Mth 4, Section 0, Spring 009 We now know enough bout definite integrls to give precise formultions of the Fundmentl Theorems of Clculus. We will lso look t some bsic emples
More information2.4 Linear Inequalities and Interval Notation
.4 Liner Inequlities nd Intervl Nottion We wnt to solve equtions tht hve n inequlity symol insted of n equl sign. There re four inequlity symols tht we will look t: Less thn , Less thn or
More informationLecture 4: Piecewise Cubic Interpolation
Lecture notes on Vritionl nd Approximte Methods in Applied Mthemtics - A Peirce UBC Lecture 4: Piecewise Cubic Interpoltion Compiled 5 September In this lecture we consider piecewise cubic interpoltion
More informationIn-Class Problems 2 and 3: Projectile Motion Solutions. In-Class Problem 2: Throwing a Stone Down a Hill
MASSACHUSETTS INSTITUTE OF TECHNOLOGY Deprtment of Physics Physics 8T Fll Term 4 In-Clss Problems nd 3: Projectile Motion Solutions We would like ech group to pply the problem solving strtegy with the
More informationLecture 3. Limits of Functions and Continuity
Lecture 3 Limits of Functions nd Continuity Audrey Terrs April 26, 21 1 Limits of Functions Notes I m skipping the lst section of Chpter 6 of Lng; the section bout open nd closed sets We cn probbly live
More information4. Calculus of Variations
4. Clculus of Vritions Introduction - Typicl Problems The clculus of vritions generlises the theory of mxim nd minim. Exmple (): Shortest distnce between two points. On given surfce (e.g. plne), nd the
More informationMath Solutions to homework 1
Mth 75 - Solutions to homework Cédric De Groote October 5, 07 Problem, prt : This problem explores the reltionship between norms nd inner products Let X be rel vector spce ) Suppose tht is norm on X tht
More informationLecture 3: Curves in Calculus. Table of contents
Mth 348 Fll 7 Lecture 3: Curves in Clculus Disclimer. As we hve textook, this lecture note is for guidnce nd supplement only. It should not e relied on when prepring for exms. In this lecture we set up
More informationand that at t = 0 the object is at position 5. Find the position of the object at t = 2.
7.2 The Fundmentl Theorem of Clculus 49 re mny, mny problems tht pper much different on the surfce but tht turn out to be the sme s these problems, in the sense tht when we try to pproimte solutions we
More information3.4 Numerical integration
3.4. Numericl integrtion 63 3.4 Numericl integrtion In mny economic pplictions it is necessry to compute the definite integrl of relvlued function f with respect to "weight" function w over n intervl [,
More informationBest Approximation. Chapter The General Case
Chpter 4 Best Approximtion 4.1 The Generl Cse In the previous chpter, we hve seen how n interpolting polynomil cn be used s n pproximtion to given function. We now wnt to find the best pproximtion to given
More informationBases for Vector Spaces
Bses for Vector Spces 2-26-25 A set is independent if, roughly speking, there is no redundncy in the set: You cn t uild ny vector in the set s liner comintion of the others A set spns if you cn uild everything
More informationMA Handout 2: Notation and Background Concepts from Analysis
MA350059 Hndout 2: Nottion nd Bckground Concepts from Anlysis This hndout summrises some nottion we will use nd lso gives recp of some concepts from other units (MA20023: PDEs nd CM, MA20218: Anlysis 2A,
More informationHow do we solve these things, especially when they get complicated? How do we know when a system has a solution, and when is it unique?
XII. LINEAR ALGEBRA: SOLVING SYSTEMS OF EQUATIONS Tody we re going to tlk bout solving systems of liner equtions. These re problems tht give couple of equtions with couple of unknowns, like: 6 2 3 7 4
More information5.7 Improper Integrals
458 pplictions of definite integrls 5.7 Improper Integrls In Section 5.4, we computed the work required to lift pylod of mss m from the surfce of moon of mss nd rdius R to height H bove the surfce of the
More informationDefinite integral. Mathematics FRDIS MENDELU
Definite integrl Mthemtics FRDIS MENDELU Simon Fišnrová Brno 1 Motivtion - re under curve Suppose, for simplicity, tht y = f(x) is nonnegtive nd continuous function defined on [, b]. Wht is the re of the
More informationSummary: Method of Separation of Variables
Physics 246 Electricity nd Mgnetism I, Fll 26, Lecture 22 1 Summry: Method of Seprtion of Vribles 1. Seprtion of Vribles in Crtesin Coordintes 2. Fourier Series Suggested Reding: Griffiths: Chpter 3, Section
More informationScientific notation is a way of expressing really big numbers or really small numbers.
Scientific Nottion (Stndrd form) Scientific nottion is wy of expressing relly big numbers or relly smll numbers. It is most often used in scientific clcultions where the nlysis must be very precise. Scientific
More informationProperties of the Riemann Integral
Properties of the Riemnn Integrl Jmes K. Peterson Deprtment of Biologicl Sciences nd Deprtment of Mthemticl Sciences Clemson University Februry 15, 2018 Outline 1 Some Infimum nd Supremum Properties 2
More informationThe Riemann Integral
Deprtment of Mthemtics King Sud University 2017-2018 Tble of contents 1 Anti-derivtive Function nd Indefinite Integrls 2 3 4 5 Indefinite Integrls & Anti-derivtive Function Definition Let f : I R be function
More informationMath 113 Exam 1-Review
Mth 113 Exm 1-Review September 26, 2016 Exm 1 covers 6.1-7.3 in the textbook. It is dvisble to lso review the mteril from 5.3 nd 5.5 s this will be helpful in solving some of the problems. 6.1 Are Between
More informationOperations with Polynomials
38 Chpter P Prerequisites P.4 Opertions with Polynomils Wht you should lern: How to identify the leding coefficients nd degrees of polynomils How to dd nd subtrct polynomils How to multiply polynomils
More informationTHE EXISTENCE-UNIQUENESS THEOREM FOR FIRST-ORDER DIFFERENTIAL EQUATIONS.
THE EXISTENCE-UNIQUENESS THEOREM FOR FIRST-ORDER DIFFERENTIAL EQUATIONS RADON ROSBOROUGH https://intuitiveexplntionscom/picrd-lindelof-theorem/ This document is proof of the existence-uniqueness theorem
More informationAMATH 731: Applied Functional Analysis Fall Some basics of integral equations
AMATH 731: Applied Functionl Anlysis Fll 2009 1 Introduction Some bsics of integrl equtions An integrl eqution is n eqution in which the unknown function u(t) ppers under n integrl sign, e.g., K(t, s)u(s)
More information