default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDScott T. Chapman
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j22]Nicholas R. Baeth, Scott T. Chapman:
The Importance of Being Prime ⋆ , a Nontrivial Generalization for Nonunique Factorizations. Am. Math. Mon. 130(10): 893-914 (2023)- 2021
- [j21]Scott T. Chapman, Felix Gotti
, Marly Gotti:
When Is a Puiseux Monoid Atomic? Am. Math. Mon. 128(4): 302-321 (2021)
2010 – 2019
- 2019
- [j20]Scott T. Chapman:
So What Is Class Number 2? Am. Math. Mon. 126(4): 330-339 (2019) - 2018
- [j19]Scott T. Chapman:
What Happens When the Division Algorithm "Almost" Works. Am. Math. Mon. 125(7): 643-647 (2018) - 2017
- [j18]Scott T. Chapman, Joseph A. Gallian:
From the Guest Editors. Am. Math. Mon. 124(9): 771 (2017) - 2016
- [j17]Scott T. Chapman:
Editor's End Notes. Am. Math. Mon. 123(5): 515-516 (2016) - [j16]Scott T. Chapman:
A Letter From the Editor: Jonathan M. Borwein (1951-2016). Am. Math. Mon. 123(9): 847-848 (2016) - [j15]Scott T. Chapman:
A Letter from the Editor: The Long and Winding Road. Am. Math. Mon. 123(10): 955-958 (2016) - 2015
- [j14]Scott T. Chapman:
A Letter from the Editor: 2015 is the Centennial Year of the MAA. Am. Math. Mon. 122(1): 3 (2015) - [j13]Jonathan M. Borwein, Scott T. Chapman:
I Prefer Pi: A Brief History and Anthology of Articles in the American Mathematical Monthly. Am. Math. Mon. 122(3): 195-216 (2015) - [j12]Jonathan M. Borwein, Scott T. Chapman:
I Prefer Pi: Addenda. Am. Math. Mon. 122(8): 800 (2015) - [j11]Scott T. Chapman:
Editor's Endnotes. Am. Math. Mon. 122(10): 1023-1025 (2015) - 2014
- [j10]Scott T. Chapman, Nathan Kaplan, Tyler Lemburg, Andrew Niles, Christina Zlogar:
Shifts of generators and delta sets of numerical monoids. Int. J. Algebra Comput. 24(5): 655-670 (2014) - [j9]Scott T. Chapman:
A Letter from the Editor: What's In a Color? Am. Math. Mon. 121(1): 3-4 (2014) - 2012
- [j8]David F. Anderson, Scott T. Chapman:
On Bounding Measures of primeness in integral Domains. Int. J. Algebra Comput. 22(5) (2012) - [j7]Scott T. Chapman, William W. Smith:
Erdős-Zaks all divisor sets. Period. Math. Hung. 64(2): 227-246 (2012) - 2011
- [j6]Paul Baginski, Scott T. Chapman:
Factorizations of Algebraic Integers, Block Monoids, and Additive Number Theory. Am. Math. Mon. 118(10): 901-920 (2011)
2000 – 2009
- 2006
- [j5]Scott T. Chapman, Pedro A. García-Sánchez, David Llena, José Carlos Rosales:
Presentations of finitely generated cancellative commutative monoids and nonnegative solutions of systems of linear equations. Discret. Appl. Math. 154(14): 1947-1959 (2006) - 2004
- [j4]Paul Baginski, Scott T. Chapman, Kathryn McDonald, Lara Pudwell:
On Cross Numbers Of Minimal Zero Sequences In Certain Cyclic Groups. Ars Comb. 70 (2004) - 2002
- [j3]Scott T. Chapman, Juan Ignacio García-García, Pedro A. García-Sánchez, José Carlos Rosales:
On the number of factorizations of an element in an atomic monoid. Adv. Appl. Math. 29(3): 438-453 (2002)
1990 – 1999
- 1999
- [j2]Scott T. Chapman, Michael Freeze, William W. Smith:
Minimal zero-sequences and the strong Davenport constant. Discret. Math. 203(1-3): 271-277 (1999) - 1996
- [j1]Scott T. Chapman, Alfred Geroldinger:
On cross numbers of minimal zero sequences. Australas. J Comb. 14: 85-92 (1996)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:08 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
