Melvyn B. Nathanson

3.1k total citations
139 papers, 1.4k citations indexed

About

Melvyn B. Nathanson is a scholar working on Computational Theory and Mathematics, Geometry and Topology and Discrete Mathematics and Combinatorics. According to data from OpenAlex, Melvyn B. Nathanson has authored 139 papers receiving a total of 1.4k indexed citations (citations by other indexed papers that have themselves been cited), including 52 papers in Computational Theory and Mathematics, 51 papers in Geometry and Topology and 46 papers in Discrete Mathematics and Combinatorics. Recurrent topics in Melvyn B. Nathanson's work include Limits and Structures in Graph Theory (40 papers), Analytic Number Theory Research (33 papers) and Mathematics and Applications (23 papers). Melvyn B. Nathanson is often cited by papers focused on Limits and Structures in Graph Theory (40 papers), Analytic Number Theory Research (33 papers) and Mathematics and Applications (23 papers). Melvyn B. Nathanson collaborates with scholars based in United States, Hungary and Israel. Melvyn B. Nathanson's co-authors include Imre Z. Ruzsa, Anatolij A. Karatsuba, Noga Alon, Andrew Granville, József Solymosi, P. Erdös, György Elekes, Paul Erdős, Andràs Sárközy and D. V. Chudnovsky and has published in prestigious journals such as Annals of the New York Academy of Sciences, Lecture notes in mathematics and Transactions of the American Mathematical Society.

In The Last Decade

Melvyn B. Nathanson

114 papers receiving 1.2k citations

Peers

Melvyn B. Nathanson
Curtis Greene United States
J. Pintz Hungary
L. N. Vaserstein United States
N. J. Fine United States
Igor Pak United States
Lowell Schoenfeld United States
Melvyn B. Nathanson
Citations per year, relative to Melvyn B. Nathanson Melvyn B. Nathanson (= 1×) peers Imre Z. Ruzsa

Countries citing papers authored by Melvyn B. Nathanson

Since Specialization
Citations

This map shows the geographic impact of Melvyn B. Nathanson's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Melvyn B. Nathanson with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Melvyn B. Nathanson more than expected).

Fields of papers citing papers by Melvyn B. Nathanson

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Melvyn B. Nathanson. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Melvyn B. Nathanson. The network helps show where Melvyn B. Nathanson may publish in the future.

Co-authorship network of co-authors of Melvyn B. Nathanson

This figure shows the co-authorship network connecting the top 25 collaborators of Melvyn B. Nathanson. A scholar is included among the top collaborators of Melvyn B. Nathanson based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Melvyn B. Nathanson. Melvyn B. Nathanson is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Nathanson, Melvyn B. & David A. Ross. (2024). Continuity of the roots of a polynomial. Communications in Algebra. 52(6). 2509–2518.
2.
Nathanson, Melvyn B.. (2015). Pairs of Matrices in GL 2 (R ≥0 ) That Freely Generate. American Mathematical Monthly. 122(8). 790–792. 2 indexed citations
3.
Nathanson, Melvyn B.. (2013). On the Fractional Parts of Roots of Positive Real Numbers. American Mathematical Monthly. 120(5). 409–429.
4.
Granville, Andrew, Melvyn B. Nathanson, & József Solymosi. (2007). Additive Combinatorics. 58 indexed citations
5.
Nathanson, Melvyn B.. (2004). Unusual Applications of Number Theory. 8 indexed citations
6.
Nathanson, Melvyn B.. (1995). Inverse theorems for subset sums. Transactions of the American Mathematical Society. 347(4). 1409–1418. 15 indexed citations
7.
Nathanson, Melvyn B. & Andràs Sárközy. (1989). On the Maximum Density of Minimal Asymptotic Bases. Proceedings of the American Mathematical Society. 105(1). 31–31.
8.
Nathanson, Melvyn B. & Andràs Sárközy. (1989). On the maximum density of minimal asymptotic bases. Proceedings of the American Mathematical Society. 105(1). 31–31. 3 indexed citations
9.
Nathanson, Melvyn B.. (1988). Simultaneous systems of representatives for families of finite sets. Proceedings of the American Mathematical Society. 103(4). 1322–1326. 3 indexed citations
10.
Nathanson, Melvyn B.. (1988). Simultaneous Systems of Representatives for Families of Finite Sets. Proceedings of the American Mathematical Society. 103(4). 1322–1322. 2 indexed citations
11.
Nathanson, Melvyn B.. (1980). Sumsets of measurable sets. Proceedings of the American Mathematical Society. 78(1). 59–63. 1 indexed citations
13.
Nathanson, Melvyn B.. (1978). Representation Functions of Sequences in Additive Number Theory. Proceedings of the American Mathematical Society. 72(1). 16–16. 2 indexed citations
14.
Nathanson, Melvyn B.. (1978). Multiplication rules for polynomials. Proceedings of the American Mathematical Society. 69(2). 210–212. 3 indexed citations
15.
Nathanson, Melvyn B.. (1978). Representation functions of sequences in additive number theory. Proceedings of the American Mathematical Society. 72(1). 16–20. 15 indexed citations
16.
Nathanson, Melvyn B.. (1975). Linear recurrences and uniform distribution. Proceedings of the American Mathematical Society. 48(2). 289–289. 5 indexed citations
17.
Nathanson, Melvyn B.. (1975). Linear Recurrences and Uniform Distribution. Proceedings of the American Mathematical Society. 48(2). 289–289. 2 indexed citations
18.
Nathanson, Melvyn B.. (1975). An Algorithm for Partitions. Proceedings of the American Mathematical Society. 52(1). 121–121.
19.
Nathanson, Melvyn B.. (1975). An algorithm for partitions. Proceedings of the American Mathematical Society. 52(1). 121–124. 1 indexed citations
20.
Nathanson, Melvyn B.. (1974). Approximation by Continued Fractions. Proceedings of the American Mathematical Society. 45(3). 323–323.

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Rankless by CCL
2026