Off-campus UMass Amherst users: To download dissertations, please use the following link to log into our proxy server with your UMass Amherst user name and password.
Non-UMass Amherst users, please click the view more button below to purchase a copy of this dissertation from Proquest.
(Some titles may also be available free of charge in our Open Access Dissertation Collection, so please check there first.)
The minimal polygon for computing Z(,f)(0,b) over a real quadratic base field
Abstract
In this thesis we develop an algorithm for determining the convex hull of a sector in a planar lattice. This algorithm will be used to construct a minimal polygon within a sector of the embedding of a fractional ideal of a real quadratic field. It has been shown that the smoothed partial zeta-function $Z\sb{f}(s,b)$, when evaluated at $s=0$, can be calculated directly from this embedding. The minimal polygon will not only calculate $Z\sb{f}(0,b)$ efficiently, but also provide a geometric interpretation of the computational cost of calculating this value.
Subject Area
Mathematics
Recommended Citation
Carter, Daniel James, "The minimal polygon for computing Z(,f)(0,b) over a real quadratic base field" (1993). Doctoral Dissertations Available from Proquest. AAI9316630.
https://scholarworks.umass.edu/dissertations/AAI9316630