arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0708.3232math.CVmath.NT
收藏

Complexity results for CR mappings between spheres

John P. D'Angelo, Jiri Lebl

英文摘要:

Using elementary number theory, we prove several results about the complexity of CR mappings between spheres. It is known that CR mappings between spheres, invariant under finite groups, lead to sharp bounds for degree estimates on real polynomials constant on a hyperplane. We show here that there are infinitely many degrees for which the uniqueness of sharp examples fails. The proof uses a Pell equation and complicated explicit computations. We also show that the so-called gap phenomenon for proper mappings between balls does not occur beyond a certain target dimension. This proof uses the solution of the postage stamp problem.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑