In this paper, we prove a stability result on k mod p multisets of points in PG (2, q), q= p h.
The particular case k= 0 is used to describe small weight codewords of the code generated …

A linear code C over\({\mathbb {F}} _q\) is called\(\Delta\)-divisible if the Hamming
weights\({\text {wt}}(c)\) of all codewords\(c\in C\) are divisible by\(\Delta\). The possible …

Let qq be a prime power and kk be a natural number. What are the possible cardinalities of
point sets SS in a projective plane of order qq, which do not intersect any line at exactly kk …

For a fixed hyperbolic quadric 𝓗 in PG (3, q), let 𝔼 (respectively 𝕋, 𝕊) denote the set of all
lines of PG (3, q) which are external (respectively tangent, secant) with respect to 𝓗. We …

If B is a minimal blocking set of size less than 3 (q+ 1)= 2 in PG (2, q), q is a power of the
prime p, then Szőnyi's result states that each line meets B in 1 (mod p) points. It follows that …

A t-semiarc is a point set S t with the property that the number of tangent lines to S t at each
of its points is t. We show that if a small t-semiarc S t in PG (2, q) has a large collinear subset …

A configuration C in a (finite) incidence structure is a subset C of blocks. If every point on a
block of C belongs to at least one other block of C, then C is called stopping set (or …

BLOCKING SETS OF CERTAIN LINE SETS IN PG(3,q) Page 1 BLOCKING SETS OF CERTAIN
LINE SETS IN PG(3,q) By BIKRAMADITYA SAHU MATH11201304003 National Institute of …

In this paper, we prove a stability result on t mod p multisets of points in PG (2, q), q= ph. The
particular case t= 0 is used to describe small weight codewords of the code generated by the …

On sets of points with few odd secants Page 1 Combinatorics, Probability and Computing (2020),
29, pp. 31–43 doi:10.1017/S0963548319000245 ARTICLE On sets of points with few odd …