SearcharxivSearch

arXiv subjects

Barry R. Smith

Publications and source records attributed to Barry R. Smith.

5 recordsLinked to original sources

Constructing minimal periods of quadratic irrationalities in Zagier's reduction theory

Dirichlet's version of Gauss's reduction theory for indefinite binary quadratic forms includes a map from Gauss-reduced forms to strings of natural numbers. It attaches to a form the minimal period of the continued fraction of a quadratic irrationality associated with the form. When Zagier developed his own reduction theory, parallel to Dirichlet's, he omitted an analogue of this map. We define a new map on Zagier-reduced forms that serves as this analogue. We also define a map from the set of Gauss-reduced forms into the set of Zagier-reduced forms that gives a near-embedding of the structure of Gauss's reduction theory into that of Zagier's. From this perspective, Zagier-reduction becomes a refinement of Gauss-reduction.

math.NT

New algorithms for modular inversion and representation by binary quadratic forms arising from structure in the Euclidean algorithm

We observe structure in the sequences of quotients and remainders of the Euclidean algorithm with two families of inputs. Analyzing the remainders, we obtain new algorithms for computing modular inverses and representating prime numbers by the binary quadratic form $x^2 + 3xy + y^2$. The Euclidean algorithm is commenced with inputs from one of the families, and the first remainder less than a predetermined size produces the modular inverse or representation.

math.NT

End-symmetric continued fractions and quadratic congruences

We show that for a fixed integer $n \neq \pm2$, the congruence $x^2 + nx \pm 1 \equiv 0 \pmodα$ has the solution $β$ with $0 < β< α$ if and only if $α/β$ has a continued fraction expansion with sequence of quotients having one of a finite number of possible asymmetry types. This generalizes the old theorem that a rational number $α/β> 1$ in lowest terms has a symmetric continued fraction precisely when $β^2 \equiv \pm 1 \pmodα$.

math.NT

Reducing quadratic forms by kneading sequences

We introduce an invertible operation on finite sequences of positive integers and call it "kneading". Kneading preserves three invariants of sequences -- the parity of the length, the sum of the entries, and one we call the "alternant". We provide a bijection between the set of sequences with alternant $a$ and parity $s$ and the set of Zagier-reduced indefinite binary quadratic forms with discriminant $a^2 + (-1)^s \cdot 4$, and show that kneading corresponds to Zagier reduction of the corresponding forms. It follows that the sum of a sequence is a class invariant of the corresponding form. We conclude with some observations and conjectures concerning this new invariant.

math.NT