๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Reconstructing plane sets from projections

โœ Scribed by G. Bianchi; M. Longinetti

Publisher
Springer
Year
1990
Tongue
English
Weight
931 KB
Volume
5
Category
Article
ISSN
0179-5376

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Reconstructing sets of orthogonal line s
Reconstructing sets of orthogonal line segments in the plane
โœ Franz Rendl; Gerhard Woeginger ๐Ÿ“‚ Article ๐Ÿ“… 1993 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 550 KB

Rend], F. and G. Woeginger, Reconstructing sets of orthogonal line segments in the plane, Discrete Mathematics 119 (1993) 1677174. We show that reconstructing a set of n orthogonal line segments in the plane from the set of their vertices can be done in O(n log n) time, if the segments are allowed

Maximal sets of permutations constructed
Maximal sets of permutations constructed from projective planes
โœ Peter Lorimer ๐Ÿ“‚ Article ๐Ÿ“… 1979 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 406 KB

On the set of n2+ n + 1 points of a projective plane, a set of ta2 + n -I-1 permutations is constructed with the property that any two are a Hamming distance 2n + 1 apart. Another set is constructed in which every pak are a Hamming distance not greater than 2n + 1 apart. Both sets are maximal with r

Codewords for Projective Planes from Set
Codewords for Projective Planes from Sets of Type (s, t)
โœ J.D. Key; M.J. de Resmini ๐Ÿ“‚ Article ๐Ÿ“… 1994 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 311 KB

Let \(\Pi^{*}\) be a projective plane of order \(n^{2}\) having a Baer subplane \(\Pi\), and let \(C\) be the code of \(\Pi^{*}\) over a prime field \(\mathbf{F}_{p}\), where \(p\) divides \(n\). If \(\Pi\) contains a set \(\mathscr{H}\) of type \((s, t)\), then it is shown that the incidence vector