scientific article; zbMATH DE number 1061188
From MaRDI portal
Publication:4354373
zbMath0885.51012MaRDI QIDQ4354373
Publication date: 15 September 1997
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Combinatorial aspects of finite geometries (05B25) Blocking sets, ovals, (k)-arcs (51E21) Research exposition (monographs, survey articles) pertaining to geometry (51-02)
Related Items
Zoology of atlas-groups: dessins d'enfants, finite geometries and quantum commutation ⋮ Two cryptomorphic formalizations of projective incidence geometry ⋮ Learning orientations: a discrete geometry model ⋮ A survey of finite algebraic geometrical structures underlying mutually unbiased quantum measurements ⋮ Subplanes of projective planes of order 121 ⋮ Counting arcs in projective planes via Glynn's algorithm ⋮ proper partial geometries with an automorphism group acting primitively on points and lines ⋮ Formalizing Some “Small” Finite Models of Projective Geometry in Coq ⋮ On MPS construction of blocking sets in projective spaces: a generalization ⋮ Point line geometry in the tropical plane ⋮ An analytic function approach to weak mutually unbiased bases ⋮ Mutually unbiased projectors and duality between lines and bases in finite quantum systems ⋮ Extending partial projective planes ⋮ Multi-line geometry of qubit-qutrit and higher-order Pauli operators ⋮ A generalized extension theorem for linear codes ⋮ Small proper double blocking sets in Galois planes of prime order ⋮ A triality between weak mutually unbiased bases, zeros of their analytic representations, and finite geometries ⋮ An equivalence relation in finite planar spaces ⋮ On some operations on finite affine planes applied to the theory of regular configurations ⋮ Periods of Ehrhart coefficients of rational polytopes ⋮ The maximum labeled path problem ⋮ Finding small regular graphs of girths 6, 8 and 12 as subgraphs of cages ⋮ An alternate description of a (q + 1, 8)-cage ⋮ The Sylvester-Gallai theorem, colourings and algebra ⋮ A construction for circulant type dropout designs ⋮ Isomorphism check for \(2^n\) factorial designs with randomization restrictions ⋮ Constructions of small regular bipartite graphs of girth 6 ⋮ Analysis of Termatiko sets in measurement matrices ⋮ Absorbing sets of codes from finite geometries ⋮ Existence and construction of randomization defining contrast subspaces for regular factorial designs ⋮ The magnitude of a graph ⋮ A construction of small \((q-1)\)-regular graphs of girth 8 ⋮ Scalable secure storage when half the system is faulty
