MARC Record from marc_columbia

LEADER: 03655cam a2200613Mi 4500
001 15408526
005 20210607151848.0
006 m o d
007 cr |||||||||||
008 171023s2017 xx go 000 0 eng d
035 $a(OCoLC)on1012136958
035 $a(NNC)15408526
040 $aNLE$beng$erda$cNLE$dOCLCO$dOCLCQ$dUKMGB$dTYFRS$dOCLCO
015 $aGBB7O8134$2bnb
016 7 $a018571991$2Uk
020 $a1351467506$q(EPUB)
020 $a9781351467506$q(EPUB)
020 $a9781315137131$q(electronic bk.)
020 $a1315137135$q(electronic bk.)
020 $a9781351467490$q(electronic bk. : Mobipocket)
020 $a1351467492$q(electronic bk. : Mobipocket)
020 $a9781351467513$q(electronic bk. : PDF)
020 $a1351467514$q(electronic bk. : PDF)
035 $a(OCoLC)1012136958
037 $a9781351467506$bIngram Content Group
037 $a9781315137131$bTaylor & Francis
050 4 $aQA164
072 7 $aMAT$x000000$2bisacsh
072 7 $aMAT$x036000$2bisacsh
072 7 $aPBV$2bicssc
082 04 $a511/.6$220
049 $aZCUA
100 1 $aGodsil, C. D.$q(Christopher David),$d1949-
245 10 $aAlgebraic combinatorics /$cC.D. Godsil.
264 1 $a[Place of publication not identified] :$bRoutledge,$c2017.
300 $a1 online resource (368 pages).
336 $atext$btxt$2rdacontent
337 $acomputer$bc$2rdamedia
338 $aonline resource$bcr$2rdacarrier
490 1 $aChapman and Hall mathematics
505 0 $aThe matchings polynomial -- The characteristic polynomial -- Formal power series and generating functions -- Walk generating functions -- Quotients of graphs -- Matchings and walks -- Pfaffians -- Orthogonal polynomials -- Moment sequences -- Strongly regular graphs -- Distance-regular graphs -- Association schemes -- Representations of distance-regular graphs -- Polynomial spaces -- Q-polynomial spaces -- Tight designs.
520 $aThis graduate level text is distinguished both by the range of topics and the novelty of the material it treats--more than half of the material in it has previously only appeared in research papers. The first half of this book introduces the characteristic and matchings polynomials of a graph. It is instructive to consider these polynomials together because they have a number of properties in common. The matchings polynomial has links with a number of problems in combinatorial enumeration, particularly some of the current work on the combinatorics of orthogonal polynomials. This connection is discussed at some length, and is also in part the stimulus for the inclusion of chapters on orthogonal polynomials and formal power series. Many of the properties of orthogonal polynomials are derived from properties of characteristic polynomials. The second half of the book introduces the theory of polynomial spaces, which provide easy access to a number of important results in design theory, coding theory and the theory of association schemes. This book should be of interest to second year graduate text/reference in mathematics.
650 0 $aCombinatorial analysis.
650 6 $aAnalyse combinatoire.
650 7 $aCombinatorial analysis.$2fast$0(OCoLC)fst00868961
650 7 $aKombinatorische Analysis$2gnd
650 17 $aCombinatieleer.$2gtt
650 7 $aAnalyse combinatoire.$2ram
650 7 $aMATHEMATICS / General$2bisacsh
650 7 $aMATHEMATICS / Combinatorics$2bisacsh
655 4 $aElectronic books.
830 0 $aChapman & Hall mathematics.
856 40 $uhttp://www.columbia.edu/cgi-bin/cul/resolve?clio15408526$zTaylor & Francis eBooks
852 8 $blweb$hEBOOKS