Show simple item record

Sums of quadratic characters.

dc.contributor.authorArmon, Mary Vlastniken_US
dc.contributor.advisorMontgomery, Hugh L.en_US
dc.date.accessioned2014-02-24T16:18:00Z
dc.date.available2014-02-24T16:18:00Z
dc.date.issued1994en_US
dc.identifier.other(UMI)AAI9423136en_US
dc.identifier.urihttp://gateway.proquest.com/openurl?url_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:dissertation&res_dat=xri:pqm&rft_dat=xri:pqdiss:9423136en_US
dc.identifier.urihttps://hdl.handle.net/2027.42/103903
dc.description.abstractThis thesis explores the question of determining the size of the sum$$S(X,Y) = \sum\sb{D\in{\cal Q}\atop\vert D\vert\le X}\left\vert\sum\sb{n\le Y}\left({D\over n}\right)\right\vert\sp2,$$where (D/n) is the Kronecker symbol and defines a quadratic character. In 1973 Jutila proved that S(X,Y) $\ll$ $XY\log\sp8X$. In 1975 Saparnijazov and Fainleib refined Jutila's method to obtain an upper bound of $XY\log\sp2X$; this was thought to be best possible. This thesis proves that in fact S(X,Y) $\ll$ $XY\log X$.en_US
dc.format.extent45 p.en_US
dc.subjectMathematicsen_US
dc.titleSums of quadratic characters.en_US
dc.typeThesisen_US
dc.description.thesisdegreenamePhDen_US
dc.description.thesisdegreedisciplineMathematicsen_US
dc.description.thesisdegreegrantorUniversity of Michigan, Horace H. Rackham School of Graduate Studiesen_US
dc.description.bitstreamurlhttp://deepblue.lib.umich.edu/bitstream/2027.42/103903/1/9423136.pdf
dc.description.filedescriptionDescription of 9423136.pdf : Restricted to UM users only.en_US
dc.owningcollnameDissertations and Theses (Ph.D. and Master's)


Files in this item

Show simple item record

Remediation of Harmful Language

The University of Michigan Library aims to describe library materials in a way that respects the people and communities who create, use, and are represented in our collections. Report harmful or offensive language in catalog records, finding aids, or elsewhere in our collections anonymously through our metadata feedback form. More information at Remediation of Harmful Language.

Accessibility

If you are unable to use this file in its current format, please select the Contact Us link and we can modify it to make it more accessible to you.