Orthogonal resolutions in odd balanced tournament designs View Full Text


Ontology type: schema:ScholarlyArticle     


Article Info

DATE

1988-12

AUTHORS

E. R. Lamken, S. A. Vanstone

ABSTRACT

An odd balanced tournament design,OBTD(n), is ann × 2n + 1 array of pairs defined on a (2n + 1)-setV such that (1) every row of the array contains each element ofV twice, (2) every column of the array contains 2n distinct elements ofV, and (3) the pairs of the array form a (2n + 1, 2, 1)-BIBD. In this paper, we investigate the spectrum of odd balanced tournament designs with orthogonal resolutions. These designs can be used to construct doubly near resolvable (v, 3, 2)-BIBDs. More... »

PAGES

241-255

References to SciGraph publications

  • 1972. Combinatorics: Room Squares, Sum-Free Sets, Hadamard Matrices in NONE
  • 1971-06. Puintuplication of Room squares in AEQUATIONES MATHEMATICAE
  • 1972. Room Squares in COMBINATORICS: ROOM SQUARES, SUM-FREE SETS, HADAMARD MATRICES
  • 1974-06. A multiplication theorem for strong starters in AEQUATIONES MATHEMATICAE
  • 1975-02. The existence of Room squares in AEQUATIONES MATHEMATICAE
  • 1981-12. Room designs and one-factorizations in AEQUATIONES MATHEMATICAE
  • Identifiers

    URI

    http://scigraph.springernature.com/pub.10.1007/bf01864165

    DOI

    http://dx.doi.org/10.1007/bf01864165

    DIMENSIONS

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


    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/08", 
            "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
            "name": "Information and Computing 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"
          }, 
          {
            "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/0802", 
            "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
            "name": "Computation Theory and Mathematics", 
            "type": "DefinedTerm"
          }
        ], 
        "author": [
          {
            "affiliation": {
              "alternateName": "Department of Combinatorics and Optimization, University of Waterloo, N2L 3G1, Waterloo, Ontario, Canada", 
              "id": "http://www.grid.ac/institutes/grid.46078.3d", 
              "name": [
                "Department of Combinatorics and Optimization, University of Waterloo, N2L 3G1, Waterloo, Ontario, Canada"
              ], 
              "type": "Organization"
            }, 
            "familyName": "Lamken", 
            "givenName": "E. R.", 
            "id": "sg:person.010160447036.50", 
            "sameAs": [
              "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.010160447036.50"
            ], 
            "type": "Person"
          }, 
          {
            "affiliation": {
              "alternateName": "Department of Combinatorics and Optimization, University of Waterloo, N2L 3G1, Waterloo, Ontario, Canada", 
              "id": "http://www.grid.ac/institutes/grid.46078.3d", 
              "name": [
                "Department of Combinatorics and Optimization, University of Waterloo, N2L 3G1, Waterloo, Ontario, Canada"
              ], 
              "type": "Organization"
            }, 
            "familyName": "Vanstone", 
            "givenName": "S. A.", 
            "id": "sg:person.010344544767.07", 
            "sameAs": [
              "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.010344544767.07"
            ], 
            "type": "Person"
          }
        ], 
        "citation": [
          {
            "id": "sg:pub.10.1007/bf01834914", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1019715690", 
              "https://doi.org/10.1007/bf01834914"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/bf01818519", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1038922377", 
              "https://doi.org/10.1007/bf01818519"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/bfb0069909", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1044754874", 
              "https://doi.org/10.1007/bfb0069909"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/bfb0069907", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1036778583", 
              "https://doi.org/10.1007/bfb0069907"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/bf01834113", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1018039054", 
              "https://doi.org/10.1007/bf01834113"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/bf02190160", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1033109860", 
              "https://doi.org/10.1007/bf02190160"
            ], 
            "type": "CreativeWork"
          }
        ], 
        "datePublished": "1988-12", 
        "datePublishedReg": "1988-12-01", 
        "description": "An odd balanced tournament design,OBTD(n), is ann \u00d7 2n + 1 array of pairs defined on a (2n + 1)-setV such that (1) every row of the array contains each element ofV twice, (2) every column of the array contains 2n distinct elements ofV, and (3) the pairs of the array form a (2n + 1, 2, 1)-BIBD. In this paper, we investigate the spectrum of odd balanced tournament designs with orthogonal resolutions. These designs can be used to construct doubly near resolvable (v, 3, 2)-BIBDs.", 
        "genre": "article", 
        "id": "sg:pub.10.1007/bf01864165", 
        "isAccessibleForFree": false, 
        "isPartOf": [
          {
            "id": "sg:journal.1136071", 
            "issn": [
              "0911-0119", 
              "1435-5914"
            ], 
            "name": "Graphs and Combinatorics", 
            "publisher": "Springer Nature", 
            "type": "Periodical"
          }, 
          {
            "issueNumber": "1", 
            "type": "PublicationIssue"
          }, 
          {
            "type": "PublicationVolume", 
            "volumeNumber": "4"
          }
        ], 
        "keywords": [
          "array of pairs", 
          "array form", 
          "orthogonal resolutions", 
          "design", 
          "array", 
          "resolution", 
          "column", 
          "rows", 
          "spectra", 
          "pairs", 
          "balanced tournament designs", 
          "ofV", 
          "setV", 
          "form", 
          "BIBD", 
          "tournament design", 
          "paper"
        ], 
        "name": "Orthogonal resolutions in odd balanced tournament designs", 
        "pagination": "241-255", 
        "productId": [
          {
            "name": "dimensions_id", 
            "type": "PropertyValue", 
            "value": [
              "pub.1046709365"
            ]
          }, 
          {
            "name": "doi", 
            "type": "PropertyValue", 
            "value": [
              "10.1007/bf01864165"
            ]
          }
        ], 
        "sameAs": [
          "https://doi.org/10.1007/bf01864165", 
          "https://app.dimensions.ai/details/publication/pub.1046709365"
        ], 
        "sdDataset": "articles", 
        "sdDatePublished": "2022-10-01T06:28", 
        "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
        "sdPublisher": {
          "name": "Springer Nature - SN SciGraph project", 
          "type": "Organization"
        }, 
        "sdSource": "s3://com-springernature-scigraph/baseset/20221001/entities/gbq_results/article/article_208.jsonl", 
        "type": "ScholarlyArticle", 
        "url": "https://doi.org/10.1007/bf01864165"
      }
    ]
     

    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/bf01864165'

    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/bf01864165'

    Turtle is a human-readable linked data format.

    curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/bf01864165'

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

    curl -H 'Accept: application/rdf+xml' 'https://scigraph.springernature.com/pub.10.1007/bf01864165'


     

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

    113 TRIPLES      21 PREDICATES      50 URIs      34 LITERALS      6 BLANK NODES

    Subject Predicate Object
    1 sg:pub.10.1007/bf01864165 schema:about anzsrc-for:01
    2 anzsrc-for:0101
    3 anzsrc-for:08
    4 anzsrc-for:0802
    5 schema:author Ne340c368fcf04e6e941b5a5bc983c67c
    6 schema:citation sg:pub.10.1007/bf01818519
    7 sg:pub.10.1007/bf01834113
    8 sg:pub.10.1007/bf01834914
    9 sg:pub.10.1007/bf02190160
    10 sg:pub.10.1007/bfb0069907
    11 sg:pub.10.1007/bfb0069909
    12 schema:datePublished 1988-12
    13 schema:datePublishedReg 1988-12-01
    14 schema:description An odd balanced tournament design,OBTD(n), is ann × 2n + 1 array of pairs defined on a (2n + 1)-setV such that (1) every row of the array contains each element ofV twice, (2) every column of the array contains 2n distinct elements ofV, and (3) the pairs of the array form a (2n + 1, 2, 1)-BIBD. In this paper, we investigate the spectrum of odd balanced tournament designs with orthogonal resolutions. These designs can be used to construct doubly near resolvable (v, 3, 2)-BIBDs.
    15 schema:genre article
    16 schema:isAccessibleForFree false
    17 schema:isPartOf N8b4526fb6d66406ca7ea43286ad56e94
    18 N9b93dc98fd004bb69d6b9f6557d48cd5
    19 sg:journal.1136071
    20 schema:keywords BIBD
    21 array
    22 array form
    23 array of pairs
    24 balanced tournament designs
    25 column
    26 design
    27 form
    28 ofV
    29 orthogonal resolutions
    30 pairs
    31 paper
    32 resolution
    33 rows
    34 setV
    35 spectra
    36 tournament design
    37 schema:name Orthogonal resolutions in odd balanced tournament designs
    38 schema:pagination 241-255
    39 schema:productId N89d56d191c934684ad89a538a4b17d42
    40 Nf2d005e44a5e4f7897cf38f98fd32f0f
    41 schema:sameAs https://app.dimensions.ai/details/publication/pub.1046709365
    42 https://doi.org/10.1007/bf01864165
    43 schema:sdDatePublished 2022-10-01T06:28
    44 schema:sdLicense https://scigraph.springernature.com/explorer/license/
    45 schema:sdPublisher N7d61a5db79b448c68fadc6285c768ceb
    46 schema:url https://doi.org/10.1007/bf01864165
    47 sgo:license sg:explorer/license/
    48 sgo:sdDataset articles
    49 rdf:type schema:ScholarlyArticle
    50 N5e65c4a0206344019f772499670ecd95 rdf:first sg:person.010344544767.07
    51 rdf:rest rdf:nil
    52 N7d61a5db79b448c68fadc6285c768ceb schema:name Springer Nature - SN SciGraph project
    53 rdf:type schema:Organization
    54 N89d56d191c934684ad89a538a4b17d42 schema:name dimensions_id
    55 schema:value pub.1046709365
    56 rdf:type schema:PropertyValue
    57 N8b4526fb6d66406ca7ea43286ad56e94 schema:issueNumber 1
    58 rdf:type schema:PublicationIssue
    59 N9b93dc98fd004bb69d6b9f6557d48cd5 schema:volumeNumber 4
    60 rdf:type schema:PublicationVolume
    61 Ne340c368fcf04e6e941b5a5bc983c67c rdf:first sg:person.010160447036.50
    62 rdf:rest N5e65c4a0206344019f772499670ecd95
    63 Nf2d005e44a5e4f7897cf38f98fd32f0f schema:name doi
    64 schema:value 10.1007/bf01864165
    65 rdf:type schema:PropertyValue
    66 anzsrc-for:01 schema:inDefinedTermSet anzsrc-for:
    67 schema:name Mathematical Sciences
    68 rdf:type schema:DefinedTerm
    69 anzsrc-for:0101 schema:inDefinedTermSet anzsrc-for:
    70 schema:name Pure Mathematics
    71 rdf:type schema:DefinedTerm
    72 anzsrc-for:08 schema:inDefinedTermSet anzsrc-for:
    73 schema:name Information and Computing Sciences
    74 rdf:type schema:DefinedTerm
    75 anzsrc-for:0802 schema:inDefinedTermSet anzsrc-for:
    76 schema:name Computation Theory and Mathematics
    77 rdf:type schema:DefinedTerm
    78 sg:journal.1136071 schema:issn 0911-0119
    79 1435-5914
    80 schema:name Graphs and Combinatorics
    81 schema:publisher Springer Nature
    82 rdf:type schema:Periodical
    83 sg:person.010160447036.50 schema:affiliation grid-institutes:grid.46078.3d
    84 schema:familyName Lamken
    85 schema:givenName E. R.
    86 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.010160447036.50
    87 rdf:type schema:Person
    88 sg:person.010344544767.07 schema:affiliation grid-institutes:grid.46078.3d
    89 schema:familyName Vanstone
    90 schema:givenName S. A.
    91 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.010344544767.07
    92 rdf:type schema:Person
    93 sg:pub.10.1007/bf01818519 schema:sameAs https://app.dimensions.ai/details/publication/pub.1038922377
    94 https://doi.org/10.1007/bf01818519
    95 rdf:type schema:CreativeWork
    96 sg:pub.10.1007/bf01834113 schema:sameAs https://app.dimensions.ai/details/publication/pub.1018039054
    97 https://doi.org/10.1007/bf01834113
    98 rdf:type schema:CreativeWork
    99 sg:pub.10.1007/bf01834914 schema:sameAs https://app.dimensions.ai/details/publication/pub.1019715690
    100 https://doi.org/10.1007/bf01834914
    101 rdf:type schema:CreativeWork
    102 sg:pub.10.1007/bf02190160 schema:sameAs https://app.dimensions.ai/details/publication/pub.1033109860
    103 https://doi.org/10.1007/bf02190160
    104 rdf:type schema:CreativeWork
    105 sg:pub.10.1007/bfb0069907 schema:sameAs https://app.dimensions.ai/details/publication/pub.1036778583
    106 https://doi.org/10.1007/bfb0069907
    107 rdf:type schema:CreativeWork
    108 sg:pub.10.1007/bfb0069909 schema:sameAs https://app.dimensions.ai/details/publication/pub.1044754874
    109 https://doi.org/10.1007/bfb0069909
    110 rdf:type schema:CreativeWork
    111 grid-institutes:grid.46078.3d schema:alternateName Department of Combinatorics and Optimization, University of Waterloo, N2L 3G1, Waterloo, Ontario, Canada
    112 schema:name Department of Combinatorics and Optimization, University of Waterloo, N2L 3G1, Waterloo, Ontario, Canada
    113 rdf:type schema:Organization
     




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


    ...