The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Contemporary Mathematics
Abstract
A bound of the number of reduced Arakelov divisors of a number field Takao Watanabe and Ryusuke Yoshimitsu Abstract. Recently, Schoof introduced the notion of reduced Arakelov divi-sors of an algebraic number field. In this paper, we give both lower and upper bounds of the number of reduced Arakelov divisors.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Functional Analysis, Sobolev Spaces and Partial Differential Equations
Brézis, H. (2010) · Springer eBooks · doi:10.1007/978-0-387-70914-7 · Cited by 5,821
Weak convergence of the sequence of successive approximations for nonexpansive mappings
Opial, Z. (1967) · Bulletin of the American Mathematical Society · doi:10.1090/s0002-9904-1967-11761-0 · Cited by 2,340
Nonpositive Curvature: Geometric and Analytic Aspects
Jost, J. (1997) · Birkhäuser Basel eBooks · doi:10.1007/978-3-0348-8918-6 · Cited by 295
Cited by
Diffusion‐tensor MRI: theory, experimental design and data analysis – a technical review
Basser, P. J., & Jones, D. K. (2002) · NMR in Biomedicine · doi:10.1002/nbm.783 · Cited by 1,478
Speeding the Pollard and elliptic curve methods of factorization
Montgomery, P. L. (1987) · Mathematics of Computation · doi:10.1090/s0025-5718-1987-0866113-7 · Cited by 1,218
A roadmap for the computation of persistent homology
Otter, N., Porter, M. A., Tillmann, U., Grindrod, P., & Harrington, H. A. (2017) · EPJ Data Science · doi:10.1140/epjds/s13688-017-0109-5 · Cited by 760
The geometric phase in molecular systems
Mead, C. A. (1992) · Reviews of Modern Physics · doi:10.1103/revmodphys.64.51 · Cited by 613
Meakin, P., & Tartakovsky, A. M. (2009) · Reviews of Geophysics · doi:10.1029/2008rg000263 · Cited by 425
Robins, J. M., & Tsiatis, A. A. (1991) · Communications in Statistics - Theory and Methods · doi:10.1080/03610929108830654 · Cited by 423
Meshfree Methods: Progress Made after 20 Years
Chen, J.-S., Hillman, M., & Chi, S.-W. (2017) · Journal of Engineering Mechanics · doi:10.1061/(asce)em.1943-7889.0001176 · Cited by 420
Loda: Lightweight on-line detector of anomalies
Pevný, T. (2016) · Machine Learning · doi:10.1007/s10994-015-5521-0 · Cited by 357
Distinguishing Separable and Entangled States
Doherty, A. C., Parrilo, P. A., & Spedalieri, F. M. (2002) · Physical Review Letters · doi:10.1103/physrevlett.88.187904 · Cited by 352
Quantum graphs: Applications to quantum chaos and universal spectral statistics
Gnutzmann∥, S., & Smilansky, U. (2006) · Advances in Physics · doi:10.1080/00018730600908042 · Cited by 346
A Critical Assessment of Coupled Cluster Method in Quantum Chemistry
Paldus, J., & Li, X. (1999) · Advances in Chemical Physics · doi:10.1002/9780470141694.ch1 · Cited by 282
Algorithm 806: SPRNG: a scalable library for pseudorandom number generation
Mascagni, M., & Srinivasan, A. (2000) · ACM Transactions on Mathematical Software · doi:10.1145/358407.358427 · Cited by 275
Gorin, G., Fang, M., Chari, T., & Pachter, L. (2022) · PLOS Computational Biology · doi:10.1371/journal.pcbi.1010492 · Cited by 186
Measurement reduction in variational quantum algorithms
Zhao, A., Tranter, A., Kirby, W. M., Ung, S. F., Miyake, A., & Love, P. J. (2020) · Physical Review A · doi:10.1103/physreva.101.062322 · Cited by 121
“Our code was then used to generate Jordan–Wigner and Bravyi–Kitaev Hamiltonians, which were divided into anticommuting subsets using the NetworkX Python package [64] and the greedy independent sets strategy [58].”
BackgroundMethodImproving the mathematics preparation of elementary teachers, one lesson at a time
Berk, D., & Hiebert, J. (2009) · Teachers and Teaching · doi:10.1080/13540600903056692 · Cited by 53
Metadata
- Venue
- The American Mathematical Monthly
- Publisher
- JSTOR
- Published
- 1961-08
- Volume
- 68
- Issue
- 7
- Pages
- 666
- ISSN
- 0002-9890 (ISSN-L)
- OpenAlex
- W2183676805
- Cited by
- 872
- References
- 3
- FWCI
- 0.00
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.