Combinatorial Theory View Full Text


Ontology type: schema:Book     


Book Info

DATE

1979

GENRE

Monograph

AUTHORS

Martin Aigner

PUBLISHER

Springer Nature

ABSTRACT

It is now generally recognized that the field of combinatorics has, over the past years, evolved into a fully-fledged branch of discrete mathematics whose potential with respect to computers and the natural sciences is only beginning to be realized. Still, two points seem to bother most authors: The apparent difficulty in defining the scope of combinatorics and the fact that combinatorics seems to consist of a vast variety of more or less unrelated methods and results. As to the scope of the field, there appears to be a growing consensus that combinatorics should be divided into three large parts: (a) Enumeration, including generating functions, inversion, and calculus of finite differences; (b) Order Theory, including finite posets and lattices, matroids, and existence results such as Hall's and Ramsey's; (c) Configurations, including designs, permutation groups, and coding theory. The present book covers most aspects of parts (a) and (b), but none of (c). The reasons for excluding (c) were twofold. First, there exist several older books on the subject, such as Ryser [1] (which I still think is the most seductive introduction to combinatorics), Hall [2], and more recent ones such as Cameron-Van Lint [1] on groups and designs, and Blake-Mullin [1] on coding theory, whereas no compre­ hensive book exists on (a) and (b). More... »

Identifiers

URI

http://scigraph.springernature.com/pub.10.1007/978-1-4615-6666-3

DOI

http://dx.doi.org/10.1007/978-1-4615-6666-3

ISBN

978-1-4615-6668-7 | 978-1-4615-6666-3

DIMENSIONS

https://app.dimensions.ai/details/publication/pub.1011173064


Indexing Status Check whether this publication has been indexed by Scopus and Web Of Science using the SN Indexing Status Tool
Incoming Citations Browse incoming citations for this publication using opencitations.net

JSON-LD is the canonical representation for SciGraph data.

TIP: You can open this SciGraph record using an external JSON-LD service: JSON-LD Playground Google SDTT

[
  {
    "@context": "https://springernature.github.io/scigraph/jsonld/sgcontext.json", 
    "about": [
      {
        "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/01", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Mathematical Sciences", 
        "type": "DefinedTerm"
      }, 
      {
        "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/0101", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Pure Mathematics", 
        "type": "DefinedTerm"
      }
    ], 
    "author": [
      {
        "affiliation": {
          "alternateName": "II. Institut f\u00fcr Mathematik, Freie Universit\u00e4t Berlin, K\u00f6nigin-Luise-Strasse 24/26, 1000, Berlin 33, Federal Republic of Germany", 
          "id": "http://www.grid.ac/institutes/grid.14095.39", 
          "name": [
            "II. Institut f\u00fcr Mathematik, Freie Universit\u00e4t Berlin, K\u00f6nigin-Luise-Strasse 24/26, 1000, Berlin 33, Federal Republic of Germany"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Aigner", 
        "givenName": "Martin", 
        "id": "sg:person.011611334033.22", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.011611334033.22"
        ], 
        "type": "Person"
      }
    ], 
    "datePublished": "1979", 
    "datePublishedReg": "1979-01-01", 
    "description": "It is now generally recognized that the field of combinatorics has, over the past years, evolved into a fully-fledged branch of discrete mathematics whose potential with respect to computers and the natural sciences is only beginning to be realized. Still, two points seem to bother most authors: The apparent difficulty in defining the scope of combinatorics and the fact that combinatorics seems to consist of a vast variety of more or less unrelated methods and results. As to the scope of the field, there appears to be a growing consensus that combinatorics should be divided into three large parts: (a) Enumeration, including generating functions, inversion, and calculus of finite differences; (b) Order Theory, including finite posets and lattices, matroids, and existence results such as Hall's and Ramsey's; (c) Configurations, including designs, permutation groups, and coding theory. The present book covers most aspects of parts (a) and (b), but none of (c). The reasons for excluding (c) were twofold. First, there exist several older books on the subject, such as Ryser [1] (which I still think is the most seductive introduction to combinatorics), Hall [2], and more recent ones such as Cameron-Van Lint [1] on groups and designs, and Blake-Mullin [1] on coding theory, whereas no compre\u00ad hensive book exists on (a) and (b).", 
    "genre": "monograph", 
    "id": "sg:pub.10.1007/978-1-4615-6666-3", 
    "inLanguage": "en", 
    "isAccessibleForFree": false, 
    "isbn": [
      "978-1-4615-6668-7", 
      "978-1-4615-6666-3"
    ], 
    "keywords": [
      "field of combinatorics", 
      "existence results", 
      "discrete mathematics", 
      "combinatorial theory", 
      "finite differences", 
      "finite poset", 
      "combinatorics", 
      "unrelated methods", 
      "permutation groups", 
      "order theory", 
      "theory", 
      "recent ones", 
      "mathematics", 
      "natural sciences", 
      "calculus", 
      "posets", 
      "apparent difficulty", 
      "matroids", 
      "vast variety", 
      "Ryser", 
      "design", 
      "present book", 
      "lattice", 
      "field", 
      "inversion", 
      "computer", 
      "function", 
      "point", 
      "enumeration", 
      "results", 
      "Ramsey", 
      "branches", 
      "one", 
      "respect", 
      "difficulties", 
      "science", 
      "fact", 
      "configuration", 
      "scope", 
      "Hall", 
      "part", 
      "variety", 
      "book", 
      "authors", 
      "aspects", 
      "large part", 
      "consensus", 
      "most authors", 
      "lint", 
      "old books", 
      "past year", 
      "reasons", 
      "most aspects", 
      "group", 
      "subjects", 
      "differences", 
      "years", 
      "method", 
      "scope of combinatorics", 
      "Cameron-Van Lint", 
      "Blake-Mullin", 
      "hensive book"
    ], 
    "name": "Combinatorial Theory", 
    "productId": [
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1011173064"
        ]
      }, 
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/978-1-4615-6666-3"
        ]
      }
    ], 
    "publisher": {
      "name": "Springer Nature", 
      "type": "Organisation"
    }, 
    "sameAs": [
      "https://doi.org/10.1007/978-1-4615-6666-3", 
      "https://app.dimensions.ai/details/publication/pub.1011173064"
    ], 
    "sdDataset": "books", 
    "sdDatePublished": "2022-01-01T19:05", 
    "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
    "sdPublisher": {
      "name": "Springer Nature - SN SciGraph project", 
      "type": "Organization"
    }, 
    "sdSource": "s3://com-springernature-scigraph/baseset/20220101/entities/gbq_results/book/book_3.jsonl", 
    "type": "Book", 
    "url": "https://doi.org/10.1007/978-1-4615-6666-3"
  }
]
 

Download the RDF metadata as:  json-ld nt turtle xml License info

HOW TO GET THIS DATA PROGRAMMATICALLY:

JSON-LD is a popular format for linked data which is fully compatible with JSON.

curl -H 'Accept: application/ld+json' 'https://scigraph.springernature.com/pub.10.1007/978-1-4615-6666-3'

N-Triples is a line-based linked data format ideal for batch operations.

curl -H 'Accept: application/n-triples' 'https://scigraph.springernature.com/pub.10.1007/978-1-4615-6666-3'

Turtle is a human-readable linked data format.

curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/978-1-4615-6666-3'

RDF/XML is a standard XML format for linked data.

curl -H 'Accept: application/rdf+xml' 'https://scigraph.springernature.com/pub.10.1007/978-1-4615-6666-3'


 

This table displays all metadata directly associated to this object as RDF triples.

112 TRIPLES      21 PREDICATES      87 URIs      80 LITERALS      5 BLANK NODES

Subject Predicate Object
1 sg:pub.10.1007/978-1-4615-6666-3 schema:about anzsrc-for:01
2 anzsrc-for:0101
3 schema:author N74d60f0e41c940c68ff9db01081a8d0a
4 schema:datePublished 1979
5 schema:datePublishedReg 1979-01-01
6 schema:description It is now generally recognized that the field of combinatorics has, over the past years, evolved into a fully-fledged branch of discrete mathematics whose potential with respect to computers and the natural sciences is only beginning to be realized. Still, two points seem to bother most authors: The apparent difficulty in defining the scope of combinatorics and the fact that combinatorics seems to consist of a vast variety of more or less unrelated methods and results. As to the scope of the field, there appears to be a growing consensus that combinatorics should be divided into three large parts: (a) Enumeration, including generating functions, inversion, and calculus of finite differences; (b) Order Theory, including finite posets and lattices, matroids, and existence results such as Hall's and Ramsey's; (c) Configurations, including designs, permutation groups, and coding theory. The present book covers most aspects of parts (a) and (b), but none of (c). The reasons for excluding (c) were twofold. First, there exist several older books on the subject, such as Ryser [1] (which I still think is the most seductive introduction to combinatorics), Hall [2], and more recent ones such as Cameron-Van Lint [1] on groups and designs, and Blake-Mullin [1] on coding theory, whereas no compre­ hensive book exists on (a) and (b).
7 schema:genre monograph
8 schema:inLanguage en
9 schema:isAccessibleForFree false
10 schema:isbn 978-1-4615-6666-3
11 978-1-4615-6668-7
12 schema:keywords Blake-Mullin
13 Cameron-Van Lint
14 Hall
15 Ramsey
16 Ryser
17 apparent difficulty
18 aspects
19 authors
20 book
21 branches
22 calculus
23 combinatorial theory
24 combinatorics
25 computer
26 configuration
27 consensus
28 design
29 differences
30 difficulties
31 discrete mathematics
32 enumeration
33 existence results
34 fact
35 field
36 field of combinatorics
37 finite differences
38 finite poset
39 function
40 group
41 hensive book
42 inversion
43 large part
44 lattice
45 lint
46 mathematics
47 matroids
48 method
49 most aspects
50 most authors
51 natural sciences
52 old books
53 one
54 order theory
55 part
56 past year
57 permutation groups
58 point
59 posets
60 present book
61 reasons
62 recent ones
63 respect
64 results
65 science
66 scope
67 scope of combinatorics
68 subjects
69 theory
70 unrelated methods
71 variety
72 vast variety
73 years
74 schema:name Combinatorial Theory
75 schema:productId N36c39d2c11ac4a499c16b0b1eff3d8d4
76 Nc8f204fddda540cfadcd3bc3b0a8e1f6
77 schema:publisher Ne09a0f0324054fdaa6e97997864939dc
78 schema:sameAs https://app.dimensions.ai/details/publication/pub.1011173064
79 https://doi.org/10.1007/978-1-4615-6666-3
80 schema:sdDatePublished 2022-01-01T19:05
81 schema:sdLicense https://scigraph.springernature.com/explorer/license/
82 schema:sdPublisher N9ab169d5268549468732652fcee31f5f
83 schema:url https://doi.org/10.1007/978-1-4615-6666-3
84 sgo:license sg:explorer/license/
85 sgo:sdDataset books
86 rdf:type schema:Book
87 N36c39d2c11ac4a499c16b0b1eff3d8d4 schema:name dimensions_id
88 schema:value pub.1011173064
89 rdf:type schema:PropertyValue
90 N74d60f0e41c940c68ff9db01081a8d0a rdf:first sg:person.011611334033.22
91 rdf:rest rdf:nil
92 N9ab169d5268549468732652fcee31f5f schema:name Springer Nature - SN SciGraph project
93 rdf:type schema:Organization
94 Nc8f204fddda540cfadcd3bc3b0a8e1f6 schema:name doi
95 schema:value 10.1007/978-1-4615-6666-3
96 rdf:type schema:PropertyValue
97 Ne09a0f0324054fdaa6e97997864939dc schema:name Springer Nature
98 rdf:type schema:Organisation
99 anzsrc-for:01 schema:inDefinedTermSet anzsrc-for:
100 schema:name Mathematical Sciences
101 rdf:type schema:DefinedTerm
102 anzsrc-for:0101 schema:inDefinedTermSet anzsrc-for:
103 schema:name Pure Mathematics
104 rdf:type schema:DefinedTerm
105 sg:person.011611334033.22 schema:affiliation grid-institutes:grid.14095.39
106 schema:familyName Aigner
107 schema:givenName Martin
108 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.011611334033.22
109 rdf:type schema:Person
110 grid-institutes:grid.14095.39 schema:alternateName II. Institut für Mathematik, Freie Universität Berlin, Königin-Luise-Strasse 24/26, 1000, Berlin 33, Federal Republic of Germany
111 schema:name II. Institut für Mathematik, Freie Universität Berlin, Königin-Luise-Strasse 24/26, 1000, Berlin 33, Federal Republic of Germany
112 rdf:type schema:Organization
 




Preview window. Press ESC to close (or click here)


...