加载中…
Let be the {\it -resultant} (see below) of -tuple of Laurent polynomials. We provide an algorithm for computing assuming that an -tuple is {\it developed} (see sec.6). We provide a relation between the product of over roots of in and the product of over roots of in assuming that the -tuple is developed. If all -tuples contained in are developed we provide a signed version of Poisson formula for . In our proofs we use a topological arguments and topological version of the Parshin reciprocity laws.

生成讲解博客的中文版本

生成AI智能校验的中文版本