Combinatorial methods in discrete mathematics:
Saved in:
| Main Author: | |
|---|---|
| Format: | Electronic eBook |
| Language: | English |
| Published: |
Cambridge ; New York, NY, USA
Cambridge University Press
1996
|
| Series: | Encyclopedia of mathematics and its applications
volume 55 |
| Subjects: | |
| Online Access: | FAW01 FAW02 Volltext |
| Item Description: | Description based on print version record |
| Physical Description: | 1 online resource (xiii, 306 pages) illustrations |
| ISBN: | 0521455138 1107088682 9780521455138 9781107088689 |
Staff View
MARC
| LEADER | 00000nmm a2200000zcb4500 | ||
|---|---|---|---|
| 001 | BV043034632 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 151120s1996 |||| o||u| ||||||eng d | ||
| 020 | |a 0521455138 |9 0-521-45513-8 | ||
| 020 | |a 1107088682 |c electronic bk. |9 1-107-08868-2 | ||
| 020 | |a 9780521455138 |9 978-0-521-45513-8 | ||
| 020 | |a 9781107088689 |c electronic bk. |9 978-1-107-08868-9 | ||
| 035 | |a (OCoLC)861692408 | ||
| 035 | |a (DE-599)BVBBV043034632 | ||
| 040 | |a DE-604 |b ger |e rda | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-1046 |a DE-1047 | ||
| 082 | 0 | |a 511/.6 |2 22 | |
| 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 ; New York, NY, USA |b Cambridge University Press |c 1996 | |
| 300 | |a 1 online resource (xiii, 306 pages) |b illustrations | ||
| 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 Description based on print version record | ||
| 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 | |
| 505 | 8 | |a This is an attempt to present 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 those 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 4. The general combinatorial scheme is then introduced and, in the final 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 opportunity to update the text and references where appropriate | |
| 650 | 7 | |a Analyse combinatoire |2 ram | |
| 650 | 7 | |a Combinatieleer |2 gtt | |
| 650 | 4 | |a Analyse combinatoire | |
| 650 | 7 | |a Combinatorial analysis |2 fast | |
| 650 | 7 | |a MATHEMATICS / General |2 bisacsh | |
| 650 | 4 | |a Combinatorial analysis | |
| 650 | 0 | 7 | |a Diskrete Mathematik |0 (DE-588)4129143-8 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Kombinatorische Analysis |0 (DE-588)4164746-4 |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 Druck-Ausgabe |a Sachkov, Vladimir Nikolaevich |t Combinatorial methods in discrete mathematics |
| 856 | 4 | 0 | |u http://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&db=nlabk&AN=569291 |x Aggregator |3 Volltext |
| 912 | |a ZDB-4-EBA | ||
| 999 | |a oai:aleph.bib-bvb.de:BVB01-028459282 | ||
| 883 | 1 | |8 1\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 966 | e | |u http://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&db=nlabk&AN=569291 |l FAW01 |p ZDB-4-EBA |q FAW_PDA_EBA |x Aggregator |3 Volltext | |
| 966 | e | |u http://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&db=nlabk&AN=569291 |l FAW02 |p ZDB-4-EBA |q FAW_PDA_EBA |x Aggregator |3 Volltext | |
Record in the Search Index
| _version_ | 1804175393636220928 |
|---|---|
| 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 | BV043034632 |
| collection | ZDB-4-EBA |
| 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 This is an attempt to present 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 those 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 4. The general combinatorial scheme is then introduced and, in the final 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 opportunity to update the text and references where appropriate |
| ctrlnum | (OCoLC)861692408 (DE-599)BVBBV043034632 |
| 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 |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>03616nmm a2200565zcb4500</leader><controlfield tag="001">BV043034632</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">151120s1996 |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0521455138</subfield><subfield code="9">0-521-45513-8</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">1107088682</subfield><subfield code="c">electronic bk.</subfield><subfield code="9">1-107-08868-2</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780521455138</subfield><subfield code="9">978-0-521-45513-8</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781107088689</subfield><subfield code="c">electronic bk.</subfield><subfield code="9">978-1-107-08868-9</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)861692408</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV043034632</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-1046</subfield><subfield code="a">DE-1047</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">511/.6</subfield><subfield code="2">22</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 ; New York, NY, USA</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><subfield code="b">illustrations</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">Description based on print version record</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="505" ind1="8" ind2=" "><subfield code="a">This is an attempt to present 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 those 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 4. The general combinatorial scheme is then introduced and, in the final 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 opportunity to update the text and references where appropriate</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Analyse combinatoire</subfield><subfield code="2">ram</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Combinatieleer</subfield><subfield code="2">gtt</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Analyse combinatoire</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Combinatorial analysis</subfield><subfield code="2">fast</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">MATHEMATICS / General</subfield><subfield code="2">bisacsh</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">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="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="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">Druck-Ausgabe</subfield><subfield code="a">Sachkov, Vladimir Nikolaevich</subfield><subfield code="t">Combinatorial methods in discrete mathematics</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">http://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&db=nlabk&AN=569291</subfield><subfield code="x">Aggregator</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-4-EBA</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-028459282</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">http://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&db=nlabk&AN=569291</subfield><subfield code="l">FAW01</subfield><subfield code="p">ZDB-4-EBA</subfield><subfield code="q">FAW_PDA_EBA</subfield><subfield code="x">Aggregator</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">http://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&db=nlabk&AN=569291</subfield><subfield code="l">FAW02</subfield><subfield code="p">ZDB-4-EBA</subfield><subfield code="q">FAW_PDA_EBA</subfield><subfield code="x">Aggregator</subfield><subfield code="3">Volltext</subfield></datafield></record></collection> |
| id | DE-604.BV043034632 |
| illustrated | Illustrated |
| indexdate | 2024-07-10T07:15:35Z |
| institution | BVB |
| isbn | 0521455138 1107088682 9780521455138 9781107088689 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-028459282 |
| oclc_num | 861692408 |
| open_access_boolean | |
| owner | DE-1046 DE-1047 |
| owner_facet | DE-1046 DE-1047 |
| physical | 1 online resource (xiii, 306 pages) illustrations |
| psigel | ZDB-4-EBA ZDB-4-EBA FAW_PDA_EBA |
| 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 ; New York, NY, USA Cambridge University Press 1996 1 online resource (xiii, 306 pages) illustrations txt rdacontent c rdamedia cr rdacarrier Encyclopedia of mathematics and its applications volume 55 Description based on print version record 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 This is an attempt to present 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 those 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 4. The general combinatorial scheme is then introduced and, in the final 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 opportunity to update the text and references where appropriate Analyse combinatoire ram Combinatieleer gtt Analyse combinatoire Combinatorial analysis fast MATHEMATICS / General bisacsh Combinatorial analysis Diskrete Mathematik (DE-588)4129143-8 gnd rswk-swf Kombinatorische Analysis (DE-588)4164746-4 gnd rswk-swf Diskrete Mathematik (DE-588)4129143-8 s Kombinatorische Analysis (DE-588)4164746-4 s 1\p DE-604 Erscheint auch als Druck-Ausgabe Sachkov, Vladimir Nikolaevich Combinatorial methods in discrete mathematics http://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&db=nlabk&AN=569291 Aggregator 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 This is an attempt to present 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 those 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 4. The general combinatorial scheme is then introduced and, in the final 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 opportunity to update the text and references where appropriate Analyse combinatoire ram Combinatieleer gtt Analyse combinatoire Combinatorial analysis fast MATHEMATICS / General bisacsh Combinatorial analysis Diskrete Mathematik (DE-588)4129143-8 gnd Kombinatorische Analysis (DE-588)4164746-4 gnd |
| subject_GND | (DE-588)4129143-8 (DE-588)4164746-4 |
| 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 | Analyse combinatoire ram Combinatieleer gtt Analyse combinatoire Combinatorial analysis fast MATHEMATICS / General bisacsh Combinatorial analysis Diskrete Mathematik (DE-588)4129143-8 gnd Kombinatorische Analysis (DE-588)4164746-4 gnd |
| topic_facet | Analyse combinatoire Combinatieleer Combinatorial analysis MATHEMATICS / General Diskrete Mathematik Kombinatorische Analysis |
| url | http://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&db=nlabk&AN=569291 |
| work_keys_str_mv | AT sachkovvladimirnikolaevich kombinatornyemetodydiskretnoimatematiki AT sachkovvladimirnikolaevich combinatorialmethodsindiscretemathematics |