From a profiled diffuser to an optimized absorber

The quadratic residue diffuser was originally designed for enhanced scattering. Subsequently, however, it has been found that these diffusers can also be designed to produce exceptional absorption. This paper looks into the absorption mechanism of the one-dimensional quadratic residue diffuser. A theory for enhanced absorption is presented. Corresponding experiments have also been done to verify the theory. The usefulness of a resistive layer at the well openings has been verified. A numerical optimization was performed to obtain a better depth sequence. The results clearly show that by arranging the depths of the wells properly in one period, the absorption is considerably better than that of a quadratic residue diffuser. © 2000 Acoustical Society of America

Springer's theorem for tame quadratic forms over Henselian fields

A quadratic form over a Henselian-valued field of arbitrary residue characteristic is tame if it becomes hyperbolic over a tamely ramified extension. The Witt group of tame quadratic forms is shown to be canonically isomorphic to the Witt group of graded quadratic forms over the graded ring associated to the filtration defined by the valuation, hence also isomorphic to a direct sum of copies of the Witt group of the residue field indexed by the value group modulo 2

Simultaneous zeros of a Cubic and Quadratic form

We verify a conjecture of Emil Artin, for the case of a Cubic and Quadratic form over any $p$-adic field, provided the cardinality of the residue class field exceeds 293. That is any Cubic and Quadratic form with at least 14 variables has a non-trivial $p$-adic zero, with the aforementioned condition on the residue class field. A crucial step in the proof, involves generalizing a $p$-adic minimization procedure due to W. M. Schmidt to hold for systems of forms of arbitrary degrees.Comment: 19 page

On quadratic residue codes and hyperelliptic curves

A long standing problem has been to develop "good" binary linear codes to be used for error-correction. This paper investigates in some detail an attack on this problem using a connection between quadratic residue codes and hyperelliptic curves. One question which coding theory is used to attack is: Does there exist a c<2 such that, for all sufficiently large $p$ and all subsets S of GF(p), we have |X_S(GF(p))| < cp?Comment: 18 pages, no figure