Skip to Main Content

Mathematics of Computation

Published by the American Mathematical Society since 1960 (published as Mathematical Tables and other Aids to Computation 1943-1959), Mathematics of Computation is devoted to research articles of the highest quality in computational mathematics.

ISSN 1088-6842 (online) ISSN 0025-5718 (print)

The 2020 MCQ for Mathematics of Computation is 1.78.

What is MCQ? The Mathematical Citation Quotient (MCQ) measures journal impact by looking at citations over a five-year period. Subscribers to MathSciNet may click through for more detailed information.

 

Salem numbers of negative trace
HTML articles powered by AMS MathViewer

by C. J. Smyth PDF
Math. Comp. 69 (2000), 827-838 Request permission

Abstract:

We prove that, for all $d\geq 4$, there are Salem numbers of degree $2d$ and trace $-1$, and that the number of such Salem numbers is $\gg d/\left ( \log \log d\right ) ^{2}$. As a consequence, it follows that the number of totally positive algebraic integers of degree $d$ and trace $2d-1$ is also $\gg d/\left ( \log \log d\right ) ^{2}$.
References
  • M.-J. Bertin, A. Decomps-Guilloux, M. Grandet-Hugot, M. Pathiaux-Delefosse, and J.-P. Schreiber, Pisot and Salem numbers, Birkhäuser Verlag, Basel, 1992. With a preface by David W. Boyd. MR 1187044, DOI 10.1007/978-3-0348-8632-1
  • David W. Boyd, Small Salem numbers, Duke Math. J. 44 (1977), no. 2, 315–328. MR 453692
  • H. Halberstam and H.-E. Richert, Sieve methods, London Mathematical Society Monographs, No. 4, Academic Press [Harcourt Brace Jovanovich, Publishers], London-New York, 1974. MR 0424730
  • J.F. McKee, P. Rowlinson and C.J. Smyth, Salem numbers and Pisot numbers from stars, in: Number Theory in Progress: Proceedings of the International Conference on Number Theory in Honor of Andrzej Schinzel, held in Zakopane, Poland, June 30–July 9, 1997 (K. Györy, Editor), de Gruyter, Berlin, 1999, Vol. 1, 309–319.
  • D. S. Mitrinović, J. Sándor, and B. Crstici, Handbook of number theory, Mathematics and its Applications, vol. 351, Kluwer Academic Publishers Group, Dordrecht, 1996. MR 1374329
  • Guy Robin, Estimation de la fonction de Tchebychef $\theta$ sur le $k$-ième nombre premier et grandes valeurs de la fonction $\omega (n)$ nombre de diviseurs premiers de $n$, Acta Arith. 42 (1983), no. 4, 367–389 (French). MR 736719, DOI 10.4064/aa-42-4-367-389
  • Raphael M. Robinson, Intervals containing infinitely many sets of conjugate algebraic integers, Studies in mathematical analysis and related topics, Stanford Univ. Press, Stanford, Calif., 1962, pp. 305–315. MR 0144892
  • J. Barkley Rosser and Lowell Schoenfeld, Approximate formulas for some functions of prime numbers, Illinois J. Math. 6 (1962), 64–94. MR 137689
  • Albert Eagle, Series for all the roots of the equation $(z-a)^m=k(z-b)^n$, Amer. Math. Monthly 46 (1939), 425–428. MR 6, DOI 10.2307/2303037
  • Christopher Smyth, Totally positive algebraic integers of small trace, Ann. Inst. Fourier (Grenoble) 34 (1984), no. 3, 1–28 (English, with French summary). MR 762691
  • C.J. Smyth, Cyclotomic factors of reciprocal polynomials and totally positive algebraic integers of small trace, University of Edinburgh preprint, MS96-024, 1996.
  • C.J. Smyth, A Euclidean algorithm for finding the intersection points of plane curves (in preparation).
Similar Articles
  • Retrieve articles in Mathematics of Computation with MSC (1991): 11R06
  • Retrieve articles in all journals with MSC (1991): 11R06
Additional Information
  • C. J. Smyth
  • Affiliation: Department of Mathematics and Statistics, James Clerk Maxwell Building, King’s Buildings, University of Edinburgh, Mayfield Road, Edinburgh, EH9 3JZ, Scotland, UK.
  • MR Author ID: 164180
  • Email: chris@maths.ed.ac.uk
  • Received by editor(s): April 28, 1998
  • Published electronically: March 10, 1999
  • © Copyright 2000 American Mathematical Society
  • Journal: Math. Comp. 69 (2000), 827-838
  • MSC (1991): Primary 11R06
  • DOI: https://doi.org/10.1090/S0025-5718-99-01099-6
  • MathSciNet review: 1648407