arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2601.01458math.AG
收藏

围绕‘代数基本定理’的定理(扩展版)

Around the 'Fundamental Theorem of Algebra' (extended version)

Moscow Institute of Physics and Technology (National Research University), Higher School of Contemporary Mathematics(莫斯科物理技术学院(国立研究型大学),高等现代数学学院)

Boris Kazarnovskii

AI总结:

本文扩展了代数基本定理,研究了Laurent多项式、复简约群上的多项式以及指数和的零点分布特性。

摘要:

代数基本定理(FTA)断言每个复多项式有与它的次数相等的复根,计重数。对于实多项式的实根的概率类比定理,有时称为Kac定理,由J. Littlewood、A. Offord和M. Kac在1938至1943年间发现。在本文中,我们提出了几种更多的FTA版本:针对单变量和多变量 Laurent多项式的Kac型FTA,针对出现在紧群表示中的复简约群上多项式的Kac型FTA(类似于出现在环面表示理论中的Laurent多项式),以及单变量和多变量指数和的FTA。在Laurent多项式的情况下,结果,即使在单变量情况下,也是出人意料的:大多数实Laurent多项式的零点是实数根。本文是对\cite{arx}的补充和更详细的版本。

英文摘要:

The Fundamental Theorem of Algebra (FTA) asserts that every complex polynomial has as many complex roots, counted with multiplicities, as its degree. A probabilistic analogue of this theorem for real roots of real polynomials, sometimes referred to as the Kac theorem, was found between 1938 and 1943 by J. Littlewood, A. Offord, and M. Kac. In this paper, we present several more versions of FTA: Kac type FTA for Laurent polynomials in one and many variables, Kac type FTA for polynomials on complex reductive groups arising in the context of compact group representations (similar to Laurent polynomials arising in torus representation theory), and FTA for exponential sums in one and many variables. In the case of Laurent polynomials, the result, even in the one-dimensional case, is unexpected: most of the zeros of a real Laurent polynomial are real. This text is a supplemented and more detailed version of \cite{arx}.

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

↑