D-log and formal flow for analytic isomorphisms of n-space
英文摘要:
Given 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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。