Stan Wagon

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

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2024

Problems and Solutions.

Daniel H. Ullman, Daniel J. Velleman, Stan Wagon, Douglas B. West

Am. Math. Mon., 2024

2022

Problems and Solutions.

Daniel H. Ullman, Daniel J. Velleman, Stan Wagon

Am. Math. Mon., 2022

2021

Littlewood polynomials, spectral-null codes, and equipowerful partitions.

Joe Buhler, Shahar Golan, Rob Pratt, Stan Wagon

Math. Comput., 2021

2019

A Paradox Arising from the Elimination of a Paradox.

Alan D. Taylor, Stan Wagon

Am. Math. Mon., 2019

2018

The Mensa Correctional Institute.

Larry Carter, Stan Wagon

Am. Math. Mon., 2018

2017

Properties, proved and conjectured, of Keller, Mycielski, and queen graphs.

Witold Jarnicki, Wendy J. Myrvold, Peter W. Saltzman, Stan Wagon

Ars Math. Contemp., 2017

2016

Round Formulas for Exponential Polynomials and the Incomplete Gamma Function.

Stan Wagon

Integers, 2016

2015

Laceable knights.

Michael Dupuis, Stan Wagon

Ars Math. Contemp., 2015

2014

Repeatedly Appending Any Digit to Generate Composite Numbers.

Jon Grantham, Witold Jarnicki, John Rickert, Stan Wagon

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.

Stan Wagon

Am. Math. Mon., 2012

Drilling for Polygons.

Barry J. Cox, Stan Wagon

Am. Math. Mon., 2012

2011

How to lose as little as possible.

Vittorio Addona, Stan Wagon, Herbert S. Wilf

Ars Math. Contemp., 2011

2008

Venn Symmetry and Prime Numbers: A Seductive Proof Revisited.

Stan Wagon, Peter Webb

Am. Math. Mon., 2008

2006

Vom Lösen numerischer Probleme - Ein Streifzug entlang der SIAM 10x10-Digit Challenge.

Folkmar Bornemann, Dirk Laurie, Stan Wagon, Jörg Waldvogel

Springer, ISBN: 978-3-540-34114-7, 2006

2005

Faster Algorithms for Frobenius Numbers.

Dale Beihoffer, Jemimah Hendry, Albert Nijenhuis, Stan Wagon

Electron. J. Comb., 2005

2004

The SIAM 100-Digit Challenge - A study in High-Accuracy Numerical Computing.

Folkmar Bornemann, Dirk Laurie, Stan Wagon, Jörg Waldvogel

SIAM, ISBN: 978-0-89871-561-3, 2004

2002

A machine resolution of a four-color hoax.

Stan Wagon

Proceedings of the 14th Canadian Conference on Computational Geometry, 2002

2001

The Gaussian Zoo.

John Renze, Stan Wagon, Brian Wick

Exp. Math., 2001

2000

Rhombic Penrose Tilings Can be 3-Colored.

Tom Sibley, Stan Wagon

Am. Math. Mon., 2000

1994

When are subset sums equidistributed modulo m?

Stan Wagon, Herbert S. Wilf

Electron. J. Comb., 1994

1993

The Banach-Tarski paradox.

Stan Wagon

Cambridge University Press, ISBN: 978-0-521-45704-0, 1993

1980

A bound on the chromatic number of graphs without certain induced subgraphs.

Stanley Wagon

J. Comb. Theory, Ser. B, 1980

1978

Infinite triangulated graphs.

Stanley Wagon

Discret. Math., 1978

1977

On Splitting Stationary Subsets of Large Cardinals.

James E. Baumgartner, Alan D. Taylor, Stanley Wagon

J. Symb. Log., 1977