default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPaul Pollack
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
[j23]Paul Pollack:
Z[-5]: Halfway to Unique Factorization. Am. Math. Mon. 131(8): 712-717 (2024)- 2023
- [j22]Sergei Konyagin, Paul Pollack:
A problem in comparative order theory. Period. Math. Hung. 86(1): 24-36 (2023) - 2021
- [j21]Paul Pollack, Enrique Treviño:
Sums of Proper Powers. Am. Math. Mon. 128(1): 40 (2021) - [j20]Paul Pollack, Noah Snyder
:
A Quick Route to Unique Factorization in Quadratic Orders. Am. Math. Mon. 128(6): 554-558 (2021) - 2019
- [j19]William Banks, Paul Pollack, Carl Pomerance:
Symmetric Primes Revisited. Integers 19: A54 (2019) - [j18]Paul Pollack, Peter Schorn:
Dirichlet's proof of the three-square theorem: An algorithmic perspective. Math. Comput. 88(316): 1007-1019 (2019) - 2018
- [j17]Paul Pollack, Enrique Treviño:
Finding the Four Squares in Lagrange's Theorem. Integers 18A: A15 (2018) - [j16]Leo Goldmakher, Paul Pollack:
Refinements of Lagrange's Four-Square Theorem. Am. Math. Mon. 125(3): 258-263 (2018) - 2017
- [j15]U. Caner Cengiz, Paul Pollack, Enrique Treviño:
Counting perfect polynomials. Finite Fields Their Appl. 47: 242-255 (2017) - 2015
- [j14]Paul Pollack:
Palindromic Sums of Proper Divisors. Integers 15A: A13 (2015) - [j13]Paul Pollack:
An Easy Generalization of Euler's Theorem on the Series of Prime Reciprocals. Am. Math. Mon. 122(2): 159-163 (2015) - [j12]Paul Pollack, Joseph Vandehey:
Besicovitch, Bisection, and the Normality of 0.(1)(4)(9)(16)(25) ... Am. Math. Mon. 122(8): 757-765 (2015) - 2014
- [j11]Paul Pollack, Enrique Treviño:
The Primes that Euclid Forgot. Am. Math. Mon. 121(5): 433-437 (2014) - 2013
- [j10]Paul Pollack:
Irreducible polynomials with several prescribed coefficients. Finite Fields Their Appl. 22: 70-78 (2013) - [j9]Greg Martin, Paul Pollack:
The average least character non-residue and further variations on a theme of Erdős. J. Lond. Math. Soc. 87(1): 22-42 (2013) - 2012
- [j8]Paul Pollack, Carl Pomerance:
Prime-Perfect Numbers. Integers 12A: A14 (2012) - [j7]Paul Pollack:
Finiteness Theorems for Perfect Numbers and Their Kin. Am. Math. Mon. 119(8): 670-681 (2012) - 2011
- [j6]Paul Pollack:
Values of the Euler and Carmichael Functions Which Are Sums of Three Squares. Integers 11: A13 (2011) - [j5]Paul Pollack:
Perfect Numbers With Identical Digits. Integers 11A: Article18 (2011) - [j4]Paul Pollack:
On Polynomial Rings with a Goldbach Property. Am. Math. Mon. 118(1): 71-77 (2011) - [j3]Paul Pollack:
On Dickson's Theorem Concerning Odd Perfect Numbers. Am. Math. Mon. 118(2): 161-164 (2011) - 2010
- [j2]Paul Pollack:
Revisiting Gauss's analogue of the prime number theorem for polynomials over a finite field. Finite Fields Their Appl. 16(4): 290-299 (2010) - 2008
- [j1]Luis H. Gallardo, Paul Pollack, Olivier Rahavandrainy:
On a conjecture of Beard, O'Connell and West concerning perfect polynomials. Finite Fields Their Appl. 14(1): 242-249 (2008)
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 2025-01-09 13:07 CET 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:
