Designs 2002: Further Computational and Constructive Design Theory
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
Boston, MA
Springer US
2003
|
| Schriftenreihe: | Mathematics and Its Applications
563 |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Beschreibung: | This volume is a sequel to our 1996 compilation, Computational and Constructive Design Theory. Again we concentrate on two closely re lated aspects of the study of combinatorial designs: design construction and computer-aided study of designs. There are at least three classes of constructive problems in design theory. The first type of problem is the construction of a specific design. This might arise because that one particular case is an exception to a general rule, the last remaining case of a problem, or the smallest unknown case. A good example is the proof that there is no projective plane of parameter 10. In that case the computations involved were not different in kind from those which have been done by human brains without electronic assistance; they were merely longer. Computers have also been useful in the study of combinatorial spec trum problems: if a class of design has certain parameters, what is the set of values that the parameters can realize? In many cases, there is a recursive construction, so that the existence of a small number of "starter" designs leads to the construction of infinite classes of designs, and computers have proven very useful in finding "starter" designs |
| Beschreibung: | 1 Online-Ressource (XII, 368 p) |
| ISBN: | 9781461302452 9781461379584 |
| DOI: | 10.1007/978-1-4613-0245-2 |
Internformat
MARC
| LEADER | 00000nmm a2200000zcb4500 | ||
|---|---|---|---|
| 001 | BV042420575 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 150317s2003 |||| o||u| ||||||eng d | ||
| 020 | |a 9781461302452 |c Online |9 978-1-4613-0245-2 | ||
| 020 | |a 9781461379584 |c Print |9 978-1-4613-7958-4 | ||
| 024 | 7 | |a 10.1007/978-1-4613-0245-2 |2 doi | |
| 035 | |a (OCoLC)905377056 | ||
| 035 | |a (DE-599)BVBBV042420575 | ||
| 040 | |a DE-604 |b ger |e aacr | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-384 |a DE-703 |a DE-91 |a DE-634 | ||
| 082 | 0 | |a 511.6 |2 23 | |
| 084 | |a MAT 000 |2 stub | ||
| 100 | 1 | |a Wallis, W. D. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Designs 2002 |b Further Computational and Constructive Design Theory |c edited by W. D. Wallis |
| 264 | 1 | |a Boston, MA |b Springer US |c 2003 | |
| 300 | |a 1 Online-Ressource (XII, 368 p) | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 490 | 0 | |a Mathematics and Its Applications |v 563 | |
| 500 | |a This volume is a sequel to our 1996 compilation, Computational and Constructive Design Theory. Again we concentrate on two closely re lated aspects of the study of combinatorial designs: design construction and computer-aided study of designs. There are at least three classes of constructive problems in design theory. The first type of problem is the construction of a specific design. This might arise because that one particular case is an exception to a general rule, the last remaining case of a problem, or the smallest unknown case. A good example is the proof that there is no projective plane of parameter 10. In that case the computations involved were not different in kind from those which have been done by human brains without electronic assistance; they were merely longer. Computers have also been useful in the study of combinatorial spec trum problems: if a class of design has certain parameters, what is the set of values that the parameters can realize? In many cases, there is a recursive construction, so that the existence of a small number of "starter" designs leads to the construction of infinite classes of designs, and computers have proven very useful in finding "starter" designs | ||
| 650 | 4 | |a Mathematics | |
| 650 | 4 | |a Information theory | |
| 650 | 4 | |a Computational complexity | |
| 650 | 4 | |a Combinatorics | |
| 650 | 4 | |a Theory of Computation | |
| 650 | 4 | |a Discrete Mathematics in Computer Science | |
| 650 | 4 | |a Mathematik | |
| 856 | 4 | 0 | |u https://doi.org/10.1007/978-1-4613-0245-2 |x Verlag |3 Volltext |
| 912 | |a ZDB-2-SMA |a ZDB-2-BAE | ||
| 940 | 1 | |q ZDB-2-SMA_Archive | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-027855992 | ||
Datensatz im Suchindex
| _version_ | 1804153092645584896 |
|---|---|
| any_adam_object | |
| author | Wallis, W. D. |
| author_facet | Wallis, W. D. |
| author_role | aut |
| author_sort | Wallis, W. D. |
| author_variant | w d w wd wdw |
| building | Verbundindex |
| bvnumber | BV042420575 |
| classification_tum | MAT 000 |
| collection | ZDB-2-SMA ZDB-2-BAE |
| ctrlnum | (OCoLC)905377056 (DE-599)BVBBV042420575 |
| 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.6 |
| dewey-tens | 510 - Mathematics |
| discipline | Mathematik |
| doi_str_mv | 10.1007/978-1-4613-0245-2 |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02646nmm a2200445zcb4500</leader><controlfield tag="001">BV042420575</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">150317s2003 |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781461302452</subfield><subfield code="c">Online</subfield><subfield code="9">978-1-4613-0245-2</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781461379584</subfield><subfield code="c">Print</subfield><subfield code="9">978-1-4613-7958-4</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/978-1-4613-0245-2</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)905377056</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV042420575</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">aacr</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-384</subfield><subfield code="a">DE-703</subfield><subfield code="a">DE-91</subfield><subfield code="a">DE-634</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">511.6</subfield><subfield code="2">23</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">MAT 000</subfield><subfield code="2">stub</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Wallis, W. D.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Designs 2002</subfield><subfield code="b">Further Computational and Constructive Design Theory</subfield><subfield code="c">edited by W. D. Wallis</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Boston, MA</subfield><subfield code="b">Springer US</subfield><subfield code="c">2003</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (XII, 368 p)</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">Mathematics and Its Applications</subfield><subfield code="v">563</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">This volume is a sequel to our 1996 compilation, Computational and Constructive Design Theory. Again we concentrate on two closely re lated aspects of the study of combinatorial designs: design construction and computer-aided study of designs. There are at least three classes of constructive problems in design theory. The first type of problem is the construction of a specific design. This might arise because that one particular case is an exception to a general rule, the last remaining case of a problem, or the smallest unknown case. A good example is the proof that there is no projective plane of parameter 10. In that case the computations involved were not different in kind from those which have been done by human brains without electronic assistance; they were merely longer. Computers have also been useful in the study of combinatorial spec trum problems: if a class of design has certain parameters, what is the set of values that the parameters can realize? In many cases, there is a recursive construction, so that the existence of a small number of "starter" designs leads to the construction of infinite classes of designs, and computers have proven very useful in finding "starter" designs</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematics</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Information theory</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computational complexity</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Combinatorics</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Theory of Computation</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Discrete Mathematics in Computer Science</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematik</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1007/978-1-4613-0245-2</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-2-SMA</subfield><subfield code="a">ZDB-2-BAE</subfield></datafield><datafield tag="940" ind1="1" ind2=" "><subfield code="q">ZDB-2-SMA_Archive</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-027855992</subfield></datafield></record></collection> |
| id | DE-604.BV042420575 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-10T01:21:07Z |
| institution | BVB |
| isbn | 9781461302452 9781461379584 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-027855992 |
| oclc_num | 905377056 |
| open_access_boolean | |
| owner | DE-384 DE-703 DE-91 DE-BY-TUM DE-634 |
| owner_facet | DE-384 DE-703 DE-91 DE-BY-TUM DE-634 |
| physical | 1 Online-Ressource (XII, 368 p) |
| psigel | ZDB-2-SMA ZDB-2-BAE ZDB-2-SMA_Archive |
| publishDate | 2003 |
| publishDateSearch | 2003 |
| publishDateSort | 2003 |
| publisher | Springer US |
| record_format | marc |
| series2 | Mathematics and Its Applications |
| spelling | Wallis, W. D. Verfasser aut Designs 2002 Further Computational and Constructive Design Theory edited by W. D. Wallis Boston, MA Springer US 2003 1 Online-Ressource (XII, 368 p) txt rdacontent c rdamedia cr rdacarrier Mathematics and Its Applications 563 This volume is a sequel to our 1996 compilation, Computational and Constructive Design Theory. Again we concentrate on two closely re lated aspects of the study of combinatorial designs: design construction and computer-aided study of designs. There are at least three classes of constructive problems in design theory. The first type of problem is the construction of a specific design. This might arise because that one particular case is an exception to a general rule, the last remaining case of a problem, or the smallest unknown case. A good example is the proof that there is no projective plane of parameter 10. In that case the computations involved were not different in kind from those which have been done by human brains without electronic assistance; they were merely longer. Computers have also been useful in the study of combinatorial spec trum problems: if a class of design has certain parameters, what is the set of values that the parameters can realize? In many cases, there is a recursive construction, so that the existence of a small number of "starter" designs leads to the construction of infinite classes of designs, and computers have proven very useful in finding "starter" designs Mathematics Information theory Computational complexity Combinatorics Theory of Computation Discrete Mathematics in Computer Science Mathematik https://doi.org/10.1007/978-1-4613-0245-2 Verlag Volltext |
| spellingShingle | Wallis, W. D. Designs 2002 Further Computational and Constructive Design Theory Mathematics Information theory Computational complexity Combinatorics Theory of Computation Discrete Mathematics in Computer Science Mathematik |
| title | Designs 2002 Further Computational and Constructive Design Theory |
| title_auth | Designs 2002 Further Computational and Constructive Design Theory |
| title_exact_search | Designs 2002 Further Computational and Constructive Design Theory |
| title_full | Designs 2002 Further Computational and Constructive Design Theory edited by W. D. Wallis |
| title_fullStr | Designs 2002 Further Computational and Constructive Design Theory edited by W. D. Wallis |
| title_full_unstemmed | Designs 2002 Further Computational and Constructive Design Theory edited by W. D. Wallis |
| title_short | Designs 2002 |
| title_sort | designs 2002 further computational and constructive design theory |
| title_sub | Further Computational and Constructive Design Theory |
| topic | Mathematics Information theory Computational complexity Combinatorics Theory of Computation Discrete Mathematics in Computer Science Mathematik |
| topic_facet | Mathematics Information theory Computational complexity Combinatorics Theory of Computation Discrete Mathematics in Computer Science Mathematik |
| url | https://doi.org/10.1007/978-1-4613-0245-2 |
| work_keys_str_mv | AT walliswd designs2002furthercomputationalandconstructivedesigntheory |