Combinatorial methods in discrete mathematics:
Originally published in 1996, this is a presentation of some complex problems of discrete mathematics in a simple and unified form using an original, general combinatorial scheme. The author's aim is not always to present the most general results, but rather to focus attention on ones that illu...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
Cambridge
Cambridge University Press
1996
|
| Schriftenreihe: | Encyclopedia of mathematics and its applications
volume 55 |
| Schlagworte: | |
| Online-Zugang: | BSB01 FHN01 Volltext |
| Zusammenfassung: | Originally published in 1996, this is a presentation of some complex problems of discrete mathematics in a simple and unified form using an original, general combinatorial scheme. The author's aim is not always to present the most general results, but rather to focus attention on ones that illustrate the methods described. A distinctive aspect of the book is the large number of asymptotic formulae derived. Professor Sachkov begins with a discussion of block designs and Latin squares before proceeding to treat transversals, devoting much attention to enumerative problems. The main role in these problems is played by generating functions, which are considered in Chapter 3. The general combinatorial scheme is then introduced and in the last chapter Polya's enumerative theory is discussed. This is an important book, describing many ideas not previously available in English; the author has taken the chance to update the text and references where appropriate |
| Beschreibung: | Title from publisher's bibliographic system (viewed on 05 Oct 2015) |
| Beschreibung: | 1 online resource (xiii, 306 pages) |
| ISBN: | 9780511666186 |
| DOI: | 10.1017/CBO9780511666186 |
Internformat
MARC
| LEADER | 00000nmm a2200000zcb4500 | ||
|---|---|---|---|
| 001 | BV043941994 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 161206s1996 |||| o||u| ||||||eng d | ||
| 020 | |a 9780511666186 |c Online |9 978-0-511-66618-6 | ||
| 024 | 7 | |a 10.1017/CBO9780511666186 |2 doi | |
| 035 | |a (ZDB-20-CBO)CR9780511666186 | ||
| 035 | |a (OCoLC)849931534 | ||
| 035 | |a (DE-599)BVBBV043941994 | ||
| 040 | |a DE-604 |b ger |e rda | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-12 |a DE-92 | ||
| 082 | 0 | |a 511/.6 |2 20 | |
| 084 | |a SK 890 |0 (DE-625)143267: |2 rvk | ||
| 100 | 1 | |a Sachkov, Vladimir Nikolaevich |e Verfasser |4 aut | |
| 240 | 1 | 0 | |a Kombinatornye metody diskretnoĭ matematiki |
| 245 | 1 | 0 | |a Combinatorial methods in discrete mathematics |c Vladimir N. Sachkov |
| 264 | 1 | |a Cambridge |b Cambridge University Press |c 1996 | |
| 300 | |a 1 online resource (xiii, 306 pages) | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 490 | 0 | |a Encyclopedia of mathematics and its applications |v volume 55 | |
| 500 | |a Title from publisher's bibliographic system (viewed on 05 Oct 2015) | ||
| 505 | 8 | |a 1. Combinatorial configurations -- 2. Transversals and permanents -- 3. Generating functions -- 4. Graphs and mappings -- 5. The general combinatorial scheme -- 6. Polya's theorem and its applications | |
| 520 | |a Originally published in 1996, this is a presentation of some complex problems of discrete mathematics in a simple and unified form using an original, general combinatorial scheme. The author's aim is not always to present the most general results, but rather to focus attention on ones that illustrate the methods described. A distinctive aspect of the book is the large number of asymptotic formulae derived. Professor Sachkov begins with a discussion of block designs and Latin squares before proceeding to treat transversals, devoting much attention to enumerative problems. The main role in these problems is played by generating functions, which are considered in Chapter 3. The general combinatorial scheme is then introduced and in the last chapter Polya's enumerative theory is discussed. This is an important book, describing many ideas not previously available in English; the author has taken the chance to update the text and references where appropriate | ||
| 650 | 4 | |a Combinatorial analysis | |
| 650 | 0 | 7 | |a Kombinatorische Analysis |0 (DE-588)4164746-4 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Diskrete Mathematik |0 (DE-588)4129143-8 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Diskrete Mathematik |0 (DE-588)4129143-8 |D s |
| 689 | 0 | 1 | |a Kombinatorische Analysis |0 (DE-588)4164746-4 |D s |
| 689 | 0 | |8 1\p |5 DE-604 | |
| 776 | 0 | 8 | |i Erscheint auch als |n Druckausgabe |z 978-0-521-17276-9 |
| 776 | 0 | 8 | |i Erscheint auch als |n Druckausgabe |z 978-0-521-45513-8 |
| 856 | 4 | 0 | |u https://doi.org/10.1017/CBO9780511666186 |x Verlag |z URL des Erstveröffentlichers |3 Volltext |
| 912 | |a ZDB-20-CBO | ||
| 999 | |a oai:aleph.bib-bvb.de:BVB01-029350964 | ||
| 883 | 1 | |8 1\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 966 | e | |u https://doi.org/10.1017/CBO9780511666186 |l BSB01 |p ZDB-20-CBO |q BSB_PDA_CBO |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1017/CBO9780511666186 |l FHN01 |p ZDB-20-CBO |q FHN_PDA_CBO |x Verlag |3 Volltext | |
Datensatz im Suchindex
| _version_ | 1804176884365262848 |
|---|---|
| any_adam_object | |
| author | Sachkov, Vladimir Nikolaevich |
| author_facet | Sachkov, Vladimir Nikolaevich |
| author_role | aut |
| author_sort | Sachkov, Vladimir Nikolaevich |
| author_variant | v n s vn vns |
| building | Verbundindex |
| bvnumber | BV043941994 |
| classification_rvk | SK 890 |
| collection | ZDB-20-CBO |
| contents | 1. Combinatorial configurations -- 2. Transversals and permanents -- 3. Generating functions -- 4. Graphs and mappings -- 5. The general combinatorial scheme -- 6. Polya's theorem and its applications |
| ctrlnum | (ZDB-20-CBO)CR9780511666186 (OCoLC)849931534 (DE-599)BVBBV043941994 |
| dewey-full | 511/.6 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 511 - General principles of mathematics |
| dewey-raw | 511/.6 |
| dewey-search | 511/.6 |
| dewey-sort | 3511 16 |
| dewey-tens | 510 - Mathematics |
| discipline | Mathematik |
| doi_str_mv | 10.1017/CBO9780511666186 |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>03274nmm a2200517zcb4500</leader><controlfield tag="001">BV043941994</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">161206s1996 |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780511666186</subfield><subfield code="c">Online</subfield><subfield code="9">978-0-511-66618-6</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1017/CBO9780511666186</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ZDB-20-CBO)CR9780511666186</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)849931534</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV043941994</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rda</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-12</subfield><subfield code="a">DE-92</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">511/.6</subfield><subfield code="2">20</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SK 890</subfield><subfield code="0">(DE-625)143267:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Sachkov, Vladimir Nikolaevich</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="240" ind1="1" ind2="0"><subfield code="a">Kombinatornye metody diskretnoĭ matematiki</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Combinatorial methods in discrete mathematics</subfield><subfield code="c">Vladimir N. Sachkov</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cambridge</subfield><subfield code="b">Cambridge University Press</subfield><subfield code="c">1996</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 online resource (xiii, 306 pages)</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="0" ind2=" "><subfield code="a">Encyclopedia of mathematics and its applications</subfield><subfield code="v">volume 55</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Title from publisher's bibliographic system (viewed on 05 Oct 2015)</subfield></datafield><datafield tag="505" ind1="8" ind2=" "><subfield code="a">1. Combinatorial configurations -- 2. Transversals and permanents -- 3. Generating functions -- 4. Graphs and mappings -- 5. The general combinatorial scheme -- 6. Polya's theorem and its applications</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Originally published in 1996, this is a presentation of some complex problems of discrete mathematics in a simple and unified form using an original, general combinatorial scheme. The author's aim is not always to present the most general results, but rather to focus attention on ones that illustrate the methods described. A distinctive aspect of the book is the large number of asymptotic formulae derived. Professor Sachkov begins with a discussion of block designs and Latin squares before proceeding to treat transversals, devoting much attention to enumerative problems. The main role in these problems is played by generating functions, which are considered in Chapter 3. The general combinatorial scheme is then introduced and in the last chapter Polya's enumerative theory is discussed. This is an important book, describing many ideas not previously available in English; the author has taken the chance to update the text and references where appropriate</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Combinatorial analysis</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Kombinatorische Analysis</subfield><subfield code="0">(DE-588)4164746-4</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Diskrete Mathematik</subfield><subfield code="0">(DE-588)4129143-8</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Diskrete Mathematik</subfield><subfield code="0">(DE-588)4129143-8</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Kombinatorische Analysis</subfield><subfield code="0">(DE-588)4164746-4</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="8">1\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druckausgabe</subfield><subfield code="z">978-0-521-17276-9</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druckausgabe</subfield><subfield code="z">978-0-521-45513-8</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1017/CBO9780511666186</subfield><subfield code="x">Verlag</subfield><subfield code="z">URL des Erstveröffentlichers</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-20-CBO</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-029350964</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">1\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1017/CBO9780511666186</subfield><subfield code="l">BSB01</subfield><subfield code="p">ZDB-20-CBO</subfield><subfield code="q">BSB_PDA_CBO</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1017/CBO9780511666186</subfield><subfield code="l">FHN01</subfield><subfield code="p">ZDB-20-CBO</subfield><subfield code="q">FHN_PDA_CBO</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield></record></collection> |
| id | DE-604.BV043941994 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-10T07:39:16Z |
| institution | BVB |
| isbn | 9780511666186 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-029350964 |
| oclc_num | 849931534 |
| open_access_boolean | |
| owner | DE-12 DE-92 |
| owner_facet | DE-12 DE-92 |
| physical | 1 online resource (xiii, 306 pages) |
| psigel | ZDB-20-CBO ZDB-20-CBO BSB_PDA_CBO ZDB-20-CBO FHN_PDA_CBO |
| publishDate | 1996 |
| publishDateSearch | 1996 |
| publishDateSort | 1996 |
| publisher | Cambridge University Press |
| record_format | marc |
| series2 | Encyclopedia of mathematics and its applications |
| spelling | Sachkov, Vladimir Nikolaevich Verfasser aut Kombinatornye metody diskretnoĭ matematiki Combinatorial methods in discrete mathematics Vladimir N. Sachkov Cambridge Cambridge University Press 1996 1 online resource (xiii, 306 pages) txt rdacontent c rdamedia cr rdacarrier Encyclopedia of mathematics and its applications volume 55 Title from publisher's bibliographic system (viewed on 05 Oct 2015) 1. Combinatorial configurations -- 2. Transversals and permanents -- 3. Generating functions -- 4. Graphs and mappings -- 5. The general combinatorial scheme -- 6. Polya's theorem and its applications Originally published in 1996, this is a presentation of some complex problems of discrete mathematics in a simple and unified form using an original, general combinatorial scheme. The author's aim is not always to present the most general results, but rather to focus attention on ones that illustrate the methods described. A distinctive aspect of the book is the large number of asymptotic formulae derived. Professor Sachkov begins with a discussion of block designs and Latin squares before proceeding to treat transversals, devoting much attention to enumerative problems. The main role in these problems is played by generating functions, which are considered in Chapter 3. The general combinatorial scheme is then introduced and in the last chapter Polya's enumerative theory is discussed. This is an important book, describing many ideas not previously available in English; the author has taken the chance to update the text and references where appropriate Combinatorial analysis Kombinatorische Analysis (DE-588)4164746-4 gnd rswk-swf Diskrete Mathematik (DE-588)4129143-8 gnd rswk-swf Diskrete Mathematik (DE-588)4129143-8 s Kombinatorische Analysis (DE-588)4164746-4 s 1\p DE-604 Erscheint auch als Druckausgabe 978-0-521-17276-9 Erscheint auch als Druckausgabe 978-0-521-45513-8 https://doi.org/10.1017/CBO9780511666186 Verlag URL des Erstveröffentlichers Volltext 1\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk |
| spellingShingle | Sachkov, Vladimir Nikolaevich Combinatorial methods in discrete mathematics 1. Combinatorial configurations -- 2. Transversals and permanents -- 3. Generating functions -- 4. Graphs and mappings -- 5. The general combinatorial scheme -- 6. Polya's theorem and its applications Combinatorial analysis Kombinatorische Analysis (DE-588)4164746-4 gnd Diskrete Mathematik (DE-588)4129143-8 gnd |
| subject_GND | (DE-588)4164746-4 (DE-588)4129143-8 |
| title | Combinatorial methods in discrete mathematics |
| title_alt | Kombinatornye metody diskretnoĭ matematiki |
| title_auth | Combinatorial methods in discrete mathematics |
| title_exact_search | Combinatorial methods in discrete mathematics |
| title_full | Combinatorial methods in discrete mathematics Vladimir N. Sachkov |
| title_fullStr | Combinatorial methods in discrete mathematics Vladimir N. Sachkov |
| title_full_unstemmed | Combinatorial methods in discrete mathematics Vladimir N. Sachkov |
| title_short | Combinatorial methods in discrete mathematics |
| title_sort | combinatorial methods in discrete mathematics |
| topic | Combinatorial analysis Kombinatorische Analysis (DE-588)4164746-4 gnd Diskrete Mathematik (DE-588)4129143-8 gnd |
| topic_facet | Combinatorial analysis Kombinatorische Analysis Diskrete Mathematik |
| url | https://doi.org/10.1017/CBO9780511666186 |
| work_keys_str_mv | AT sachkovvladimirnikolaevich kombinatornyemetodydiskretnoimatematiki AT sachkovvladimirnikolaevich combinatorialmethodsindiscretemathematics |