Search problems in vector spaces

DOI10.1007/s10623-014-9941-9zbMath1329.68091arXiv1309.6731OpenAlexW2056914019MaRDI QIDQ498971

Balázs Patkós, Marcella Takáts, Tamás Héger

Publication date: 29 September 2015

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1309.6731

zbMATH Keywords

projective spaceseparating systemcombinatorial searchQ-analog

Mathematics Subject Classification ID

Searching and sorting (68P10) Combinatorial structures in finite projective spaces (51E20)

Related Items (5)

On cutting blocking sets and their codes ⋮ Higgledy-piggledy subspaces and uniform subspace designs ⋮ Higgledy-piggledy sets in projective spaces of small dimension ⋮ Resolving sets for higher dimensional projective spaces ⋮ On resolving sets in the point-line incidence graph of PG(n, q)

Cites Work

• Unnamed Item
• Unnamed Item
• Lines in higgledy-piggledy arrangement
• Blocking sets in Desarguesian affine and projective planes
• On the size of a double blocking set in \(\text{PG}(2,q)\)
• Unique reducibility of multiple blocking sets
• Resolving sets and semi-resolving sets in finite projective planes
• Base size, metric dimension and other invariants of groups and graphs
• Blocking Sets in Desarguesian Projective Planes
• Lacunary Polynomials, Multiple Blocking Sets and Baer Subplanes
• Multiple Blocking Sets and Arcs in Finite Planes
• The 2‐Blocking Number and the Upper Chromatic Number of PG(2,q)
• On separating systems of a finite set

This page was built for publication: Search problems in vector spaces