词条 | David A. Klarner |
释义 |
| name = David A. Klarner | birth_name = David Anthony Klarner | image = | caption = Left to Right: David Klarner, George Pólya, Nicolaas Govert de Bruijn in March 1973 | image_size = 250px | birth_date = {{birth date|1940|10|10}} | birth_place = Fort Bragg, California | residence = | nationality = American | death_date = {{death date and age|1999|3|20|1940|10|10}} | death_place = Eureka, California | field = Mathematics | work_institutions = University of Calgary | alma_mater = University of Alberta | doctoral_advisor = John W. Moon | doctoral_students = Jean Scholtz | thesis_title = On some combinatorial and probabilistic aspects of bipartite graphs | thesis_url = | thesis_year = | known_for = Combinatorics Klarner's Theorem[1] Klarner-Rado Sequence[2] Recreational mathematics | prizes = | footnotes = | website = }}David Anthony Klarner (October 10, 1940{{spaced ndash}}March 20, 1999) was an American mathematician, author, and educator. He is known for his work in combinatorial enumeration, polyominoes,[1] and box-packing.[2][5][3] Klarner was a friend and correspondent of mathematics popularizer Martin Gardner and frequently made contributions to Gardner's Mathematical Games column in Scientific American.[7] He edited a book honoring Gardner on the occasion of his 65th birthday.[4][9] Gardner in turn dedicated his twelfth collection of mathematical games columns to Klarner.[5] Beginning in 1969 Klarner made significant contributions to the theory of combinatorial enumeration, especially focusing on polyominoes[6] and box-packing.[7][8] Working with Ronald L. Rivest he found upper bounds on the number of n-ominoes.[2] Klarner's Theorem is the statement that an m by n rectangle can be packed with 1-by-x rectangles if and only if x divides one of m and n.[9][10] He has also published important results in group theory[11] and number theory, in particular working on the Collatz conjecture (sometimes called the 3x + 1 problem).[12] The Klarner-Rado Sequence is named after Klarner and Richard Rado.[13] BiographyKlarner was born in Fort Bragg, California, and spent his childhood in Napa, California.[14] He married Kara Lynn Klarner in 1961. Their son Carl Eoin Klarner was born on April 21, 1969.[15] Klarner did his undergraduate work at Humboldt State University (1960–63), got his Ph.D. at the University of Alberta (1963–66), and did post-doctoral work at McMaster University in Hamilton, Ontario (1966–68). He also did post-doctoral work at Eindhoven University of Technology in the Netherlands (1968-1970), at the University of Reading in England working with Richard Rado (1970–71),[16] and at Stanford University (1971–73). He served as an assistant professor at Binghamton University (1973–79) and was a visiting professor at Humboldt State University in California (1979–80). He returned to Eindhoven as a professor (1980–81), and to Binghamton (1981–82). From 1982 to 1996 he was a professor of computer science at the University of Nebraska, at Lincoln, with a one-year break at Eindhoven in academic year 1991-92. He retired to Eureka, California in 1997 and died there in 1999.[14] He was a frequent contributor to recreational mathematics and worked with many key mathematics popularizers including Ronald L. Rivest, John H. Conway, Richard K. Guy, Donald Coxeter, Ronald Graham, and Donald Knuth.[17][4][18][6] Organizations and awardsKlarner was a member of the Association for Computing Machinery, the American Mathematical Society, the Mathematical Association of America, and the Fibonacci Association.[14] He was awarded a National Science Foundation Fellowship Award in mathematics in 1963.[19] In 1986 Klarner received a University of Nebraska-Lincoln Distinguished Teaching Award in Computer Science.[20] The David A. Klarner Fellowship for Computer Science was set up after Klarner's death by Spyros Magliveras a fellow professor in Computer Science at UNL.[21] Bibliography
Selected publicationsBooks
Papers
References1. ^[https://www3.amherst.edu/~nstarr/trom/intro.html The Tromino Puzzle] by Norton Starr 2. ^1 [https://people.csail.mit.edu/rivest/pubs/KR73.pdf A procedure for improving the upper bound for the number of n-ominoes], by D. A. Klarner and R. L. Rivest, Can. J. Math., Vol. XXV, No. 3, 1973, pp. 5 3. ^A Finite Basis Theorem Revisited by David A. Klarner, Stanford University, Department of Computer Science, Report Number: CS-TR-73-338, February 1973 4. ^1 Gardner Tribute Books The Mathematical Gardner, edited by David A. Klarner "It was quietly assembled behind the scenes, with the assistance of Ron Graham and Don Knuth, as a surprise for Martin to mark his announced retirement from his Scientific American column." 5. ^[https://books.google.com/books?id=cU3NBQAAQBAJ&pg=PA221&lpg=PA221&dq=klarner+thane&source=bl&ots=xy4isTBanR&sig=ztRkIE8WT56G62kX3g-mCzwtxXQ&hl=en&sa=X&ved=0ahUKEwic-fff7tvTAhUIOyYKHQOKDKYQ6AEIODAE#v=onepage&q=klarner&f=false A lifetime of puzzles : a collection of puzzles in honor of Martin Gardner's 90th birthday] edited by Erik D Demaine, Martin L Demaine, and Tom Rodgers, Publisher: Wellesley, Massachusetts : A K Peters, Ltd. (2008), p. 346, {{ISBN|1568812450}} 6. ^1 [https://books.google.com/books?id=ZfK7AQAAQBAJ&pg=PT31&lpg=PT31&dq=John+conway+david+klarner&source=bl&ots=kNm7ZsbJpB&sig=dKIGdPNLAJkp1_8cqeNmxw-uHQc&hl=en&sa=X&ved=0ahUKEwjktZf6oNbVAhXHbiYKHWXyAwAQ6AEIKDAA#v=onepage&q=John%20conway%20david%20klarner&f=false Another Fine Math You've Got Me Into. . .], By Ian Stewart, Dover Publications (January 15, 2004), p. 21, {{ISBN|0486431819}} 7. ^Packing a rectangle with congruent n-ominoes Journal of Combinatorial Theory, Vol. 7, Issue 2, September 1969, Pages 107-115 8. ^1 Klarner systems and tiling boxes with polyominoes by Michael Reid, Journal of Combinatorial Theory, Series A, Vol. 111, Issue 1, July 2005, Pages 89-105 9. ^1 Mathematical Gems Vol. 2, by Ross Honsberger The Mathematical Association of America: The Dolciani Mathematical Expositions, p. 88, 1976. 10. ^{{mathworld|urlname=KlarnersTheorem|title=Klarner's Theorem}} 11. ^A sufficient condition for certain semigroups to be free by David A Klarner, Journal of Algebra, Vol 74, Issue 1, January 1982, Pages 140-148 12. ^[https://www.jstor.org/stable/10.4169/amer.math.monthly.123.8.753?seq=1#page_scan_tab_contents Erdős, Klarner, and the 3x + 1 Problem] by Jeffrey C. Lagarias, The American Mathematical Monthly, Vol. 123, No. 8, October 2016, pp. 753-776" [This paper describes work of Erdős, Klarner, and Rado on semigroups of integer affine maps and on sets of integers they generate. It gives the history of problems they studied, some solutions, and new unsolved problems that arose from them."] 13. ^1 [https://archive.lib.msu.edu/crcmath/math/math/k/k083.htm Klarner-Rado Sequence] Michigan State University, MSU Librarie 14. ^1 2 3 [https://asc.ucalgary.ca/node/83 University of Calgary: Archives and Special Collections: David A. Klarner] 15. ^Carl is a Political Scientist, receiving tenure at Indiana State University and currently working at the University of Florida as a research associate. 16. ^Arithmetic properties of certain recursively defined sets by D. A. Klarner and R. Rado, Stanford University: Computer Science Department, March 1972 17. ^Election Integrity, Past, Present and Future Caltech/MIT Voting Technology Project, Participants’ Biographies 18. ^The Penrose Tiling at Miami University by David Kullman, Presented at the Mathematical Association of America Ohio Section Meeting Shawnee State University, October 24, 1997 19. ^[https://www.nsf.gov/pubs/1963/annualreports/ar_1963_appendix_e.pdf Fellowship Awards Offered ] National Science Foundation 1963 20. ^University of Nebraska-Lincoln Distinguished Teaching Awards: Past Recipients 21. ^David A. Klarner Fellowship for Computer Science University of Nebraska–Lincoln: Scholarships & Aid 22. ^1 Reprinted in 1998 as Mathematical Recreations: A Collection in Honor of Martin Gardner (Dover; {{ISBN|0-486-40089-1}}), this book, edited by Klarner, was the tribute of the mathematical community to Gardner when he retired from writing his Scientific American column in 1981. Discreetly assembled for the occasion, the stature of the mathematicians submitting papers is a testament to Gardner's importance. 23. ^This is a 2016 revision by Barequet of the chapter of the same title originally written by Klarner for the first edition, and revised by Golomb for the second edition. External links
14 : Mathematics popularizers|Recreational mathematicians|20th-century American mathematicians|Humboldt State University alumni|University of Alberta alumni|McMaster University alumni|Eindhoven University of Technology faculty|Binghamton University faculty|University of Calgary faculty|University of Nebraska faculty|Number theorists|Combinatorial game theorists|1940 births|1999 deaths |
随便看 |
|
开放百科全书收录14589846条英语、德语、日语等多语种百科知识,基本涵盖了大多数领域的百科知识,是一部内容自由、开放的电子版国际百科全书。