1 Ocak 2010 Dergi makalesi Açık Erişim

Kolotoglu, Emre; Yazici, Emine Sule

JSON

{
  "conceptrecid": "23966", 
  "created": "2021-03-15T11:22:27.628740+00:00", 
  "doi": "10.1007/s00373-010-0892-2", 
  "files": [
    {
      "bucket": "d4d3448c-d217-4515-97c0-1ab06a5238d2", 
      "checksum": "md5:30aaf304eeee3e803f7d1d33104405b3", 
      "key": "bib-43343f3e-2877-4621-96a1-93eda0b084ac.txt", 
      "links": {
        "self": "https://aperta.ulakbim.gov.tr/api/files/d4d3448c-d217-4515-97c0-1ab06a5238d2/bib-43343f3e-2877-4621-96a1-93eda0b084ac.txt"
      }, 
      "size": 209, 
      "type": "txt"
    }
  ], 
  "id": 23967, 
  "links": {
    "badge": "https://aperta.ulakbim.gov.tr/badge/doi/10.1007/s00373-010-0892-2.svg", 
    "bucket": "https://aperta.ulakbim.gov.tr/api/files/d4d3448c-d217-4515-97c0-1ab06a5238d2", 
    "doi": "https://doi.org/10.1007/s00373-010-0892-2", 
    "html": "https://aperta.ulakbim.gov.tr/record/23967", 
    "latest": "https://aperta.ulakbim.gov.tr/api/records/23967", 
    "latest_html": "https://aperta.ulakbim.gov.tr/record/23967"
  }, 
  "metadata": {
    "access_right": "open", 
    "access_right_category": "success", 
    "communities": [
      {
        "id": "tubitak-destekli-proje-yayinlari"
      }
    ], 
    "creators": [
      {
        "affiliation": "Koc Univ, Dept Math, TR-34450 Istanbul, Turkey", 
        "name": "Kolotoglu, Emre"
      }, 
      {
        "affiliation": "Koc Univ, Dept Math, TR-34450 Istanbul, Turkey", 
        "name": "Yazici, Emine Sule"
      }
    ], 
    "description": "A defining set of a t-(v, k, lambda) design is a partial design which is contained in a unique t- design with the given parameters. A minimal defining set is a defining set, none of whose proper partial designs is a defining set. This paper proposes a new and more efficient algorithm that finds all non-isomorphic minimal defining sets of a given t- design. The complete list of minimal defining sets of 2-(6, 3, 6) designs, 2-(7, 3, 4) designs, the full 2-(7, 3, 5) design, a 2-(10, 4, 4) design, 2-(10, 5, 4) designs, 2-(13, 3, 1) designs, 2-(15, 3, 1) designs, the 2-(25, 5, 1) design, 3-(8, 4, 2) designs, the 3-(12, 6, 2) design, and 3-(16, 8, 3) designs are given to illustrate the efficiency of the algorithm. Also, corrections to the literature are made for the minimal defining sets of four 2-(7, 3, 3) designs, two 2-(6, 3, 4) designs and the 2-(21, 5, 1) design. Moreover, an infinite class of minimal defining sets for 2-((v)(3)) designs, where v >= 5, has been constructed which helped to show that the difference between the sizes of the largest and the smallest minimal defining sets of 2-((v)(3)) designs gets arbitrarily large as v -> infinity. Some results in the literature for the smallest defining sets of t-designs have been generalized to all minimal defining sets of these designs. We have also shown that all minimal defining sets of t-(2n, n, lambda) designs can be constructed from the minimal defining sets of their restrictions when t is odd and all t-(2n, n, lambda) designs are self-complementary. This theorem can be applied to 3-(8, 4, 3) designs, 3-(8, 4, 4) designs and the full 3-((8)(4)) design using the previous results on minimal defining sets of their restrictions. Furthermore we proved that when n is even all (n - 1)-(2n, n, lambda) designs are self-complementary.", 
    "doi": "10.1007/s00373-010-0892-2", 
    "has_grant": false, 
    "journal": {
      "issue": "2", 
      "pages": "259-281", 
      "title": "GRAPHS AND COMBINATORICS", 
      "volume": "26"
    }, 
    "license": {
      "id": "cc-by"
    }, 
    "publication_date": "2010-01-01", 
    "relations": {
      "version": [
        {
          "count": 1, 
          "index": 0, 
          "is_last": true, 
          "last_child": {
            "pid_type": "recid", 
            "pid_value": "23967"
          }, 
          "parent": {
            "pid_type": "recid", 
            "pid_value": "23966"
          }
        }
      ]
    }, 
    "resource_type": {
      "subtype": "article", 
      "title": "Dergi makalesi", 
      "type": "publication"
    }, 
    "title": "On Minimal Defining Sets of Full Designs and Self-Complementary Designs, and a New Algorithm for Finding Defining Sets of t-Designs"
  }, 
  "owners": [
    1
  ], 
  "revision": 1, 
  "stats": {
    "downloads": 6.0, 
    "unique_downloads": 6.0, 
    "unique_views": 32.0, 
    "version_downloads": 6.0, 
    "version_unique_downloads": 6.0, 
    "version_unique_views": 32.0, 
    "version_views": 34.0, 
    "version_volume": 1254.0, 
    "views": 34.0, 
    "volume": 1254.0
  }, 
  "updated": "2021-03-15T11:22:27.682494+00:00"
}