Combinatorial Mathematics VIII
Author : K. L. McAvaney
Publisher : Springer
Page : 377 pages
File Size : 16,45 MB
Release : 2006-11-14
Category : Mathematics
ISBN : 3540387927
Author : K. L. McAvaney
Publisher : Springer
Page : 377 pages
File Size : 16,45 MB
Release : 2006-11-14
Category : Mathematics
ISBN : 3540387927
Author : D. A. Holton
Publisher : Springer
Page : 364 pages
File Size : 20,14 MB
Release : 2006-11-15
Category : Mathematics
ISBN : 3540357025
Author : E. J. Billington
Publisher : Springer
Page : 459 pages
File Size : 13,11 MB
Release : 2006-11-15
Category : Mathematics
ISBN : 3540393757
Author : A. F. Horadam
Publisher : Springer
Page : 219 pages
File Size : 45,10 MB
Release : 2007-01-05
Category : Mathematics
ISBN : 3540348573
Author : R. W. Robinson
Publisher : Springer
Page : 270 pages
File Size : 49,6 MB
Release : 2006-11-15
Category : Mathematics
ISBN : 354038376X
Author : C. H. C. Little
Publisher : Springer
Page : 224 pages
File Size : 29,82 MB
Release : 2006-11-15
Category : Mathematics
ISBN : 354037020X
Author : L. R. A. Casse
Publisher : Springer
Page : 431 pages
File Size : 22,25 MB
Release : 2006-11-14
Category : Mathematics
ISBN : 3540386947
Author : Ralph P. Grimaldi
Publisher : Addison Wesley Publishing Company
Page : 880 pages
File Size : 32,51 MB
Release : 1993-10-01
Category : Combinatorial analysis
ISBN : 9780201600445
Author : Bruce E. Sagan
Publisher : American Mathematical Soc.
Page : 304 pages
File Size : 31,24 MB
Release : 2020-10-16
Category : Education
ISBN : 1470460327
This book is a gentle introduction to the enumerative part of combinatorics suitable for study at the advanced undergraduate or beginning graduate level. In addition to covering all the standard techniques for counting combinatorial objects, the text contains material from the research literature which has never before appeared in print, such as the use of quotient posets to study the Möbius function and characteristic polynomial of a partially ordered set, or the connection between quasisymmetric functions and pattern avoidance. The book assumes minimal background, and a first course in abstract algebra should suffice. The exposition is very reader friendly: keeping a moderate pace, using lots of examples, emphasizing recurring themes, and frankly expressing the delight the author takes in mathematics in general and combinatorics in particular.
Author :
Publisher : Elsevier
Page : 401 pages
File Size : 18,81 MB
Release : 2011-08-26
Category : Mathematics
ISBN : 0080867693
Combinatorial Mathematics, Optimal Designs, and Their Applications