Dieter Jungnickel


Ontology type: schema:Person     


Person Info

NAME

Dieter

SURNAME

Jungnickel

Publications in SciGraph latest 50 shown

  • 2019-04 The classification of Steiner triple systems on 27 points with 3-rank 24 in DESIGNS, CODES AND CRYPTOGRAPHY
  • 2018-03 Extension sets, affine designs, and Hamada’s conjecture in DESIGNS, CODES AND CRYPTOGRAPHY
  • 2018-03 On Bonisoli’s theorem and the block codes of Steiner triple systems in DESIGNS, CODES AND CRYPTOGRAPHY
  • 2017 On Classifying Steiner Triple Systems by Their 3-Rank in MATHEMATICAL ASPECTS OF COMPUTER AND INFORMATION SCIENCES
  • 2016-10 The characterization problem for designs with the parameters of AGd(n, q) in COMBINATORICA
  • 2016-07 On a theorem of Rigby in JOURNAL OF GEOMETRY
  • 2016-06 Editorial: finite geometries in DESIGNS, CODES AND CRYPTOGRAPHY
  • 2016-01 Editorial for the 25th anniversary issue in DESIGNS, CODES AND CRYPTOGRAPHY
  • 2015-12 Maximal arcs and quasi-symmetric designs in DESIGNS, CODES AND CRYPTOGRAPHY
  • 2014-07 Remarks on polarity designs in DESIGNS, CODES AND CRYPTOGRAPHY
  • 2013-12 Obituary: Hanfried Lenz (1916–2013) in DESIGNS, CODES AND CRYPTOGRAPHY
  • 2013-07 New invariants for incidence structures in DESIGNS, CODES AND CRYPTOGRAPHY
  • 2013-07 Editorial: Finite geometries in DESIGNS, CODES AND CRYPTOGRAPHY
  • 2013-05 Obituary: Daniel R. Hughes (1927–2012) in DESIGNS, CODES AND CRYPTOGRAPHY
  • 2013-05 Obituary: Marialuisa J. de Resmini (1939–2012) in DESIGNS, CODES AND CRYPTOGRAPHY
  • 2012-12 The geometric dimension of some small configurations in JOURNAL OF GEOMETRY
  • 2012-10 A Hamada type characterization of the classical geometric designs in DESIGNS, CODES AND CRYPTOGRAPHY
  • 2011-08 Recent results on designs with classical parameters in JOURNAL OF GEOMETRY
  • 2010-05 The number of designs with geometric parameters grows exponentially in DESIGNS, CODES AND CRYPTOGRAPHY
  • 2009-05 Polarities, quasi-symmetric designs, and Hamada’s conjecture in DESIGNS, CODES AND CRYPTOGRAPHY
  • 2008-06 The isomorphism problem for abelian projective planes in APPLICABLE ALGEBRA IN ENGINEERING, COMMUNICATION AND COMPUTING
  • 2008-06 Finite geometries in DESIGNS, CODES AND CRYPTOGRAPHY
  • 2007-09 Preface in DESIGNS, CODES AND CRYPTOGRAPHY
  • 2007-03 A Non-Existence Result For Finite Projective Planes In Lenz-Barlotti Class I.4 in COMBINATORICA
  • 2003-05 Some New Maximal Sets of Mutually Orthogonal Latin Squares in DESIGNS, CODES AND CRYPTOGRAPHY
  • 2003-05 Finite Geometries in DESIGNS, CODES AND CRYPTOGRAPHY
  • 2002-06 Arcs and Ovals from Abelian Groups in DESIGNS, CODES AND CRYPTOGRAPHY
  • 2001 On a Class of Symmetric Divisible Designs which are Almost Projective Planes in FINITE GEOMETRIES
  • 1999 Difference Sets: An Introduction in DIFFERENCE SETS, SEQUENCES AND THEIR CORRELATION PROPERTIES
  • 1996-05 Codes Based on Complete Graphs in DESIGNS, CODES AND CRYPTOGRAPHY
  • 1996-05 Codes based on complete graphs in DESIGNS, CODES AND CRYPTOGRAPHY
  • 1996-05 A Life's Work in Geometry: An Homage to Hanfried Lenz in DESIGNS, CODES AND CRYPTOGRAPHY
  • 1996 Codes Based on Complete Graphs in DESIGNS AND FINITE GEOMETRIES
  • 1996 A Life’s Work in Geometry: An Homage to Hanfried Lenz in DESIGNS AND FINITE GEOMETRIES
  • 1995-11 An application of coding theory to a problem in graphical enumeration in ARCHIV DER MATHEMATIK
  • 1994-07 A new class of symmetric (v, k, λ)-designs in DESIGNS, CODES AND CRYPTOGRAPHY
  • 1994-06 Erratum in GRAPHS AND COMBINATORICS
  • 1994-02 A note on orthogonal circulant matrices over finite fields in ARCHIV DER MATHEMATIK
  • 1992-09 Strongly Regular Semi-Cayley Graphs in JOURNAL OF ALGEBRAIC COMBINATORICS
  • 1992-08 On the number of isomorphism classes of complete translation nets in ARCHIV DER MATHEMATIK
  • 1991-09 Exponential number of quasi-symmetric SDP designs and codes meeting the Grey-Rankin bound in DESIGNS, CODES AND CRYPTOGRAPHY
  • 1991-09 The mann test for divisible difference sets in GRAPHS AND COMBINATORICS
  • 1991-03 The existence of non-trivial hyperfactorizations ofK2n in COMBINATORICA
  • 1991-03 Some non-existence results on divisible difference sets in COMBINATORICA
  • 1990-11 The Steinberg module of a graph in ARCHIV DER MATHEMATIK
  • 1990-11 Bruck nets with a transitive direction in GEOMETRIAE DEDICATA
  • 1990-02 On automorphism groups of divisible designs, II: Group invariant generalised conference matrices in ARCHIV DER MATHEMATIK
  • 1989-12 On the chromatic index of a finite projective space in GEOMETRIAE DEDICATA
  • 1989-07 A family of relative difference sets associated with Hjelmslev structures over finite projective spaces in JOURNAL OF GEOMETRY
  • 1989-06 An elementary proof of Wilbrink's theorem in ARCHIV DER MATHEMATIK
  • Affiliations

    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", 
        "affiliation": [
          {
            "affiliation": {
              "id": "https://www.grid.ac/institutes/grid.7307.3", 
              "type": "Organization"
            }, 
            "isCurrent": true, 
            "type": "OrganizationRole"
          }
        ], 
        "familyName": "Jungnickel", 
        "givenName": "Dieter", 
        "id": "sg:person.016273474670.91", 
        "identifier": {
          "name": "orcid_id", 
          "type": "PropertyValue", 
          "value": [
            "0000-0001-5615-6934"
          ]
        }, 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.016273474670.91", 
          "https://orcid.org/0000-0001-5615-6934"
        ], 
        "sdDataset": "persons", 
        "sdDatePublished": "2019-03-07T14:16", 
        "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
        "sdPublisher": {
          "name": "Springer Nature - SN SciGraph project", 
          "type": "Organization"
        }, 
        "sdSource": "s3://com-uberresearch-data-dimensions-researchers-20181010/20181011/dim_researchers/base/researchers_2037.json", 
        "type": "Person"
      }
    ]
     

    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/person.016273474670.91'

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

    curl -H 'Accept: application/n-triples' 'https://scigraph.springernature.com/person.016273474670.91'

    Turtle is a human-readable linked data format.

    curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/person.016273474670.91'

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

    curl -H 'Accept: application/rdf+xml' 'https://scigraph.springernature.com/person.016273474670.91'


     




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


    ...