Klarner, David A.
Overview
Works:  18 works in 62 publications in 3 languages and 982 library holdings 

Genres:  Puzzles and games Records and correspondence Manuscripts 
Roles:  Author, Editor 
Publication Timeline
.
Most widely held works by
David A Klarner
The mathematical Gardner by
David A Klarner(
Book
)
21 editions published between 1980 and 1992 in 3 languages and held by 879 WorldCat member libraries worldwide
~ T he articles in this book are dedicated to Martin Gardner, the world's greatest expositor and popularizer of mathematics. While our papers are confined to this single subject, Gardner's interests and accomplishments have a wide range of subjects. Hence, we have entitled the book the Mathematical Gardner, and would like to see other volumes such as the Magical, the Literary, the Philosophical, or the Scientific Gardner accompany it. Of course, our title is also an appropriate pun, for Martin Gardner's relationship to the mathematical community is similar to a gardener's relationship to a beautiful flower garden. The contributors to this volume comprise only a small part of a large body of mathematicians whose work has been nurtured by its exposition in "Mathematical Games"; Martin's column which appears every month in Scientific American. More than just a mathematical journalist, Martin connects his readers by passing along problems and information and stimulating creative activity. Thus, he is a force behind the scenes as well as a public figure. Two people were particularly helpful in putting this book together
21 editions published between 1980 and 1992 in 3 languages and held by 879 WorldCat member libraries worldwide
~ T he articles in this book are dedicated to Martin Gardner, the world's greatest expositor and popularizer of mathematics. While our papers are confined to this single subject, Gardner's interests and accomplishments have a wide range of subjects. Hence, we have entitled the book the Mathematical Gardner, and would like to see other volumes such as the Magical, the Literary, the Philosophical, or the Scientific Gardner accompany it. Of course, our title is also an appropriate pun, for Martin Gardner's relationship to the mathematical community is similar to a gardener's relationship to a beautiful flower garden. The contributors to this volume comprise only a small part of a large body of mathematicians whose work has been nurtured by its exposition in "Mathematical Games"; Martin's column which appears every month in Scientific American. More than just a mathematical journalist, Martin connects his readers by passing along problems and information and stimulating creative activity. Thus, he is a force behind the scenes as well as a public figure. Two people were particularly helpful in putting this book together
Mathematical recreations : a collection in honor of Martin Gardner by
David A Klarner(
Book
)
6 editions published in 1998 in English and held by 63 WorldCat member libraries worldwide
6 editions published in 1998 in English and held by 63 WorldCat member libraries worldwide
Selected combinatorial research problems by
Vašek Chvátal(
Book
)
3 editions published in 1972 in English and held by 4 WorldCat member libraries worldwide
Thirtyseven research problems are described, covering a wide range of combinatorial topics. (Author)
3 editions published in 1972 in English and held by 4 WorldCat member libraries worldwide
Thirtyseven research problems are described, covering a wide range of combinatorial topics. (Author)
Asymptotic bounds for the number of convex nominoes by
David A Klarner(
Book
)
3 editions published in 1972 in English and held by 4 WorldCat member libraries worldwide
Unit squares having their vertices at integer points in the Cartesian plane are called cells. A point set equal to a union of n distinct cells which is connected and has no finite cut set is called an nomino. Two nominoes are considered the same if one is mapped onto the other by some translation of the plane. An nomino is convex if all cells in a row or column form a connected strip. Letting c(n) denote the number of different convex nominoes, the authors show that the sequence ((c(n))(sup 1/n): n = 1,2 ...) tends to a limit gamma, and gamma = 2.309138 ... (Author)
3 editions published in 1972 in English and held by 4 WorldCat member libraries worldwide
Unit squares having their vertices at integer points in the Cartesian plane are called cells. A point set equal to a union of n distinct cells which is connected and has no finite cut set is called an nomino. Two nominoes are considered the same if one is mapped onto the other by some translation of the plane. An nomino is convex if all cells in a row or column form a connected strip. Letting c(n) denote the number of different convex nominoes, the authors show that the sequence ((c(n))(sup 1/n): n = 1,2 ...) tends to a limit gamma, and gamma = 2.309138 ... (Author)
Matematičeskij evetnik : sbornik statej i zadač(
Book
)
1 edition published in 1983 in Russian and held by 4 WorldCat member libraries worldwide
1 edition published in 1983 in Russian and held by 4 WorldCat member libraries worldwide
Arithmetic properties of certain recursively defined sets by
David A Klarner(
Book
)
3 editions published in 1972 in English and held by 3 WorldCat member libraries worldwide
3 editions published in 1972 in English and held by 3 WorldCat member libraries worldwide
A Procedure for Improving the Upper Bound for the Number of nOminoes by
David A Klarner(
Book
)
2 editions published in 1972 in English and held by 3 WorldCat member libraries worldwide
An nomino is a plane figure composed of n unit squares joined together along their edges. Every nomino is generated by joining the edge of a unit square to the edge of a unit square in some (n1)omino so that the new square does not overlap any squares. Let t(n) denote the number of nominoes, then it is known that the sequence ((t(n)) (sup 1/n); n = 1,2 ...) increases to a limit theta, and 3.72 <theta <6.75. A procedure exists for computing an increasing sequence of numbers bounded above by theta. (Chandra recently showed that the limit of this sequence is theta.) In the present work the authors give a procedure for computing a sequence of numbers bounded below by theta. Whether or not the limit of this sequence is theta remains an open question. By computing the first ten terms of our sequence, the authors have shown that theta <4.65. (Author)
2 editions published in 1972 in English and held by 3 WorldCat member libraries worldwide
An nomino is a plane figure composed of n unit squares joined together along their edges. Every nomino is generated by joining the edge of a unit square to the edge of a unit square in some (n1)omino so that the new square does not overlap any squares. Let t(n) denote the number of nominoes, then it is known that the sequence ((t(n)) (sup 1/n); n = 1,2 ...) increases to a limit theta, and 3.72 <theta <6.75. A procedure exists for computing an increasing sequence of numbers bounded above by theta. (Chandra recently showed that the limit of this sequence is theta.) In the present work the authors give a procedure for computing a sequence of numbers bounded below by theta. Whether or not the limit of this sequence is theta remains an open question. By computing the first ten terms of our sequence, the authors have shown that theta <4.65. (Author)
Sets generated by iteration of a linear operation by
David A Klarner(
Book
)
3 editions published in 1972 in English and held by 3 WorldCat member libraries worldwide
3 editions published in 1972 in English and held by 3 WorldCat member libraries worldwide
The number of SDR's in certain regular systems by
David A Klarner(
Book
)
3 editions published in 1973 in English and held by 3 WorldCat member libraries worldwide
3 editions published in 1973 in English and held by 3 WorldCat member libraries worldwide
A finite basis theorem revisited by
David A Klarner(
Book
)
2 editions published in 1973 in English and held by 3 WorldCat member libraries worldwide
2 editions published in 1973 in English and held by 3 WorldCat member libraries worldwide
Linear combinations of sets of consecutive integers by
David A Klarner(
Book
)
3 editions published in 1972 in English and held by 3 WorldCat member libraries worldwide
3 editions published in 1972 in English and held by 3 WorldCat member libraries worldwide
Matematičeskij cvetnik : sbornik statej i zadač by
David A Klarner(
Book
)
4 editions published in 1983 in Russian and held by 3 WorldCat member libraries worldwide
4 editions published in 1983 in Russian and held by 3 WorldCat member libraries worldwide
A procedure for improving the upper bound for the number of nominoes by
David A Klarner(
Book
)
3 editions published in 1972 in English and held by 2 WorldCat member libraries worldwide
3 editions published in 1972 in English and held by 2 WorldCat member libraries worldwide
A Finite Basis Theorem Revisited(
Book
)
1 edition published in 1973 in English and held by 1 WorldCat member library worldwide
Let S denote a set of kdimensional boxes each having integral sides. Let gamma(S) denote the set of all boxes which can be filled completely with translates of elements of S. It is shown here that S contains a finite subset B such that Gamma(B) = Gamma(S). This result was proved for k = 1,2 in an earlier paper, but the proof for k> 2 contained an error. (Author)
1 edition published in 1973 in English and held by 1 WorldCat member library worldwide
Let S denote a set of kdimensional boxes each having integral sides. Let gamma(S) denote the set of all boxes which can be filled completely with translates of elements of S. It is shown here that S contains a finite subset B such that Gamma(B) = Gamma(S). This result was proved for k = 1,2 in an earlier paper, but the proof for k> 2 contained an error. (Author)
Papers by
Jerry Slocum(
)
in English and held by 1 WorldCat member library worldwide
Collection consists of the papers of Jerry Slocum and the Slocum Puzzle Foundation
in English and held by 1 WorldCat member library worldwide
Collection consists of the papers of Jerry Slocum and the Slocum Puzzle Foundation
Linear Combinations of Sets of Consecutive Integers(
Book
)
1 edition published in 1972 in English and held by 1 WorldCat member library worldwide
Let k1,m(1) ..., m(k) denote nonnegative integers, and suppose the greatest common divisor of m(1) ..., m(k) is 1. The authors show that if S(1) ..., S(k) are sufficiently long blocks of consecutive integers, then the set m(1)S(1)+ ... +m(k)S(k) contains a sizeable block of consecutive integers.. (Author)
1 edition published in 1972 in English and held by 1 WorldCat member library worldwide
Let k1,m(1) ..., m(k) denote nonnegative integers, and suppose the greatest common divisor of m(1) ..., m(k) is 1. The authors show that if S(1) ..., S(k) are sufficiently long blocks of consecutive integers, then the set m(1)S(1)+ ... +m(k)S(k) contains a sizeable block of consecutive integers.. (Author)
Sets Generated by Iteration of a Linear Operation(
Book
)
1 edition published in 1972 in English and held by 1 WorldCat member library worldwide
1 edition published in 1972 in English and held by 1 WorldCat member library worldwide
more
fewer
Audience Level
0 

1  
Kids  General  Special 
Related Identities
Useful Links
Associated Subjects
Coffin, Stewart T Combinatorial geometry Combinatorial set theory Conway, John H.(John Horton) Diaconis, Persi Gardner, Martin, Geometry, Plane Guy, Richard K Iterative methods (Mathematics) Jay, Ricky Knuth, Donald Ervin, Linear systems Mathematical recreations Matrices Number theory Puzzles PuzzlesCollectors and collecting Recursive functions Rubik's Cube Schattschneider, Doris Set theory Shortz, Will, Slocum, Jerry Trigg, Charles W Ulam, Stanislaw M