1 citations · 1 across the 3 of their papers we have counts for
5 papers
Unknotted cycles
Christopher R. Cornwell, Nathan McNew
Noting that cycle diagrams of permutations visually resemble grid diagrams used to depict knots and links in topology, we consider the knot (or link) obtained from the cycle diagra…
On the Erdős primitive set conjecture in function fields
Andrés Gómez-Colunga, Charlotte Kavaler, Nathan McNew +1
Erdős proved that converges for any primitive set of integers and later conjectured this sum is maximized when is the se…
On the size of primitive sets in function fields
Andrés Gómez-Colunga, Charlotte Kavaler, Nathan McNew +1
A set is primitive if no element of the set divides another. We consider primitive sets of monic polynomials over a finite field and find natural generalizations of many of the res…
Counting pattern-avoiding integer partitions
Jonathan Bloom, Nathan McNew
A partition is said to contain another partition (or pattern) if the Ferrers board for is attainable from under removal of rows and columns. We say avoids i…
Popular values of the largest prime divisor function
Nathan McNew
We consider the distribution of the largest prime divisor of the integers in the interval , and investigate in particular the mode of this distribution, the prime number(s)…