Averages of Fourier coefficients of Siegel modular forms and representation of binary quadratic forms by quadratic forms in four variables

Let $-d$ be a a negative discriminant and let $T$ vary over a set of representatives of the integral equivalence classes of integral binary quadratic forms of discriminant $-d$. We prove an asymptotic formula for $d \to \infty$ for the average over $T$ of the number of representations of $T$ by an integral positive definite quaternary quadratic form and obtain results on averages of Fourier coefficients of linear combinations of Siegel theta series. We also find an asymptotic bound from below on the number of binary forms of fixed discriminant $-d$ which are represented by a given quaternary form. In particular, we can show that for growing $d$ a positive proportion of the binary quadratic forms of discriminant $-d$ is represented by the given quaternary quadratic form.Comment: v5: Some typos correcte

Parallel Algorithms for Summing Floating-Point Numbers

The problem of exactly summing n floating-point numbers is a fundamental problem that has many applications in large-scale simulations and computational geometry. Unfortunately, due to the round-off error in standard floating-point operations, this problem becomes very challenging. Moreover, all existing solutions rely on sequential algorithms which cannot scale to the huge datasets that need to be processed. In this paper, we provide several efficient parallel algorithms for summing n floating point numbers, so as to produce a faithfully rounded floating-point representation of the sum. We present algorithms in PRAM, external-memory, and MapReduce models, and we also provide an experimental analysis of our MapReduce algorithms, due to their simplicity and practical efficiency.Comment: Conference version appears in SPAA 201

Complements and signed digit representations: Analysis of a multi-exponentiation-algorithm of Wu, Lou, Lai and Chang

Wu, Lou, Lai and Chang proposed a multi-exponentiation algorithm using binary complements and the non-adjacent form. The purpose of this paper is to show that neither the analysis of the algorithm given by its original proposers nor that by other authors are correct. In fact it turns out that the complement operation does not have significant influence on the performance of the algorithm and can therefore be omitted