top

  Info

  • Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.

  Info

  • Utilizzare questo link per rimuovere la selezione effettuata.

Biblioteca

MARC Lista (tabellare)
Beautiful mathematics / / Martin Erickson [[electronic resource]]
Beautiful mathematics / / Martin Erickson [[electronic resource]]
Autore Erickson Martin J. <1963->
Pubbl/distr/stampa Washington : , : Mathematical Association of America, , 2011
Descrizione fisica 1 online resource (xiii, 177 pages) : digital, PDF file(s)
Disciplina 510
Collana Spectrum series
Soggetto topico Mathematics
ISBN 1-61444-509-5
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Imaginative words -- Intriguing images -- Captivating formulas -- Delightful theorems -- Pleasing proofs -- Elegant solutions -- Creative problems -- Harmonious foundations -- Eye-opening explorations.
Record Nr. UNINA-9910790362503321
Erickson Martin J. <1963->  
Washington : , : Mathematical Association of America, , 2011
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Beautiful mathematics / / Martin Erickson [[electronic resource]]
Beautiful mathematics / / Martin Erickson [[electronic resource]]
Autore Erickson Martin J. <1963->
Pubbl/distr/stampa Washington : , : Mathematical Association of America, , 2011
Descrizione fisica 1 online resource (xiii, 177 pages) : digital, PDF file(s)
Disciplina 510
Collana Spectrum series
Soggetto topico Mathematics
ISBN 1-61444-509-5
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Imaginative words -- Intriguing images -- Captivating formulas -- Delightful theorems -- Pleasing proofs -- Elegant solutions -- Creative problems -- Harmonious foundations -- Eye-opening explorations.
Record Nr. UNINA-9910826525803321
Erickson Martin J. <1963->  
Washington : , : Mathematical Association of America, , 2011
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Introduction to combinatorics / / Martin J. Erickson
Introduction to combinatorics / / Martin J. Erickson
Autore Erickson Martin J. <1963->
Edizione [Second edition.]
Pubbl/distr/stampa Hoboken, New Jersey : , : Wiley, , 2013
Descrizione fisica 1 online resource (410 p.)
Disciplina 511/.6
Collana Wiley Series in Discrete Mathematics and Optimization
Soggetto topico Combinatorial analysis
Soggetto genere / forma Electronic books.
ISBN 1-118-64021-7
1-118-63758-5
Classificazione MAT008000
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Machine generated contents note: Preface xi1 Basic Counting Methods 11.1 The multiplication principle 11.2 Permutations 41.3 Combinations 61.4 Binomial coefficient identities 101.5 Distributions 191.6 The principle of inclusion and exclusion 231.7 Fibonacci numbers 311.8 Linear recurrence relations 331.9 Special recurrence relations 411.10 Counting and number theory 45Notes 502 Generating Functions 532.1 Rational generating functions 532.2 Special generating functions 632.3 Partition numbers 762.4 Labeled and unlabeled sets 802.5 Counting with symmetry 862.6 Cycle indexes 932.7 Polya's theorem 962.8 The number of graphs 982.9 Symmetries in domain and range 1022.10 Asymmetric graphs 103Notes 1053 The Pigeonhole Principle 1073.1 Simple examples 1073.2 Lattice points, the Gitterpunktproblem, and SET(r) 1103.3 Graphs 1153.4 Colorings of the plane 1183.5 Sequences and partial orders 1193.6 Subsets 124Notes 1264 Ramsey Theory 1314.1 Ramsey's theorem 1314.2 Generalizations of Ramsey's theorem 1354.3 Ramsey numbers, bounds, and asymptotics 1394.4 The probabilistic method 1434.5 Sums 1454.6 Van der Waerden's theorem 146Notes 1505 Codes 1535.1 Binary codes 1535.2 Perfect codes 1565.3 Hamming codes 1585.4 The Fano Configuration 162Notes 1686 Designs 1716.1 t-designs 171CONTENTS ix6.2 Block designs 1756.3 Projective planes 1806.4 Latin squares 1826.5 MOLS and OODs 1856.6 Hadamard matrices 1886.7 The Golay code and S(5, 8, 24) 1946.8 Lattices and sphere packings 1976.9 Leech's lattice 199Notes 201A Web Resources 205B Notation 207Exercise Solutions 211References 225Index 227.
Record Nr. UNINA-9910463174803321
Erickson Martin J. <1963->  
Hoboken, New Jersey : , : Wiley, , 2013
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Introduction to combinatorics / / Martin J. Erickson
Introduction to combinatorics / / Martin J. Erickson
Autore Erickson Martin J. <1963->
Pubbl/distr/stampa New York, New York : , : John Wiley & Sons, Inc., , 1996
Descrizione fisica 1 online resource (210 p.)
Disciplina 511.6
Collana Wiley Series in Discrete Mathematics and Optimization
Soggetto topico Combinatorial analysis
ISBN 1-283-33199-3
9786613331991
1-118-03264-0
1-118-03089-3
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Introduction to Combinatorics; Contents; Notation; 1 Preliminaries: Set Theory, Algebra, and Number Theory; 1.1 Sets; 1.2 Relations and Functions; 1.3 Binomial Coefficients; 1.4 Group Theory; 1.5 Number Theory; 1.6 Fields; 1.7 Linear Algebra; Notes; Exercises; I Existence; 2 The Pigeonhole Principle; 2.1 Versions of the Pigeonhole Principle; 2.2 Graph Theory; 2.3 Extremal Graphs; 2.4 Colorings of the Plane; Notes; Exercises; 3 Sequences and Partial Orders; 3.1 The Erdös-Szekeres Theorem; 3.2 Dilworth's Lemma; 3.3 Sperner's Theorem; Notes; Exercises; 4 Ramsey Theory; 4.1 Ramsey's Theorem
4.2 Generalizations of Ramsey's Theorem4.3 Ramsey Numbers, Bounds, and Asymptotics; 4.4 The Probabilistic Method; 4.5 Schur's Lemma; 4.6 Van der Waerden's Theorem; Notes; Exercises; II Enumeration; 5 The Fundamental Counting Problem; 5.1 Labeled and Unlabeled Sets; 5.2 The Sixteen Cases; Notes; Exercises; 6 Recurrence Relations and Explicit Formulas; 6.1 The Inclusion-Exclusion Principle; 6.2 Stirling Numbers; 6.3 Linear Recurrence Relations; 6.4 Generating Functions; 6.5 Special Generating Functions; 6.6 Partition Numbers; Notes; Exercises; 7 Permutations and Tableaux
7.1 Algorithm: Listing Permutations7.2 Young Tableaux; 7.3 The Robinson-Schensted Correspondence; Notes; Exercises; 8 The Pólya Theory of Counting; 8.1 Burnside's Lemma; 8.2 Labelings; 8.3 Cycle Indexes; 8.4 Pólya's Theorem; 8.5 De Bruijn's Formula; Notes; Exercises; III Construction; 9 Codes; 9.1 The Geometry of GF(2)n; 9.2 Binary Codes; 9.3 Perfect Codes; 9.4 Hamming Codes; 9.5 The Fano Configuration; Notes; Exercises; 10 Designs; 10.1 t-Designs; 10.2 Block Designs; 10.3 Projective Planes; 10.4 Latin Squares; 10.5 MOLS and OODs; 10.6 Hadamard Matrices; Notes; Exercises; 11 Big Designs
11.1 The Golay Codes and S(5, 8, 24)11.2 Lattices and Sphere Packings; 11.3 Leech's Lattice; Notes; Exercises; Bibliography; Index
Record Nr. UNINA-9910141195303321
Erickson Martin J. <1963->  
New York, New York : , : John Wiley & Sons, Inc., , 1996
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Introduction to combinatorics / / Martin J. Erickson
Introduction to combinatorics / / Martin J. Erickson
Autore Erickson Martin J. <1963->
Pubbl/distr/stampa New York, New York : , : John Wiley & Sons, Inc., , 1996
Descrizione fisica 1 online resource (210 p.)
Disciplina 511.6
Collana Wiley Series in Discrete Mathematics and Optimization
Soggetto topico Combinatorial analysis
ISBN 1-283-33199-3
9786613331991
1-118-03264-0
1-118-03089-3
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Introduction to Combinatorics; Contents; Notation; 1 Preliminaries: Set Theory, Algebra, and Number Theory; 1.1 Sets; 1.2 Relations and Functions; 1.3 Binomial Coefficients; 1.4 Group Theory; 1.5 Number Theory; 1.6 Fields; 1.7 Linear Algebra; Notes; Exercises; I Existence; 2 The Pigeonhole Principle; 2.1 Versions of the Pigeonhole Principle; 2.2 Graph Theory; 2.3 Extremal Graphs; 2.4 Colorings of the Plane; Notes; Exercises; 3 Sequences and Partial Orders; 3.1 The Erdös-Szekeres Theorem; 3.2 Dilworth's Lemma; 3.3 Sperner's Theorem; Notes; Exercises; 4 Ramsey Theory; 4.1 Ramsey's Theorem
4.2 Generalizations of Ramsey's Theorem4.3 Ramsey Numbers, Bounds, and Asymptotics; 4.4 The Probabilistic Method; 4.5 Schur's Lemma; 4.6 Van der Waerden's Theorem; Notes; Exercises; II Enumeration; 5 The Fundamental Counting Problem; 5.1 Labeled and Unlabeled Sets; 5.2 The Sixteen Cases; Notes; Exercises; 6 Recurrence Relations and Explicit Formulas; 6.1 The Inclusion-Exclusion Principle; 6.2 Stirling Numbers; 6.3 Linear Recurrence Relations; 6.4 Generating Functions; 6.5 Special Generating Functions; 6.6 Partition Numbers; Notes; Exercises; 7 Permutations and Tableaux
7.1 Algorithm: Listing Permutations7.2 Young Tableaux; 7.3 The Robinson-Schensted Correspondence; Notes; Exercises; 8 The Pólya Theory of Counting; 8.1 Burnside's Lemma; 8.2 Labelings; 8.3 Cycle Indexes; 8.4 Pólya's Theorem; 8.5 De Bruijn's Formula; Notes; Exercises; III Construction; 9 Codes; 9.1 The Geometry of GF(2)n; 9.2 Binary Codes; 9.3 Perfect Codes; 9.4 Hamming Codes; 9.5 The Fano Configuration; Notes; Exercises; 10 Designs; 10.1 t-Designs; 10.2 Block Designs; 10.3 Projective Planes; 10.4 Latin Squares; 10.5 MOLS and OODs; 10.6 Hadamard Matrices; Notes; Exercises; 11 Big Designs
11.1 The Golay Codes and S(5, 8, 24)11.2 Lattices and Sphere Packings; 11.3 Leech's Lattice; Notes; Exercises; Bibliography; Index
Record Nr. UNINA-9910830175103321
Erickson Martin J. <1963->  
New York, New York : , : John Wiley & Sons, Inc., , 1996
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui