Formal solution Chen-Fliess series

Size: px
Start display at page:

Download "Formal solution Chen-Fliess series"

Transcription

1 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 Z T t1 tp 1 u ap (t p )... u a 1 (t 1 ) dt 1... dt p } {{ } Υ w (T,u) Use as asymptotic expansion for evolution of output y = ϕ(x) along solution of ẋ = a Z ua f a (x). ϕ(x(t, u)) w Z T t1 tp 1 a 1... a p }{{} =w u ap (t p )...u a 1 (t 1 ) dt 1... dt p (f a1... a ip ϕ)

2 Series solution by iteration φ(x(t, u)) = 1 φ(x ) + t ua (s)ds (f a φ)(x ) + t ub (s)ds (f b φ)(x ) t t t t t ua (s 1 )u a (s 2 )ds 2 ds 1 (f a f a φ)(x ) ua (s 1 )u b (s 2 )ds 2 ds 1 (f a f b φ)(x ) ub (s 1 )u a (s 2 )ds 2 ds 1 (f b f a φ)(x ) ub (s 1 )u b (s 2 )ds 2 ds 1 (f b f b φ)(x ) s2 ua (s 1 )u a (s 2 )u a (s 3 )ds 3 ds 2 ds 1 (f a f a f a φ)(x ) +... Objective: Collect first order differential operators, and minimize number of higher order differential operators involved

3 Integrate by parts: The wrong way to do it t ua (s 1 )u b (s 2 )ds 2 ds 1 f a f b + t ub (s 1 )u a (s 2 )ds 2 ds 1 f b f a = = t ua (s 1 )u b (s 2 )ds 2 ds 1 f a f b t ua (s 1 )u b (s 2 )ds 2 ds 1 f b f a + t ua (s 1 )u b (s 2 )ds 2 ds 1 f b f a + t ub (s 1 )u a (s 2 )ds 2 ds 1 f b f a

4 Integrate by parts: The wrong way to do it t ua (s 1 )u b (s 2 )ds 2 ds 1 f a f b + t ub (s 1 )u a (s 2 )ds 2 ds 1 f b f a = = t ua (s 1 )u b (s 2 )ds 2 ds 1 f a f b t ua (s 1 )u b (s 2 )ds 2 ds 1 f b f a + t ua (s 1 )u b (s 2 )ds 2 ds 1 f b f a + t ub (s 1 )u a (s 2 )ds 2 ds 1 f b f a

5 Integrate by parts: The wrong way to do it t ua (s 1 )u b (s 2 )ds 2 ds 1 f a f b + t ub (s 1 )u a (s 2 )ds 2 ds 1 f b f a = = t ua (s 1 )u b (s 2 )ds 2 ds 1 f a f b t ua (s 1 )u b (s 2 )ds 2 ds 1 f b f a + t ua (s 1 )u b (s 2 )ds 2 ds 1 f b f a + t ub (s 1 )u a (s 2 )ds 2 ds 1 f b f a = t + t ua (s 1 )u b (s 2 )ds 2 ds 1 (f a f b f b f a ) ( u a (s 1 ) s 1 ub (s 2 ) + u b (s 1 ) ) s 1 ua (s 2 )ds 2 ds 1 f b f a

6 Integrate by parts: The wrong way to do it t ua (s 1 )u b (s 2 )ds 2 ds 1 f a f b + t ub (s 1 )u a (s 2 )ds 2 ds 1 f b f a = = t ua (s 1 )u b (s 2 )ds 2 ds 1 f a f b t ua (s 1 )u b (s 2 )ds 2 ds 1 f b f a + t ua (s 1 )u b (s 2 )ds 2 ds 1 f b f a + t ub (s 1 )u a (s 2 )ds 2 ds 1 f b f a = t + t ua (s 1 )u b (s 2 )ds 2 ds 1 (f a f b f b f a ) ( u a (s 1 ) s 1 ub (s 2 ) + u b (s 1 ) ) s 1 ua (s 2 )ds 2 ds 1 f b f a = t ua (s 1 )u b (s 2 )ds 2 ds 1 (f a f b f b f a ) ( ) ( ) t t + ua (s) ds ub (s) ds f b f a

7 Integrate by parts: The wrong way to do it t ua (s 1 )u b (s 2 )ds 2 ds 1 f a f b + t ub (s 1 )u a (s 2 )ds 2 ds 1 f b f a = = t ua (s 1 )u b (s 2 )ds 2 ds 1 f a f b t ua (s 1 )u b (s 2 )ds 2 ds 1 f b f a + t ua (s 1 )u b (s 2 )ds 2 ds 1 f b f a + t ub (s 1 )u a (s 2 )ds 2 ds 1 f b f a = t + t ua (s 1 )u b (s 2 )ds 2 ds 1 (f a f b f b f a ) ( u a (s 1 ) s 1 ub (s 2 ) + u b (s 1 ) ) s 1 ua (s 2 )ds 2 ds 1 f b f a = t ua (s 1 )u b (s 2 )ds 2 ds 1 (f a f b f b f a ) ( ) ( ) t t + ua (s) ds ub (s) ds f b f a Lie brackets together w/ iterated integrals in right order higher order deriv s (wrong order) w/ pointwise prod s of int s

8 Integrate by parts, smart way Do not manipulate iterated integrals and iterated Lie brackets of vector fields by hand work on level of words (their indices) I {a,b} I I = a a + b b aa aa ab ab ba ba bb bb aaa aaa +... = a a + b b aa aa ab (ab ba) (ab + ba) ba bb bb aaa aaa +...

9 Drop everything except the indices - maps The iterated integral Υ a 1a 2...a n = t t1 tn 1 u a 1 (t 1 )u a 2 (t 2 ) u an (t n ) dt n dt n 1 dt 1 is uniquely identified by the multi-index ( word ) a 1 a 2... a n The n-th order partial differential operator f an f an 1... f a1 is uniquely identified by the multi-index ( word ) a 1 a 2... a n The Chen series is identified with the identity map on free associative algebra A(Z ) over set Z of with Z = m CF Id A(Z ) = w w Â(Z ) A(Z ) n w Z n with shuffle product on left and concatenation on right

10 Homomorphisms I For fixed smooth vector fields f i F : A(Z ) partial diff operators on C (M) F : (a 1 a 2... a n ) f a1 f a2... f an associative algebras: concatenation composition For fixed control u U Z Υ(u): A(Z ) AC([, T ], R) Υ(u): (a 1 a 2... a n ) T t1 tp 1 u ap (t p )... u a1 (t 1 ) dt 1... dt p associative algebras (Ree s theorem): shuffle of words pointwise multiplication of functions

11 Recall: definition of the shuffle Combinatorially: for words w, z Z and letters a, b Z ( w a ) X ( z b ) = (( w a ) X z ) b + ( w X ( z b )) a Example: (ab) X (cd) = a b c d + a c b d + c a b d + a c d b + c a d b + c d a b Algebraically: transpose of the coproduct where < v X w, z > = < v w, (z) > SKIP : A(Z ) A(Z ) A(Z ) by (a) = 1 a+a 1 for a Z

12 Shuffles and simplices SKIP On permutations algebras Duchamp and Agrachev consider partially commutative and noncommutative shuffles. Illustration: σ 12 σ 2 σ 1 x 2 = σ 21 σ 1 = σ (12) x 3 = σ 312 σ 132 E.g. σ (12) x 3 = {t : t 1 t 2 1, t 3 1} For multiplicative integrands f (x, y, z) = f 1 (x) f 2 (y) f 3 (z) ( 1 y ( )dx dy ) 1 ( )dz = 1 y x ( ) dz dx dy+ 1 y z ( ) dx dz dy+ 1 z y ( ) dx dy dz

13 Homomorphisms II Restriction is Lie algebra homomorphism F : L(Z ) A(Z ) Γ (M) (vector fields) Do not fix controls: iterated integral functionals Υ: A(Z ) IIF(U Z ) ( Υ: (a 1 a 2... a n ) u T t1 tp 1 associative algebras: shuffle of words pointwise multiplication of iterated integral functionals u ap (t p )... u a 1 (t 1 ) dt 1... dt Much better: Theorem: If U = L 1 ([, T ], [ 1, 1]) then Υ: (A(Z ), ) IIF(U Z ) is a Zinbiel algebra isomorphism.

14 Zinbiel: The product & algebra of iterated integrals Abstractly, right Zinbiel identity U (V W ) = (U V ) W + (V U) W Concrete examples in control: polynomials X n X m = m n+m X n+m and X n X m = 1 n X n+m AC([, )): and iterated integrals functionals (U V )(t) = t U(s) V (s) ds (U V )(t) = t U(s)ds V (t) subsets, e.g. exponentials e imt e int = m n+m ei(m+n)t and e imt e int = 1 m ei(m+n)t

15 Abstract solution of DE by iteration Rewrite universal control system Ṡ = S Φ, S() = 1 with Φ = m as integral equation using right Zinbiel product S = 1 + S Φ and iterate to obtain Chen Fliess series i=1 u i X i or Φ = a Z a a SKIP S = 1 + (1 + S Φ) Φ = 1 + Φ + ((1 + S Φ) Φ) Φ = 1 + Φ + (Φ Φ) + (((1 + S Φ) Φ) Φ) Φ = 1 + Φ + (Φ Φ) + ((Φ Φ) Φ) + ((((1 + S Φ) Φ) Φ) Φ) Φ. = 1 + Φ + (Φ Φ) + ((Φ Φ) Φ) + (((Φ Φ) Φ) Φ)...

16 Rewriting the Chen series Recall: Chen series is an exponential Lie series ( ) w w = exp ζ b b = exp(ξ b b) w Z b B b B where B is ordered basis of free Lie algebra L(Z ) A(Z ) Coord s of 2 nd kind (classic) Coord s of the 1 st kind (new) ξ HK = ξ H ξ K ζ = π 1 ξ Use in control / geometric integration: explicit formula for iterated integral functionals Υ ζ b and Υ ξ b.

17 Hall words Hall words (in narrow sense as in Bourbaki) a Z a H w, z H, u < v u < v If a Z, then (ua) H u < a and u < (ua) (u, (vw)) H u, (vw) H and v u < (vw), u < (u(vw)) ((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

18 Iterated integral functionals ξ H (coord. s of 2 nd kind Presented as normal form for free nilpotent system Normal from for a free nilpotent system (of rank r = 5) using a typical Hall set on the alphabet Z = {a, b} ξ a = u a ξ b = u b ξ ab = ξ a ξ b = ξ a u b ξ aab = ξ a ξ ab = ξa 2 u b using ψ b (aab) = (a(ab)) ξ bab = ξ b ξ ab = ξ b ξ a u b using ψ b (bab) = (b(ab)) ξ aaab = ξ a ξ aab = ξa 3 u b using ψ b (aaab) = (a(a(ab))) ξ baab = ξ b ξ aab = ξ b ξa 2 u b using ψ b (baab) = (b(a(ab))) ξ bbab = ξ b ξ bab = ξb 2ξ a u b using ψ b (bbab) = (b(b(ab))) ξ aaaab = ξ a ξ aaab = ξa 4 u b using ψ b (aaaab) = (a(a(a(ab)))) ξ baaab = ξ b ξ aaab = ξ b ξa 3 u b using ψ b (baaab) = (b(a(a(ab)))) ξ bbaab = ξ b ξ baab = ξb 2ξ2 a u b using ψ b (bbaab) = (b(b(a(ab)))) ξ abaab = ξ ab ξ aab = ξ ab ξa 3 u b using ψ b (abaab) = ((ab)(a(ab))) ξ abbab = ξ ab ξ bab = ξ ab ξb 2ξ a u b using ψ b (abbab) = ((ab)(b(ab))) Analyze orbits of all nilpotent systems under feedback group

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

Using bases to simplify asymptotic expansions

Using bases to simplify asymptotic expansions 1 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

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

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

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

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

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

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

Some practice problems for midterm 2

Some practice problems for midterm 2 Some practice problems for midterm 2 Kiumars Kaveh November 14, 2011 Problem: Let Z = {a G ax = xa, x G} be the center of a group G. Prove that Z is a normal subgroup of G. Solution: First we prove Z is

More information

Linear Classifiers (Kernels)

Linear Classifiers (Kernels) Universität Potsdam Institut für Informatik Lehrstuhl Linear Classifiers (Kernels) Blaine Nelson, Christoph Sawade, Tobias Scheffer Exam Dates & Course Conclusion There are 2 Exam dates: Feb 20 th March

More information

The Hopf algebraic structure of stochastic expansions and efficient simulation

The Hopf algebraic structure of stochastic expansions and efficient simulation The Hopf algebraic structure of stochastic expansions and efficient simulation Kurusch Ebrahimi Fard, Alexander Lundervold, Simon J.A. Malham, Hans Munthe Kaas and Anke Wiese York: 15th October 2012 KEF,

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

Transcendental Numbers and Hopf Algebras

Transcendental Numbers and Hopf Algebras Transcendental Numbers and Hopf Algebras Michel Waldschmidt Deutsch-Französischer Diskurs, Saarland University, July 4, 2003 1 Algebraic groups (commutative, linear, over Q) Exponential polynomials Transcendence

More information

WORD SERIES FOR THE ANALYSIS OF SPLITTING SDE INTEGRATORS. Alfonso Álamo/J. M. Sanz-Serna Universidad de Valladolid/Universidad Carlos III de Madrid

WORD SERIES FOR THE ANALYSIS OF SPLITTING SDE INTEGRATORS. Alfonso Álamo/J. M. Sanz-Serna Universidad de Valladolid/Universidad Carlos III de Madrid WORD SERIES FOR THE ANALYSIS OF SPLITTING SDE INTEGRATORS Alfonso Álamo/J. M. Sanz-Serna Universidad de Valladolid/Universidad Carlos III de Madrid 1 I. OVERVIEW 2 The importance of splitting integrators

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

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

HW 3 Solutions. Tommy November 27, 2012

HW 3 Solutions. Tommy November 27, 2012 HW 3 Solutions Tommy November 27, 2012 5.1.1 (a) Online solution: S 0S1 ɛ. (b) Similar to online solution: S AY XC A aa ɛ b ɛ C cc ɛ X axb aa b Y by c b cc (c) S X A A A V AV a V V b V a b X V V X V (d)

More information

Differential Equations and Associators for Periods

Differential Equations and Associators for Periods Differential Equations and Associators for Periods Stephan Stieberger, MPP München Workshop on Geometry and Physics in memoriam of Ioannis Bakas November 2-25, 26 Schloß Ringberg, Tegernsee based on: St.St.,

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

Theoretical Computer Science

Theoretical Computer Science Theoretical Computer Science Zdeněk Sawa Department of Computer Science, FEI, Technical University of Ostrava 17. listopadu 15, Ostrava-Poruba 708 33 Czech republic September 22, 2017 Z. Sawa (TU Ostrava)

More information

Spring 2018 CIS 610. Advanced Geometric Methods in Computer Science Jean Gallier Homework 3

Spring 2018 CIS 610. Advanced Geometric Methods in Computer Science Jean Gallier Homework 3 Spring 2018 CIS 610 Advanced Geometric Methods in Computer Science Jean Gallier Homework 3 March 20; Due April 5, 2018 Problem B1 (80). This problem is from Knapp, Lie Groups Beyond an Introduction, Introduction,

More information

AN EXACT SEQUENCE FOR THE BROADHURST-KREIMER CONJECTURE

AN EXACT SEQUENCE FOR THE BROADHURST-KREIMER CONJECTURE AN EXACT SEQUENCE FOR THE BROADHURST-KREIMER CONJECTURE FRANCIS BROWN Don Zagier asked me whether the Broadhurst-Kreimer conjecture could be reformulated as a short exact sequence of spaces of polynomials

More information

A polynomial realization of the Hopf algebra of uniform block permutations.

A polynomial realization of the Hopf algebra of uniform block permutations. FPSAC 202, Nagoya, Japan DMTCS proc AR, 202, 93 204 A polynomial realization of the Hopf algebra of uniform block permutations Rémi Maurice Institut Gaspard Monge, Université Paris-Est Marne-la-Vallée,

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

THEODORE VORONOV DIFFERENTIABLE MANIFOLDS. Fall Last updated: November 26, (Under construction.)

THEODORE VORONOV DIFFERENTIABLE MANIFOLDS. Fall Last updated: November 26, (Under construction.) 4 Vector fields Last updated: November 26, 2009. (Under construction.) 4.1 Tangent vectors as derivations After we have introduced topological notions, we can come back to analysis on manifolds. Let M

More information

Symmetric Spaces Toolkit

Symmetric Spaces Toolkit Symmetric Spaces Toolkit SFB/TR12 Langeoog, Nov. 1st 7th 2007 H. Sebert, S. Mandt Contents 1 Lie Groups and Lie Algebras 2 1.1 Matrix Lie Groups........................ 2 1.2 Lie Group Homomorphisms...................

More information

Solutions of Assignment 10 Basic Algebra I

Solutions of Assignment 10 Basic Algebra I Solutions of Assignment 10 Basic Algebra I November 25, 2004 Solution of the problem 1. Let a = m, bab 1 = n. Since (bab 1 ) m = (bab 1 )(bab 1 ) (bab 1 ) = ba m b 1 = b1b 1 = 1, we have n m. Conversely,

More information

D-MATH Alessio Savini. Exercise Sheet 4

D-MATH Alessio Savini. Exercise Sheet 4 ETH Zürich Exercise Sheet 4 Exercise 1 Let G, H be two Lie groups and let ϕ : G H be a smooth homomorphism. Show that ϕ has constant rank. Solution: We need to show that for every g G the rank of the linear

More information

The Combinatorics of Nonlinear Controllability and Noncommuting Flows

The Combinatorics of Nonlinear Controllability and Noncommuting Flows The Combinatorics of Nonlinear Controllability and Noncommuting Flows Matthias Kawski Department of Mathematics, Arizona State University, Tempe, Arizona, USA Lectures given at the Summer School on Mathematical

More information

6.8 The Post Correspondence Problem

6.8 The Post Correspondence Problem 6.8. THE POST CORRESPONDENCE PROBLEM 423 6.8 The Post Correspondence Problem The Post correspondence problem (due to Emil Post) is another undecidable problem that turns out to be a very helpful tool for

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

MS 3011 Exercises. December 11, 2013

MS 3011 Exercises. December 11, 2013 MS 3011 Exercises December 11, 2013 The exercises are divided into (A) easy (B) medium and (C) hard. If you are particularly interested I also have some projects at the end which will deepen your understanding

More information

ELLIPSES AND ELLIPTIC CURVES. M. Ram Murty Queen s University

ELLIPSES AND ELLIPTIC CURVES. M. Ram Murty Queen s University ELLIPSES AND ELLIPTIC CURVES M. Ram Murty Queen s University Planetary orbits are elliptical What is an ellipse? x 2 a 2 + y2 b 2 = 1 An ellipse has two foci From: gomath.com/geometry/ellipse.php Metric

More information

From p-adic numbers to p-adic words

From p-adic numbers to p-adic words From p-adic numbers to p-adic words Jean-Éric Pin1 1 January 2014, Lorentz Center, Leiden References I S. Eilenberg, Automata, Languages and Machines, Vol B, Acad. Press, New-York (1976). M. Lothaire,

More information

Definition 5.1. A vector field v on a manifold M is map M T M such that for all x M, v(x) T x M.

Definition 5.1. A vector field v on a manifold M is map M T M such that for all x M, v(x) T x M. 5 Vector fields Last updated: March 12, 2012. 5.1 Definition and general properties We first need to define what a vector field is. Definition 5.1. A vector field v on a manifold M is map M T M such that

More information

Master Algèbre géométrie et théorie des nombres Final exam of differential geometry Lecture notes allowed

Master Algèbre géométrie et théorie des nombres Final exam of differential geometry Lecture notes allowed Université de Bordeaux U.F. Mathématiques et Interactions Master Algèbre géométrie et théorie des nombres Final exam of differential geometry 2018-2019 Lecture notes allowed Exercise 1 We call H (like

More information

DIFFERENTIATION RULES

DIFFERENTIATION RULES 3 DIFFERENTIATION RULES DIFFERENTIATION RULES We have: Seen how to interpret derivatives as slopes and rates of change Seen how to estimate derivatives of functions given by tables of values Learned how

More information

Analytic Left Inversion of Multivariable Lotka Volterra Models α

Analytic Left Inversion of Multivariable Lotka Volterra Models α Analytic Left Inversion of Multivariable Lotka Volterra Models α W. Steven Gray β Mathematical Perspectives in Biology Madrid, Spain February 5, 6 β Joint work with Luis A. Duffaut Espinosa (GMU) and Kurusch

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

Problems in Linear Algebra and Representation Theory

Problems in Linear Algebra and Representation Theory Problems in Linear Algebra and Representation Theory (Most of these were provided by Victor Ginzburg) The problems appearing below have varying level of difficulty. They are not listed in any specific

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

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

Noncommutative compact manifolds constructed from quivers

Noncommutative compact manifolds constructed from quivers Noncommutative compact manifolds constructed from quivers Lieven Le Bruyn Universitaire Instelling Antwerpen B-2610 Antwerp (Belgium) lebruyn@wins.uia.ac.be Abstract The moduli spaces of θ-semistable representations

More information

Department of Mathematics, University of California, Berkeley. GRADUATE PRELIMINARY EXAMINATION, Part A Fall Semester 2016

Department of Mathematics, University of California, Berkeley. GRADUATE PRELIMINARY EXAMINATION, Part A Fall Semester 2016 Department of Mathematics, University of California, Berkeley YOUR 1 OR 2 DIGIT EXAM NUMBER GRADUATE PRELIMINARY EXAMINATION, Part A Fall Semester 2016 1. Please write your 1- or 2-digit exam number on

More information

BMT 2013 The Algebra of Noncommutative Operators Power Round Time Limit: 60 mins. Maximum Score: 100 points. Instructions:

BMT 2013 The Algebra of Noncommutative Operators Power Round Time Limit: 60 mins. Maximum Score: 100 points. Instructions: Time Limit: 60 mins. Maximum Score: 100 points. Instructions: 1. You may use the result of a previous problem that you have not solved in order to solve a later problem without losing credit on the later

More information

Motivic Periods, Coleman Functions, and the Unit Equation

Motivic Periods, Coleman Functions, and the Unit Equation Motivic Periods, Coleman Functions, and the Unit Equation An Ongoing Project D. Corwin 1 I. Dan-Cohen 2 1 MIT 2 Ben Gurion University of the Negev April 10, 2018 Corwin, Dan-Cohen Motivic Periods, Coleman

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

A New Shuffle Convolution for Multiple Zeta Values

A New Shuffle Convolution for Multiple Zeta Values January 19, 2004 A New Shuffle Convolution for Multiple Zeta Values Ae Ja Yee 1 yee@math.psu.edu The Pennsylvania State University, Department of Mathematics, University Park, PA 16802 1 Introduction As

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

Grade 8 Factorisation

Grade 8 Factorisation ID : ae-8-factorisation [1] Grade 8 Factorisation For more such worksheets visit www.edugain.com Answer the questions (1) Find factors of following polynomial A) y 2-2xy + 3y - 6x B) 3y 2-12xy - 2y + 8x

More information

FINITE GROUPS AND EQUATIONS OVER FINITE FIELDS A PROBLEM SET FOR ARIZONA WINTER SCHOOL 2016

FINITE GROUPS AND EQUATIONS OVER FINITE FIELDS A PROBLEM SET FOR ARIZONA WINTER SCHOOL 2016 FINITE GROUPS AND EQUATIONS OVER FINITE FIELDS A PROBLEM SET FOR ARIZONA WINTER SCHOOL 2016 PREPARED BY SHABNAM AKHTARI Introduction and Notations The problems in Part I are related to Andrew Sutherland

More information

Multiple divisor functions, their algebraic structure and the relation to multiple zeta values

Multiple divisor functions, their algebraic structure and the relation to multiple zeta values Multiple divisor functions, their algebraic structure and the relation to multiple zeta values Kyushu University - 13th November 2013 joint work: H.B., Ulf Kühn, arxiv:1309.3920 [math.nt] Multiple

More information

Meromorphic connections and the Stokes groupoids

Meromorphic connections and the Stokes groupoids Meromorphic connections and the Stokes groupoids Brent Pym (Oxford) Based on arxiv:1305.7288 (Crelle 2015) with Marco Gualtieri and Songhao Li 1 / 34 Warmup Exercise Find the flat sections of the connection

More information

Symbolic integration of multiple polylogarithms

Symbolic integration of multiple polylogarithms Symbolic integration of multiple polylogarithms Erik Panzer Institute des Hautes E tudes Scientifiques Applications of Computer Algebra July 22nd, 215 Kalamata, Greece Problem: Multiple integrals of rational

More information

Derived Poisson structures and higher character maps

Derived Poisson structures and higher character maps Derived Poisson structures and higher character maps Sasha Patotski Cornell University ap744@cornell.edu March 8, 2016 Sasha Patotski (Cornell University) Derived Poisson structures March 8, 2016 1 / 23

More information

On the renormalization problem of multiple zeta values

On the renormalization problem of multiple zeta values On the renormalization problem of multiple zeta values joint work with K. Ebrahimi-Fard, D. Manchon and J. Zhao Johannes Singer Universität Erlangen Paths to, from and in renormalization Universität Potsdam

More information

THE QUANTUM CONNECTION

THE QUANTUM CONNECTION THE QUANTUM CONNECTION MICHAEL VISCARDI Review of quantum cohomology Genus 0 Gromov-Witten invariants Let X be a smooth projective variety over C, and H 2 (X, Z) an effective curve class Let M 0,n (X,

More information

The algebra of multiple divisor functions and applications to multiple zeta values

The algebra of multiple divisor functions and applications to multiple zeta values The algebra of multiple divisor functions and applications to multiple zeta values ESF Workshop: New Approaches To Multiple Zeta Values ICMAT Madrid - 30th September 2013 joint work: H.B., Ulf Kühn, arxiv:1309.3920

More information

Analytic Left Inversion of SISO Lotka-Volterra Models

Analytic Left Inversion of SISO Lotka-Volterra Models Analytic Left Inversion of SISO Lotka-Volterra Models Luis A. Duffaut Espinosa George Mason University Joint work with W. Steven Gray (ODU) and K. Ebrahimi-Fard (ICMAT) This research was supported by the

More information

FACULTY OF MATHEMATICAL STUDIES MATHEMATICS FOR PART I ENGINEERING. Lectures

FACULTY OF MATHEMATICAL STUDIES MATHEMATICS FOR PART I ENGINEERING. Lectures FACULTY OF MATHEMATICAL STUDIES MATHEMATICS FOR PART I ENGINEERING Lectures MODULE 5 VECTORS II. Triple products 2. Differentiation and integration of vectors 3. Equation of a line 4. Equation of a plane.

More information

Sophus Lie s Approach to Differential Equations

Sophus Lie s Approach to Differential Equations Sophus Lie s Approach to Differential Equations IAP lecture 2006 (S. Helgason) 1 Groups Let X be a set. A one-to-one mapping ϕ of X onto X is called a bijection. Let B(X) denote the set of all bijections

More information

FOUNDATIONS OF ALGEBRAIC GEOMETRY CLASS 37

FOUNDATIONS OF ALGEBRAIC GEOMETRY CLASS 37 FOUNDATIONS OF ALGEBRAIC GEOMETRY CLASS 37 RAVI VAKIL CONTENTS 1. Motivation and game plan 1 2. The affine case: three definitions 2 Welcome back to the third quarter! The theme for this quarter, insofar

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

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 Probability of Winning a Series. Gregory Quenell

The Probability of Winning a Series. Gregory Quenell The Probability of Winning a Series Gregory Quenell Exercise: Team A and Team B play a series of n + games. The first team to win n + games wins the series. All games are independent, and Team A wins any

More information

Combinatorics On Sturmian Words. Amy Glen. Major Review Seminar. February 27, 2004 DISCIPLINE OF PURE MATHEMATICS

Combinatorics On Sturmian Words. Amy Glen. Major Review Seminar. February 27, 2004 DISCIPLINE OF PURE MATHEMATICS Combinatorics On Sturmian Words Amy Glen Major Review Seminar February 27, 2004 DISCIPLINE OF PURE MATHEMATICS OUTLINE Finite and Infinite Words Sturmian Words Mechanical Words and Cutting Sequences Infinite

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

Vertex Operator Algebra Structure of Standard Affine Lie Algebra Modules

Vertex Operator Algebra Structure of Standard Affine Lie Algebra Modules Vertex Operator Algebra Structure of Standard Affine Lie Algebra Modules p. 1/4 Vertex Operator Algebra Structure of Standard Affine Lie Algebra Modules Christopher Sadowski Rutgers University Department

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

Lecture III. Five Lie Algebras

Lecture III. Five Lie Algebras Lecture III Five Lie Algebras 35 Introduction The aim of this talk is to connect five different Lie algebras which arise naturally in different theories. Various conjectures, put together, state that they

More information

MATRIX LIE GROUPS AND LIE GROUPS

MATRIX LIE GROUPS AND LIE GROUPS MATRIX LIE GROUPS AND LIE GROUPS Steven Sy December 7, 2005 I MATRIX LIE GROUPS Definition: A matrix Lie group is a closed subgroup of Thus if is any sequence of matrices in, and for some, then either

More information

book 2005/1/23 20:41 page 132 #146

book 2005/1/23 20:41 page 132 #146 book 2005/1/23 20:41 page 132 #146 132 2. BASIC THEORY OF GROUPS Definition 2.6.16. Let a and b be elements of a group G. We say that b is conjugate to a if there is a g G such that b = gag 1. You are

More information

Riemann integral and volume are generalized to unbounded functions and sets. is an admissible set, and its volume is a Riemann integral, 1l E,

Riemann integral and volume are generalized to unbounded functions and sets. is an admissible set, and its volume is a Riemann integral, 1l E, Tel Aviv University, 26 Analysis-III 9 9 Improper integral 9a Introduction....................... 9 9b Positive integrands................... 9c Special functions gamma and beta......... 4 9d Change of

More information

7 Planar systems of linear ODE

7 Planar systems of linear ODE 7 Planar systems of linear ODE Here I restrict my attention to a very special class of autonomous ODE: linear ODE with constant coefficients This is arguably the only class of ODE for which explicit solution

More information

Vortex Equations on Riemannian Surfaces

Vortex Equations on Riemannian Surfaces Vortex Equations on Riemannian Surfaces Amanda Hood, Khoa Nguyen, Joseph Shao Advisor: Chris Woodward Vortex Equations on Riemannian Surfaces p.1/36 Introduction Yang Mills equations: originated from electromagnetism

More information

3.1. Derivations. Let A be a commutative k-algebra. Let M be a left A-module. A derivation of A in M is a linear map D : A M such that

3.1. Derivations. Let A be a commutative k-algebra. Let M be a left A-module. A derivation of A in M is a linear map D : A M such that ALGEBRAIC GROUPS 33 3. Lie algebras Now we introduce the Lie algebra of an algebraic group. First, we need to do some more algebraic geometry to understand the tangent space to an algebraic variety at

More information

Stanford University CS366: Graph Partitioning and Expanders Handout 13 Luca Trevisan March 4, 2013

Stanford University CS366: Graph Partitioning and Expanders Handout 13 Luca Trevisan March 4, 2013 Stanford University CS366: Graph Partitioning and Expanders Handout 13 Luca Trevisan March 4, 2013 Lecture 13 In which we construct a family of expander graphs. The problem of constructing expander graphs

More information

Hamiltonian flows, cotangent lifts, and momentum maps

Hamiltonian flows, cotangent lifts, and momentum maps Hamiltonian flows, cotangent lifts, and momentum maps Jordan Bell jordan.bell@gmail.com Department of Mathematics, University of Toronto April 3, 2014 1 Symplectic manifolds Let (M, ω) and (N, η) be symplectic

More information

The Exponential of a Matrix

The Exponential of a Matrix The Exponential of a Matrix 5-8- The solution to the exponential growth equation dx dt kx is given by x c e kt It is natural to ask whether you can solve a constant coefficient linear system x A x in a

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

You may not start to read the questions printed on the subsequent pages until instructed to do so by the Invigilator.

You may not start to read the questions printed on the subsequent pages until instructed to do so by the Invigilator. MATHEMATICAL TRIPOS Part IA Tuesday 7 June 2005 1.30 to 4.30 PAPER 3 Before you begin read these instructions carefully. The examination paper is divided into two sections. Each question in Section II

More information

NOTES ON FINITE FIELDS

NOTES ON FINITE FIELDS NOTES ON FINITE FIELDS AARON LANDESMAN CONTENTS 1. Introduction to finite fields 2 2. Definition and constructions of fields 3 2.1. The definition of a field 3 2.2. Constructing field extensions by adjoining

More information

Chapter. Algebra techniques. Syllabus Content A Basic Mathematics 10% Basic algebraic techniques and the solution of equations.

Chapter. Algebra techniques. Syllabus Content A Basic Mathematics 10% Basic algebraic techniques and the solution of equations. Chapter 2 Algebra techniques Syllabus Content A Basic Mathematics 10% Basic algebraic techniques and the solution of equations. Page 1 2.1 What is algebra? In order to extend the usefulness of mathematical

More information

CMSC Discrete Mathematics SOLUTIONS TO FIRST MIDTERM EXAM October 18, 2005 posted Nov 2, 2005

CMSC Discrete Mathematics SOLUTIONS TO FIRST MIDTERM EXAM October 18, 2005 posted Nov 2, 2005 CMSC-37110 Discrete Mathematics SOLUTIONS TO FIRST MIDTERM EXAM October 18, 2005 posted Nov 2, 2005 Instructor: László Babai Ryerson 164 e-mail: laci@cs This exam contributes 20% to your course grade.

More information

Chap. 1. Some Differential Geometric Tools

Chap. 1. Some Differential Geometric Tools Chap. 1. Some Differential Geometric Tools 1. Manifold, Diffeomorphism 1.1. The Implicit Function Theorem ϕ : U R n R n p (0 p < n), of class C k (k 1) x 0 U such that ϕ(x 0 ) = 0 rank Dϕ(x) = n p x U

More information

Andrews Curtis Groups and the Andrews Curtis Conjecture

Andrews Curtis Groups and the Andrews Curtis Conjecture Andrews Curtis Groups and the Andrews Curtis Conjecture Adam Piggott adam.piggott@tufts.edu Tufts University p. 1/33 Credits and further info This work has appeared in the Journal of Group Theory 10 (2007)

More information

Matrix Lie groups. and their Lie algebras. Mahmood Alaghmandan. A project in fulfillment of the requirement for the Lie algebra course

Matrix Lie groups. and their Lie algebras. Mahmood Alaghmandan. A project in fulfillment of the requirement for the Lie algebra course Matrix Lie groups and their Lie algebras Mahmood Alaghmandan A project in fulfillment of the requirement for the Lie algebra course Department of Mathematics and Statistics University of Saskatchewan March

More information

Monoidal Categories, Bialgebras, and Automata

Monoidal Categories, Bialgebras, and Automata Monoidal Categories, Bialgebras, and Automata James Worthington Mathematics Department Cornell University Binghamton University Geometry/Topology Seminar October 29, 2009 Background: Automata Finite automata

More information

Exercises on chapter 4

Exercises on chapter 4 Exercises on chapter 4 Always R-algebra means associative, unital R-algebra. (There are other sorts of R-algebra but we won t meet them in this course.) 1. Let A and B be algebras over a field F. (i) Explain

More information

Suppose A h is a flat family of non-commutative algebras, such that A 0 is commutative.

Suppose A h is a flat family of non-commutative algebras, such that A 0 is commutative. Suppose A h is a flat family of non-commutative algebras, such that A 0 is commutative. Suppose A h is a flat family of non-commutative algebras, such that A 0 is commutative. Then A 0 has an additional

More information

An asymptotic preserving unified gas kinetic scheme for the grey radiative transfer equations

An asymptotic preserving unified gas kinetic scheme for the grey radiative transfer equations An asymptotic preserving unified gas kinetic scheme for the grey radiative transfer equations Institute of Applied Physics and Computational Mathematics, Beijing NUS, Singapore, March 2-6, 2015 (joint

More information

Introduction to Arithmetic Geometry Fall 2013 Lecture #23 11/26/2013

Introduction to Arithmetic Geometry Fall 2013 Lecture #23 11/26/2013 18.782 Introduction to Arithmetic Geometry Fall 2013 Lecture #23 11/26/2013 As usual, a curve is a smooth projective (geometrically irreducible) variety of dimension one and k is a perfect field. 23.1

More information

Mathematics for Control Theory

Mathematics for Control Theory Mathematics for Control Theory Geometric Concepts in Control Involutivity and Frobenius Theorem Exact Linearization Hanz Richter Mechanical Engineering Department Cleveland State University Reading materials

More information

Notes 5: The Baker-Campbell -Hausdorff formula.

Notes 5: The Baker-Campbell -Hausdorff formula. Notes 5: The Baker-Campbell -Hausdorff formula. Version. with misprints, A usefull power series. There is a power series that plays a central role in the formulation of the Baker- Campbell-Hausdorff formula,

More information

7. Baker-Campbell-Hausdorff formula

7. Baker-Campbell-Hausdorff formula 7. Baker-Campbell-Hausdorff formula 7.1. Formulation. Let G GL(n,R) be a matrix Lie group and let g = Lie(G). The exponential map is an analytic diffeomorphim of a neighborhood of 0 in g with a neighborhood

More information

Lecture-05 Perturbation Theory and Feynman Diagrams

Lecture-05 Perturbation Theory and Feynman Diagrams Lecture-5 Perturbation Theory and Feynman Diagrams U. Robkob, Physics-MUSC SCPY639/428 September 3, 218 From the previous lecture We end up at an expression of the 2-to-2 particle scattering S-matrix S

More information

1 Alphabets and Languages

1 Alphabets and Languages 1 Alphabets and Languages Look at handout 1 (inference rules for sets) and use the rules on some examples like {a} {{a}} {a} {a, b}, {a} {{a}}, {a} {{a}}, {a} {a, b}, a {{a}}, a {a, b}, a {{a}}, a {a,

More information

Transverse geometry. consisting of finite sums of monomials of the form

Transverse geometry. consisting of finite sums of monomials of the form Transverse geometry The space of leaves of a foliation (V, F) can be described in terms of (M, Γ), with M = complete transversal and Γ = holonomy pseudogroup. The natural transverse coordinates form the

More information

Derivations and differentials

Derivations and differentials Derivations and differentials Johan Commelin April 24, 2012 In the following text all rings are commutative with 1, unless otherwise specified. 1 Modules of derivations Let A be a ring, α : A B an A algebra,

More information