Abstract
An exponential sum is a linear combination of characters of the additive group of . We regard as an analogue of the torus , exponential sums as analogues of Laurent polynomials, and exponential analytic sets (-sets), that is, the sets of common zeros of finite systems of exponential sums, as analogues of algebraic subvarieties of the torus. Using these analogies, we define the intersection number of -sets and apply the De Concini–Procesi algorithm to construct the ring of conditions of the corresponding intersection theory. To construct the intersection number and the ring of conditions, we associate an algebraic subvariety of a multidimensional complex torus with every -set and use the methods of tropical geometry. By computing the intersection number of the divisors of arbitrary exponential sums , we arrive at a formula for the density of the -set of common zeros of the perturbed system , where the perturbation belongs to a set of relatively full measure in . This formula is analogous to the formula for the number of common zeros of Laurent polynomials.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have