• français
    • English
  • English 
    • français
    • English
  • Login
JavaScript is disabled for your browser. Some features of this site may not work without it.
BIRD Home

Browse

This CollectionBy Issue DateAuthorsTitlesSubjectsJournals BIRDResearch centres & CollectionsBy Issue DateAuthorsTitlesSubjectsJournals

My Account

Login

Statistics

View Usage Statistics

Abstract integration, Combinatorics of Trees and Differential Equations

Thumbnail
Date
2011
Link to item file
https://arxiv.org/abs/0809.1821v1
Dewey
Analyse
Sujet
Equations différentielles; Mathematical Physics
Book title
Combinatorics and Physics
Author
Kurusch Ebrahimi-Fard, Matilde Marcolli, Walter D. van Suijlekom
Publisher
American Mathematical Society
Publisher city
Providence, R.I.
Year
2011
ISBN
978-0-8218-5329-0
Book URL
10.1090/conm/539
URI
https://basepub.dauphine.fr/handle/123456789/3408
Collections
  • CEREMADE : Publications
Metadata
Show full item record
Author
Gubinelli, Massimiliano
Type
Chapitre d'ouvrage
Item number of pages
135-152
Abstract (EN)
This is a review paper on recent work about the connections between rough path theory, the Connes-Kreimer Hopf algebra on rooted trees and the analysis of finite and infinite dimensional differential equation. We try to explain and motivate the theory of rough paths introduced by T. Lyons in the context of differential equations in presence of irregular noises. We show how it is used in an abstract algebraic approach to the definition of integrals over paths which involves a cochain complex of finite increments. In the context of such abstract integration theories we outline a connection with the combinatorics of rooted trees. As interesting examples where these ideas apply we present two infinite dimensional dynamical systems: the Navier-Stokes equation and the Korteweg-de-Vries equation.

  • Accueil Bibliothèque
  • Site de l'Université Paris-Dauphine
  • Contact
SCD Paris Dauphine - Place du Maréchal de Lattre de Tassigny 75775 Paris Cedex 16

 Content on this site is licensed under a Creative Commons 2.0 France (CC BY-NC-ND 2.0) license.