The notion of a reduced real quadratic number goes back to Gauss, who defined such a number to be reduced if it is greater than one, and its conjugate between negative one and zero. An equivalent characterization is that the continued fraction of a reduced quadratic number is purely periodic. Zassenhaus generalized this by defining a real algebraic number \u03b1 to be reduced if \u03b1 > 1 and -1 < Re\u03b1' < 0 for the conjugates \u03b1' of \u03b1 distinct from \u03b1. In this thesis, several properties of these reduced numbers are developed. In particular it is shown that there exist reduced numbers \u03b1 with the property that \u03b1 has no reduced immediate predecessor, that is, u + 1/\u03b1 is not reduced for any choice of the rational integer u. We call such a number \u03b1 an ancestor. These ancestors have the property that every real algebraic number of degree at least three is equivalent to exactly one of them. Here, equivalence is in the sense of continued fractions; \u03b1 ~ \u03b2 means that there exist integers a, b, c, and d such that ad - bc = \u00b11 and \u03b1 = a\u03b2+b/c\u03b2+d. This is equivalent to \u03b1 and \u03b2 having identical continued fractions after a certain point. This property of ancestors gives rise to an application to the problem of determining whether or not two given integral binary homogeneous forms are equivalent, assuming that each form has a real root. If the forms are equivalent, so are the roots of the forms; this can be checked by comparing the ancestors. This method is computationally effective.
\r\n\r\nIn another direction, there is a connection between the reduced numbers defined above and the Pisot-Vijayaraghavan (PV) numbers (a PV number is a real algebraic integer greater than one all of whose other conjugates have absolute value less than one). It turns out that any reduced algebraic integer which is not an ancestor is a PV number; integral ancestors may or may not be. Part of the thesis is devoted to a more detailed comparison of PV numbers and integral ancestors. On one side, there is the theorem of Salem that the PV numbers are closed. On the other, it is proved here that if K is a field of degree at least three over the rationals, real but not totally real, then no integral ancestor in K is isolated (that is, there are other integral ancestors arbitrarily close). Much more is true; one can show in many cases that the integral ancestors in such a field lie in a set of non-trivial intervals in which they are dense. This decomposition is studied in more detail. For example, in Q(\u03b1), where \u03b13 = \u03b1 + 1, the integral ancestors are actually dense in [1,\u221e]. In contrast, in Q(\u221b2), the integral ancestors are dense in [1,2] U [3,5] U [6,8] U [9,11] U . . . and none of them occur in the gaps. It is proved that all cubic fields which are not totally real are like one of these two fields in the way the integral ancestors are distributed. Similar results hold for fields of higher degree, although the situation is somewhat more complicated.
\r\n\r\n", "doi": "10.7907/5jj1-j729", "publication_date": "1982", "thesis_type": "phd", "thesis_year": "1982" }, { "id": "thesis:8060", "collection": "thesis", "collection_id": "8060", "cite_using_url": "https://resolver.caltech.edu/CaltechTHESIS:01292014-160430243", "primary_object_url": { "basename": "Odlyzko_am_1971.pdf", "content": "final", "filesize": 18097596, "license": "other", "mime_type": "application/pdf", "url": "/8060/1/Odlyzko_am_1971.pdf", "version": "v2.0.0" }, "type": "thesis", "title": "Sieve Methods", "author": [ { "family_name": "Odlyzko", "given_name": "Andrew Michael", "clpid": "Odlyzko-Andrew-Michael" } ], "thesis_advisor": [ { "family_name": "Apostol", "given_name": "Tom M.", "clpid": "Apostol-T-M" } ], "thesis_committee": [ { "family_name": "None", "given_name": "None" } ], "local_group": [ { "literal": "div_pma" } ], "abstract": "Preface: The main goal of this work is to give an introductory account of sieve methods that would be understandable with only a slight knowledge of analytic number theory. These notes are based to a large extent on lectures on sieve methods given by Professor Van Lint and the author in a number theory seminar during the 1970-71 academic year, but rather extensive changes have been made in both the content and the presentation.", "doi": "10.7907/28FN-8P32", "publication_date": "1971", "thesis_type": "senior_major", "thesis_year": "1971" }, { "id": "thesis:9331", "collection": "thesis", "collection_id": "9331", "cite_using_url": "https://resolver.caltech.edu/CaltechTHESIS:12182015-163230212", "primary_object_url": { "basename": "Lu_ku_1968.pdf", "content": "final", "filesize": 8528660, "license": "other", "mime_type": "application/pdf", "url": "/9331/1/Lu_ku_1968.pdf", "version": "v2.0.0" }, "type": "thesis", "title": "Some Properties of the Coefficients of Cyclotomic Polynomials", "author": [ { "family_name": "Lu", "given_name": "Kau-un", "clpid": "Lu-Kau-un" } ], "thesis_advisor": [ { "family_name": "Apostol", "given_name": "Tom M.", "clpid": "Apostol-T-M" } ], "thesis_committee": [ { "family_name": "Unknown", "given_name": "Unknown" } ], "local_group": [ { "literal": "div_pma" } ], "abstract": "An explicit formula is obtained for the coefficients of the cyclotomic polynomial Fn(x), where n is the product of two distinct odd primes. A recursion formula and a lower bound and an improvement of Bang\u2019s upper bound for the coefficients of Fn(x) are also obtained, where n is the product of three distinct primes. The cyclotomic coefficients are also studied when n is the product of four distinct odd primes. A recursion formula and upper bounds for its coefficients are obtained. The last chapter includes a different approach to the cyclotomic coefficients. A connection is obtained between a certain partition function and the cyclotomic coefficients when n is the product of an arbitrary number of distinct odd primes. Finally, an upper bound for the coefficients is derived when n is the product of an arbitrary number of distinct and odd primes.
", "doi": "10.7907/py5s-v205", "publication_date": "1968", "thesis_type": "phd", "thesis_year": "1968" }, { "id": "thesis:9215", "collection": "thesis", "collection_id": "9215", "cite_using_url": "https://resolver.caltech.edu/CaltechTHESIS:10122015-160506112", "primary_object_url": { "basename": "Skarda_rv_1966.pdf", "content": "final", "filesize": 5719373, "license": "other", "mime_type": "application/pdf", "url": "/9215/1/Skarda_rv_1966.pdf", "version": "v2.0.0" }, "type": "thesis", "title": "Some Central Limit Theorems for Doubly Restricted Partitions", "author": [ { "family_name": "Skarda", "given_name": "Ralph Vencil, Jr.", "clpid": "Skarda-Ralph-Vencil" } ], "thesis_advisor": [ { "family_name": "Apostol", "given_name": "Tom M.", "clpid": "Apostol-T-M" } ], "thesis_committee": [ { "family_name": "Unknown", "given_name": "Unknown" } ], "local_group": [ { "literal": "div_pma" } ], "abstract": "Let PK, L(N) be the number of unordered partitions of a positive integer N into K or fewer positive integer parts, each part not exceeding L. A distribution of the form
\r\n\r\n\u01a9/N\u2264x PK,L(N)
\r\n\r\nis considered first. For any fixed K, this distribution approaches a piecewise polynomial function as L increases to infinity. As both K and L approach infinity, this distribution is asymptotically normal. These results are proved by studying the convergence of the characteristic function.
\r\n\r\nThe main result is the asymptotic behavior of PK,K(N) itself, for certain large K and N. This is obtained by studying a contour integral of the generating function taken along the unit circle. The bulk of the estimate comes from integrating along a small arc near the point 1. Diophantine approximation is used to show that the integral along the rest of the circle is much smaller.
\r\n", "doi": "10.7907/YH19-JH87", "publication_date": "1966", "thesis_type": "phd", "thesis_year": "1966" }, { "id": "thesis:6275", "collection": "thesis", "collection_id": "6275", "cite_using_url": "https://resolver.caltech.edu/CaltechTHESIS:03282011-140809241", "primary_object_url": { "basename": "Rumsey_h_1961.pdf", "content": "final", "filesize": 12237019, "license": "other", "mime_type": "application/pdf", "url": "/6275/1/Rumsey_h_1961.pdf", "version": "v4.0.0" }, "type": "thesis", "title": "Sets of Visible Points", "author": [ { "family_name": "Rumsey", "given_name": "Howard Calvin", "clpid": "Rumsey-Howard-Calvin" } ], "thesis_advisor": [ { "family_name": "Apostol", "given_name": "Tom M.", "clpid": "Apostol-T-M" } ], "thesis_committee": [ { "family_name": "Unknown", "given_name": "Unknown" } ], "local_group": [ { "literal": "div_pma" } ], "abstract": "We say that two lattice points are visible from one another if\r\nthere is no lattice point on the open line segment joining them. If\r\nQ is a subset of the n-dimensional integer lattice L^n, we write VQ\r\nfor the set of points which can see every point of Q, and we call a\r\nset S a set of visible points if S = VQ for some set Q.\r\nIn the first section we study the elementary properties of the\r\noperator V and of certain associated operators. A typical result is\r\nthat Q is a set of visible points if and only if Q = V(VQ). In the\r\nsecond and third sections we study sets of visible points in greater\r\ndetail. In particular we show that if Q is a finite subset of L^n, then VQ has a \"density\" which is given by the Euler product\r\n\r\n^\u03c0_p (1 \u2013 r_p(Q)/p_n)\r\n\r\nwhere the numbers r_p (Q) are certain integers determined by the set Q\r\nand the primes p. And if Q is an infinite subset of L^ n, we give\r\nnecessary and sufficient conditions on the set Q such that VQ has\r\na density which is given by this or other related products.\r\nIn the final section we compute the average values of a certain\r\nclass of functions defined on L^n, and we show that the resulting\r\nformula may be used to compute the density of a set of visible points\r\nVQ generated by a finite set Q.\r\n", "doi": "10.7907/9Y69-0F82", "publication_date": "1961", "thesis_type": "phd", "thesis_year": "1961" }, { "id": "thesis:2705", "collection": "thesis", "collection_id": "2705", "cite_using_url": "https://resolver.caltech.edu/CaltechETD:etd-06232006-133908", "primary_object_url": { "basename": "Rearick_df_1960.pdf", "content": "final", "filesize": 2025377, "license": "other", "mime_type": "application/pdf", "url": "/2705/1/Rearick_df_1960.pdf", "version": "v2.0.0" }, "type": "thesis", "title": "Some Visibility Problems in Point Lattices", "author": [ { "family_name": "Rearick", "given_name": "David Francis", "clpid": "Rearick-David-Francis" } ], "thesis_advisor": [ { "family_name": "Apostol", "given_name": "Tom M.", "clpid": "Apostol-T-M" } ], "thesis_committee": [ { "family_name": "Unknown", "given_name": "Unknown" } ], "local_group": [ { "literal": "div_pma" } ], "abstract": "NOTE: Text or symbols not renderable in plain ASCII are indicated by [...]. Abstract is included in .pdf document.\r\n\r\nWe say that one lattice point is visible from another if no third lattice point lies on the line joining them. A lattice point visible from the origin is called a visible point. We study the manner in which the visible points are distributed throughout the lattice and show that, in a k-dimensional lattice, the fraction of such points in an expanding region \"usually\" tends to [...]. On the other hand there exist arbitrarily large \"gaps\" containing no visible points. The following is a typical theorem: The maximum number of lattice points mutually visible in pairs is [...], and if [...], the \"density\" of points visible from each of a fixed set of n points, themselves mutually visible in pairs, is [...].\r\n\r\nThe last section is devoted to a study of the function [...], which is defined to be the number of distinct solutions of the congruence [...] having [...]. A special case of this function arises in connection with a certain visibility problem. A typical result is that [...].\r\n", "doi": "10.7907/AH50-9D92", "publication_date": "1960", "thesis_type": "phd", "thesis_year": "1960" }, { "id": "thesis:6540", "collection": "thesis", "collection_id": "6540", "cite_using_url": "https://resolver.caltech.edu/CaltechTHESIS:07142011-113939348", "primary_object_url": { "basename": "Sklar_a_1956.pdf", "content": "final", "filesize": 19228905, "license": "other", "mime_type": "application/pdf", "url": "/6540/1/Sklar_a_1956.pdf", "version": "v4.0.0" }, "type": "thesis", "title": "Summation Formulas Associated with a Class of Dirichlet Series", "author": [ { "family_name": "Sklar", "given_name": "Abe", "clpid": "Sklar-Abe" } ], "thesis_advisor": [ { "family_name": "Apostol", "given_name": "Tom M.", "clpid": "Apostol-T-M" } ], "thesis_committee": [ { "family_name": "Unknown", "given_name": "Unknown" } ], "local_group": [ { "literal": "div_pma" } ], "abstract": "The Poisson summation formula, which gives, under suitable conditions on f(x), and expression for sums of the form\r\n \r\n^(n_2)\u03a3_(n=n_1) f(n) 1 \u2264 n_1 < n_2 \u2264 \u221e\r\n\r\ncan be derived from the functional equation for the Riemann zeta-function (s). In this thesis a class of Dirichlet series is defined whose members have properties analogous to those of s(s); in particular, each series in the class, written in the form\r\n\r\n\u00d8(s) = ^\u221e\u03a3_(n=1) a(n) \u03bb ^(-s)_n\r\n\r\ndefines a meromorphic function \u00d8(s) which satisfies a relation analogous to the functional equation of s(s). From this relation an identity for sum of the form\r\n\r\n\u03a3_(^\u03bbn^(\u2264x) a(n) (x - \u03bb_n)^q\r\n\r\nis derived. This identity in turn leads, in a quite simple fashion, to summation formulas which give expressions for sums of the form\r\n\r\n^(n_2)\u03a3_(n=n_1) a(n) f(\u03bb_n) 1 \u2264 n_1 \u2264 n_2\r\n\r\nThe summation formulas thus derived include the Poisson and other well-known summation formulas as special cases and in addition embrace many expressions that are new. The formulas are not only of interest in themselves, but also provide a tool for investigating many problems that arise in analytic number theory. ", "doi": "10.7907/F6R6-5E76", "publication_date": "1956", "thesis_type": "phd", "thesis_year": "1956" }, { "id": "thesis:1063", "collection": "thesis", "collection_id": "1063", "cite_using_url": "https://resolver.caltech.edu/CaltechETD:etd-03232004-113001", "primary_object_url": { "basename": "Gordon_b_1956.pdf", "content": "final", "filesize": 776678, "license": "other", "mime_type": "application/pdf", "url": "/1063/1/Gordon_b_1956.pdf", "version": "v2.0.0" }, "type": "thesis", "title": "Some Tauberian Theorems Connected with the Prime Number Theorem", "author": [ { "family_name": "Gordon", "given_name": "Basil", "clpid": "Gordon-Basil" } ], "thesis_advisor": [ { "family_name": "Apostol", "given_name": "Tom M.", "clpid": "Apostol-T-M" } ], "thesis_committee": [ { "family_name": "Unknown", "given_name": "Unknown" } ], "local_group": [ { "literal": "div_pma" } ], "abstract": "NOTE: Text or symbols not renderable in plain ASCII are indicated by [...]. Abstract is included in .pdf document.\r\n\r\nLet A(x) be a monotone non-decreasing function of x, and let [...]. It is possible that T(x)~ ax log x, but [...] = 0, [...]. If T(x) = ax log x + 0(x), then [...], [...], but A(x) ~ ax is in general false. If T(x) = ax log x + bx + [...] then A(x) ~ ax.\r\n\r\nThe prime number theorem is the special case A(x) = [...](x).", "doi": "10.7907/952N-ET02", "publication_date": "1956", "thesis_type": "phd", "thesis_year": "1956" } ]