D-log and formal flow for analytic isomorphisms of n-space

Simple item page
dc.creatorWright, David
dc.creatorZhao, Wenhua
dc.date2002-09-20
dc.date.accessioned2026-07-07T12:36:36Z
dc.date.available2026-07-07T12:36:36Z
dc.descriptionGiven a formal map $F=(F_1...,F_n)$ of the form $z+\text{higher}$ order terms, we give tree expansion formulas and associated algorithms for the D-Log of F and the formal flow F_t. The coefficients which appear in these formulas can be viewed as certain generalizations of the Bernoulli numbers and the Bernoulli polynomials. Moreover the coefficient polynomials in the formal flow formula coincide with the strict order polynomials in combinatorics for the partially ordered sets induced by trees. Applications of these formulas to the Jacobian Conjecture are discussed.
dc.descriptionLatex, 32 pages
dc.identifierhttps://arxiv.org/abs/math/0209274
dc.identifierhttp://arxiv.org/abs/math/0209274
dc.identifierTrans. Amer. Math. Soc. 355 (2003), No. 8, 3117-3141.
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/218150
dc.subjectComplex Variables
dc.subjectCombinatorics
dc.subjectPrimary 14R10, 11B68; Secondary 14R15, 05C05
dc.titleD-log and formal flow for analytic isomorphisms of n-space
dc.typetext

Files

Collections

arXiv