×


 x 

Shopping cart
Anthony J. . Ed(S): Guttmann - Polygons, Polyominoes and Polycubes - 9781402099267 - V9781402099267
Stock image for illustration purposes only - book cover, edition or condition may vary.

Polygons, Polyominoes and Polycubes

€ 67.35
FREE Delivery in Ireland
Description for Polygons, Polyominoes and Polycubes Hardback. This unique book gives a comprehensive account of new mathematical tools used to solve polygon problems. Chapters describe particular aspects of the polygon problem, and applications to biology, to surface phenomena and to computer enumeration methods. Editor(s): Guttmann, Anthony J. Series: Lecture Notes in Physics. Num Pages: 509 pages, biography. BIC Classification: PBKS; PBV; PBWR; PN; PSA; UYAM. Category: (P) Professional & Vocational. Dimension: 235 x 155 x 25. Weight in Grams: 925.
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 ... Read more

Product Details

Format
Hardback
Publication date
2009
Publisher
Springer-Verlag New York Inc. United States
Number of pages
509
Condition
New
Series
Lecture Notes in Physics
Number of Pages
490
Place of Publication
New York, NY, United States
ISBN
9781402099267
SKU
V9781402099267
Shipping Time
Usually ships in 15 to 20 working days
Ref
99-15

Reviews for Polygons, Polyominoes and Polycubes

Goodreads reviews for Polygons, Polyominoes and Polycubes


Subscribe to our newsletter

News on special offers, signed editions & more!