• Publications
  • Influence
The Banach-Tarski paradox
  • S. Wagon
  • Mathematics, Computer Science
  • 1 August 1987
This chapter shows how tilings of the hyperbolic plane can help us visualize the Banach—Tarski paradox. Expand
The SIAM 100-Digit Challenge - A study in High-Accuracy Numerical Computing
A flea starts at (0, 0) on the infinite 2-D integer lattice and executes a biased random walk: at each step it hops north or south with probability 1/4, east with probability 2/4 + , and west with probability1/4 − . Expand
Old And New Unsolved Problems In Plane Geometry And Number Theory
Victor Klee and Stan Wagon discuss some of the unsolved problems in number theory and geometry, many of which can be understood by readers with a very modest mathematical background. The presentationExpand
A Stroll Through the Gaussian Primes
THE MOAT PROBLEM. One cannot walk to infinity on the real line if one uses steps of bounded length and steps on the prime numbers. This is simply a restatement of the classic result that there areExpand
Mathematica in action
This guide to the extraordinary capabilities of Mathematica in Action includes many detailed programs with line-by-line explanations, valuable shortcuts, and alternative methods to generate--three dimensional graphics, iterative graphics, and animations. Expand
Structural properties of ideals
CONTENTSPreface.............................................................................................. 5Chapter I.Expand
Faster Algorithms for Frobenius Numbers
Two main new methods are introduced, one based on breadthrst search and another that uses the number theory and combinatorial structure inherent in the problem to speed up the Dijkstra approach. Expand
A bound on the chromatic number of graphs without certain induced subgraphs
  • S. Wagon
  • Computer Science, Mathematics
  • J. Comb. Theory, Ser. B
  • 1 December 1980
A (polynomial) bound on the chromatic number is obtained in terms of the maximum size of a complete subgraph, for graphs not having n · K 2 as an induced subgraph. Expand
On Splitting Stationary Subsets of Large Cardinals
Let K denote a regular uncountable cardinal and NS the normal ideal of nonstationary subsets of K. Our results concern the well-known open question whether NS fails to be K '-saturated, i.e., areExpand