Item Successfully Added to Cart
An error was encountered while trying to add the item to the cart. Please try again.
OK
Please make all selections above before adding to cart
OK

Mathematics of Computation

Digital content for 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 2024 MCQ for Mathematics of Computation is 1.78.
Contents of Volume 95, Number 362
HTML articles powered by AMS MathViewer
Articles in press
Papers are displayed alphabetically by first author listed
Early View PDF articles are an AMS member benefit
  • On Galois inertial types of elliptic curves over $\mathbb {Q}_p$
    Primary MSC: 11G07, 11F70; Secondary MSC: 11G07, 11F70
    Math. Comp.
    DOI: https://doi.org/10.1090/mcom/4107
  • Erratum to “The reciprocal sums of pseudoprimes and Carmichael numbers”
    Primary MSC: 11N25, 11N37
    Math. Comp.
    DOI: https://doi.org/10.1090/mcom/4122
  • Bohr sets generated by polynomials and Coppersmith’s method in many variables
    Primary MSC: 11J71, 11L07, 11Y16, 68Q25
    Math. Comp.
    DOI: https://doi.org/10.1090/mcom/4001
  • Algebraic norm and $p$-class group capitulations in totally ramified cyclic $p$-extensions
    Primary MSC: 11R29, 11R18, 11R37, 12Y05
    Math. Comp.
    DOI: https://doi.org/10.1090/mcom/3920
  • Fully-discrete cell entropy inequality of third-order explicit Runge-Kutta discontinuous Galerkin method for nonlinear conservation laws
    Primary MSC: 65M60, 65M12
    Math. Comp.
    DOI: https://doi.org/10.1090/mcom/4242
  • Box progressions, abelian power-free morphisms and a sieving for the template method
    Primary MSC: 68R15, 68R05, 11B25
    Math. Comp.
    DOI: https://doi.org/10.1090/mcom/4246
  • Fast numerical approximation of linear, second-order hyperbolic problems using model order reduction and the Laplace transform
    Primary MSC: 35L05, 65M12, 65Y20, 44A10
    Math. Comp.
    DOI: https://doi.org/10.1090/mcom/4226
  • A geometric framework for stochastic iterations
    Primary MSC: 47N10, 90C15, 90C48, 47J26, 62L20
    Math. Comp.
    DOI: https://doi.org/10.1090/mcom/4230
  • On decomposability and subdifferential of the tensor nuclear norm
    Primary MSC: 15A60, 15A69, 62B10, 68Q25, 90C25
    Math. Comp.
    DOI: https://doi.org/10.1090/mcom/4240
  • Decomposing a factorial into large factors
    Primary MSC: 11A51
    Math. Comp.
    DOI: https://doi.org/10.1090/mcom/4249
  • Asymptotic numerical hypocoercivity of the space-time discontinuous Galerkin method for Kolmogorov equation
    Primary MSC: 65N30, 78M10, 65N15
    Math. Comp.
    DOI: https://doi.org/10.1090/mcom/4261
  • Constructive quasi-uniform sequences over triangles
    Primary MSC: 52C17; Secondary MSC: 52C17
    Math. Comp.
    DOI: https://doi.org/10.1090/mcom/4259
  • Structure-preserving local discontinuous Galerkin discretization of conformational conversion systems
    Primary MSC: 65M60, 65M12, 35K57, 35Q92
    Math. Comp.
    DOI: https://doi.org/10.1090/mcom/4256
  • Numerical computations concerning Landau-Siegel zeros
    Primary MSC: 11M20; Secondary MSC: 11M20
    Math. Comp.
    DOI: https://doi.org/10.1090/mcom/4268
  • Interpolated drift implicit Euler MLMC method for barrier option pricing and application to CIR and CEV models
    Primary MSC: 60H10, 60H35, 65C05, 65C30, 33C15, 41A60
    Math. Comp.
    DOI: https://doi.org/10.1090/mcom/4262
  • On the quasi-uniformity properties of quasi-Monte Carlo point sets and sequences–Part II: Digital nets and sequences
    Primary MSC: 05B40, 11K36, 11K45, 52C15, 52C17
    Math. Comp.
    DOI: https://doi.org/10.1090/mcom/4263
  • On dense tetrahedra in binary sphere packings
    Primary MSC: 52C17, 65G30, 68V05
    Math. Comp.
    DOI: https://doi.org/10.1090/mcom/4265
  • Sufficient conditions for strong discrete maximum principles in finite element solutions of linear and semilinear elliptic equations
    Primary MSC: 65N30
    Math. Comp.
    DOI: https://doi.org/10.1090/mcom/4270
  • The computation of higher order Alexander invariants
    Primary MSC: 57K10; Secondary MSC: 57K10
    Math. Comp.
    DOI: https://doi.org/10.1090/mcom/4271
  • Convergence analysis of a stochastic interacting particle-field algorithm for 3D parabolic-parabolic Keller-Segel systems
    Primary MSC: 35K51, 65C05, 65M12, 65M75, 65T50
    Math. Comp.
    DOI: https://doi.org/10.1090/mcom/4276
  • On canonical roots of fractional ideals
    Primary MSC: 11Y16; Secondary MSC: 11Y16
    Math. Comp.
    DOI: https://doi.org/10.1090/mcom/4273
  • Stability of the variable two-step BDF scheme for parabolic equations under a sharp ratio condition
    Primary MSC: 65M06, 35B65
    Math. Comp.
    DOI: https://doi.org/10.1090/mcom/4275
  • Comparing Galois representations in the residually reducible case
    Primary MSC: 11F80, 11Y40; Secondary MSC: 11F80, 11Y40
    Math. Comp.
    DOI: https://doi.org/10.1090/mcom/4274
  • An adaptive delaminating Levin method in two dimensions
    Primary MSC: 65D30, 65N35
    Math. Comp.
    DOI: https://doi.org/10.1090/mcom/4272
  • The Hessian of elliptic curves as a Lattès map
    Primary MSC: 14H52, 37P05; Secondary MSC: 14H52, 37P05
    Math. Comp.
    DOI: https://doi.org/10.1090/mcom/4277
  • A wave front tracking scheme for flux reconstruction in $2 \times 2$ hyperbolic conservation laws
    Primary MSC: 35L65, 35R30, 65M32
    Math. Comp.
    DOI: https://doi.org/10.1090/mcom/4278
  • Computing with necklaces on elliptic curves
    Primary MSC: 11G05, 11G18, 11Y99
    Math. Comp.
    DOI: https://doi.org/10.1090/mcom/4279
Recently published articles
HTML articles powered by AMS MathViewer
Articles are published on the AMS website individually soon after proof is returned from authors and before appearing in an issue (most recently published article listed first).

Contents of Volume 54, Number 189
HTML articles powered by AMS MathViewer
On an integer’s infinitary divisors
HTML articles powered by AMS MathViewer
Math. Comp. 54 (1990), 395-411
DOI: https://doi.org/10.1090/S0025-5718-1990-0993927-5
Abstract
The notions of unitary divisor and biunitary divisor are extended in a natural fashion to give k-ary divisors, for any natural number k. We show that we may sensibly allow k to increase indefinitely, and this leads to infinitary divisors. The infinitary divisors of an integer are described in full, and applications to the obvious analogues of the classical perfect and amicable numbers and aliquot sequences are given.

Enhancements:

Retrieve articles in Mathematics of Computation with MSC : 11A25(opens in a new tab), 11A05(opens in a new tab)
Retrieve articles in all journals with MSC : 11A25(opens in a new tab), 11A05(opens in a new tab)

  • Graeme L. Cohen
  • © Copyright 1990 American Mathematical Society
  • Journal: Math. Comp. 54 (1990), 395-411
  • MSC: Primary 11A25; Secondary 11A05
  • DOI: https://doi.org/10.1090/S0025-5718-1990-0993927-5
  • MathSciNet review: 993927

Editorial Board Past Editorial Board Members

 
  • Editorial Committee

  • Susanne C. Brenner
    Center for Computation & Technology and
    Department of Mathematics
    Louisiana State University
  • Michael J. Mossinghoff
    Center for Communications Research
    Princeton
  • Michael J. Neilan
    Managing Editor
    Department of Mathematics
    University of Pittsburgh
  • Valeria Simoncini
    Dipartimento di Matematica
    Università di Bologna
  • Associate Editors

  • Paola F. Antonietti
    Dipartimento di Matematica
    Politecnico di Milano
  • Markus Bachmayr
    Institut für Geometrie und Praktische Mathematik
    RWTH Aachen
  • Jennifer Balakrishnan
    Department of Mathematics and Statistics
    Boston University
  • Soren Bartels
    Department of Applied Mathematics
    Albert-Ludwigs-University
  • Laurent Bartholdi
    Institut Camille Jordan
    Université Claude Bernard Lyon 1
  • Ernesto G. Birgin
    Department of Computer Science
    University of São Paulo
  • Martin Burger
    Department Mathematik
    Friedrich-Alexander-Universität Erlangen-Nürnberg
  • Coralia Cartis
    Mathematical Institute
    University of Oxford
  • Elena Celledoni
    Department of Mathematical Sciences
    Norwegian University of Science and Technology
  • Théophile Chaumont-Frelet
    Inria and Laboratoire Paul Painlevé
    University of Lille
  • Alan Demlow
    Department of Mathematics
    Texas A&M University
  • Alicia Dickenstein
    Departamento de Matemática, FCEN
    University of Buenos Aires
  • Virginie Ehrlacher
    CERMICS
    Ecole Nationale des Ponts et Chaussées
  • Patrick Farrell
    Mathematical Institute 
    University of Oxford
  • Kevin Hare
    Department of Pure Mathematics 
    University of Waterloo
  • Lili Ju
    Department of Mathematics
    University of South Carolina
  • Manuel Kauers
    Institute for Algebra
    Johannes Kepler University
  • Jurgen Kluners
    Department of Mathematics
    Paderborn University
  • Frances Kuo
    University of New South Wales
  • Frédéric Lagoutière
    Institut Camille Jordan
    Université Lyon 1 Claude Bernard
  • Buyang Li
    Department of Applied Mathematics 
    The Hong Kong Polytechnic University
  • Fengyan Li
    Department of Mathematical Sciences 
    Rensselaer Polytechnic University
  • Jens Markus Melenk
    Institute of Analysis and Scientific Computing
    Technische Universität Wien
  • Steffen Müller
    Bernoulli Institute for Mathematics, Computer Science and Artificial Intelligence
    University of Groningen
  • Houman Owhadi
    Department of Computing and Mathematical Sciences
    California Institute of Technology
  • Daniel Peterseim
    Institute of Mathematics 
    University of Augsburg
  • Robert Scheichl
    Institute for Applied Mathematics
    University of Heidelberg 
  • Thomas D. Trogdon
    Department of Applied Mathematics
    University of Washington
  • Timothy Trudgian
    Department of Mathematics
    University of New South Wales

The editorial office for Mathematics of Computation can be contacted by email or by postal mail to the Electronic PrePress Department, American Mathematical Society, 201 Charles Street, Providence, RI 02904-2213 USA.

Submission

All articles submitted to this journal are peer-reviewed. Mathematics of Computation has a single anonymous process in which the reviewers know who the authors of the manuscript are, but the authors do not have access to the information on who the peer reviewers are. The AMS uses Centralized Manuscript Processing for initial submissions to AMS journals. The preferred method of submission is to upload a PDF file using the Initial Manuscript Submission form.  Authors are limited to three submissions to Mathematics of Computation within any 12-month period. 

An alternate method is to send one copy of the paper to the following address:

Centralized Manuscript Processing
MATHEMATICS OF COMPUTATION
201 Charles Street
Providence, Rhode Island
02904-2213 USA

If a paper copy is being forwarded to the AMS, the following information is required with the submission (note that all contact information, particularly email addresses, must be supplied to avoid delay):

  • Name of the journal to which the paper is submitted
  • Name of the corresponding author
  • Contact information including email address and mailing address
  • The author should suggest an appropriate Editor to review the paper

No paper that has been previously published, or is being considered for publication elsewhere, should be submitted to the American Mathematical Society, nor may a paper that is under consideration by the American Mathematical Society be submitted elsewhere.

Included with the footnotes to the paper should be the 2020 Mathematics Subject Classification representing the primary and secondary subjects of the article. 

The AMS Author Resource Center provides TeX Resources, the AMS Style Guide, the Mathematics Subject Classification, and further useful tools for preparing your manuscript. Journal abbreviations used in bibliographies are available for download.

After Acceptance

Once a paper has been accepted for publication, authors should follow the online Submission Instructions.

All authors must submit the Consent to Publish. All authors must agree regarding the Copyright Agreement. If the article is to be published in one of the AMS Open Access journals, authors must agree which Creative Commons License will be selected. Authors are encouraged to use AMS-prepared style files in preparing their papers.

Useful Tools

An abstract is required. It must be brief, reasonably self-contained, and not exceed 300 words. The AMS offers free worldwide access to the electronic abstracts. 

  • Abstracts, references (with links to MathSciNet), and bibliographic information are freely viewable for every article.
  • Free Digital Archive: Full article PDFs in all volumes older than five years are available electronically free of charge.
  • A current active subscription to the electronic version of this journal is required to view article PDFs in all volumes published within the last five years. Subscribe here.(opens in a new tab)
Share this page via the icons above, or by copying the link below:
Copy To Clipboard
Successfully Copied!
Please select which format for which you are requesting permissions.