In 1874 Brill and Noether designed a seminal geometric method for computing bases of Riemann-Roch spaces. From then, their method has led to several algorithms, some of them being implemented in computer algebra systems. The usual proofs often rely on abstract concepts of algebraic geometry and commutative algebra. In this paper we present a short self-contained and elementary proof that mostly needs Newton polygons, Hensel lifting, bivariate resultants, and Chinese remaindering.
翻译:在1874年,布里尔和诺埃瑟设计了里曼-洛克空域计算基数的原始几何方法。 从那时起,它们的方法导致了若干算法,其中一些是在计算机代数系统中实施的。通常的证据往往依靠代数几何和交替代数的抽象概念。在本文中,我们提出了一个简短的、自足和基本的证据,主要需要牛顿多边形、汉塞尔升降、双变结果和中国剩余部分。