A New Lower Bound for the Smallest Complete (K, N)-Arc in $$\Mathrm {PG}(2,q)$$PG(2,q)

Designs, Codes, and Cryptography - Netherlands
doi 10.1007/s10623-018-00592-8
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Science and Business Media LLC

Related search

Construction of (N,r)-Arcs in PG(2,q)

Innovations in Incidence Geometry: Algebraic, Topological and Combinatorial
2005English

Erratum for “A Family of Complete Caps in PG(n, 2)”

Designs, Codes, and Cryptography
CombinatoricsApplied MathematicsComputer Science ApplicationsTheoretical Computer ScienceDiscrete Mathematics
2006English

Double Blocking Sets of Size 3q−1 in PG(2,q)

European Journal of Combinatorics
CombinatoricsMathematicsGeometryDiscrete MathematicsComputational TheoryTheoretical Computer ScienceTopology
2019English

Maximal Arcs in PG(2, Q) and Partial Flocks of the Quadratic Cone

Advances in Geometry
GeometryTopology
2006English

A New Lower Bound for {\Vert (3/2)^k\Vert }

Journal de Theorie des Nombres de Bordeaux
Number TheoryAlgebra
2007English

A Lower Bound for the Rank of $J_0(q)$

Acta Arithmetica
Number TheoryAlgebra
2000English

On T-Spreads of PG(( S + 1)( T + 1) − 1, Q)

Bulletin of the Australian Mathematical Society
Mathematics
1988English

On the Size of the Smallest Non-Classical Blocking Set of Rédei Type in PG(2, P)

Journal of Combinatorial Theory - Series A
CombinatoricsComputational TheoryDiscrete MathematicsTheoretical Computer ScienceMathematics
2000English

A Four-Class Association Scheme Derived From a Hyperbolic Quadric in PG(3,q)

Advances in Geometry
GeometryTopology
2004English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy