La fonction à deux points et à trois points des quadrangulations et cartes. Éric Fusy (CNRS/LIX) Travaux avec Jérémie Bouttier et Emmanuel Guitter

Size: px
Start display at page:

Download "La fonction à deux points et à trois points des quadrangulations et cartes. Éric Fusy (CNRS/LIX) Travaux avec Jérémie Bouttier et Emmanuel Guitter"

Transcription

1 La foncton à deux ponts et à tros ponts des quadrangulatons et cartes Érc Fusy (CNRS/LIX) Travaux avec Jéréme Boutter et Emmanuel Gutter Sémnare Caln, LIPN, Ma 4

2 Maps Def. Planar map = connected graph embedded on the sphere = Easer to draw n the plane (by choosng a face to be the outer face)

3 Maps as random dscrete surfaces Natural questons: Typcal dstance between (random) vertces n random maps the order of magntude s n /4 ( n / n random trees) random quadrang. { - [Chassang-Schaeffer 4] probablstc - [Boutter D Francesco Gutter 3] exact GF expressons How does a random map (rescaled by n /4 ) look lke? convergence to the Brownan map [Le Gall 3, Mermont 3]

4 Countng (rooted) maps wth a marked corner Very smple countng formulas ([Tutte 6s]), for nstance Let q n = #{rooted quadrangulatons wth n faces} m n = #{rooted maps wth n edges} Then m n = q n = n+ 3n (n)! n!(n+)!

5 Countng (rooted) maps wth a marked corner Very smple countng formulas ([Tutte 6s]), for nstance Let q n = #{rooted quadrangulatons wth n faces} m n = #{rooted maps wth n edges} Then m n = q n = n+ 3n (n)! n!(n+)! Proof of m n = q n by easy local bjecton:

6 Countng (rooted) maps wth a marked corner Very smple countng formulas ([Tutte 6s]), for nstance Let q n = #{rooted quadrangulatons wth n faces} m n = #{rooted maps wth n edges} Then m n = q n = n+ 3n (n)! n!(n+)! Proof of m n = q n by easy local bjecton: But ths bjecton does not preserve dstance-parameters (only bounds)

7 The k-pont functon Let M = n M[n] be a famly of maps (quadrangulatons, general,...) where n s a sze-parameter (# faces for quad., # edges for gen. maps) Let M (k) = famly of maps from M wth k marked vertces v,..., v k

8 The k-pont functon Let M = n M[n] be a famly of maps (quadrangulatons, general,...) where n s a sze-parameter (# faces for quad., # edges for gen. maps) Let M (k) = famly of maps from M wth k marked vertces v,..., v k Refnement by dstances : For D = (d,j ) <j k any ( k let M (k) D ) -tuple of postve ntegers := subfamly of M(k) where dst(v, v j ) = d j for < j k The countng seres G D G D (g) of M (k) D s called the k-pont functon of M wth respect to the sze v v quadrangulaton k = d = 3 v v v 3 general map k = 3 d = d 3 = d 3 = 3

9 Exact expressons for the k-pont functon For the two-pont functons: - quadrangulatons [Boutter D Francesco Gutter 3] - maps wth prescrbed (bounded) face-degrees [Boutter Gutter 8] - general maps [Ambjørn Budd 3] - general hypermaps, general constellatons [Boutter F Gutter 3] For the three-pont functons - quadrangulatons [Boutter Gutter 8] - general maps & bpartte maps [F Gutter 4]

10 Exact expressons for the k-pont functon Outlne of the talk For the two-pont functons: - quadrangulatons uses Schaeffer s bjecton - maps wth prescrbed (bounded) face-degrees [Boutter D Francesco Gutter 3] [Boutter Gutter 8] 3 - general maps based on clever observaton [Ambjørn Budd 3] on Mermont s bjecton - general hypermaps, general constellatons [Boutter F Gutter 3] For the three-pont functons - quadrangulatons uses Mermont s bjecton [Boutter Gutter 8] 4 - general maps & bpartte maps [F Gutter 4] uses AB bjecton

11 Computng the two-pont functon of quadrangulatons usng the Schaeffer bjecton

12 Well-labelled trees Well-labelled tree = plane tree where - each vertex v has a label l(v) Z - each edge e = {u, v} satsfes l(u) l(v) -

13 Ponted quadrangulatons, geodesc labellng Ponted quadrangulaton = quadrangulaton wth a marked vertex v Geodesc labellng wth respect to v : l(v) = dst(v, v) 3 Rk: two types of faces v stretched + confluent

14 The Schaeffer bjecton 3 3 [Schaeffer 99], also [Cor-Vauqueln 8] Ponted quadrangulaton well-labelled tree wth mn-label= n faces n edges 3 Local rule n each face:

15 The -pont functon of quadrangulatons () Denote by G d G d (g) the two-pont functon of quadrangulatons bjecton G d (g) = GF of well-labelled trees wth mn-label= and wth a marked vertex of label d d = Rk: G d = F d F d = d F d where F d F d (g) = GF of well-labelled trees wth postve labels and wth a marked vertex of label d

16 The -pont functon of quadrangulatons () - - > + - wth R = F = log g(r +R +R + ) > GF rooted well-labelled trees wth postve labels and label at the root

17 The -pont functon of quadrangulatons () - - > + - wth R = F = log g(r +R +R + ) GF rooted well-labelled trees wth postve labels and label at the root Equ. for R : R = g(r +R +R + ) (so F = log(r ), G d = log( R d R d )) >

18 The -pont functon of quadrangulatons () - - > + - wth R = F = log g(r +R +R + ) GF rooted well-labelled trees wth postve labels and label at the root Equ. for R : R = g(r +R +R + ) (so F = log(r ), G d = log( R d R d )) Exact expresson for R [BDG 3] R = R [] x[ + 3] x wth the notaton [] x = x [ + ] x [ + ] x wth R R(g) and x x(g) gven by R(g) = S 6g x(g) = 6 S / (+6g)S S 4g+ +S+6g > { x R = + 3gR x = gr ( + x + x ) wth S = g

19 The -pont functon of quadrangulatons () - - > + - wth R = F = log g(r +R +R + ) GF rooted well-labelled trees wth postve labels and label at the root Equ. for R : R = g(r +R +R + ) (so F = log(r ), G d = log( R d R d )) Exact expresson for R [BDG 3] R = R [] x[ + 3] x wth the notaton [] x = x [ + ] x [ + ] x wth R R(g) and x x(g) gven by R(g) = S 6g x(g) = 6 Fnal -pont functon expresson: > { x R = + 3gR x = gr ( + x + x ) S / (+6g)S S 4g+ +S+6g ( [d] x G d = log [d+3] x [d ] x [d+] x wth S = g )

20 Asymptotc consderatons Two-pont functon of (plane) trees: G d (g) = (gr ) d wth R = + gr = 4g g G d s the d th power of a seres havng a square-root sngularty d = 5 d/n / converges n law (Raylegh law, densty α exp( α ))

21 Asymptotc consderatons Two-pont functon of (plane) trees: G d (g) = (gr ) d wth R = + gr = 4g g G d s the d th power of a seres havng a square-root sngularty d = 5 d/n / converges n law (Raylegh law, densty α exp( α )) Two-pont functon of quadrangulatons: G d (g) d a x d + a x d + where x = x(g) has a quartc sngularty d/n /4 converges to an explct law [BDG 3]

22 Asymptotc consderatons Two-pont functon of (plane) trees: G d (g) = (gr ) d wth R = + gr = 4g g G d s the d th power of a seres havng a square-root sngularty d/n / converges n law (Raylegh law, densty α exp( α )) Two-pont functon of quadrangulatons: G d (g) d a x d + a x d + where x = x(g) has a quartc sngularty d = 5 d/n /4 converges to an explct law [BDG 3] Convergence n the two cases follows from (proof by Hankel contour) [Banderer, Flajolet, Louchard, Schaeffer 3]: x(g) ( g) s [g n ]x αns for < s <, e t Im(exp( αt s e πs ))dt g πn

23 Computng the two-pont and three-pont functon of quadrangulatons usng Mermont s bjecton

24 Well-labelled maps Well-labelled map = map where - each vertex v has a label l(v) Z - each edge e = {u, v} satsfes l(u) l(v) a well-labelled map M wth 3 faces Rk: Well-labelled tree = well-labelled map wth one face

25 Very-well-labelled quadrangulatons Very-well-labelled quadrangulaton = quadrangulaton where - each vertex v has a label l(v) Z - each edge e = {u, v} satsfes l(u) l(v) = - a very-well-labelled quadrangulaton Q wth 3 local mn - Rk: two types of faces stretched + + confluent Def: local mn= vertex wth all neghbours of larger label Rk: Geodesc labellng there s just one local mn, of label

26 The Mermont bjecton [Mermont 7], [Ambjørn, Budd 3] Very-well labelled quadrangulaton Q well-labelled map M n faces n edges local mn v face f non-local mn l(v) = mn(f) same label vertex

27 The Mermont bjecton [Mermont 7], [Ambjørn, Budd 3] Very-well labelled quadrangulaton Q well-labelled map M n faces n edges recover the Schaeffer bjecton (case of one local mn, of label ) local mn v face f non-local mn l(v) = mn(f) same label vertex

28 Proof of the stated propertes mples - (follows from the local rules) c From each corner c n a face of M starts a label-decreasng path of Q that stays n the face and ends at a local mn of Q

29 Proof of the stated propertes mples - (follows from the local rules) c From each corner c n a face of M starts a label-decreasng path of Q that stays n the face and ends at a local mn of Q

30 Proof of the stated propertes mples - (follows from the local rules) - c From each corner c n a face of M starts a label-decreasng path of Q that stays n the face and ends at a local mn of Q

31 Proof of the stated propertes mples - (follows from the local rules) - c - From each corner c n a face of M starts a label-decreasng path of Q that stays n the face and ends at a local mn of Q

32 Proof of the stated propertes mples - (follows from the local rules) - c - -3 From each corner c n a face of M starts a label-decreasng path of Q that stays n the face and ends at a local mn of Q

33 Proof of the stated propertes mples - (follows from the local rules) - c From each corner c n a face of M starts a label-decreasng path of Q that stays n the face and ends at a local mn of Q

34 Proof of the stated propertes mples - (follows from the local rules) - c From each corner c n a face of M starts a label-decreasng path of Q that stays n the face and ends at a local mn of Q Let n = # faces of Q, p = # local mn of Q, f = # faces of M Q M #V #E #F n + n n n + p n f = k + p Euler s relaton, wth k = # connected comp. of M

35 Proof of the stated propertes mples - (follows from the local rules) - c From each corner c n a face of M starts a label-decreasng path of Q that stays n the face and ends at a local mn of Q Let n = # faces of Q, p = # local mn of Q, f = # faces of M Q M #V #E #F n + n n n + p n f = k + p Euler s relaton, wth Drawng above f p k = # connected comp. of M Hence k = (M connected) f = p, and there s exactly one local mn of Q n each face of M

36 The case of two local mn d = 5 Γ the boundary, here mn Γ = f Γ - v - v - Mermont f dst(v, v ) = mn Γ l(v ) l(v )

37 The case of two local mn d = 5 Γ the boundary, here mn Γ = f Γ - v - v - Mermont f dst(v, v ) = mn Γ l(v ) l(v )

38 The case of two local mn d = 5 Γ the boundary, here mn Γ = f Γ - v - v - Mermont f dst(v, v ) = mn Γ l(v ) l(v ) Proof: v Γ, a shortest path v v v has length l(v) l(v ) l(v ) (because of the exstence of a label-decreasng path on each sde) - v l(v) l(v ) l(v) l(v ) - v v

39 Another way of computng the -pont functon [Boutter, Gutter 8] Let d and let s, t such that s + t = d A b-ponted quadrangulaton Q where d = d has a unque very-well labellng l(.) wth two local mn, at v, v, and l(v ) = s, l(v ) = t. l(.) s gven by l(v) = mn(dst(v, v) s, dst(v, v) t) d = 5 - v -3 v

40 Another way of computng the -pont functon [Boutter, Gutter 8] Let d and let s, t such that s + t = d A b-ponted quadrangulaton Q where d = d has a unque very-well labellng l(.) wth two local mn, at v, v, and l(v ) = s, l(v ) = t. l(.) s gven by l(v) = mn(dst(v, v) s, dst(v, v) t) d = v v - - -

41 Another way of computng the -pont functon [Boutter, Gutter 8] Let d and let s, t such that s + t = d A b-ponted quadrangulaton Q where d = d has a unque very-well labellng l(.) wth two local mn, at v, v, and l(v ) = s, l(v ) = t. l(.) s gven by l(v) = mn(dst(v, v) s, dst(v, v) t) d = 5 f - - v v f - -

42 Another way of computng the -pont functon [Boutter, Gutter 8] Let d and let s, t such that s + t = d A b-ponted quadrangulaton Q where d = d has a unque very-well labellng l(.) wth two local mn, at v, v, and l(v ) = s, l(v ) = t. l(.) s gven by l(v) = mn(dst(v, v) s, dst(v, v) t) d = 5 f Γ - - v v f - - The assocated well-labelled map wth two faces f, f satsfes: mn(f ) = s +, mn(f ) = t + mn Γ = (by precedng slde)

43 Another way of computng the -pont functon [Boutter, Gutter 8] Let d and let s, t such that s + t = d A b-ponted quadrangulaton Q where d = d has a unque very-well labellng l(.) wth two local mn, at v, v, and l(v ) = s, l(v ) = t. l(.) s gven by l(v) = mn(dst(v, v) s, dst(v, v) t) d = 5 f Γ - - v v f - - The assocated well-labelled map wth two faces f, f satsfes: mn(f ) = s +, mn(f ) = t + mn Γ = (by precedng slde)

44 nother way of computng the -pont functon We conclude that, for d = s + t (s, t ) G d (g) s the seres of mn(f )= s f s t v v Or ( := dscrete dfferentaton) G d = s t F s,t, where F s,t counts mn(f ) s f mn(f )= t Γ mn Γ = d st method corresponds to t = f f mn(f ) t Γ mn Γ =

45 nother way of computng the -pont functon Then by the lnk between cyclc and sequental excursons: F s,t = log(x s,t ) }{{} counts s t Equaton for X s,t : X s,t = + gr s R t X s,t ( + gr s+ R t+ X s+,t+ ) soluton (guessng/checkng): X s,t = [3] x[s+] x [t+] x [s+t+3] x [] x [s+3] x [t+3] x [s+t+] ) x recover G d = log ( [s+t] x [s+t+3] x [s+t ] x [s+t+] x

46 A frst covered case for the 3-pont functon [Boutter, Gutter 8] mn(f )= s f mn(f )= t Ths solves the case of 3 algned vertces s t Γ v 3 v v 3 v tr-ponted quadrangulatons wth d = s + t, d 3 = s, d 3 = t f mn Γ =.e., v 3 s on a geodesc path from v to v at respectve dstances s, t from v, v

47 A frst covered case for the 3-pont functon [Boutter, Gutter 8] mn(f )= s f mn(f )= t Ths solves the case of 3 algned vertces s t Γ v 3 v v 3 v tr-ponted quadrangulatons wth d = s + t, d 3 = s, d 3 = t f mn Γ = Hence G s+t,s,t (g) = s t X s,t.e., v 3 s on a geodesc path from v to v at respectve dstances s, t from v, v where X s,t = [3] x[s+] x [t+] x [s+t+3] x [] x [s+3] x [t+3] x [s+t+] x mn(f ) s X s,t counts f mn(f ) t Γ v 3 f mn Γ =

48 The dfferent cases for the 3-pont functon [Boutter, Gutter 8] D = (d, d 3, d 3 ) can be acheved only f d d 3 + d 3 d 3 d + d 3 d 3 d + d 3

49 The dfferent cases for the 3-pont functon [Boutter, Gutter 8] D = (d, d 3, d 3 ) can be acheved only f d d 3 + d 3 d 3 d + d 3 d 3 d + d 3 parametrze d = s + t d 3 = s + u d 3 = t + u wth s, t, u

50 The dfferent cases for the 3-pont functon [Boutter, Gutter 8] D = (d, d 3, d 3 ) can be acheved only f d d 3 + d 3 d 3 d + d 3 d 3 d + d 3 parametrze d = s + t d 3 = s + u d 3 = t + u wth s, t, u 3 ponts are dstnct at most one of s, t, u s zero One of s, t, u (say u) s zero algned ponts (precedng slde) Generc case: s, t, u > (non-algned ponts)

51 The generc case Boutter, Gutter 8] wrte D as d = s + t d 3 = s + u d 3 = t + u wth s, t, u > Endow Q wth unque very-well labellng wth 3 local mn at v, v, v 3 and where l(v )= s, l(v )= t, l(v 3 )= u Apply the Mermont bjecton f obtan a 3-face well-labelled map where mn(f )= s mn(f )= t mn(f 3 )= u mn Γ = mn Γ3 = mn Γ3 = f f 3 Γ Γ 3 Γ 3

52 The generc case Boutter, Gutter 8] wrte D as d = s + t d 3 = s + u d 3 = t + u wth s, t, u > Endow Q wth unque very-well labellng wth 3 local mn at v, v, v 3 and where l(v )= s, l(v )= t, l(v 3 )= u -s Apply the Mermont bjecton obtan a 3-face well-labelled map where mn(f )= s mn(f )= t mn(f 3 )= u mn Γ = mn Γ3 = mn Γ3 = f -u f 3 -t Γ Γ 3 Γ 3 f

53 The generc case Boutter, Gutter 8] wrte D as d = s + t d 3 = s + u d 3 = t + u wth s, t, u > Endow Q wth unque very-well labellng wth 3 local mn at v, v, v 3 and where l(v )= s, l(v )= t, l(v 3 )= u -s Apply the Mermont bjecton obtan a 3-face well-labelled map where mn(f )= s mn(f )= t mn(f 3 )= u mn Γ = mn Γ3 = mn Γ3 = f -u f 3 -t Γ Γ 3 Γ 3 expresson of G d,d 3,d 3 (g) as s t u F s,t,u, wth F s,t,u (g) explct f

54 Computng the two-pont functon of general maps usng the Ambjørn-Budd bjecton

55 The Ambjørn-Budd bjecton Λ [Ambjørn-Budd 3] Recall the Mermont bjecton Φ (reformulated by Ambjørn-Budd) Q local mn of Q face f of W - - Φ W mn(f) = +

56 The Ambjørn-Budd bjecton Λ [Ambjørn-Budd 3] Recall the Mermont bjecton Φ (reformulated by Ambjørn-Budd) Q local mn of Q face f of W local max of Q local max of W - - Φ W mn(f) = +

57 The Ambjørn-Budd bjecton Λ Recall the Mermont bjecton Φ (reformulated by Ambjørn-Budd) Q local mn of Q face f of W Let op : Z Z - local max of Q local max of W - - Φ = op Φ op Φ W W [Ambjørn-Budd 3] mn(f) = + - -

58 The Ambjørn-Budd bjecton Λ Recall the Mermont bjecton Φ (reformulated by Ambjørn-Budd) Q local mn of Q face f of W Let op : Z Z mn(f) = + local mn of W - local max of Q local max of W - - face f of W Φ = op Φ op Φ max(f) = W W [Ambjørn-Budd 3] - -

59 The Ambjørn-Budd bjecton Λ Recall the Mermont bjecton Φ (reformulated by Ambjørn-Budd) Q local mn of Q face f of W Let op : Z Z mn(f) = + local mn of W - local max of Q local max of W - - face f of W Φ = op Φ op Φ max(f) = W W Λ + Λ s a new dualty relaton for well-labelled map [Ambjørn-Budd 3] - -

60 The bjecton Λ appled to ponted maps Rk: ponted maps+geodesc labellng well-labelled maps wth one local mn, of label v M T ponted maps n edges well-labelled trees mn-label= and n edges (as for quadrang., but ths tme vertex of M v non-local max of T )

61 The bjecton Λ appled to ponted maps Rk: ponted maps+geodesc labellng well-labelled maps wth one local mn, of label v M T ponted maps n edges well-labelled trees mn-label= and n edges (as for quadrang., but ths tme vertex of M v non-local max of T ) k: In that case, Φ gves a new bjecton from ponted quadrangulatons wth n faces to ponted maps wth n edges that preserves the dstances to the ponted vertex (not the case wth the easy local bjecton)

62 The two-pont functon of general maps Let G d (g) the -pont functon of general maps d = v AB bjecton G d (g) s the seres of well-labelled trees wth mn-label wth a marked non local max of label d 3

63 The two-pont functon of general maps Let G d (g) the -pont functon of general maps d = v AB bjecton G d (g) s the seres of well-labelled trees wth mn-label wth a marked non local max of label d G d = F d F d, wth F d (g) := the seres of well-labelled trees wth postve labels and a marked non local max of label d 3

64 The two-pont functon of general maps Let G d (g) the -pont functon of general maps d = v AB bjecton G d (g) s the seres of well-labelled trees wth mn-label wth a marked non local max of label d G d = F d F d, wth F d (g) := the seres of well-labelled trees wth postve labels and a marked non local max of label d F = log g(r +R +R + ) log g(r +R ) = log( + gr R + ) 3 G d = log ( [d+] 3 x [d+3] [d] x [d+] 3 x ) for general maps

65 The two-pont functon of general maps Let G d (g) the -pont functon of general maps d = v AB bjecton G d (g) s the seres of well-labelled trees wth mn-label wth a marked non local max of label d G d = F d F d, wth F d (g) := the seres of well-labelled trees wth postve labels and a marked non local max of label d F = log g(r +R +R + ) log g(r +R ) = log( + gr R + ) G d = log recall G d = log ( [d+] 3 x [d+3] [d] x [d+] 3 x ) ( [d] x [d+3] x [d ] x [d+] x 3 for general maps ) for quadrang. (same asymptotc laws)

66 The case of two local mn Let M a well-labelled map wth two local mn v, v Let M = Λ(M), let f, f the two faces of M Let Γ the (cycle) boundary of M, := mn Γ Two cases: A): no edge of labels on Γ dst M (v, v ) = l(v ) l(v ) B): an edge of labels on Γ dst M (v, v ) = l(v ) l(v ) l(v ) l(v ) v + v l(v ) l(v ) - - v v

67 other ways to compute the -pont functon [F, Gutter 4] For d, let M a b-ponted map wth d = d A) Wrte d as s + t wth s, t. Endow M wth unque well-labellng where v, v are unque local mn and l(v ) = s, l(v ) = t - v v - - f - - B) Wrte d as s + t wth s, t. Endow M wth unque well-labellng where v, v are unque local mn and l(v ) = s, l(v ) = t v - - v f Γ f f Γ mn Γ = no edge - on Γ - mn Γ = edge - on Γ

68 other ways to compute the -pont functon ase (A): X s,t = G s+t (g) = s t log(n s,t ) }{{} N s,t gr s R t N s,t exact expresson for N s,t recover G s+t = log ( [s+t] x [s+t+3] x [s+t ] x [s+t+] x counts Rk: s t N s,t gves GF of tr-ponted maps wth algned ponts: d, d 3, d 3 = (s + t, s, t) ) mn(f ) s f f mn(f ) t Γ mn Γ = no edge on Γ v 3 Case (B): G s+t (g) = s t log( gr s R t N s,t ) mn(f ) s recover G s+t = log ( [s+t ] x [s+t+] x [s+t ] x [s+t+] x ) counts f f mn(f ) t Γ mn Γ = edges -

69 3-pont functon: generc (non-algned) case Case A: d + d 3 + d 3 even parametrze as: d = s + t d 3 = s + u d 3 = t + u wth s, t, u > endow tr-ponted map wth unque ( s, t, u)-well-labellng and apply the AB bjecton Λ mn(f )= s mn(f )= t mn(f 3 )= u mn Γ = mn Γ3 = mn Γ3 = and no edge - on Γ f f 3 Γ Γ 3 Γ 3 f

70 3-pont functon: generc (non-algned) case Case A: d + d 3 + d 3 even parametrze as: d = s + t d 3 = s + u d 3 = t + u wth s, t, u > endow tr-ponted map wth unque ( s, t, u)-well-labellng and apply the AB bjecton Λ -s mn(f )= s mn(f )= t mn(f 3 )= u mn Γ = mn Γ3 = mn Γ3 = and no edge - on Γ f -u f 3 -t Γ Γ 3 Γ 3 f

71 3-pont functon: generc (non-algned) case Case A: d + d 3 + d 3 even parametrze as: d = s + t d 3 = s + u d 3 = t + u wth s, t, u > endow tr-ponted map wth unque ( s, t, u)-well-labellng and apply the AB bjecton Λ -s mn(f )= s mn(f )= t mn(f 3 )= u mn Γ = mn Γ3 = mn Γ3 = and no edge - on Γ f -u f 3 -t Γ Γ 3 Γ 3 f expresson of G d,d 3,d 3 (g) as s t u F even s,t,u, wth F even s,t,u(g) explct

72 3-pont functon: generc (non-algned) case Case B: d + d 3 + d 3 odd (dd not exst for quadrang.) parametrze as: d = s + t d 3 = s + u d 3 = t + u wth s, t, u > endow tr-ponted map wth unque ( s, t, u)-well-labellng and apply the AB bjecton Λ mn(f )= s mn(f )= t mn(f 3 )= u mn Γ = mn Γ3 = mn Γ3 = and there s an edge - on each of Γ, Γ 3, Γ 3 f f 3 Γ Γ 3 Γ 3 f

73 3-pont functon: generc (non-algned) case Case B: d + d 3 + d 3 odd (dd not exst for quadrang.) parametrze as: d = s + t d 3 = s + u d 3 = t + u wth s, t, u > endow tr-ponted map wth unque ( s, t, u)-well-labellng and apply the AB bjecton Λ -s mn(f )= s mn(f )= t mn(f 3 )= u mn Γ = mn Γ3 = mn Γ3 = and there s an edge - on each of Γ, Γ 3, Γ f -u f 3 -t - - Γ Γ 3 Γ 3 - f

74 3-pont functon: generc (non-algned) case Case B: d + d 3 + d 3 odd (dd not exst for quadrang.) parametrze as: d = s + t d 3 = s + u d 3 = t + u wth s, t, u > endow tr-ponted map wth unque ( s, t, u)-well-labellng and apply the AB bjecton Λ -s mn(f )= s mn(f )= t mn(f 3 )= u mn Γ = mn Γ3 = mn Γ3 = and there s an edge - on each of Γ, Γ 3, Γ f -u f 3 -t - - Γ Γ 3 Γ 3 expresson of G d,d 3,d 3 (g) as s t u F odd s,t,u, wth F odd s,t,u(g) explct - - f

75 Examples Case A: - v - f v - - f f 3 - v 3 - Case B: - v f v f v f 3

76 Concluson and remarks There are exact expressons for the -pont and 3-pont functons of quadrangulatons and general maps (bjectons + GF calculatons) Asymptotcally the lmt laws (rescalng by n /4 ) are the same for the random quad. Q n of sze n as for the random map M n of sze n Rk: also follows from [Bettnell, Jacob, Mermont 3] (Q n, dst/n /4 ) and (M n, dst/n /4 ) are close as metrc spaces, when couplng (M n, Q n ) by the AB bjecton We can also obtan smlar expressons for bpartte maps (assocated well-labelled maps are restrcted to have no edge ) The GF expressons G D (g) for maps/bpartte maps can be extended to expressons G D (g, z) where z marks the number of faces

Planar maps and continued fractions

Planar maps and continued fractions Batz 2010 p. 1/4 Planar maps and contnued fractons n collaboraton wth Jéréme Boutter 1 3 3 2 0 3 1 maps and dstances: generaltes Batz 2010 p. 2/4 Batz 2010 p. 3/4 degree of a face = number of ncdent edge

More information

Bernoulli Numbers and Polynomials

Bernoulli Numbers and Polynomials Bernoull Numbers and Polynomals T. Muthukumar tmk@tk.ac.n 17 Jun 2014 The sum of frst n natural numbers 1, 2, 3,..., n s n n(n + 1 S 1 (n := m = = n2 2 2 + n 2. Ths formula can be derved by notng that

More information

Lecture 21: Numerical methods for pricing American type derivatives

Lecture 21: Numerical methods for pricing American type derivatives Lecture 21: Numercal methods for prcng Amercan type dervatves Xaoguang Wang STAT 598W Aprl 10th, 2014 (STAT 598W) Lecture 21 1 / 26 Outlne 1 Fnte Dfference Method Explct Method Penalty Method (STAT 598W)

More information

THE CHINESE REMAINDER THEOREM. We should thank the Chinese for their wonderful remainder theorem. Glenn Stevens

THE 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 information

Limit Laws of Planar Maps with Prescribed Vertex Degrees

Limit Laws of Planar Maps with Prescribed Vertex Degrees Combnatorcs, Probablty and Computng (206) 00, 000 000. c 206 Cambrdge Unversty Press OI: 0.07/S0000000000000000 Prnted n the Unted Kngdom Lmt Laws of Planar Maps wth Prescrbed Vertex egrees G. C O L L

More information

More metrics on cartesian products

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 information

A Quantum Gauss-Bonnet Theorem

A Quantum Gauss-Bonnet Theorem A Quantum Gauss-Bonnet Theorem Tyler Fresen November 13, 2014 Curvature n the plane Let Γ be a smooth curve wth orentaton n R 2, parametrzed by arc length. The curvature k of Γ s ± Γ, where the sgn s postve

More information

Maximizing the number of nonnegative subsets

Maximizing 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

Math1110 (Spring 2009) Prelim 3 - Solutions

Math1110 (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 information

Edge Isoperimetric Inequalities

Edge 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 information

Complex Numbers Alpha, Round 1 Test #123

Complex 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 information

Ballot Paths Avoiding Depth Zero Patterns

Ballot Paths Avoiding Depth Zero Patterns Ballot Paths Avodng Depth Zero Patterns Henrch Nederhausen and Shaun Sullvan Florda Atlantc Unversty, Boca Raton, Florda nederha@fauedu, ssull21@fauedu 1 Introducton In a paper by Sapounaks, Tasoulas,

More information

arxiv: v1 [math.co] 1 Mar 2014

arxiv: 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 information

Problem Set 9 Solutions

Problem 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 information

= z 20 z n. (k 20) + 4 z k = 4

= 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 information

Exercises. 18 Algorithms

Exercises. 18 Algorithms 18 Algorthms Exercses 0.1. In each of the followng stuatons, ndcate whether f = O(g), or f = Ω(g), or both (n whch case f = Θ(g)). f(n) g(n) (a) n 100 n 200 (b) n 1/2 n 2/3 (c) 100n + log n n + (log n)

More information

MMA and GCMMA two methods for nonlinear optimization

MMA and GCMMA two methods for nonlinear optimization MMA and GCMMA two methods for nonlnear optmzaton Krster Svanberg Optmzaton and Systems Theory, KTH, Stockholm, Sweden. krlle@math.kth.se Ths note descrbes the algorthms used n the author s 2007 mplementatons

More information

Spectral Graph Theory and its Applications September 16, Lecture 5

Spectral 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 information

Affine transformations and convexity

Affine 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 information

Geometric drawings of K n with few crossings

Geometric drawings of K n with few crossings 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

More information

Affine and Riemannian Connections

Affine and Riemannian Connections Affne and Remannan Connectons Semnar Remannan Geometry Summer Term 2015 Prof Dr Anna Wenhard and Dr Gye-Seon Lee Jakob Ullmann Notaton: X(M) space of smooth vector felds on M D(M) space of smooth functons

More information

Finding Dense Subgraphs in G(n, 1/2)

Finding 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 information

Min Cut, Fast Cut, Polynomial Identities

Min 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 information

Solutions HW #2. minimize. Ax = b. Give the dual problem, and make the implicit equality constraints explicit. Solution.

Solutions HW #2. minimize. Ax = b. Give the dual problem, and make the implicit equality constraints explicit. Solution. Solutons HW #2 Dual of general LP. Fnd the dual functon of the LP mnmze subject to c T x Gx h Ax = b. Gve the dual problem, and make the mplct equalty constrants explct. Soluton. 1. The Lagrangan s L(x,

More information

College of Computer & Information Science Fall 2009 Northeastern University 20 October 2009

College 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 information

Modelli Clamfim Equazione del Calore Lezione ottobre 2014

Modelli Clamfim Equazione del Calore Lezione ottobre 2014 CLAMFIM Bologna Modell 1 @ Clamfm Equazone del Calore Lezone 17 15 ottobre 2014 professor Danele Rtell danele.rtell@unbo.t 1/24? Convoluton The convoluton of two functons g(t) and f(t) s the functon (g

More information

3.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

3.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 information

Poisson brackets and canonical transformations

Poisson brackets and canonical transformations rof O B Wrght Mechancs Notes osson brackets and canoncal transformatons osson Brackets Consder an arbtrary functon f f ( qp t) df f f f q p q p t But q p p where ( qp ) pq q df f f f p q q p t In order

More information

NP-Completeness : Proofs

NP-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 information

Section 8.3 Polar Form of Complex Numbers

Section 8.3 Polar Form of Complex Numbers 80 Chapter 8 Secton 8 Polar Form of Complex Numbers From prevous classes, you may have encountered magnary numbers the square roots of negatve numbers and, more generally, complex numbers whch are the

More information

Solutions Homework 4 March 5, 2018

Solutions Homework 4 March 5, 2018 1 Solutons Homework 4 March 5, 018 Soluton to Exercse 5.1.8: Let a IR be a translaton and c > 0 be a re-scalng. ˆb1 (cx + a) cx n + a (cx 1 + a) c x n x 1 cˆb 1 (x), whch shows ˆb 1 s locaton nvarant and

More information

Inductance Calculation for Conductors of Arbitrary Shape

Inductance Calculation for Conductors of Arbitrary Shape CRYO/02/028 Aprl 5, 2002 Inductance Calculaton for Conductors of Arbtrary Shape L. Bottura Dstrbuton: Internal Summary In ths note we descrbe a method for the numercal calculaton of nductances among conductors

More information

PHYS 215C: Quantum Mechanics (Spring 2017) Problem Set 3 Solutions

PHYS 215C: Quantum Mechanics (Spring 2017) Problem Set 3 Solutions PHYS 5C: Quantum Mechancs Sprng 07 Problem Set 3 Solutons Prof. Matthew Fsher Solutons prepared by: Chatanya Murthy and James Sully June 4, 07 Please let me know f you encounter any typos n the solutons.

More information

REAL ANALYSIS I HOMEWORK 1

REAL 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 information

MATH 5707 HOMEWORK 4 SOLUTIONS 2. 2 i 2p i E(X i ) + E(Xi 2 ) ä i=1. i=1

MATH 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 information

The Number of Ways to Write n as a Sum of ` Regular Figurate Numbers

The 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 information

Lab session: numerical simulations of sponateous polarization

Lab session: numerical simulations of sponateous polarization Lab sesson: numercal smulatons of sponateous polarzaton Emerc Boun & Vncent Calvez CNRS, ENS Lyon, France CIMPA, Hammamet, March 2012 Spontaneous cell polarzaton: the 1D case The Hawkns-Voturez model for

More information

Modulo Magic Labeling in Digraphs

Modulo 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 information

Example: (13320, 22140) =? Solution #1: The divisors of are 1, 2, 3, 4, 5, 6, 9, 10, 12, 15, 18, 20, 27, 30, 36, 41,

Example: (13320, 22140) =? Solution #1: The divisors of are 1, 2, 3, 4, 5, 6, 9, 10, 12, 15, 18, 20, 27, 30, 36, 41, The greatest common dvsor of two ntegers a and b (not both zero) s the largest nteger whch s a common factor of both a and b. We denote ths number by gcd(a, b), or smply (a, b) when there s no confuson

More information

The L(2, 1)-Labeling on -Product of Graphs

The 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 information

Errors for Linear Systems

Errors for Linear Systems Errors for Lnear Systems When we solve a lnear system Ax b we often do not know A and b exactly, but have only approxmatons  and ˆb avalable. Then the best thng we can do s to solve ˆx ˆb exactly whch

More information

Meshless Surfaces. presented by Niloy J. Mitra. An Nguyen

Meshless Surfaces. presented by Niloy J. Mitra. An Nguyen Meshless Surfaces presented by Nloy J. Mtra An Nguyen Outlne Mesh-Independent Surface Interpolaton D. Levn Outlne Mesh-Independent Surface Interpolaton D. Levn Pont Set Surfaces M. Alexa, J. Behr, D. Cohen-Or,

More information

COMPLEX NUMBERS AND QUADRATIC EQUATIONS

COMPLEX 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 information

2 Finite difference basics

2 Finite difference basics Numersche Methoden 1, WS 11/12 B.J.P. Kaus 2 Fnte dfference bascs Consder the one- The bascs of the fnte dfference method are best understood wth an example. dmensonal transent heat conducton equaton T

More information

n α j x j = 0 j=1 has a nontrivial solution. Here A is the n k matrix whose jth column is the vector for all t j=0

n α j x j = 0 j=1 has a nontrivial solution. Here A is the n k matrix whose jth column is the vector for all t j=0 MODULE 2 Topcs: Lnear ndependence, bass and dmenson We have seen that f n a set of vectors one vector s a lnear combnaton of the remanng vectors n the set then the span of the set s unchanged f that vector

More information

Statistical Mechanics and Combinatorics : Lecture III

Statistical 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 information

Dirichlet s Theorem In Arithmetic Progressions

Dirichlet s Theorem In Arithmetic Progressions Drchlet s Theorem In Arthmetc Progressons Parsa Kavkan Hang Wang The Unversty of Adelade February 26, 205 Abstract The am of ths paper s to ntroduce and prove Drchlet s theorem n arthmetc progressons,

More information

Bezier curves. Michael S. Floater. August 25, These notes provide an introduction to Bezier curves. i=0

Bezier curves. Michael S. Floater. August 25, These notes provide an introduction to Bezier curves. i=0 Bezer curves Mchael S. Floater August 25, 211 These notes provde an ntroducton to Bezer curves. 1 Bernsten polynomals Recall that a real polynomal of a real varable x R, wth degree n, s a functon of the

More information

Foundations of Arithmetic

Foundations 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 information

SUMS PROBLEM COMPETITION, 2001

SUMS PROBLEM COMPETITION, 2001 SUMS PROBLEM COMPETITION, 200 SOLUTIONS Suppose that after n vsts to Aunt Joylene (and therefore also n vsts to Uncle Bruce Lnda has t n ten cent peces and d n dollar cons After a vst to Uncle Bruce she

More information

Causal Diamonds. M. Aghili, L. Bombelli, B. Pilgrim

Causal Diamonds. M. Aghili, L. Bombelli, B. Pilgrim Causal Damonds M. Aghl, L. Bombell, B. Plgrm Introducton The correcton to volume of a causal nterval due to curvature of spacetme has been done by Myrhem [] and recently by Gbbons & Solodukhn [] and later

More information

n ). This is tight for all admissible values of t, k and n. k t + + n t

n ). 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 information

PAijpam.eu SOME NEW SUM PERFECT SQUARE GRAPHS S.G. Sonchhatra 1, G.V. Ghodasara 2

PAijpam.eu SOME NEW SUM PERFECT SQUARE GRAPHS S.G. Sonchhatra 1, G.V. Ghodasara 2 Internatonal Journal of Pure and Appled Mathematcs Volume 113 No. 3 2017, 489-499 ISSN: 1311-8080 (prnted verson); ISSN: 1314-3395 (on-lne verson) url: http://www.jpam.eu do: 10.12732/jpam.v1133.11 PAjpam.eu

More information

Homework 9 Solutions. 1. (Exercises from the book, 6 th edition, 6.6, 1-3.) Determine the number of distinct orderings of the letters given:

Homework 9 Solutions. 1. (Exercises from the book, 6 th edition, 6.6, 1-3.) Determine the number of distinct orderings of the letters given: Homework 9 Solutons PROBLEM ONE 1 (Exercses from the book, th edton,, 1-) Determne the number of dstnct orderngs of the letters gven: (a) GUIDE Soluton: 5! (b) SCHOOL Soluton:! (c) SALESPERSONS Soluton:

More information

Applied Stochastic Processes

Applied Stochastic Processes STAT455/855 Fall 23 Appled Stochastc Processes Fnal Exam, Bref Solutons 1. (15 marks) (a) (7 marks) The dstrbuton of Y s gven by ( ) ( ) y 2 1 5 P (Y y) for y 2, 3,... The above follows because each of

More information

APPROXIMATE PRICES OF BASKET AND ASIAN OPTIONS DUPONT OLIVIER. Premia 14

APPROXIMATE PRICES OF BASKET AND ASIAN OPTIONS DUPONT OLIVIER. Premia 14 APPROXIMAE PRICES OF BASKE AND ASIAN OPIONS DUPON OLIVIER Prema 14 Contents Introducton 1 1. Framewor 1 1.1. Baset optons 1.. Asan optons. Computng the prce 3. Lower bound 3.1. Closed formula for the prce

More information

Some modelling aspects for the Matlab implementation of MMA

Some modelling aspects for the Matlab implementation of MMA Some modellng aspects for the Matlab mplementaton of MMA Krster Svanberg krlle@math.kth.se Optmzaton and Systems Theory Department of Mathematcs KTH, SE 10044 Stockholm September 2004 1. Consdered optmzaton

More information

Anti-van der Waerden numbers of 3-term arithmetic progressions.

Anti-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 information

Physics 4B. A positive value is obtained, so the current is counterclockwise around the circuit.

Physics 4B. A positive value is obtained, so the current is counterclockwise around the circuit. Physcs 4B Solutons to Chapter 7 HW Chapter 7: Questons:, 8, 0 Problems:,,, 45, 48,,, 7, 9 Queston 7- (a) no (b) yes (c) all te Queston 7-8 0 μc Queston 7-0, c;, a;, d; 4, b Problem 7- (a) Let be the current

More information

Non-negative Matrices and Distributed Control

Non-negative Matrices and Distributed Control Non-negatve Matrces an Dstrbute Control Yln Mo July 2, 2015 We moel a network compose of m agents as a graph G = {V, E}. V = {1, 2,..., m} s the set of vertces representng the agents. E V V s the set of

More information

Math 426: Probability MWF 1pm, Gasson 310 Homework 4 Selected Solutions

Math 426: Probability MWF 1pm, Gasson 310 Homework 4 Selected Solutions Exercses from Ross, 3, : Math 26: Probablty MWF pm, Gasson 30 Homework Selected Solutons 3, p. 05 Problems 76, 86 3, p. 06 Theoretcal exercses 3, 6, p. 63 Problems 5, 0, 20, p. 69 Theoretcal exercses 2,

More information

Limited Dependent Variables

Limited Dependent Variables Lmted Dependent Varables. What f the left-hand sde varable s not a contnuous thng spread from mnus nfnty to plus nfnty? That s, gven a model = f (, β, ε, where a. s bounded below at zero, such as wages

More information

FACTORIZATION IN KRULL MONOIDS WITH INFINITE CLASS GROUP

FACTORIZATION 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 information

5 The Rational Canonical Form

5 The Rational Canonical Form 5 The Ratonal Canoncal Form Here p s a monc rreducble factor of the mnmum polynomal m T and s not necessarly of degree one Let F p denote the feld constructed earler n the course, consstng of all matrces

More information

U.C. Berkeley CS294: Spectral Methods and Expanders Handout 8 Luca Trevisan February 17, 2016

U.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 information

Georgia Tech PHYS 6124 Mathematical Methods of Physics I

Georgia Tech PHYS 6124 Mathematical Methods of Physics I Georga Tech PHYS 624 Mathematcal Methods of Physcs I Instructor: Predrag Cvtanovć Fall semester 202 Homework Set #7 due October 30 202 == show all your work for maxmum credt == put labels ttle legends

More information

6.3.4 Modified Euler s method of integration

6.3.4 Modified Euler s method of integration 6.3.4 Modfed Euler s method of ntegraton Before dscussng the applcaton of Euler s method for solvng the swng equatons, let us frst revew the basc Euler s method of numercal ntegraton. Let the general from

More information

NUMERICAL DIFFERENTIATION

NUMERICAL 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 information

18.781: Solution to Practice Questions for Final Exam

18.781: Solution to Practice Questions for Final Exam 18.781: Soluton to Practce Questons for Fnal Exam 1. Fnd three solutons n postve ntegers of x 6y = 1 by frst calculatng the contnued fracton expanson of 6. Soluton: We have 1 6=[, ] 6 6+ =[, ] 1 =[,, ]=[,,

More information

Lecture 20: Lift and Project, SDP Duality. Today we will study the Lift and Project method. Then we will prove the SDP duality theorem.

Lecture 20: Lift and Project, SDP Duality. Today we will study the Lift and Project method. Then we will prove the SDP duality theorem. prnceton u. sp 02 cos 598B: algorthms and complexty Lecture 20: Lft and Project, SDP Dualty Lecturer: Sanjeev Arora Scrbe:Yury Makarychev Today we wll study the Lft and Project method. Then we wll prove

More information

U.C. Berkeley CS294: Beyond Worst-Case Analysis Luca Trevisan September 5, 2017

U.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 information

Exercise Solutions to Real Analysis

Exercise Solutions to Real Analysis xercse Solutons to Real Analyss Note: References refer to H. L. Royden, Real Analyss xersze 1. Gven any set A any ɛ > 0, there s an open set O such that A O m O m A + ɛ. Soluton 1. If m A =, then there

More information

Solutions to Exercises in Astrophysical Gas Dynamics

Solutions to Exercises in Astrophysical Gas Dynamics 1 Solutons to Exercses n Astrophyscal Gas Dynamcs 1. (a). Snce u 1, v are vectors then, under an orthogonal transformaton, u = a j u j v = a k u k Therefore, u v = a j a k u j v k = δ jk u j v k = u j

More information

A SURVEY OF PROPERTIES OF FINITE HORIZON DIFFERENTIAL GAMES UNDER ISAACS CONDITION. Contents

A SURVEY OF PROPERTIES OF FINITE HORIZON DIFFERENTIAL GAMES UNDER ISAACS CONDITION. Contents A SURVEY OF PROPERTIES OF FINITE HORIZON DIFFERENTIAL GAMES UNDER ISAACS CONDITION BOTAO WU Abstract. In ths paper, we attempt to answer the followng questons about dfferental games: 1) when does a two-player,

More information

Geometric Registration for Deformable Shapes. 2.1 ICP + Tangent Space optimization for Rigid Motions

Geometric Registration for Deformable Shapes. 2.1 ICP + Tangent Space optimization for Rigid Motions Geometrc Regstraton for Deformable Shapes 2.1 ICP + Tangent Space optmzaton for Rgd Motons Regstraton Problem Gven Two pont cloud data sets P (model) and Q (data) sampled from surfaces Φ P and Φ Q respectvely.

More information

MA 323 Geometric Modelling Course Notes: Day 13 Bezier Curves & Bernstein Polynomials

MA 323 Geometric Modelling Course Notes: Day 13 Bezier Curves & Bernstein Polynomials MA 323 Geometrc Modellng Course Notes: Day 13 Bezer Curves & Bernsten Polynomals Davd L. Fnn Over the past few days, we have looked at de Casteljau s algorthm for generatng a polynomal curve, and we have

More information

ACTM State Calculus Competition Saturday April 30, 2011

ACTM State Calculus Competition Saturday April 30, 2011 ACTM State Calculus Competton Saturday Aprl 30, 2011 ACTM State Calculus Competton Sprng 2011 Page 1 Instructons: For questons 1 through 25, mark the best answer choce on the answer sheet provde Afterward

More information

Complete subgraphs in multipartite graphs

Complete 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 information

How Strong Are Weak Patents? Joseph Farrell and Carl Shapiro. Supplementary Material Licensing Probabilistic Patents to Cournot Oligopolists *

How Strong Are Weak Patents? Joseph Farrell and Carl Shapiro. Supplementary Material Licensing Probabilistic Patents to Cournot Oligopolists * How Strong Are Weak Patents? Joseph Farrell and Carl Shapro Supplementary Materal Lcensng Probablstc Patents to Cournot Olgopolsts * September 007 We study here the specal case n whch downstream competton

More information

First day August 1, Problems and Solutions

First day August 1, Problems and Solutions FOURTH INTERNATIONAL COMPETITION FOR UNIVERSITY STUDENTS IN MATHEMATICS July 30 August 4, 997, Plovdv, BULGARIA Frst day August, 997 Problems and Solutons Problem. Let {ε n } n= be a sequence of postve

More information

A CLASS OF RECURSIVE SETS. Florentin Smarandache University of New Mexico 200 College Road Gallup, NM 87301, USA

A CLASS OF RECURSIVE SETS. Florentin Smarandache University of New Mexico 200 College Road Gallup, NM 87301, USA A CLASS OF RECURSIVE SETS Florentn Smarandache Unversty of New Mexco 200 College Road Gallup, NM 87301, USA E-mal: smarand@unmedu In ths artcle one bulds a class of recursve sets, one establshes propertes

More information

Randić Energy and Randić Estrada Index of a Graph

Randić 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 information

Volume 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].

Volume 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 information

Module 3 LOSSY IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur

Module 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 information

PHYS 705: Classical Mechanics. Canonical Transformation II

PHYS 705: Classical Mechanics. Canonical Transformation II 1 PHYS 705: Classcal Mechancs Canoncal Transformaton II Example: Harmonc Oscllator f ( x) x m 0 x U( x) x mx x LT U m Defne or L p p mx x x m mx x H px L px p m p x m m H p 1 x m p m 1 m H x p m x m m

More information

An introduction to chaining, and applications to sublinear algorithms

An introduction to chaining, and applications to sublinear algorithms An ntroducton to channg, and applcatons to sublnear algorthms Jelan Nelson Harvard August 28, 2015 What s ths talk about? What s ths talk about? Gven a collecton of random varables X 1, X 2,...,, we would

More information

Expected Value and Variance

Expected Value and Variance MATH 38 Expected Value and Varance Dr. Neal, WKU We now shall dscuss how to fnd the average and standard devaton of a random varable X. Expected Value Defnton. The expected value (or average value, or

More information

Lecture 10: Euler s Equations for Multivariable

Lecture 10: Euler s Equations for Multivariable Lecture 0: Euler s Equatons for Multvarable Problems Let s say we re tryng to mnmze an ntegral of the form: {,,,,,, ; } J f y y y y y y d We can start by wrtng each of the y s as we dd before: y (, ) (

More information

Using TranSIESTA (II): Integration contour and tbtrans

Using TranSIESTA (II): Integration contour and tbtrans Usng TranSIESTA (II): Integraton contour and tbtrans Frederco D. Novaes December 15, 2009 Outlne Usng TranSIESTA The ntegraton contour Electron densty from GF Why go complex? The non-equlbrum stuaton Usng

More information

APPENDIX A Some Linear Algebra

APPENDIX 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 information

Uniqueness of Weak Solutions to the 3D Ginzburg- Landau Model for Superconductivity

Uniqueness of Weak Solutions to the 3D Ginzburg- Landau Model for Superconductivity Int. Journal of Math. Analyss, Vol. 6, 212, no. 22, 195-114 Unqueness of Weak Solutons to the 3D Gnzburg- Landau Model for Superconductvty Jshan Fan Department of Appled Mathematcs Nanjng Forestry Unversty

More information

Efficient, General Point Cloud Registration with Kernel Feature Maps

Efficient, General Point Cloud Registration with Kernel Feature Maps Effcent, General Pont Cloud Regstraton wth Kernel Feature Maps Hanchen Xong, Sandor Szedmak, Justus Pater Insttute of Computer Scence Unversty of Innsbruck 30 May 2013 Hanchen Xong (Un.Innsbruck) 3D Regstraton

More information

Lecture 17 : Stochastic Processes II

Lecture 17 : Stochastic Processes II : Stochastc Processes II 1 Contnuous-tme stochastc process So far we have studed dscrete-tme stochastc processes. We studed the concept of Makov chans and martngales, tme seres analyss, and regresson analyss

More information

2.3 Nilpotent endomorphisms

2.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 information

Binomial transforms of the modified k-fibonacci-like sequence

Binomial transforms of the modified k-fibonacci-like sequence Internatonal Journal of Mathematcs and Computer Scence, 14(2019, no. 1, 47 59 M CS Bnomal transforms of the modfed k-fbonacc-lke sequence Youngwoo Kwon Department of mathematcs Korea Unversty Seoul, Republc

More information

Inner Product. Euclidean Space. Orthonormal Basis. Orthogonal

Inner Product. Euclidean Space. Orthonormal Basis. Orthogonal Inner Product Defnton 1 () A Eucldean space s a fnte-dmensonal vector space over the reals R, wth an nner product,. Defnton 2 (Inner Product) An nner product, on a real vector space X s a symmetrc, blnear,

More information

Dynamic Programming. Preview. Dynamic Programming. Dynamic Programming. Dynamic Programming (Example: Fibonacci Sequence)

Dynamic Programming. Preview. Dynamic Programming. Dynamic Programming. Dynamic Programming (Example: Fibonacci Sequence) /24/27 Prevew Fbonacc Sequence Longest Common Subsequence Dynamc programmng s a method for solvng complex problems by breakng them down nto smpler sub-problems. It s applcable to problems exhbtng the propertes

More information

CONJUGACY IN THOMPSON S GROUP F. 1. Introduction

CONJUGACY IN THOMPSON S GROUP F. 1. Introduction CONJUGACY IN THOMPSON S GROUP F NICK GILL AND IAN SHORT Abstract. We complete the program begun by Brn and Squer of charactersng conjugacy n Thompson s group F usng the standard acton of F as a group of

More information

CHAPTER 17 Amortized Analysis

CHAPTER 17 Amortized Analysis CHAPTER 7 Amortzed Analyss In an amortzed analyss, the tme requred to perform a sequence of data structure operatons s averaged over all the operatons performed. It can be used to show that the average

More information

Problem Solving in Math (Math 43900) Fall 2013

Problem Solving in Math (Math 43900) Fall 2013 Problem Solvng n Math (Math 43900) Fall 2013 Week four (September 17) solutons Instructor: Davd Galvn 1. Let a and b be two nteger for whch a b s dvsble by 3. Prove that a 3 b 3 s dvsble by 9. Soluton:

More information