Stan Wagon

According to our database1, Stan Wagon authored at least 24 papers between 1977 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Problems and Solutions.
Am. Math. Mon., September, 2024

2022
Problems and Solutions.
Am. Math. Mon., 2022

2021
Littlewood polynomials, spectral-null codes, and equipowerful partitions.
Math. Comput., 2021

2019
A Paradox Arising from the Elimination of a Paradox.
Am. Math. Mon., 2019

2018
The Mensa Correctional Institute.
Am. Math. Mon., 2018

2017
Properties, proved and conjectured, of Keller, Mycielski, and queen graphs.
Ars Math. Contemp., 2017

2016
Round Formulas for Exponential Polynomials and the Incomplete Gamma Function.
Integers, 2016

2015
Laceable knights.
Ars Math. Contemp., 2015

2014
Repeatedly Appending Any Digit to Generate Composite Numbers.
Am. Math. Mon., 2014

2012
Review: In Pursuit of the Traveling Salesman. Princeton University Press, Princeton, NJ, 2012 xiii + 228 pp., ISBN 978-0-691-15270-7, $27.95. by William J. Cook.
Am. Math. Mon., 2012

Drilling for Polygons.
Am. Math. Mon., 2012

2011
How to lose as little as possible.
Ars Math. Contemp., 2011

2008
Venn Symmetry and Prime Numbers: A Seductive Proof Revisited.
Am. Math. Mon., 2008

2006
Vom Lösen numerischer Probleme - Ein Streifzug entlang der SIAM 10x10-Digit Challenge.
Springer, ISBN: 978-3-540-34114-7, 2006

2005
Faster Algorithms for Frobenius Numbers.
Electron. J. Comb., 2005

2004
The SIAM 100-Digit Challenge - A study in High-Accuracy Numerical Computing.
SIAM, ISBN: 978-0-89871-561-3, 2004

2002
A machine resolution of a four-color hoax.
Proceedings of the 14th Canadian Conference on Computational Geometry, 2002

2001
The Gaussian Zoo.
Exp. Math., 2001

2000
Rhombic Penrose Tilings Can be 3-Colored.
Am. Math. Mon., 2000

1994
When are subset sums equidistributed modulo m?
Electron. J. Comb., 1994

1993
The Banach-Tarski paradox.
Cambridge University Press, ISBN: 978-0-521-45704-0, 1993

1980
A bound on the chromatic number of graphs without certain induced subgraphs.
J. Comb. Theory B, 1980

1978
Infinite triangulated graphs.
Discret. Math., 1978

1977
On Splitting Stationary Subsets of Large Cardinals.
J. Symb. Log., 1977


  Loading...