Polyominoes will delight not only students and teachers of mathematics at all levels, but will be appreciated by anyone who likes a good geometric challenge. There are no prerequisites. If you like jigsaw puzzles, or if you hate jigsaw puzzles but have ever wondered about the pattern of some floor tiling, there is much here to interest you. A polyomino is a shape cut along the lines from square graph paper; the pronunciation of polyomino begins as does polygon and ends as does domino. Tilings, also called tessellations of mosaic patterns, are older than civilization itself. Tiling with polyominoes provides challenges that range from the popular jigsaw-like puzzles to easily understood mathematical research problems. You will find unsolved puzzles and problems of both kinds here. Answers are provided for most of the problems that have known solutions. It is only fair to repeat here the warning stated in the preface to this book, "Playing with polyominoes can be habit forming."

For professional mathematicians and amateurs seeking further challenge, the author offers a host of new problems that remain to be solved.

This book is a reference for librarians, mathematicians, and statisticians involved in college and research level mathematics and statistics in the 21st century. We are in a time of transition in scholarly communications in mathematics, practices which have changed little for a hundred years are giving way to new modes of accessing information. Where journals, books, indexes and catalogs were once the physical representation of a good mathematics library, shelves have given way to computers, and users are often accessing information from remote places. Part I is a historical survey of the past 15 years tracking this huge transition in scholarly communications in mathematics. Part II of the book is the bibliography of resources recommended to support the disciplines of mathematics and statistics. These are grouped by type of material. Publication dates range from the 1800's onwards. Hundreds of electronic resources-some online, both dynamic and static, some in fixed media, are listed among the paper resources. Amazingly a majority of listed electronic resources are free.

The 7th International Conference on Embedded and Multimedia Computing (EMC-12), will be held in Gwangju, Korea on September 6 - 8, 2012. EMC-12 will be the most comprehensive conference focused on the various aspects of advances in Embedded and Multimedia (EM) Computing. EMC-12 will provide an opportunity for academic and industry professionals to discuss the latest issues and progress in the area of EM. In addition, the conference will publish high quality papers which are closely related to the various theories and practical applications in EM. Furthermore, we expect that the conference and its publications will be a trigger for further related research and technology improvements in this important subject. The EMC-12 is the next event, in a series of highly successful International Conference on Embedded and Multimedia Computing, previously held as EMC 2011 (China, Aug. 2011), EMC 2010 (Philippines, Aug. 2010), EM-Com 2009 (Korea, Dec. 2009), UMC-08 (Australia, Oct. 2008), ESO-08(China, Dec. 2008), UMS-08 (Korea, April, 2008), UMS-07(Singapore, Jan. 2007), ESO-07(Taiwan, Dec. 2007), ESO-06(Korea, Aug. 2006).

The problem of counting the number of self-avoiding polygons on a square grid, - therbytheirperimeterortheirenclosedarea,is aproblemthatis soeasytostate that, at ?rst sight, it seems surprising that it hasn’t been solved. It is however perhaps the simplest member of a large class of such problems that have resisted all attempts at their exact solution. These are all problems that are easy to state and look as if they should be solvable. They include percolation, in its various forms, the Ising model of ferromagnetism, polyomino enumeration, Potts models and many others. These models are of intrinsic interest to mathematicians and mathematical physicists, but can also be applied to many other areas, including economics, the social sciences, the biological sciences and even to traf?c models. It is the widespread applicab- ity of these models to interesting phenomena that makes them so deserving of our attention. Here however we restrict our attention to the mathematical aspects. Here we are concerned with collecting together most of what is known about polygons, and the closely related problems of polyominoes. We describe what is known, taking care to distinguish between what has been proved, and what is c- tainlytrue,but has notbeenproved. Theearlierchaptersfocusonwhatis knownand on why the problems have not been solved, culminating in a proof of unsolvability, in a certain sense. The next chapters describe a range of numerical and theoretical methods and tools for extracting as much information about the problem as possible, in some cases permittingexactconjecturesto be made.

The Handbook of Discrete and Computational Geometry is intended as a reference book fully accessible to nonspecialists as well as specialists, covering all major aspects of both fields. The book offers the most important results and methods in discrete and computational geometry to those who use them in their work, both in the academic world—as researchers in mathematics and computer science—and in the professional world—as practitioners in fields as diverse as operations research, molecular biology, and robotics. Discrete geometry has contributed significantly to the growth of discrete mathematics in recent years. This has been fueled partly by the advent of powerful computers and by the recent explosion of activity in the relatively young field of computational geometry. This synthesis between discrete and computational geometry lies at the heart of this Handbook. A growing list of application fields includes combinatorial optimization, computer-aided design, computer graphics, crystallography, data analysis, error-correcting codes, geographic information systems, motion planning, operations research, pattern recognition, robotics, solid modeling, and tomography.

Keeping students involved and actively learning is challenging. Instructors in computer science are aware of the cognitive value of modelling puzzles and often use logical puzzles as an efficient pedagogical instrument to engage students and develop problem-solving skills. This unique book is a comprehensive resource that offers teachers and students fun activities to teach and learn logic. It provides new, complete, and running formalisation in Propositional and First Order Logic for over 130 logical puzzles, including Sudoku-like puzzles, zebra-like puzzles, island of truth, lady and tigers, grid puzzles, strange numbers, or self-reference puzzles. Solving puzzles with theorem provers can be an effective cognitive incentive to motivate students to learn logic. They will find a ready-to-use format which illustrates how to model each puzzle, provides running implementations, and explains each solution. This concise and easy-to-follow textbook is a much-needed support tool for students willing to explore beyond the introductory level of learning logic and lecturers looking for examples to heighten student engagement in their computer science courses.

Martin Gardner's Mathematical Games columns in Scientific American inspired and entertained several generations of mathematicians and scientists. Gardner in his crystal-clear prose illuminated corners of mathematics, especially recreational mathematics, that most people had no idea existed. His playful spirit and inquisitive nature invite the reader into an exploration of beautiful mathematical ideas along with him. These columns were both a revelation and a gift when he wrote them; no one--before Gardner--had written about mathematics like this. They continue to be a marvel. This volume, first published in 1966, contains columns originally published from 1959-1961. This is the 1995 MAA edition and contains an extensive postscript and bibliography from Gardner updating the columns.

Tiling theory provides a wonderful opportunity to illustrate both the beauty and utility of mathematics. It has all the relevant ingredients: there are stunning pictures; open problems can be stated without having to spend months providing the necessary background; and there are both deep mathematics and applications. Furthermore, tiling theory happens to be an area where many of the sub-fields of mathematics overlap. Tools can be applied from linear algebra, algebra, analysis, geometry, topology, and combinatorics. As such, it makes for an ideal capstone course for undergraduates or an introductory course for graduate students. This material can also be used for a lower-level course by skipping the more technical sections. In addition, readers from a variety of disciplines can read the book on their own to find out more about this intriguing subject. This book covers the necessary background on tilings and then delves into a variety of fascinating topics in the field, including symmetry groups, random tilings, aperiodic tilings, and quasicrystals. Although primarily focused on tilings of the Euclidean plane, the book also covers tilings of the sphere, hyperbolic plane, and Euclidean 3-space, including knotted tilings. Throughout, the book includes open problems and possible projects for students. Readers will come away with the background necessary to pursue further work in the subject.