A combinatorial proof of Frobenius theorem

MaRDI QIDQ3566593zbMATH OpenFDO

Authors Robert Moussu, Jean-Philippe Rolin

Publication date 8 June 2010

Full work available at URL http://smf4.emath.fr/en/Publications/Asterisque/2009/323/html/smf_ast_323_253-260.php

zbMATH Keywords

Frobenius theoremGodbillon-Vey algorithmholomorphic foliations

Mathematics Subject Classification ID

Dynamical aspects of holomorphic foliations and vector fields (37F75) Differential forms in global analysis (58A10) Pfaffian systems (58A17)

Recommendations

• A formal Frobenius theorem and argument shift
• scientific article; zbMATH DE number 854085
• A singular Frobenius theorem via elementary arithmetic
• A Short Proof of the Frobenius Theorem
• Frobenius theorem for foliations on singular varieties

Cited in

(7)

• A combinatorical proof of Kneser's conjecture
• A combinatorial proof of a theorem of Freund
• A Combinatorial Proof for Stockhausen's Problem
• A Counting Proof of a Theorem of Frobenius
• Many Frobenius complements have even order
• Combinatorial Proofs of Fermat's, Lucas's, and Wilson's Theorems
• A formal Frobenius theorem and argument shift

This page was built for publication: A combinatorial proof of Frobenius theorem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3566593)