Integer Partitions

Integer Partitions

EnglishHardbackPrint on demand
Andrews, George E.
Cambridge University Press
EAN: 9780521841184
Print on demand
Delivery on Thursday, 16. of July 2026
CZK 4,104
Common price CZK 4,560
Discount 10%
pc
Do you want this product today?
Megabooks Praha Korunní
not available
Librairie Francophone Praha Štěpánská
not available
Megabooks Ostrava
not available
Megabooks Olomouc
not available
Megabooks Plzeň
not available
Megabooks Brno
not available
Megabooks Hradec Králové
not available
Megabooks České Budějovice
not available
Megabooks Liberec
not available

Detailed information

The theory of integer partitions is a subject of enduring interest. A major research area in its own right, it has found numerous applications, and celebrated results such as the Rogers-Ramanujan identities make it a topic filled with the true romance of mathematics. The aim in this introductory textbook is to provide an accessible and wide ranging introduction to partitions, without requiring anything more of the reader than some familiarity with polynomials and infinite series. Many exercises are included, together with some solutions and helpful hints. The book has a short introduction followed by an initial chapter introducing Euler's famous theorem on partitions with odd parts and partitions with distinct parts. This is followed by chapters titled: Ferrers Graphs, The Rogers-Ramanujan Identities, Generating Functions, Formulas for Partition Functions, Gaussian Polynomials, Durfee Squares, Euler Refined, Plane Partitions, Growing Ferrers Boards, and Musings.
EAN 9780521841184
ISBN 0521841186
Binding Hardback
Publisher Cambridge University Press
Publication date October 11, 2004
Pages 152
Language English
Dimensions 229 x 152 x 13
Country United Kingdom
Authors Andrews, George E.; Eriksson Kimmo
Illustrations Worked examples or Exercises
Manufacturer information
The manufacturer's contact information is currently not available online, we are working intensively on the axle. If you need information, write us on [email protected], we will be happy to provide it.