Zeros of Systems of p{\mathfrak p}-adic Quadratic Forms

It is shown that a system of $r$ quadratic forms over a ${\mathfrak p}$-adic field has a non-trivial common zero as soon as the number of variables exceeds $4r$, providing that the residue class field has cardinality at least $(2r)^r$.Comment: Revised version, with better treatment and results for characteristic

The largest prime factor of X3+2X^3+2

The largest prime factor of $X^3+2$ has been investigated by Hooley, who gave a conditional proof that it is infinitely often at least as large as $X^{1+\delta}$, with a certain positive constant $\delta$. It is trivial to obtain such a result with $\delta=0$. One may think of Hooley's result as an approximation to the conjecture that $X^3+2$ is infinitely often prime. The condition required by Hooley, his R$^{*}$ conjecture, gives a non-trivial bound for short Ramanujan-Kloosterman sums. The present paper gives an unconditional proof that the largest prime factor of $X^3+2$ is infinitely often at least as large as $X^{1+\delta}$, though with a much smaller constant than that obtained by Hooley. In order to do this we prove a non-trivial bound for short Ramanujan-Kloosterman sums with smooth modulus. It is also necessary to modify the Chebychev method, as used by Hooley, so as to ensure that the sums that occur do indeed have a sufficiently smooth modulus

Using single buffers and data reorganization to implement a multi-megasample fast Fourier transform

Data ordering in large fast Fourier transforms (FFT's) is both conceptually and implementationally difficult. Discribed here is a method of visualizing data orderings as vectors of address bits, which enables the engineer to use more efficient data orderings and reduce double-buffer memory designs. Also detailed are the difficulties and algorithmic solutions involved in FFT lengths up to 4 megasamples (Msamples) and sample rates up to 80 MHz

Commutative semigroups of real and complex matrices

The computation of divergence is studied. Covariance matrices to be analyzed admit a common diagonalization, or even triangulation. Sufficient conditions are given for such phenomena to take place, the arguments cover both real and complex matrices, and are not restricted to Hermotian or other special forms. Specifically, it is shown to be sufficient that the matrices in question commute in order to admit a common triangulation. Several results hold in the case that the matrices in question form a closed and bounded set, rather than only in the finite case