Zobrazeno 1 - 10
of 22
pro vyhledávání: '"Paul K. Stockmeyer"'
Autor:
Paul K. Stockmeyer
Publikováno v:
The Mathematics of Various Entertaining Subjects
This chapter discusses one of the great classics of recreational math—the Tower of Hanoi. The Tower of Hanoi was introduced in 1883 by Le Professeur N. Claus (de Siam), Mandarin du College Li-Sou-Stian. He was later revealed to be French mathematic
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4a62f0654a63cbaafa73a3e4d4242dca
https://doi.org/10.2307/j.ctt1s4773q.8
https://doi.org/10.2307/j.ctt1s4773q.8
Autor:
Paul K. Stockmeyer, Ciril Petr, Daniele Parisse, Thierry Bousch, Andreas M. Hinz, Sandi Klavžar
Publikováno v:
Discrete Mathematics, Algorithms and Applications
Discrete Mathematics, Algorithms and Applications, World Scientific Publishing, 2019, 11 (04), pp.1950049. ⟨10.1142/S1793830919500496⟩
Discrete Mathematics, Algorithms and Applications, World Scientific Publishing, 2019, 11 (04), pp.1950049. ⟨10.1142/S1793830919500496⟩
International audience; Providing the example of a disc whose number of moves performed in a minimal solution for the Tower of Hanoi problem is not a power of two, we show that the argument given in an article by R. Demontis in this journal is false
Autor:
Paul K. Stockmeyer
Publikováno v:
Math Horizons. 21:8-11
(2013). Of Camels, Inheritance, and Unit Fractions. Math Horizons: Vol. 21, No. 1, pp. 8-11.
Autor:
Patrick J. Rodriguez, Cyrus R. Eyster, Matthew T. Harrison, Joseph R. Simmons, Paul K. Stockmeyer, James W. Clark, Nicholas A. Loehr, C. Douglass Bateman
Publikováno v:
International Journal of Computer Mathematics. 59:37-47
We examine a variation of the famous Tower of Hanoi puzzle posed but not solved in a 1944 paper by Scorer et al. [5]. In this variation, disks of adjacent sizes can be exchanged, provided that they are at the top of their respective stacks. We presen
Autor:
Paul K. Stockmeyer, David C. Banks
Publikováno v:
Mathematics and Visualization ISBN: 9783540250760
Mathematical Foundations of Scientific Visualization, Computer Graphics, and Massive Data Exploration
Mathematical Foundations of Scientific Visualization, Computer Graphics, and Massive Data Exploration
We describe how to determine the number of cases that arise in visualization al- gorithms such as Marching Cubes by applying the deBruijn extension of Polya counting. This technique constructs a polynomial, using the cycle index, encoding the case co
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2d1b4d31ef77c27093bb9e5fc751cd09
https://doi.org/10.1007/b106657_4
https://doi.org/10.1007/b106657_4
Publikováno v:
Discrete Mathematics. 94(3):209-219
Every sequence of length n determines (nk) subsequences of length k. We investigate the relationship between such subsequences and the original sequence. In particular, we show that for n>;7 and k⩾[n/2] the subsequences uniquely determine the origi
Autor:
Paul K. Stockmeyer
Publikováno v:
Journal of Graph Theory. 62:199-200
Autor:
Paul K. Stockmeyer
Publikováno v:
The College Mathematics Journal. 35:103-104
Paul K. Stockmeyer (stockmeyer@cs.wm.edu) received his B.A. degree from Earlham College, and his graduate degrees from the University of Michigan, all in Mathematics. He has been teaching at the College of William and Mary since 1971, where he has be
Autor:
Paul K. Stockmeyer
Publikováno v:
Math Horizons. 12:23-23
Publikováno v:
The American Mathematical Monthly. 107:370