Argument shift method: Difference between revisions

Content deleted Content added

Revision as of 04:08, 2 December 2012 edit R.e.b. (talk \| contribs) Extended confirmed users, Pending changes reviewers 42,907 edits Expanding article ← Previous edit		Latest revision as of 13:02, 6 December 2024 edit undo Old Man Consequences (talk \| contribs) Extended confirmed users 50,392 edits stub sort
(5 intermediate revisions by 5 users not shown)
Line 1: {{Orphan\|date=December 2022}} In mathematics, the '''argument shift method''' is a method for constructing functions in involution with respect to [[Poisson–Lie bracket]]s, introduced by {{harvs\|txt\|last1=Mishchenko\|last2= Fomenko\|year=1978}}. They used it to prove that the [[Poisson algebra]] of a finite-dimensional [[semisimple Lie algebra]] contains a complete commuting set of polynomials. Line 4 ⟶ 6: ==References== *{{Citation \| last1=Mishchenko \| first1=A. S. \| last2=Fomenko \| first2=A. T. \| title=Euler equation on finite-dimensional Lie groups \| idmr=~~{{MR\|~~0482832~~}} English translation: Math. USSR-Izv. 12 (1978), no. 2, 371–389~~ \| year=1978 \| journal=Izvestiya Akademii Nauk SSSR. Seriya Matematicheskaya \|language=ru \| issn=0373-2436 \| volume=42 \| issue=2 \| pages=396–415}} English translation: Math. USSR-Izv. 12 (1978), no. 2, 371–389 [[Category:Lie algebras]] {{abstract-algebra-stub}}