Using bases to simplify asymptotic expansions

Size: px
Start display at page:

Download "Using bases to simplify asymptotic expansions"

Transcription

1 1

2 Using bases to simplify asymptotic expansions Matthias Kawski 1 Amit Sanyal 2 1 Department of Mathematics and Statistics Arizona State University 2 Department of Mechanical and Aerospace Engineering Arizona State University LHMNLC 6 : 3 rd IFAC Workshop on Lagrangian and Hamiltonian Methods for Nonlinear Control Nagoya 26 1 This work was partially supported by the National Science Foundation through the grant DMS This presentation was prepared with LaTeX using the beamer package.

3 Overview: Preliminary / progress report General problem Noncommuting flows / vector fields Asymptotic series expansions Linear dependencies / lack of well-definedness Specialization to simple mechanical systems Series expansions using the symmetric product (( Identities and simplifications )) Lie algebras that are never free (( Specialization to specific mechanical systems simulation, comparison of computational accuracy and efficiency )) Successful and ongoing simplification efforts Exponential product expansion of Chen-series: Zinbiel algebra and Hall bases Continuous CBH formula / logarithm of Chen-series Outlook and future plans

4 Why asymptotic expansions? Rarely have closed-form solution formulas for time-varying / nonlinear systems of DEs

5 Why asymptotic expansions? Rarely have closed-form solution formulas for time-varying / nonlinear systems of DEs Commonly: Right hand side of DE ẋ = F + G naturally splits into summands ẋ = F and ẋ = G that BOTH can integrated easily/exactly but need to account for infinity of interaction terms

6 Why asymptotic expansions? Rarely have closed-form solution formulas for time-varying / nonlinear systems of DEs Commonly: Right hand side of DE ẋ = F + G naturally splits into summands ẋ = F and ẋ = G that BOTH can integrated easily/exactly but need to account for infinity of interaction terms Commonly: Right hand side of DE ẋ = u i (t)f i (x) naturally splits into time and state dependent factors naturally want to separate off-line/exact integration of fixed geometric features, and just-in-time integration of controls/disturbances u i (t)

7 Why asymptotic expansions? Rarely have closed-form solution formulas for time-varying / nonlinear systems of DEs Commonly: Right hand side of DE ẋ = F + G naturally splits into summands ẋ = F and ẋ = G that BOTH can integrated easily/exactly but need to account for infinity of interaction terms Commonly: Right hand side of DE ẋ = u i (t)f i (x) naturally splits into time and state dependent factors naturally want to separate off-line/exact integration of fixed geometric features, and just-in-time integration of controls/disturbances u i (t) Perturbation analysis, averaging, vibrational control

8 Magnus (1954) expansion and trees Given Y = A(t)Y seek Ω(t) such that Y (t) = e Ω(t) Y () e.g. Iserles & Nørsett (1999), Butcher trees

9 Magnus (1954) expansion and trees Given Y = A(t)Y seek Ω(t) such that Y (t) = e Ω(t) Y () Ω(t) = t A(τ) dτ 1 2 t τ1 t τ1 τ t τ1 τ [A(τ 2 ), A(τ 1 )] dτ 2 dτ 1 [A(τ 3 ), [A(τ 2 ), A(τ 1 )]] dτ 3 dτ 2 dτ 1 [[A(τ 3 ), A(τ 2 )], A(τ 1 )] dτ 3 dτ 2 dτ 1 e.g. Iserles & Nørsett (1999), Butcher trees

10 Magnus (1954) expansion and trees Given Y = A(t)Y seek Ω(t) such that Y (t) = e Ω(t) Y () Ω(t) = t A(τ) dτ 1 2 t τ1 t τ1 τ t τ1 τ [A(τ 2 ), A(τ 1 )] dτ 2 dτ 1 [A(τ 3 ), [A(τ 2 ), A(τ 1 )]] dτ 3 dτ 2 dτ 1 [[A(τ 3 ), A(τ 2 )], A(τ 1 )] dτ 3 dτ 2 dτ 1 e.g. Iserles & Nørsett (1999), Butcher trees

11 Magnus (1954) expansion and trees Given Y = A(t)Y seek Ω(t) such that Y (t) = e Ω(t) Y () Ω(t) = t A(τ) dτ 1 2 t τ1 t τ1 τ t τ1 τ [A(τ 2 ), A(τ 1 )] dτ 2 dτ 1 [A(τ 3 ), [A(τ 2 ), A(τ 1 )]] dτ 3 dτ 2 dτ 1 [[A(τ 3 ), A(τ 2 )], A(τ 1 )] dτ 3 dτ 2 dτ 1 Effective encoding using rooted trees e.g. Iserles & Nørsett (1999), Butcher trees

12 Volterra series and chronological calculus Agrachev and Gamkrelidze (1979), Sarychev... Functional analysis: operators on C (M), i.e. f (p) p(f ) consistent and effective notation allows for exponential representation of flows of time-varying vector fields basic product of time varying vector fields X τ, Y τ (X Y ) τ = τ [X t, d dt Y t] dt Different algebra: left chronological identity ((X Y ) Z ) ((Y X) Z ) = (X (Y Z )) (Y (X Z )) linear dependent terms in Volterra-like series expansion using basis for free chronological algebra to collect terms?

13 Series expansions for mechanical systems Lewis and Murray (1995), Bullo (1999), Burdick and Vela,... Controlled system defined by affine connection, in coordinates q i + Γ i jk (q) q j q k = X i (t, q)= u l (t)y i l (q)

14 Series expansions for mechanical systems Lewis and Murray (1995), Bullo (1999), Burdick and Vela,... Controlled system defined by affine connection, in coordinates q i + Γ i jk (q) q j q k = X i (t, q)= u l (t)y i l (q) affine connection usually from Riemannian metric (energy) ( ) Γ i jk = 1 Mlj 2 Mlk + M q i li M ij q j q l

15 Series expansions for mechanical systems Lewis and Murray (1995), Bullo (1999), Burdick and Vela,... Controlled system defined by affine connection, in coordinates q i + Γ i jk (q) q j q k = X i (t, q)= u l (t)y i l (q) affine connection usually from Riemannian metric (energy) ( ) Γ i jk = 1 Mlj 2 Mlk + M q i li M ij q j q l to rewrite as first order system on TQ, vertically lift vector fields X on a manifold Q to vector fields X lift on TQ. Geometrically: X lift (v q ) = d dt (υ q + tx(q)) t= In coordinates, if X(q) = X i (q) q i then X lift (υ q ) = X i (q) υ i

16 Symmetric products and series expansions Lewis and Murray (1995), Bullo (1999), Burdick and Vela,... use Lie brackets of lifted vector fields together with geodesic spray Z = υ i Γ i q i jk υj υ k υ i to define symmetric bracket of vector fields X and Y on Q X : Y lift = [X lift, [Z, Y lift ]]

17 Symmetric products and series expansions Lewis and Murray (1995), Bullo (1999), Burdick and Vela,... use Lie brackets of lifted vector fields together with geodesic spray Z = υ i Γ i q i jk υj υ k υ i to define symmetric bracket of vector fields X and Y on Q notation Y (q, T ) = T X : Y lift = [X lift, [Z, Y lift ]] Y (q, t)dt series expansion via iterated integrals and symm. products typical terms Y : Y : Y : Y and Y : Y : Y : Y

18 Symmetric products and series expansions Lewis and Murray (1995), Bullo (1999), Burdick and Vela,... use Lie brackets of lifted vector fields together with geodesic spray Z = υ i Γ i q i jk υj υ k υ i to define symmetric bracket of vector fields X and Y on Q notation Y (q, T ) = T X : Y lift = [X lift, [Z, Y lift ]] Y (q, t)dt series expansion via iterated integrals and symm. products typical terms Y : Y : Y : Y and Y : Y : Y : Y Question: linear independence of terms in series?

19 Identities in the symmetric algebra? If L(X 1,... X m, Z ) is free, is Sym Z (X 1,... X m ) ever free?

20 Identities in the symmetric algebra? If L(X 1,... X m, Z ) is free, is Sym Z (X 1,... X m ) ever free? For vector fields f i on M n can Sym Z (f 1,... f m ) ever be free? If not, what identities are always satisfied? Bases? Use these to further collapse the series.

21 Identities in the symmetric algebra? If L(X 1,... X m, Z ) is free, is Sym Z (X 1,... X m ) ever free? For vector fields f i on M n can Sym Z (f 1,... f m ) ever be free? If not, what identities are always satisfied? Bases? Use these to further collapse the series. When is it a (well-studied) Jordan algebra? i.e. commutative w/ Jordan identity ((xx)xy)) = (x((xx)y))

22 Identities in the symmetric algebra? If L(X 1,... X m, Z ) is free, is Sym Z (X 1,... X m ) ever free? For vector fields f i on M n can Sym Z (f 1,... f m ) ever be free? If not, what identities are always satisfied? Bases? Use these to further collapse the series. When is it a (well-studied) Jordan algebra? i.e. commutative w/ Jordan identity ((xx)xy)) = (x((xx)y)) Specialize to Z quadratic in velocities... (c.f. homogeneity, Murray, Lewis, Bullo, Vela, Burdick,... )

23 Identities in the symmetric algebra? If L(X 1,... X m, Z ) is free, is Sym Z (X 1,... X m ) ever free? For vector fields f i on M n can Sym Z (f 1,... f m ) ever be free? If not, what identities are always satisfied? Bases? Use these to further collapse the series. When is it a (well-studied) Jordan algebra? i.e. commutative w/ Jordan identity ((xx)xy)) = (x((xx)y)) Specialize to Z quadratic in velocities... (c.f. homogeneity, Murray, Lewis, Bullo, Vela, Burdick,... ) Specialize to distinguished curvatures i.e. assuming additional identities on Γ i jk and q l Γ i jk

24 Search for cubic identities in the symmetric algebra An early false lead a cubic operad? V : X : Y : W + Y : W : V : X + X : W : V : Y = = V : X : Y : W + V : Y : X : W + X : Y : V : W

25 Search for cubic identities in the symmetric algebra An early false lead a cubic operad? V : X : Y : W + Y : W : V : X + X : W : V : Y = = V : X : Y : W + V : Y : X : W + X : Y : V : W Another sample, triple brackets of coordinates vector fields < dx α, x i : x j : x k : + (Γ α is + Γα si )( Γs kl x j + (Γ m kl + Γm lk ) ( Γ α mj x i x l >= (Γ α is +Γα si )(Γm kl +Γm lk )(Γs mj +Γs jm ) + Γs lk x j ) + ) + Γα jm x i ( Γ m kl x i + ( 2 Γ α kl x i x j ) + Γm lk (Γ α x i mj + Γα jm ) + 2 Γ α lk x i x j )

26 Search for cubic identities in the symmetric algebra An early false lead a cubic operad? V : X : Y : W + Y : W : V : X + X : W : V : Y = = V : X : Y : W + V : Y : X : W + X : Y : V : W Another sample, triple brackets of coordinates vector fields < dx α, x i : x j : x k : + (Γ α is + Γα si )( Γs kl x j + (Γ m kl + Γm lk ) ( Γ α mj x i x l >= (Γ α is +Γα si )(Γm kl +Γm lk )(Γs mj +Γs jm ) + Γs lk x j ) + ) + Γα jm x i ( Γ m kl x i + ( 2 Γ α kl x i x j ) + Γm lk (Γ α x i mj + Γα jm ) + 2 Γ α lk x i x j ) Take differences, kill second derivatives. Use curvature...

27 Compare: Lie algebra of two fields on R Molev (1983, Russian): Lie algebra L(X, Y ) generated by two vector fields X and Y on R is never free Kirillov, Kontsevich, and Molev (199): For Lie algebra L generated by two vector fields on R in general position calculated dim s of hom. subspaces and entropy, and established identity X σ(1), X σ(2), X σ(3), X σ(4), Z L σ S 4 sgn(σ) [X σ(1), [X σ(2), [X σ(3), [X σ(4), Z ]]]] = McLachlan and Ryland (23): starting at order 13, the Lie algebras of classical mechanics in general position on Q = R n w/ Euclidean metric M = I and on general Q differ!

28 Compare: Lie algebra of classical mechanics the Lie algebra of simple mechanical systems is never free: with canonical Poisson bracket {A, B} = A B A B q i p i p i q i i kinetic energy T = 1 2 pt M(q)p and potential energy V (q) always satisfy identities such as {V, {V, {V, H}}} (since e.g. the modified potential {V, {V, H}} = V V q i M ij q j is independent of p) i,j in The algebraic entropy of classical mechanics (23) McLachlan and Ryland calculate the entropy lim (dim n Ln (T, V )) 1/n = Witt s formula (free Lie alg) dim L n (X, Y ) = 1 n µ(d) 2 n d bases ( by hand, for small dim ) by Murua (1999) also Blanes, Casas, and Ros (2, 21) d n 2n n

29 Compare: factoring the Chen Fliess series Affine analytic control system on M n, initialized at x() = p ẋ = m u j (t)f j (x), with output ϕ: M n R j=1 asymptotic series x(t ) = T t1 I=(i 1...i s) ts u i1 (t 1 )... u is (t s ) dt s... dt 1 (f i1... f is ϕ )(p)

30 Compare: factoring the Chen Fliess series Affine analytic control system on M n, initialized at x() = p ẋ = m u j (t)f j (x), with output ϕ: M n R j=1 asymptotic series x(t ) = I=(i 1...i s) T t1 ts u i1 (t 1 )... u is (t s ) dt s... dt 1 (f i1... f is ϕ )(p) formal series in free associative algebra A = A(X 1,... X m ) over set of indeterminates X 1,... X m S(T, u) = I=(i 1...i s) T t1 ts u i1 (t 1 )... u is (t s ) dt s... dt 1 X i1... X is

31 Compare: factoring the Chen Fliess series Affine analytic control system on M n, initialized at x() = p ẋ = m u j (t)f j (x), with output ϕ: M n R j=1 asymptotic series x(t ) = I=(i 1...i s) T t1 ts u i1 (t 1 )... u is (t s ) dt s... dt 1 (f i1... f is ϕ )(p) formal series in free associative algebra A = A(X 1,... X m ) over set of indeterminates X 1,... X m S(T, u) = I=(i 1...i s) T t1 ts u i1 (t 1 )... u is (t s ) dt s... dt 1 X i1... X is redundant, linearly dependent, truncations not systems

32 Coordinates of the first / second kind The series actually takes values in the free Lie algebra L = L(X 1,... X m ) A S(T, u) = I=(i 1...i s) T t1 ts u i1 (t 1 )... u is (t s ) dt s... dt 1 X i1... X is

33 Coordinates of the first / second kind The series actually takes values in the free Lie algebra L = L(X 1,... X m ) A S(T, u) = I=(i 1...i s) T t1 ts u i1 (t 1 )... u is (t s ) dt s... dt 1 X i1... X is For any ordered basis B L, there exist uniquely determined iterated integral functionals assuming that the space of coefficients U is sufficiently rich, e.g. U = L loc ([, T ], R m ) ξ H, ζ H : U C[, T ] such that S(T, u) = exp( ζ H (T, u)h) = H B H B exp(ξ H (T, u)h)

34 Coordinates of the first / second kind The series actually takes values in the free Lie algebra L = L(X 1,... X m ) A S(T, u) = I=(i 1...i s) T t1 ts u i1 (t 1 )... u is (t s ) dt s... dt 1 X i1... X is For any ordered basis B L, there exist uniquely determined iterated integral functionals assuming that the space of coefficients U is sufficiently rich, e.g. U = L loc ([, T ], R m ) ξ H, ζ H : U C[, T ] such that S(T, u) = exp( ζ H (T, u)h) = H B H B Wanted: suitable bases B for L that yield simple formulas for ξ H and ζ H exp(ξ H (T, u)h)

35 Hall sets A Hall set over a set X is any strictly ordered subset H of parenthesixed words satisfying (i) X H (ii) Suppose a X. Then (t, a) H iff t H, t < a and a < (t, a). (iii) Suppose u, v, w, (u, v) H. Then (t, (t, t )) H iff t t (t, t ) and t < (t, (t, t )). Example: X = {a, b} ((a(ab))(b(ab))) ((ab)(b(b(ab)))) ((ab)(b(a(ab)))) ((ab)(a(a(ab)))) (b(b(b(b(ab))))) (b(b(b(a(ab))))) (b(b(a(a(ab))))) (b(a(a(a(ab))))) ((ab)(b(ab))) ((ab)(a(ab))) (b(b(b(ab)))) (b(b(a(ab)))) (b(a(a(ab)))) (a(a(a(ab)))) (b(b(ab))) (b(a(ab))) (a(a(ab))) (b(ab)) (a(ab)) (ab) b a

36 Elegant formula for coordinates ξ H of 2 nd kind Use Hall bases for free Lie algebra

37 Elegant formula for coordinates ξ H of 2 nd kind Use Hall bases for free Lie algebra Use Zinbiel product on iterated integrals (U V )(t) = t U(s) V (s) ds

38 Elegant formula for coordinates ξ H of 2 nd kind Use Hall bases for free Lie algebra Use Zinbiel product on iterated integrals (U V )(t) = t U(s) V (s) ds which makes AC([, T ]) into a left Zinbiel algebra, satisfying the left Zinbiel identity (U (V W )) = ((U V ) W ) + ((V U) W )

39 Elegant formula for coordinates ξ H of 2 nd kind Use Hall bases for free Lie algebra Use Zinbiel product on iterated integrals (U V )(t) = t U(s) V (s) ds which makes AC([, T ]) into a left Zinbiel algebra, satisfying the left Zinbiel identity (U (V W )) = ((U V ) W ) + ((V U) W ) (Schützenberger 1958, Sussmann 1985, Grossmann 1988, Melançon and Reutenauer 199, MK) ξ HK = ξ H ξ K for H, K, HK H

40 In progress: The logarithm of the Chen series, or: A continuous Campbell-Baker-Hausdorff formula Wanted: similar simple formula for coord s ζ B of 1 st kind Advantages, especially in computational numerics: One exponential only! which bases? what is the product structure for the ζs, if there is any? proposed (partial) solutions: Rocha, Murua, MK

41 The first iterated integrals Notational convenience: Zinbiel algebra isomomorphism Υ from free Zinbiel algebra to Zinbiel algebra of iterated integral functionals Υ(wa): (u, t) t Υ(w)(u, s) u a(s) ds ζ a = a Υ(a)(u, t) = t u a(s)ds ζ b = b Υ(ab)(u, t) = t s u a(σ) dσ u b (s)ds ζ ab = 1 2 (ab ba) ζ aab = 1 6 ζ bab = 1 6 ( aab 2aba + baa) ( abb + 2bab bba) ζ aaab = 1 6 (abaa aaba) ζ baab = 1 6 (abab aabb + bbaa baba) ζ bbab = 1 6 (bbab babb)

42 The next few iterated integrals ζ aaaab = 1 3 (aaaab + aaaba 4aabaa + abaaa + baaaa) ζ baaab = 1 3 ( 2aaabb + 3aabab + 3aabba 2abaab 2ababa + 3abbaa 2baaab 2baaba + 3babaa 2bbaaa) ζ abaab = 1 3 ( 3aaabb + 2aabab + 2aabba + 2abaab 3ababa + 2abbaa 3baaab + 2baaba + 2babaa 3bbaaa) ζ bbaab = 1 3 (2aabbb 3ababb + 2abbab + 2abbba 3baabb + 2babab + 2babba 3bbaba 3bbaab + 2bbbaa) ζ abbab = 1 3 ( aabbb ababb + 4abbab abbba baabb babab + 4babba bbaba bbaab bbbaa) ζ bbbab = 1 3 (abbbb + babbb 4bbabb + bbbab + bbbba)

43 The next few iterated integrals ζ aaaab = 1 3 (aaaab + aaaba 4aabaa + abaaa + baaaa) ζ baaab = 1 3 ( 2aaabb + 3aabab + 3aabba 2abaab 2ababa + 3abbaa 2baaab 2baaba + 3babaa 2bbaaa) ζ abaab = 1 3 ( 3aaabb + 2aabab + 2aabba + 2abaab 3ababa + 2abbaa 3baaab + 2baaba + 2babaa 3bbaaa) ζ bbaab = 1 3 (2aabbb 3ababb + 2abbab + 2abbba 3baabb + 2babab + 2babba 3bbaba 3bbaab + 2bbbaa) ζ abbab = 1 3 ( aabbb ababb + 4abbab abbba baabb babab + 4babba bbaba bbaab bbbaa) ζ bbbab = 1 3 (abbbb + babbb 4bbabb + bbbab + bbbba) Multiplicative structures?

44 The next few iterated integrals ζ aaaab = 1 3 (aaaab + aaaba 4aabaa + abaaa + baaaa) ζ baaab = 1 3 ( 2aaabb + 3aabab + 3aabba 2abaab 2ababa + 3abbaa 2baaab 2baaba + 3babaa 2bbaaa) ζ abaab = 1 3 ( 3aaabb + 2aabab + 2aabba + 2abaab 3ababa + 2abbaa 3baaab + 2baaba + 2babaa 3bbaaa) ζ bbaab = 1 3 (2aabbb 3ababb + 2abbab + 2abbba 3baabb + 2babab + 2babba 3bbaba 3bbaab + 2bbbaa) ζ abbab = 1 3 ( aabbb ababb + 4abbab abbba baabb babab + 4babba bbaba bbaab bbbaa) ζ bbbab = 1 3 (abbbb + babbb 4bbabb + bbbab + bbbba) Multiplicative structures? Maybe only apparent when using other bases but which?

45 The next few iterated integrals ζ aaaab = 1 3 (aaaab + aaaba 4aabaa + abaaa + baaaa) ζ baaab = 1 3 ( 2aaabb + 3aabab + 3aabba 2abaab 2ababa + 3abbaa 2baaab 2baaba + 3babaa 2bbaaa) ζ abaab = 1 3 ( 3aaabb + 2aabab + 2aabba + 2abaab 3ababa + 2abbaa 3baaab + 2baaba + 2babaa 3bbaaa) ζ bbaab = 1 3 (2aabbb 3ababb + 2abbab + 2abbba 3baabb + 2babab + 2babba 3bbaba 3bbaab + 2bbbaa) ζ abbab = 1 3 ( aabbb ababb + 4abbab abbba baabb babab + 4babba bbaba bbaab bbbaa) ζ bbbab = 1 3 (abbbb + babbb 4bbabb + bbbab + bbbba) Multiplicative structures? Maybe only apparent when using other bases but which? Special cases? Mechanical? extreme case SO(3) recover/compare trad formulas

46 Conclusion and continuing work Continuing efforts, esp.for computational purposes, to use geometric structures to simplify asymptotic expansions This presentation was prepared with LaTeX using the beamer package.

47 Conclusion and continuing work Continuing efforts, esp.for computational purposes, to use geometric structures to simplify asymptotic expansions Identify multiplicative structure of coordinates ζ of 1 st kind, and find bases that yield formulas as simple as ξ HK = ξ ξ K This presentation was prepared with LaTeX using the beamer package.

48 Conclusion and continuing work Continuing efforts, esp.for computational purposes, to use geometric structures to simplify asymptotic expansions Identify multiplicative structure of coordinates ζ of 1 st kind, and find bases that yield formulas as simple as ξ HK = ξ ξ K Specialize to general mechanical systems, analyze the geometry, find all structural identities, and use these to simplify solution formulas This presentation was prepared with LaTeX using the beamer package.

49 Conclusion and continuing work Continuing efforts, esp.for computational purposes, to use geometric structures to simplify asymptotic expansions Identify multiplicative structure of coordinates ζ of 1 st kind, and find bases that yield formulas as simple as ξ HK = ξ ξ K Specialize to general mechanical systems, analyze the geometry, find all structural identities, and use these to simplify solution formulas Specialize to specific mechanical systems, further collapse the formulas. This presentation was prepared with LaTeX using the beamer package.

50 Conclusion and continuing work Continuing efforts, esp.for computational purposes, to use geometric structures to simplify asymptotic expansions Identify multiplicative structure of coordinates ζ of 1 st kind, and find bases that yield formulas as simple as ξ HK = ξ ξ K Specialize to general mechanical systems, analyze the geometry, find all structural identities, and use these to simplify solution formulas Specialize to specific mechanical systems, further collapse the formulas. Demonstrate in simulations the accuracy and computational efficiency of simplified solution formulas This presentation was prepared with LaTeX using the beamer package.

Formal solution Chen-Fliess series

Formal solution Chen-Fliess series Formal solution Chen-Fliess series Ṡ = S(t) u a (t) a, S() = 1 Z = m a Z on algebra Â(Z ) of formal power series in aset Z of noncommuting indeterminates (letters) has the unique solution CF(T, u) = w

More information

The assignment is not difficult, but quite labour consuming. Do not wait until the very last day.

The assignment is not difficult, but quite labour consuming. Do not wait until the very last day. CAS 705 CAS 705. Sample solutions to the assignment 1 (many questions have more than one solutions). Total of this assignment is 129 pts. Each assignment is worth 25%. The assignment is not difficult,

More information

Manipulating exponential products Instead of working with complicated concatenations of flows

Manipulating exponential products Instead of working with complicated concatenations of flows Manipulating exponential products Instead of working with complicated concatenations of flows z(t) = e t9 t2 t8 (f +f 1 +f 2 ) dt... e t1 (f +f 1 f 2 ) dt t1 e (f +f 1 +f 2 ) dt (p) it is desirable to

More information

Manipulating exponential products

Manipulating exponential products Manipulating exponential products Instead of working with complicated concatenations of flows like z(t) =e t 9 t (f 8 0 +f 1 +f 2 ) dt...e t 2 t (f 1 0 +f 1 f 2 ) dt e t 1 0 (f 0+f 1 +f 2 ) dt (p) it is

More information

Deciding Representability of Sets of Words of Equal Length

Deciding Representability of Sets of Words of Equal Length Deciding Representability of Sets of Words of Equal Length F. Blanchet-Sadri 1 Sean Simmons 2 November 24, 2012 Abstract Partial words are sequences over a finite alphabet that may have holes that match,

More information

O C C W S M N N Z C Z Y D D C T N P C G O M P C O S B V Y B C S E E K O U T T H E H I D D E N T R E A S U R E S O F L I F E

O C C W S M N N Z C Z Y D D C T N P C G O M P C O S B V Y B C S E E K O U T T H E H I D D E N T R E A S U R E S O F L I F E Timed question: I VISUALIZE A TIME WHEN WE WILL BE TO ROBOTS WHAT DOGS ARE TO HUMANS. AND I AM ROOTING FOR THE MACHINES. 1) S E E K O U T T H E H I D D E N T R E A S U R E S O F L I F E Here s how we get

More information

The Binomial Theorem.

The Binomial Theorem. The Binomial Theorem RajeshRathod42@gmail.com The Problem Evaluate (A+B) N as a polynomial in powers of A and B Where N is a positive integer A and B are numbers Example: (A+B) 5 = A 5 +5A 4 B+10A 3 B

More information

The following tables might be useful during the event.

The following tables might be useful during the event. The following tables might be useful during the event. A B C D E F G H I J K L M N O P Q R S T U V W X Y Z A A B C D E F G H I J K L M N O P Q R S T U V W X Y Z B B C D E F G H I J K L M N O P Q R S T

More information

Supplementary Examples for

Supplementary Examples for Supplementary Examples for Infinite Interval Exchange Transformations from Shifts ([LN15]) Luis-Miguel Lopez Philippe Narbel Version 1.0, April, 2016 Contents A The Shifted Intervals Preservation (Lemma

More information

A canonical semi-deterministic transducer

A canonical semi-deterministic transducer A canonical semi-deterministic transducer Achilles A. Beros Joint work with Colin de la Higuera Laboratoire d Informatique de Nantes Atlantique, Université de Nantes September 18, 2014 The Results There

More information

Minimal Complexity Sinusoidal Controls for Path Planning

Minimal Complexity Sinusoidal Controls for Path Planning 53rd IEEE Conference on Decision and Control December 15-17, 214. Los Angeles, California, USA Minimal Complexity Sinusoidal Controls for Path Planning Jean-Paul Gauthier and Matthias Kawski Abstract This

More information

F G J F M K P C H D V P T H Z M T U C F M X Q P G Z C Q P O F M Y I F W I N T E R C O M E S C A N S P R I N G B E F A R B E H I N D

F G J F M K P C H D V P T H Z M T U C F M X Q P G Z C Q P O F M Y I F W I N T E R C O M E S C A N S P R I N G B E F A R B E H I N D Timed question: WHAT GOOD IS THE WARTH OF SUER, WITHOUT THE COLD OF WINTER TO GIVE IT SWEETNESS. KTHX JCCB PG XTD KHUVXT CR GVVDU, KPXTCX XTD ZCIB WHAT GOOD IS THE WARTH OF SUER, WITHOUT THE COLD CR KPOXDU

More information

Chapter 4. Regular Expressions. 4.1 Some Definitions

Chapter 4. Regular Expressions. 4.1 Some Definitions Chapter 4 Regular Expressions 4.1 Some Definitions Definition: If S and T are sets of strings of letters (whether they are finite or infinite sets), we define the product set of strings of letters to be

More information

Recap from Last Time

Recap from Last Time Regular Expressions Recap from Last Time Regular Languages A language L is a regular language if there is a DFA D such that L( D) = L. Theorem: The following are equivalent: L is a regular language. There

More information

In English, there are at least three different types of entities: letters, words, sentences.

In English, there are at least three different types of entities: letters, words, sentences. Chapter 2 Languages 2.1 Introduction In English, there are at least three different types of entities: letters, words, sentences. letters are from a finite alphabet { a, b, c,..., z } words are made up

More information

The local structure of affine systems

The local structure of affine systems The local structure of affine systems César Aguilar and Andrew D. Lewis Department of Mathematics and Statistics, Queen s University 05/06/2008 C. Aguilar, A. Lewis (Queen s University) The local structure

More information

Sturmian Words, Sturmian Trees and Sturmian Graphs

Sturmian Words, Sturmian Trees and Sturmian Graphs Sturmian Words, Sturmian Trees and Sturmian Graphs A Survey of Some Recent Results Jean Berstel Institut Gaspard-Monge, Université Paris-Est CAI 2007, Thessaloniki Jean Berstel (IGM) Survey on Sturm CAI

More information

Calculus of nonlinear interconnections with applications

Calculus of nonlinear interconnections with applications Calculus of nonlinear interconnections with applications Matthias Kawski Department of Mathematics Arizona State University Tempe, Arizona, 85287 kawski@asu.edu Abstract This paper reports progress in

More information

Computational Learning Theory Learning Patterns (Monomials)

Computational Learning Theory Learning Patterns (Monomials) Computational Learning Theory Learning Patterns (Monomials) Akihiro Yamamoto 山本章博 http://www.iip.ist.i.kyoto-u.ac.jp/member/akihiro/ akihiro@i.kyoto-u.ac.jp 1 Formal Languages : a finite set of symbols

More information

On the homogeneity of the affine connection model for mechanical control systems

On the homogeneity of the affine connection model for mechanical control systems 2 F. Bullo and A. D. Lewis On the homogeneity of the affine connection model for mechanical control systems Francesco Bullo Andrew D. Lewis 29/2/2 Abstract This work presents a review of a number of control

More information

Interactions in Random Copolymers. Toma Marinov and. Jutta Luettmer-Strathmann. Department of Physics The University of Akron Akron, OH

Interactions in Random Copolymers. Toma Marinov and. Jutta Luettmer-Strathmann. Department of Physics The University of Akron Akron, OH Interactions in Random Copolymers Toma Marinov and Jutta Luettmer-Strathmann Department of Physics The University of Akron Akron, OH 44325-4001 Poster presented at the March Meeting of the American Physical

More information

CS A Term 2009: Foundations of Computer Science. Homework 2. By Li Feng, Shweta Srivastava, and Carolina Ruiz.

CS A Term 2009: Foundations of Computer Science. Homework 2. By Li Feng, Shweta Srivastava, and Carolina Ruiz. CS3133 - A Term 2009: Foundations of Computer Science Prof. Carolina Ruiz Homework 2 WPI By Li Feng, Shweta Srivastava, and Carolina Ruiz Chapter 4 Problem 1: (10 Points) Exercise 4.3 Solution 1: S is

More information

CSCI 340: Computational Models. Regular Expressions. Department of Computer Science

CSCI 340: Computational Models. Regular Expressions. Department of Computer Science CSCI 340: Computational Models Regular Expressions Chapter 4 Department of Computer Science Yet Another New Method for Defining Languages Given the Language: L 1 = {x n for n = 1 2 3...} We could easily

More information

North Carolina Science Olympiad Code Busters Test 2

North Carolina Science Olympiad Code Busters Test 2 North Carolina Science Olympiad Code Busters Test 2 2018 Names of participants: (Please print neatly) School Name: V JV1 JV2 JV3 Warning: Do not open this packet until given permission to do so. Note:

More information

THE MAGNUS METHOD FOR SOLVING OSCILLATORY LIE-TYPE ORDINARY DIFFERENTIAL EQUATIONS

THE MAGNUS METHOD FOR SOLVING OSCILLATORY LIE-TYPE ORDINARY DIFFERENTIAL EQUATIONS THE MAGNUS METHOD FOR SOLVING OSCILLATORY LIE-TYPE ORDINARY DIFFERENTIAL EQUATIONS MARIANNA KHANAMIRYAN Department of Applied Mathematics and Theoretical Physics, University of Cambridge, Wilberforce Road,

More information

Automata Theory CS F-04 Non-Determinisitic Finite Automata

Automata Theory CS F-04 Non-Determinisitic Finite Automata Automata Theory CS411-2015F-04 Non-Determinisitic Finite Automata David Galles Department of Computer Science University of San Francisco 04-0: Non-Determinism A Deterministic Finite Automata s transition

More information

B-Series and their Cousins - A. Contemporary Geometric View

B-Series and their Cousins - A. Contemporary Geometric View B-Series and their Cousins - A Contemporary Geometric View Hans Munthe-Kaas 1 Department of Mathematics University of Bergen Norway url: hans.munthe-kaas.no mail: hans.munthe-kaas@uib.no SciCADE Bath,

More information

North Carolina Science Olympiad Code Busters Test 1

North Carolina Science Olympiad Code Busters Test 1 North Carolina Science Olympiad Code Busters Test 1 2018 Names of participants: (Please print neatly) School Name: V JV1 JV2 JV3 Warning: Do not open this packet until given permission to do so. Note:

More information

INDUCTIVE SYNTHESIS OF COVER-GRAMMARS WITH THE HELP OF ANT COLONY OPTIMIZATION

INDUCTIVE SYNTHESIS OF COVER-GRAMMARS WITH THE HELP OF ANT COLONY OPTIMIZATION F O U N D A T I O N S O F C O M P U T I N G A N D D E C I S I O N S C I E N C E S Vol. 41 (2016) DOI: 10.1515/fcds-2016-0016 No. 4 ISSN 0867-6356 e-issn 2300-3405 INDUCTIVE SYNTHESIS OF COVER-GRAMMARS

More information

Author: Vivek Kulkarni ( )

Author: Vivek Kulkarni ( ) Author: Vivek Kulkarni ( vivek_kulkarni@yahoo.com ) Chapter-3: Regular Expressions Solutions for Review Questions @ Oxford University Press 2013. All rights reserved. 1 Q.1 Define the following and give

More information

Loos Symmetric Cones. Jimmie Lawson Louisiana State University. July, 2018

Loos Symmetric Cones. Jimmie Lawson Louisiana State University. July, 2018 Louisiana State University July, 2018 Dedication I would like to dedicate this talk to Joachim Hilgert, whose 60th birthday we celebrate at this conference and with whom I researched and wrote a big blue

More information

Conference on Diophantine Analysis and Related Fields 2006 in honor of Professor Iekata Shiokawa Keio University Yokohama March 8, 2006

Conference on Diophantine Analysis and Related Fields 2006 in honor of Professor Iekata Shiokawa Keio University Yokohama March 8, 2006 Diophantine analysis and words Institut de Mathématiques de Jussieu + CIMPA http://www.math.jussieu.fr/ miw/ March 8, 2006 Conference on Diophantine Analysis and Related Fields 2006 in honor of Professor

More information

Stream Codes. 6.1 The guessing game

Stream Codes. 6.1 The guessing game About Chapter 6 Before reading Chapter 6, you should have read the previous chapter and worked on most of the exercises in it. We ll also make use of some Bayesian modelling ideas that arrived in the vicinity

More information

Involution Palindrome DNA Languages

Involution Palindrome DNA Languages Involution Palindrome DNA Languages Chen-Ming Fan 1, Jen-Tse Wang 2 and C. C. Huang 3,4 1 Department of Information Management, National Chin-Yi University of Technology, Taichung, Taiwan 411. fan@ncut.edu.tw

More information

Series Expansions for Analytic Systems Linear in the Controls

Series Expansions for Analytic Systems Linear in the Controls IEEE Decision and Control Conference Sydney, Australia, Dec 2 Series Expansions for Analytic Systems Linear in the Controls Francesco Bullo Coordinated Science Laboratory and General Engineering Department

More information

The Pumping Lemma (cont.) 2IT70 Finite Automata and Process Theory

The Pumping Lemma (cont.) 2IT70 Finite Automata and Process Theory The Pumping Lemma (cont.) 2IT70 Finite Automata and Process Theory Technische Universiteit Eindhoven May 4, 2016 The Pumping Lemma theorem if L Σ is a regular language then m > 0 : w L, w m : x,y,z : w

More information

Chap. 3. Controlled Systems, Controllability

Chap. 3. Controlled Systems, Controllability Chap. 3. Controlled Systems, Controllability 1. Controllability of Linear Systems 1.1. Kalman s Criterion Consider the linear system ẋ = Ax + Bu where x R n : state vector and u R m : input vector. A :

More information

Code Busters Division C

Code Busters Division C Code Busters 2018 2019 Division C Names: School: Team Number: DO NOT BEGIN UNTIL YOU ARE INSTRUCTED TO DO SO. This test contains 16 questions. You will have 50 minutes to complete this test. The first

More information

arxiv: v1 [math.ra] 15 Jul 2013

arxiv: v1 [math.ra] 15 Jul 2013 Additive Property of Drazin Invertibility of Elements Long Wang, Huihui Zhu, Xia Zhu, Jianlong Chen arxiv:1307.3816v1 [math.ra] 15 Jul 2013 Department of Mathematics, Southeast University, Nanjing 210096,

More information

Homework 4 Solutions. 2. Find context-free grammars for the language L = {a n b m c k : k n + m}. (with n 0,

Homework 4 Solutions. 2. Find context-free grammars for the language L = {a n b m c k : k n + m}. (with n 0, Introduction to Formal Language, Fall 2016 Due: 21-Apr-2016 (Thursday) Instructor: Prof. Wen-Guey Tzeng Homework 4 Solutions Scribe: Yi-Ruei Chen 1. Find context-free grammars for the language L = {a n

More information

LECTURES ON TOPOLOGY OF WORDS

LECTURES ON TOPOLOGY OF WORDS LECTURES ON TOPOLOGY OF WORDS VLADIMIR TURAEV Based on notes by Eri Hatakenaka, Daniel Moskovich, and Tadayuki Watanabe Abstract. We discuss a topological approach to words introduced by the author in

More information

NEW NUMERICAL INTEGRATORS BASED ON SOLVABILITY AND SPLITTING Fernando Casas Universitat Jaume I, Castellón, Spain Fernando.Casas@uji.es (on sabbatical leave at DAMTP, University of Cambridge) Edinburgh,

More information

AN IDENTITY IN JORDAN RINGS

AN IDENTITY IN JORDAN RINGS AN IDENTITY IN JORDAN RINGS MARSHALL HALL, JR. 1. Introduction. An abstract Jordan ring / is a distributive ring in which multiplication satisfies the two laws (1.1) ba = ab, (1.2) ia2b)a = a2iba). We

More information

Stabilization of Control-Affine Systems by Local Approximations of Trajectories

Stabilization of Control-Affine Systems by Local Approximations of Trajectories Stabilization of Control-Affine Systems by Local Approximations of Trajectories Raik Suttner arxiv:1805.05991v2 [math.ds] 9 Jun 2018 We study convergence and stability properties of control-affine systems.

More information

Hamiltonian Systems of Negative Curvature are Hyperbolic

Hamiltonian Systems of Negative Curvature are Hyperbolic Hamiltonian Systems of Negative Curvature are Hyperbolic A. A. Agrachev N. N. Chtcherbakova Abstract The curvature and the reduced curvature are basic differential invariants of the pair: Hamiltonian system,

More information

FABER Formal Languages, Automata. Lecture 2. Mälardalen University

FABER Formal Languages, Automata. Lecture 2. Mälardalen University CD5560 FABER Formal Languages, Automata and Models of Computation Lecture 2 Mälardalen University 2010 1 Content Languages, g Alphabets and Strings Strings & String Operations Languages & Language Operations

More information

4200:225 Equilibrium Thermodynamics

4200:225 Equilibrium Thermodynamics 4:5 Equilibrium Thermodynamics Unit I. Earth, Air, Fire, and Water Chapter 3. The Entropy Balance By J.R. Elliott, Jr. Unit I. Energy and Entropy Chapter 3. The Entropy Balance Introduction to Entropy

More information

Geometric Homogeneity and Configuration Controllability of Nonlinear Systems

Geometric Homogeneity and Configuration Controllability of Nonlinear Systems Geometric Homogeneity and Configuration Controllability of Nonlinear Systems Patricio A. Vela and Joel W. Burdick July 18, 2004 Abstract This paper exploits notions of geometric homogeneity to show that

More information

Lie algebraic quantum control mechanism analysis

Lie algebraic quantum control mechanism analysis Lie algebraic quantum control mechanism analysis June 4, 2 Existing methods for quantum control mechanism identification do not exploit analytic features of control systems to delineate mechanism (or,

More information

Exponential integrators

Exponential integrators Exponential integrators Marlis Hochbruck Heinrich-Heine University Düsseldorf, Germany Alexander Ostermann University Innsbruck, Austria Helsinki, May 25 p.1 Outline Time dependent Schrödinger equations

More information

Math 280 Modern Algebra Assignment 3 Solutions

Math 280 Modern Algebra Assignment 3 Solutions Math 280 Modern Algebra Assignment 3 s 1. Below is a list of binary operations on a given set. Decide if each operation is closed, associative, or commutative. Justify your answers in each case; if an

More information

Some results on the reverse order law in rings with involution

Some results on the reverse order law in rings with involution Some results on the reverse order law in rings with involution Dijana Mosić and Dragan S. Djordjević Abstract We investigate some necessary and sufficient conditions for the hybrid reverse order law (ab)

More information

UNIVERSITY OF DUBLIN

UNIVERSITY OF DUBLIN UNIVERSITY OF DUBLIN TRINITY COLLEGE JS & SS Mathematics SS Theoretical Physics SS TSM Mathematics Faculty of Engineering, Mathematics and Science school of mathematics Trinity Term 2015 Module MA3429

More information

Lecture 4: Numerical solution of ordinary differential equations

Lecture 4: Numerical solution of ordinary differential equations Lecture 4: Numerical solution of ordinary differential equations Department of Mathematics, ETH Zürich General explicit one-step method: Consistency; Stability; Convergence. High-order methods: Taylor

More information

EXERCISES IN POISSON GEOMETRY

EXERCISES IN POISSON GEOMETRY EXERCISES IN POISSON GEOMETRY The suggested problems for the exercise sessions #1 and #2 are marked with an asterisk. The material from the last section will be discussed in lecture IV, but it s possible

More information

RIEMANNIAN GEOMETRY COMPACT METRIC SPACES. Jean BELLISSARD 1. Collaboration:

RIEMANNIAN GEOMETRY COMPACT METRIC SPACES. Jean BELLISSARD 1. Collaboration: RIEMANNIAN GEOMETRY of COMPACT METRIC SPACES Jean BELLISSARD 1 Georgia Institute of Technology, Atlanta School of Mathematics & School of Physics Collaboration: I. PALMER (Georgia Tech, Atlanta) 1 e-mail:

More information

From Dirac operator to supermanifolds and supersymmetries PAI DYGEST Meeting

From Dirac operator to supermanifolds and supersymmetries PAI DYGEST Meeting From Dirac operator to supermanifolds and supersymmetries PAI DYGEST Meeting Jean-Philippe Michel Département de Mathématiques, Université de Liège First aim Spinor dierential operators symplectic supermanifold

More information

BACKGROUND IN SYMPLECTIC GEOMETRY

BACKGROUND IN SYMPLECTIC GEOMETRY BACKGROUND IN SYMPLECTIC GEOMETRY NILAY KUMAR Today I want to introduce some of the symplectic structure underlying classical mechanics. The key idea is actually quite old and in its various formulations

More information

Entrance Exam, Differential Equations April, (Solve exactly 6 out of the 8 problems) y + 2y + y cos(x 2 y) = 0, y(0) = 2, y (0) = 4.

Entrance Exam, Differential Equations April, (Solve exactly 6 out of the 8 problems) y + 2y + y cos(x 2 y) = 0, y(0) = 2, y (0) = 4. Entrance Exam, Differential Equations April, 7 (Solve exactly 6 out of the 8 problems). Consider the following initial value problem: { y + y + y cos(x y) =, y() = y. Find all the values y such that the

More information

Chapter 3. Riemannian Manifolds - I. The subject of this thesis is to extend the combinatorial curve reconstruction approach to curves

Chapter 3. Riemannian Manifolds - I. The subject of this thesis is to extend the combinatorial curve reconstruction approach to curves Chapter 3 Riemannian Manifolds - I The subject of this thesis is to extend the combinatorial curve reconstruction approach to curves embedded in Riemannian manifolds. A Riemannian manifold is an abstraction

More information

GEOMETRIC QUANTIZATION

GEOMETRIC QUANTIZATION GEOMETRIC QUANTIZATION 1. The basic idea The setting of the Hamiltonian version of classical (Newtonian) mechanics is the phase space (position and momentum), which is a symplectic manifold. The typical

More information

DENSITY OF CRITICAL FACTORIZATIONS

DENSITY OF CRITICAL FACTORIZATIONS DENSITY OF CRITICAL FACTORIZATIONS TERO HARJU AND DIRK NOWOTKA Abstract. We investigate the density of critical factorizations of infinte sequences of words. The density of critical factorizations of a

More information

Complexité palindromique des codages de rotations et conjectures

Complexité palindromique des codages de rotations et conjectures Complexité palindromique des codages de rotations et conjectures Sébastien Labbé Laboratoire d Informatique, de Robotique et de Microélectronique de Montpellier Université Montpellier 2 Laboratoire de

More information

Automata, Computability and Complexity with Applications Exercises in the Book Solutions Elaine Rich

Automata, Computability and Complexity with Applications Exercises in the Book Solutions Elaine Rich Automata, Computability and Complexity with Applications Exercises in the Book Solutions Elaine Rich Part I: Introduction 1 Why Study Automata Theory? 2 Languages and Strings 1) Consider the language L

More information

NONCONSTRUCTIBLE BLOCKS IN 1D CELLULAR AUTOMATA: MINIMAL GENERATORS AND NATURAL SYSTEMS. Andrew Adamatzky* and Andrew Wuensche**

NONCONSTRUCTIBLE BLOCKS IN 1D CELLULAR AUTOMATA: MINIMAL GENERATORS AND NATURAL SYSTEMS. Andrew Adamatzky* and Andrew Wuensche** NONCONSTRUCTIBLE BLOCKS IN 1D CELLULAR AUTOMATA: MINIMAL GENERATORS AND NATURAL SYSTEMS Andrew Adamatzky* and Andrew Wuensche** * IAS Lab, University of the West of England, Coldharbour Lane, Bristol BS16

More information

Invariant Nonholonomic Riemannian Structures on Three-Dimensional Lie Groups

Invariant Nonholonomic Riemannian Structures on Three-Dimensional Lie Groups Invariant Nonholonomic Riemannian Structures on Three-Dimensional Lie Groups Dennis I. Barrett Geometry, Graphs and Control (GGC) Research Group Department of Mathematics, Rhodes University Grahamstown,

More information

From symplectic to spin geometry

From symplectic to spin geometry From symplectic to spin geometry Jean-Philippe Michel University of Luxembourg Jean-Philippe MICHEL (UL) NCTS-CPT Workshop Hsinshu, 24-02-2011 1 / 16 Quantization for spinless system classical quantum

More information

The Geometry of Euler s equation. Introduction

The Geometry of Euler s equation. Introduction The Geometry of Euler s equation Introduction Part 1 Mechanical systems with constraints, symmetries flexible joint fixed length In principle can be dealt with by applying F=ma, but this can become complicated

More information

Linear ODEs. Existence of solutions to linear IVPs. Resolvent matrix. Autonomous linear systems

Linear ODEs. Existence of solutions to linear IVPs. Resolvent matrix. Autonomous linear systems Linear ODEs p. 1 Linear ODEs Existence of solutions to linear IVPs Resolvent matrix Autonomous linear systems Linear ODEs Definition (Linear ODE) A linear ODE is a differential equation taking the form

More information

Liouville integrability of Hamiltonian systems and spacetime symmetry

Liouville integrability of Hamiltonian systems and spacetime symmetry Seminar, Kobe U., April 22, 2015 Liouville integrability of Hamiltonian systems and spacetime symmetry Tsuyoshi Houri with D. Kubiznak (Perimeter Inst.), C. Warnick (Warwick U.) Y. Yasui (OCU Setsunan

More information

download instant at Assume that (w R ) R = w for all strings w Σ of length n or less.

download instant at  Assume that (w R ) R = w for all strings w Σ of length n or less. Chapter 2 Languages 3. We prove, by induction on the length of the string, that w = (w R ) R for every string w Σ. Basis: The basis consists of the null string. In this case, (λ R ) R = (λ) R = λ as desired.

More information

and the seeds of quantisation

and the seeds of quantisation noncommutative spectral geometry algebra doubling and the seeds of quantisation m.s.,.,, stabile, vitiello, PRD 84 (2011) 045026 mairi sakellariadou king s college london noncommutative spectral geometry

More information

Diffraction by Edges. András Vasy (with Richard Melrose and Jared Wunsch)

Diffraction by Edges. András Vasy (with Richard Melrose and Jared Wunsch) Diffraction by Edges András Vasy (with Richard Melrose and Jared Wunsch) Cambridge, July 2006 Consider the wave equation Pu = 0, Pu = D 2 t u gu, on manifolds with corners M; here g 0 the Laplacian, D

More information

R-flux string sigma model and algebroid duality on Lie 3-algebroids

R-flux string sigma model and algebroid duality on Lie 3-algebroids R-flux string sigma model and algebroid duality on Lie 3-algebroids Marc Andre Heller Tohoku University Based on joint work with Taiki Bessho (Tohoku University), Noriaki Ikeda (Ritsumeikan University)

More information

Geometrical mechanics on algebroids

Geometrical mechanics on algebroids Geometrical mechanics on algebroids Katarzyna Grabowska, Janusz Grabowski, Paweł Urbański Mathematical Institute, Polish Academy of Sciences Department of Mathematical Methods in Physics, University of

More information

Combinatorial Algebra in Controllability and Optimal Control

Combinatorial Algebra in Controllability and Optimal Control Combinatorial Algebra in Controllability and Optimal Control Matthias Kawski Abstract Control theory models, analyzes, and designs purposeful interactions with dynamical systems so that these behave in

More information

Impulsive Control of Lagrangian Systems and Locomotion in Fluids. Alberto Bressan

Impulsive Control of Lagrangian Systems and Locomotion in Fluids. Alberto Bressan Manuscript submitted to AIMS journals Volume X, Number X, XX 2X Website http://aimsciences.org pp. X XX Impulsive Control of Lagrangian Systems and Locomotion in Fluids Alberto Bressan Department of Mathematics

More information

B-FIELDS, GERBES AND GENERALIZED GEOMETRY

B-FIELDS, GERBES AND GENERALIZED GEOMETRY B-FIELDS, GERBES AND GENERALIZED GEOMETRY Nigel Hitchin (Oxford) Durham Symposium July 29th 2005 1 PART 1 (i) BACKGROUND (ii) GERBES (iii) GENERALIZED COMPLEX STRUCTURES (iv) GENERALIZED KÄHLER STRUCTURES

More information

Higher dimensional Kerr-Schild spacetimes 1

Higher dimensional Kerr-Schild spacetimes 1 Higher dimensional Kerr-Schild spacetimes 1 Marcello Ortaggio Institute of Mathematics Academy of Sciences of the Czech Republic Bremen August 2008 1 Joint work with V. Pravda and A. Pravdová, arxiv:0808.2165

More information

Riemannian and Sub-Riemannian Geodesic Flows

Riemannian and Sub-Riemannian Geodesic Flows Riemannian and Sub-Riemannian Geodesic Flows Mauricio Godoy Molina 1 Joint with E. Grong Universidad de La Frontera (Temuco, Chile) Potsdam, February 2017 1 Partially funded by grant Anillo ACT 1415 PIA

More information

Splitting methods (with processing) for near-integrable problems

Splitting methods (with processing) for near-integrable problems Splitting methods (with processing) for near-integrable problems Fernando Casas casas@mat.uji.es www.gicas.uji.es Departament de Matemàtiques Institut de Matemàtiques i Aplicacions de Castelló (IMAC) Universitat

More information

From the Heisenberg group to Carnot groups

From the Heisenberg group to Carnot groups From the Heisenberg group to Carnot groups p. 1/47 From the Heisenberg group to Carnot groups Irina Markina, University of Bergen, Norway Summer school Analysis - with Applications to Mathematical Physics

More information

DIFFERENTIAL GEOMETRY. LECTURE 12-13,

DIFFERENTIAL GEOMETRY. LECTURE 12-13, DIFFERENTIAL GEOMETRY. LECTURE 12-13, 3.07.08 5. Riemannian metrics. Examples. Connections 5.1. Length of a curve. Let γ : [a, b] R n be a parametried curve. Its length can be calculated as the limit of

More information

ON THE NUMERICAL INTEGRATION OF ORDINARY DIFFERENTIAL EQUATIONS BY SYMMETRIC COMPOSITION METHODS. Robert I. McLachlan

ON THE NUMERICAL INTEGRATION OF ORDINARY DIFFERENTIAL EQUATIONS BY SYMMETRIC COMPOSITION METHODS. Robert I. McLachlan ON THE NUMERICAL INTEGRATION OF ORDINARY DIFFERENTIAL EQUATIONS BY SYMMETRIC COMPOSITION METHODS Robert I. McLachlan Abstract. Differential equations of the form ẋ = X = A + B are considered, where the

More information

Automata Theory Final Exam Solution 08:10-10:00 am Friday, June 13, 2008

Automata Theory Final Exam Solution 08:10-10:00 am Friday, June 13, 2008 Automata Theory Final Exam Solution 08:10-10:00 am Friday, June 13, 2008 Name: ID #: This is a Close Book examination. Only an A4 cheating sheet belonging to you is acceptable. You can write your answers

More information

Properties of the boundary rg flow

Properties of the boundary rg flow Properties of the boundary rg flow Daniel Friedan Department of Physics & Astronomy Rutgers the State University of New Jersey, USA Natural Science Institute University of Iceland 82ème rencontre entre

More information

Varieties of Signature Tensors Lecture #1

Varieties of Signature Tensors Lecture #1 Lecture #1 Carlos Enrique Améndola Cerón (TU Munich) Summer School in Algebraic Statistics Tromsø, September 218 Setup: Signatures Let X : [, 1] R d be a piecewise differentiable path. Coordinate functions:

More information

Euclidean path integral formalism: from quantum mechanics to quantum field theory

Euclidean path integral formalism: from quantum mechanics to quantum field theory : from quantum mechanics to quantum field theory Dr. Philippe de Forcrand Tutor: Dr. Marco Panero ETH Zürich 30th March, 2009 Introduction Real time Euclidean time Vacuum s expectation values Euclidean

More information

About Integrable Non-Abelian Laurent ODEs

About Integrable Non-Abelian Laurent ODEs About Integrable Non-Abelian Laurent ODEs T. Wolf, Brock University September 12, 2013 Outline Non-commutative ODEs First Integrals and Lax Pairs Symmetries Pre-Hamiltonian Operators Recursion Operators

More information

Some topics in sub-riemannian geometry

Some topics in sub-riemannian geometry Some topics in sub-riemannian geometry Luca Rizzi CNRS, Institut Fourier Mathematical Colloquium Universität Bern - December 19 2016 Sub-Riemannian geometry Known under many names: Carnot-Carathéodory

More information

Linear maps. Matthew Macauley. Department of Mathematical Sciences Clemson University Math 8530, Spring 2017

Linear maps. Matthew Macauley. Department of Mathematical Sciences Clemson University  Math 8530, Spring 2017 Linear maps Matthew Macauley Department of Mathematical Sciences Clemson University http://www.math.clemson.edu/~macaule/ Math 8530, Spring 2017 M. Macauley (Clemson) Linear maps Math 8530, Spring 2017

More information

Crochemore factorization of Sturmian and other infinite words

Crochemore factorization of Sturmian and other infinite words WoWA,7june2006 1 Crochemore factorization of Sturmian and other infinite words Jean Berstel and Alessandra Savelli Institut Gaspard Monge Université de Marne la Vallée and CNRS(UMR 8049) Workshop on Words

More information

[#1] R 3 bracket for the spherical pendulum

[#1] R 3 bracket for the spherical pendulum .. Holm Tuesday 11 January 2011 Solutions to MSc Enhanced Coursework for MA16 1 M3/4A16 MSc Enhanced Coursework arryl Holm Solutions Tuesday 11 January 2011 [#1] R 3 bracket for the spherical pendulum

More information

CS6902 Theory of Computation and Algorithms

CS6902 Theory of Computation and Algorithms CS6902 Theory of Computation and Algorithms Any mechanically (automatically) discretely computation of problem solving contains at least three components: - problem description - computational tool - procedure/analysis

More information

arxiv: v1 [math.ra] 27 Jul 2013

arxiv: v1 [math.ra] 27 Jul 2013 Additive and product properties of Drazin inverses of elements in a ring arxiv:1307.7229v1 [math.ra] 27 Jul 2013 Huihui Zhu, Jianlong Chen Abstract: We study the Drazin inverses of the sum and product

More information

Donoghue, Golowich, Holstein Chapter 4, 6

Donoghue, Golowich, Holstein Chapter 4, 6 1 Week 7: Non linear sigma models and pion lagrangians Reading material from the books Burgess-Moore, Chapter 9.3 Donoghue, Golowich, Holstein Chapter 4, 6 Weinberg, Chap. 19 1 Goldstone boson lagrangians

More information

Converse Lyapunov theorem and Input-to-State Stability

Converse Lyapunov theorem and Input-to-State Stability Converse Lyapunov theorem and Input-to-State Stability April 6, 2014 1 Converse Lyapunov theorem In the previous lecture, we have discussed few examples of nonlinear control systems and stability concepts

More information

Lecture Notes of EE 714

Lecture Notes of EE 714 Lecture Notes of EE 714 Lecture 1 Motivation Systems theory that we have studied so far deals with the notion of specified input and output spaces. But there are systems which do not have a clear demarcation

More information

ON THE LEAST NUMBER OF PALINDROMES IN AN INFINITE WORD

ON THE LEAST NUMBER OF PALINDROMES IN AN INFINITE WORD ON THE LEAST NUMBER OF PALINDROMES IN AN INFINITE WORD GABRIELE FICI AND LUCA Q. ZAMBONI ABSTRACT. We investigate the least number of palindromic factors in an infinite word. We first consider general

More information

LECTURE 1: LINEAR SYMPLECTIC GEOMETRY

LECTURE 1: LINEAR SYMPLECTIC GEOMETRY LECTURE 1: LINEAR SYMPLECTIC GEOMETRY Contents 1. Linear symplectic structure 3 2. Distinguished subspaces 5 3. Linear complex structure 7 4. The symplectic group 10 *********************************************************************************

More information