Seminar talk, 7 October 2009: Difference between revisions

From Geometry of Differential Equations
Jump to navigation Jump to search
 
No edit summary
 
(One intermediate revision by the same user not shown)
Line 2: Line 2:
| speaker = Alexander Verbovetsky
| speaker = Alexander Verbovetsky
| title = Compatibility operators for passive orthonomic systems
| title = Compatibility operators for passive orthonomic systems
| abstract = About three years ago, we discussed Michal Marvan's theorem on integrability conditions of orthonomic systems.  Since then Michal improved his construction and proved that his set of integrability conditions is irredundant.  The talk will discuss these results and their application to construction of compatibility operators.
| abstract = About three years ago, we discussed [[Michal Marvan]]'s theorem on integrability conditions of orthonomic systems.  Since then Michal improved his construction and proved that his set of integrability conditions is irredundant.  The talk will discuss these results and their application to construction of compatibility operators.
| references = Marvan M. Sufficient set of integrability conditions of an orthonomic system, Found. Comput. Math., 2009, [http://arxiv.org/abs/nlin/0605009 arXiv:nlin/0605009]
| references = Marvan M. Sufficient set of integrability conditions of an orthonomic system, Found. Comput. Math., 2009, {{arXiv|nlin/0605009}}
| 79YY-MM-DD = 7990-89-92
| 79YY-MM-DD = 7990-89-92
}}
}}

Latest revision as of 21:07, 30 November 2009

Speaker: Alexander Verbovetsky

Title: Compatibility operators for passive orthonomic systems

Abstract:
About three years ago, we discussed Michal Marvan's theorem on integrability conditions of orthonomic systems. Since then Michal improved his construction and proved that his set of integrability conditions is irredundant. The talk will discuss these results and their application to construction of compatibility operators.

References:
Marvan M. Sufficient set of integrability conditions of an orthonomic system, Found. Comput. Math., 2009, arXiv:nlin/0605009