• Nem Talált Eredményt

Semi-resolving sets for PG(2, q)

N/A
N/A
Protected

Academic year: 2022

Ossza meg "Semi-resolving sets for PG(2, q)"

Copied!
71
0
0

Teljes szövegt

(1)

Semi-resolving sets for PG (2, q)

Tamás Héger

Joint work withMarcella Takáts

Eötvös Loránd University Budapest

Finite Geometry Conference and Workshop 10–14 June 2013

Szeged, Hungary

Héger, Takáts Semi-resolving sets forPG(2,q)

(2)

LetΠq = (P,L)be a projective plane of order q.

Idea (Bailey, BCC 2011): ifPS is a point-set that resolves all lines, andLS is a line-set that resolves all points, then

S=PS∪ LS is clearly a resolving set.

Such a resolving set is called asplit resolving set; its parts, PS

andLS are calledsemi-resolving sets. Note that if the plane is self-dual (likePG(2,q)), then we may assume that a semi-resolving set resolves the lines of the plane.

Definition

The size of the smallest split resolving set forΠq isµq).

The size of the smallest semi-resolving set forΠq isµSq);

well-defined ifΠq is self-dual.

Clearlyµ(Πq)≤µq), and µ(PG(2,q)) =2µS(PG(2,q)).

Héger, Takáts Semi-resolving sets forPG(2,q)

(3)

Feedback

LetΠq = (P,L)be a projective plane of order q.

Idea (Bailey, BCC 2011): ifPS is a point-set that resolves all lines, andLS is a line-set that resolves all points, then

S=PS∪ LS is clearly a resolving set.

Such a resolving set is called asplit resolving set; its parts, PS

andLS are calledsemi-resolving sets. Note that if the plane is self-dual (likePG(2,q)), then we may assume that a semi-resolving set resolves the lines of the plane.

Definition

The size of the smallest split resolving set forΠq isµq).

The size of the smallest semi-resolving set forΠq isµSq);

well-defined ifΠq is self-dual.

Clearlyµ(Πq)≤µq), and µ(PG(2,q)) =2µS(PG(2,q)).

Héger, Takáts Semi-resolving sets forPG(2,q)

(4)

LetΠq = (P,L)be a projective plane of order q.

Idea (Bailey, BCC 2011): ifPS is a point-set that resolves all lines, andLS is a line-set that resolves all points, then

S=PS∪ LS is clearly a resolving set.

Such a resolving set is called asplit resolving set; its parts, PS

andLS are calledsemi-resolving sets. Note that if the plane is self-dual (likePG(2,q)), then we may assume that a semi-resolving set resolves the lines of the plane.

Definition

The size of the smallest split resolving set forΠq isµq).

The size of the smallest semi-resolving set forΠq isµSq);

well-defined ifΠq is self-dual.

Clearlyµ(Πq)≤µq), and µ(PG(2,q)) =2µS(PG(2,q)).

Héger, Takáts Semi-resolving sets forPG(2,q)

(5)

Feedback

LetΠq = (P,L)be a projective plane of order q.

Idea (Bailey, BCC 2011): ifPS is a point-set that resolves all lines, andLS is a line-set that resolves all points, then

S=PS∪ LS is clearly a resolving set.

Such a resolving set is called asplit resolving set; its parts, PS

andLS are calledsemi-resolving sets. Note that if the plane is self-dual (likePG(2,q)), then we may assume that a semi-resolving set resolves the lines of the plane.

Definition

The size of the smallest split resolving set forΠq isµq).

The size of the smallest semi-resolving set forΠq isµSq);

well-defined ifΠq is self-dual.

Clearlyµ(Πq)≤µq), and µ(PG(2,q)) =2µS(PG(2,q)).

Héger, Takáts Semi-resolving sets forPG(2,q)

(6)

LetΠq = (P,L)be a projective plane of order q.

Idea (Bailey, BCC 2011): ifPS is a point-set that resolves all lines, andLS is a line-set that resolves all points, then

S=PS∪ LS is clearly a resolving set.

Such a resolving set is called asplit resolving set; its parts, PS

andLS are calledsemi-resolving sets. Note that if the plane is self-dual (likePG(2,q)), then we may assume that a semi-resolving set resolves the lines of the plane.

Definition

The size of the smallest split resolving set forΠq isµq).

The size of the smallest semi-resolving set forΠq isµSq);

well-defined ifΠq is self-dual.

Clearlyµ(Πq)≤µq), and µ(PG(2,q)) =2µS(PG(2,q)).

Héger, Takáts Semi-resolving sets forPG(2,q)

(7)

Semi-resolving sets for projective planes

P is a point,ℓ is a line;

d(P, ℓ) =1 ⇐⇒ P ∈ℓ d(P, ℓ) =3 ⇐⇒ P ∈/ ℓ

There is no third possibility: incidence determines distance. I.e., a distance list ofℓwith respect to a point-setS !ℓ∩ S.

SoS is a semi-resolving set ⇐⇒ S ∩ℓis unique for every lineℓ.

Clear: |ℓ∩ S| ≥2⇒ S resolvesℓ.

So a point-setS is a semi-resolving set if and only if there is at most one skew line to S

there is at most one tangent line through any point of S.

Héger, Takáts Semi-resolving sets forPG(2,q)

(8)

P is a point,ℓ is a line;

d(P, ℓ) =1 ⇐⇒ P ∈ℓ d(P, ℓ) =3 ⇐⇒ P ∈/ ℓ

There is no third possibility: incidence determines distance. I.e., a distance list ofℓwith respect to a point-setS !ℓ∩ S.

SoS is a semi-resolving set ⇐⇒ S ∩ℓis unique for every lineℓ.

Clear: |ℓ∩ S| ≥2⇒ S resolvesℓ.

So a point-setS is a semi-resolving set if and only if there is at most one skew line to S

there is at most one tangent line through any point of S.

Héger, Takáts Semi-resolving sets forPG(2,q)

(9)

Semi-resolving sets for projective planes

P is a point,ℓ is a line;

d(P, ℓ) =1 ⇐⇒ P ∈ℓ d(P, ℓ) =3 ⇐⇒ P ∈/ ℓ

There is no third possibility: incidence determines distance. I.e., a distance list ofℓwith respect to a point-setS !ℓ∩ S.

SoS is a semi-resolving set ⇐⇒ S ∩ℓis unique for every lineℓ.

Clear: |ℓ∩ S| ≥2⇒ S resolvesℓ.

So a point-setS is a semi-resolving set if and only if there is at most one skew line to S

there is at most one tangent line through any point of S.

Héger, Takáts Semi-resolving sets forPG(2,q)

(10)

P is a point,ℓ is a line;

d(P, ℓ) =1 ⇐⇒ P ∈ℓ d(P, ℓ) =3 ⇐⇒ P ∈/ ℓ

There is no third possibility: incidence determines distance. I.e., a distance list ofℓwith respect to a point-setS !ℓ∩ S.

SoS is a semi-resolving set ⇐⇒ S ∩ℓis unique for every lineℓ.

Clear: |ℓ∩ S| ≥2⇒ S resolvesℓ.

So a point-setS is a semi-resolving set if and only if there is at most one skew line to S

there is at most one tangent line through any point of S.

Héger, Takáts Semi-resolving sets forPG(2,q)

(11)

Semi-resolving sets for projective planes

P is a point,ℓ is a line;

d(P, ℓ) =1 ⇐⇒ P ∈ℓ d(P, ℓ) =3 ⇐⇒ P ∈/ ℓ

There is no third possibility: incidence determines distance. I.e., a distance list ofℓwith respect to a point-setS !ℓ∩ S.

SoS is a semi-resolving set ⇐⇒ S ∩ℓis unique for every lineℓ.

Clear: |ℓ∩ S| ≥2⇒ S resolvesℓ.

So a point-setS is a semi-resolving set if and only if there is at most one skew line to S

there is at most one tangent line through any point of S.

Héger, Takáts Semi-resolving sets forPG(2,q)

(12)

Definition

A t-fold blocking set is a set of points that intersects every line in at least t points.

Blocking set =1-fold blocking set Double blocking set =2-fold blocking set

A double blocking set is clearly a semi-resolving set.

τ2: the size of the smallest double blocking set.

Hence we haveµS ≤τ2. (Bailey)

Héger, Takáts Semi-resolving sets forPG(2,q)

(13)

Constructions

Definition

A t-fold blocking set is a set of points that intersects every line in at least t points.

Blocking set =1-fold blocking set Double blocking set =2-fold blocking set

A double blocking set is clearly a semi-resolving set.

τ2: the size of the smallest double blocking set.

Hence we haveµS ≤τ2. (Bailey)

Héger, Takáts Semi-resolving sets forPG(2,q)

(14)

Definition

A t-fold blocking set is a set of points that intersects every line in at least t points.

Blocking set =1-fold blocking set Double blocking set =2-fold blocking set

A double blocking set is clearly a semi-resolving set.

τ2: the size of the smallest double blocking set.

Hence we haveµS ≤τ2. (Bailey)

Héger, Takáts Semi-resolving sets forPG(2,q)

(15)

Constructions

Ba double blocking set, P ∈ B arbitrary.

ThenS =B \ {P}is a semi-resolving set:

there is no skew line to S;

there is at most one tangent line through any pointQ of S: PQ may be tangent.

So we haveµS ≤τ2−1. (Bailey)

Héger, Takáts Semi-resolving sets forPG(2,q)

(16)

B1,B2 disjoint blocking sets,P1 ∈ B1,P2∈ B2 arbitrary.

ThenS =B1\ {P1} ∪ B2\ {P2} is a semi-resolving set:

P

B

P B

1 2

1 2

Q

there is at most one skew line to S: P1P2 may be skew there is at most one tangent line through any pointQ ∈ S: say, Q ∈ B1; every line throughQ intersectsB2, except possibly QP2.

Héger, Takáts Semi-resolving sets forPG(2,q)

(17)

Results

Ifq is a square, we find disjoint Baer subplanes (blocking sets of sizeq+√q+1). Thus we haveµS(PG(2,q))≤2q+2√q.

Aart Blokhuis (unpublished): µSq)≥2q+√

2q (roughly).

We prove: ifq ≥87, then µS(PG(2,q))≥2q+2√q. In fact:

Theorem

LetS be a semi-resolving set for PG(2,q), q ≥4. If

|S|<9q/4−3, then one can add at most two points toS to obtain a double blocking set; thus|S| ≥τ2−2.

Corollary

LetS be a semi-resolving set for PG(2,q), q ≥4. Then

|S| ≥min{9q/4−3, τ2(PG(2,q))−2}.

Héger, Takáts Semi-resolving sets forPG(2,q)

(18)

Ifq is a square, we find disjoint Baer subplanes (blocking sets of sizeq+√q+1). Thus we haveµS(PG(2,q))≤2q+2√q.

Aart Blokhuis (unpublished): µSq)≥2q+√

2q (roughly).

We prove: ifq ≥87, then µS(PG(2,q))≥2q+2√q. In fact:

Theorem

LetS be a semi-resolving set for PG(2,q), q ≥4. If

|S|<9q/4−3, then one can add at most two points toS to obtain a double blocking set; thus|S| ≥τ2−2.

Corollary

LetS be a semi-resolving set for PG(2,q), q ≥4. Then

|S| ≥min{9q/4−3, τ2(PG(2,q))−2}.

Héger, Takáts Semi-resolving sets forPG(2,q)

(19)

Results

Ifq is a square, we find disjoint Baer subplanes (blocking sets of sizeq+√q+1). Thus we haveµS(PG(2,q))≤2q+2√q.

Aart Blokhuis (unpublished): µSq)≥2q+√

2q (roughly).

We prove: ifq ≥87, then µS(PG(2,q))≥2q+2√q. In fact:

Theorem

LetS be a semi-resolving set for PG(2,q), q ≥4. If

|S|<9q/4−3, then one can add at most two points toS to obtain a double blocking set; thus|S| ≥τ2−2.

Corollary

LetS be a semi-resolving set for PG(2,q), q ≥4. Then

|S| ≥min{9q/4−3, τ2(PG(2,q))−2}.

Héger, Takáts Semi-resolving sets forPG(2,q)

(20)

Ifq is a square, we find disjoint Baer subplanes (blocking sets of sizeq+√q+1). Thus we haveµS(PG(2,q))≤2q+2√q.

Aart Blokhuis (unpublished): µSq)≥2q+√

2q (roughly).

We prove: ifq ≥87, then µS(PG(2,q))≥2q+2√q. In fact:

Theorem

LetS be a semi-resolving set for PG(2,q), q ≥4. If

|S|<9q/4−3, then one can add at most two points toS to obtain a double blocking set; thus|S| ≥τ2−2.

Corollary

LetS be a semi-resolving set for PG(2,q), q ≥4. Then

|S| ≥min{9q/4−3, τ2(PG(2,q))−2}.

Héger, Takáts Semi-resolving sets forPG(2,q)

(21)

Results

Ifq is a square, we find disjoint Baer subplanes (blocking sets of sizeq+√q+1). Thus we haveµS(PG(2,q))≤2q+2√q.

Aart Blokhuis (unpublished): µSq)≥2q+√

2q (roughly).

We prove: ifq ≥87, then µS(PG(2,q))≥2q+2√q. In fact:

Theorem

LetS be a semi-resolving set for PG(2,q), q ≥4. If

|S|<9q/4−3, then one can add at most two points toS to obtain a double blocking set; thus|S| ≥τ2−2.

Corollary

LetS be a semi-resolving set for PG(2,q), q ≥4. Then

|S| ≥min{9q/4−3, τ2(PG(2,q))−2}.

Héger, Takáts Semi-resolving sets forPG(2,q)

(22)

If q ≥9 is a square, thenτ2=2q+2√q+2. Thus the corollary gives µS ≥τ2−2 if q ≥87.

If q =rh,r odd,h≥3 odd, thenτ2 ≤2(q−1)/(r−1). Thus the corollary givesµS ≥τ2−2 if r ≥11.

Theorem

LetS be a semi-resolving set for PG(2,q), q ≥4. If

|S|<9q/4−3, then one can add at most two points toS to obtain a double blocking set; thus|S| ≥τ2−2.

Corollary

LetS be a semi-resolving set for PG(2,q), q ≥4. Then

|S| ≥min{9q/4−3, τ2(PG(2,q))−2}.

Héger, Takáts Semi-resolving sets forPG(2,q)

(23)

Blocking semiovals

Definition

A point-setS is a semioval, if it has precisely one tangent at each of its points. Ablocking semiovalis a semioval that is a blocking set.

Theorem (Dover)

LetS be a blocking semioval in an arbitrary projective plane of order q. If q≥7, then|S| ≥2q+2. If q≥3 and there is a line intersectingS in q−k points, 1≤k ≤q−1, then

|S| ≥3q−2q/(k+2)−k.

Héger, Takáts Semi-resolving sets forPG(2,q)

(24)

Corollary

LetS be a blocking semioval in PG(2,q), q ≥4. Then

|S| ≥9q/4−3.

Proof.

A blocking semiovalS is a semi-resolving set. Suppose

|S|<9q/4−3. Then|S| ≥τ2−2>2q+1, so S has at least 2q+2 tangents, but two points may block at most 2q+1 of

them.

Héger, Takáts Semi-resolving sets forPG(2,q)

(25)

A corollary for blocking semiovals

Corollary

LetS be a blocking semioval in PG(2,q), q ≥4. Then

|S| ≥9q/4−3.

Proof.

A blocking semiovalS is a semi-resolving set. Suppose

|S|<9q/4−3. Then|S| ≥τ2−2>2q+1, so S has at least 2q+2 tangents, but two points may block at most 2q+1 of

them.

Héger, Takáts Semi-resolving sets forPG(2,q)

(26)

S is a semi-resolving set, P is a point.

Let|S|=2q+β. Homework: β ≥ −1.

indi(P): the number of i-secants to S throughP ind(P) :=2ind0(P) +ind1(P)(index)

We show thatind(P) is either large or small.

IfP ∈ S, thenind(P)≤1.

LetP ∈ S/ ,ind(P)≤q−2,|S|=2q+β ≤4q−4. Chooseℓ so thatP ∈ℓ,|ℓ∩ S|=s ≥2 ,(∞)∈/S, and P 6= (∞).

(This can be done: homework.)

Héger, Takáts Semi-resolving sets forPG(2,q)

(27)

Index

S is a semi-resolving set, P is a point.

Let|S|=2q+β. Homework: β ≥ −1.

indi(P): the number of i-secants to S throughP ind(P) :=2ind0(P) +ind1(P)(index)

We show thatind(P) is either large or small.

IfP ∈ S, thenind(P)≤1.

LetP ∈ S/ ,ind(P)≤q−2,|S|=2q+β ≤4q−4. Chooseℓ so thatP ∈ℓ,|ℓ∩ S|=s ≥2 ,(∞)∈/S, and P 6= (∞).

(This can be done: homework.)

Héger, Takáts Semi-resolving sets forPG(2,q)

(28)

S is a semi-resolving set, P is a point.

Let|S|=2q+β. Homework: β ≥ −1.

indi(P): the number of i-secants to S throughP ind(P) :=2ind0(P) +ind1(P)(index)

We show thatind(P) is either large or small.

IfP ∈ S, thenind(P)≤1.

LetP ∈ S/ ,ind(P)≤q−2,|S|=2q+β ≤4q−4. Chooseℓ so thatP ∈ℓ,|ℓ∩ S|=s ≥2 ,(∞)∈/S, and P 6= (∞).

(This can be done: homework.)

Héger, Takáts Semi-resolving sets forPG(2,q)

(29)

Index

S is a semi-resolving set, P is a point.

Let|S|=2q+β. Homework: β ≥ −1.

indi(P): the number of i-secants to S throughP ind(P) :=2ind0(P) +ind1(P)(index)

We show thatind(P) is either large or small.

IfP ∈ S, thenind(P)≤1.

LetP ∈ S/ ,ind(P)≤q−2,|S|=2q+β ≤4q−4. Chooseℓ so thatP ∈ℓ,|ℓ∩ S|=s ≥2 ,(∞)∈/S, and P 6= (∞).

(This can be done: homework.)

Héger, Takáts Semi-resolving sets forPG(2,q)

(30)

S is a semi-resolving set, P is a point.

Let|S|=2q+β. Homework: β ≥ −1.

indi(P): the number of i-secants to S throughP ind(P) :=2ind0(P) +ind1(P)(index)

We show thatind(P) is either large or small.

IfP ∈ S, thenind(P)≤1.

LetP ∈ S/ ,ind(P)≤q−2,|S|=2q+β ≤4q−4. Chooseℓ so thatP ∈ℓ,|ℓ∩ S|=s ≥2 ,(∞)∈/S, and P 6= (∞).

(This can be done: homework.)

Héger, Takáts Semi-resolving sets forPG(2,q)

(31)

Index

S is a semi-resolving set, P is a point.

Let|S|=2q+β. Homework: β ≥ −1.

indi(P): the number of i-secants to S throughP ind(P) :=2ind0(P) +ind1(P)(index)

We show thatind(P) is either large or small.

IfP ∈ S, thenind(P)≤1.

LetP ∈ S/ ,ind(P)≤q−2,|S|=2q+β ≤4q−4. Chooseℓ so thatP ∈ℓ,|ℓ∩ S|=s ≥2,(∞)∈/S, and P 6= (∞).

(This can be done: homework.)

Héger, Takáts Semi-resolving sets forPG(2,q)

(32)

S is a semi-resolving set, P is a point.

Let|S|=2q+β. Homework: β ≥ −1.

indi(P): the number of i-secants to S throughP ind(P) :=2ind0(P) +ind1(P)(index)

We show thatind(P) is either large or small.

IfP ∈ S, thenind(P)≤1.

LetP ∈ S/ ,ind(P)≤q−2,|S|=2q+β ≤4q−4. Chooseℓ so thatP ∈ℓ,|ℓ∩ S|=s ≥2 ,(∞)∈/S, and P 6= (∞).

(This can be done: homework.)

Héger, Takáts Semi-resolving sets forPG(2,q)

(33)

Index

S is a semi-resolving set, P is a point.

Let|S|=2q+β. Homework: β ≥ −1.

indi(P): the number of i-secants to S throughP ind(P) :=2ind0(P) +ind1(P)(index)

We show thatind(P) is either large or small.

IfP ∈ S, thenind(P)≤1.

LetP ∈ S/ ,ind(P)≤q−2,|S|=2q+β ≤4q−4. Chooseℓ so thatP ∈ℓ,|ℓ∩ S|=s ≥2 ,(∞)∈/S, and P 6= (∞).

(This can be done: homework.)

Héger, Takáts Semi-resolving sets forPG(2,q)

(34)

R(M,B) =

|S∩AG(2,q)|

Y

i=1

(Mxi +B−yi)∈GF(q)[M,B]

|S∩ {Y =mX +b}|= the multiplicity of the rootb in R(m,B) m∈GF(q),P = (m)∈ S/ ,ℓ a „standard” line

deg gcd(R(m,B),(Bq−B)2) = 0·#skew lines on (m) +1·#tangent lines on (m) +2·#standard lines on (m)

=2q−ind(m) {(x ,y )}

8

( )

Y=mX+b m

AG(2, )q

(0, )b S’= i i

l 8( )

Héger, Takáts Semi-resolving sets forPG(2,q)

(35)

The Rédei polynomial

R(M,B) =

|S∩AG(2,q)|

Y

i=1

(Mxi +B−yi)∈GF(q)[M,B]

|S∩ {Y =mX +b}|= the multiplicity of the rootb in R(m,B) m∈GF(q),P = (m)∈ S/ ,ℓ a „standard” line

deg gcd(R(m,B),(Bq−B)2) = 0·#skew lines on (m) +1·#tangent lines on (m) +2·#standard lines on (m)

=2q−ind(m) {(x ,y )}

8

( )

Y=mX+b m

AG(2, )q

(0, )b S’= i i

l 8( )

Héger, Takáts Semi-resolving sets forPG(2,q)

(36)

R(M,B) =

|S∩AG(2,q)|

Y

i=1

(Mxi +B−yi)∈GF(q)[M,B]

|S∩ {Y =mX +b}|= the multiplicity of the rootb in R(m,B) m∈GF(q),P = (m)∈ S/ ,ℓ a „standard” line

deg gcd(R(m,B),(Bq−B)2) = 0·#skew lines on (m) +1·#tangent lines on (m) +2·#standard lines on (m)

=2q−ind(m) {(x ,y )}

8

( )

Y=mX+b m

AG(2, )q

(0, )b S’= i i

l 8( )

Héger, Takáts Semi-resolving sets forPG(2,q)

(37)

The Rédei polynomial

R(M,B) =

|S∩AG(2,q)|

Y

i=1

(Mxi +B−yi)∈GF(q)[M,B]

|S∩ {Y =mX +b}|= the multiplicity of the rootb in R(m,B) m∈GF(q),P = (m)∈ S/ ,ℓ a „standard” line

deg gcd(R(m,B),(Bq−B)2) = 0·#skew lines on (m) +1·#tangent lines on (m) +2·#standard lines on (m)

=2q−ind(m) {(x ,y )}

8

( )

Y=mX+b m

AG(2, )q

(0, )b S’= i i

l 8( )

Héger, Takáts Semi-resolving sets forPG(2,q)

(38)

Forz ∈Z,z+=max{z,0}. Lemma (Szőnyi–Weiner)

Let u,v ∈GF(q)[X,Y]. Suppose that the coefficient of Xdeg(u) in u(X,Y) is not zero. For y ∈GF(q), let

ky :=deg gcd(u(X,y),v(X,y)).

Then for all y ∈GF(q) X

yGF(q)

ky−ky+

≤(degu(X,Y)−ky)(degv(X,Y)−ky).

Héger, Takáts Semi-resolving sets forPG(2,q)

(39)

The crucial tool: the Szőnyi–Weiner Lemma

Forz ∈Z,z+=max{z,0}. Lemma (Szőnyi–Weiner)

Let u,v ∈GF(q)[X,Y]. Suppose that the coefficient of Xdeg(u) in u(X,Y) is not zero. For y ∈GF(q), let

ky :=deg gcd(u(X,y),v(X,y)).

Then for all y ∈GF(q) X

yGF(q)

ky−ky+

≤(degu(X,Y)−ky)(degv(X,Y)−ky).

Héger, Takáts Semi-resolving sets forPG(2,q)

(40)

Forz ∈Z,z+=max{z,0}. Lemma (Szőnyi–Weiner)

Let u,v ∈GF(q)[X,Y]. Suppose that the coefficient of Xdeg(u) in u(X,Y) is not zero. For y ∈GF(q), let

ky :=deg gcd(u(X,y),v(X,y)).

Then for all y ∈GF(q) X

yGF(q)

ky−ky+

≤(degu(X,Y)−ky)(degv(X,Y)−ky).

Héger, Takáts Semi-resolving sets forPG(2,q)

(41)

The crucial tool: the Szőnyi–Weiner Lemma

Forz ∈Z,z+=max{z,0}. Lemma (Szőnyi–Weiner)

Let u,v ∈GF(q)[X,Y]. Suppose that the coefficient of Xdeg(u) in u(X,Y) is not zero. For y ∈GF(q), let

ky :=deg gcd(u(X,y),v(X,y)).

Then for all y ∈GF(q) X

yGF(q)

ky−ky+

≤(degu(X,Y)−ky)(degv(X,Y)−ky).

Héger, Takáts Semi-resolving sets forPG(2,q)

(42)

D: non-vertical directions outsideS D⊂GF(q);|D|=q−s

R(M,B) =Q|S|

i=1(Mxi+B−yi) deg(R(M,B)) =|S|=2q+β−s {(x ,y )}

l8

S

i

m ( )8 D

( ) =P

S’= i

∀m ∈D:km :=deg gcd(R(m,B),(Bq−B)2) =2q−ind(m)

|S| −km

(2q−km) ≥ X

mGF(q)

(km−km)+

X

m∈D

(km −km)+ ≥ X

m∈D

(ind(m)−ind(m))

Héger, Takáts Semi-resolving sets forPG(2,q)

(43)

Applying the Szőnyi–Weiner Lemma

D: non-vertical directions outsideS D⊂GF(q);|D|=q−s

R(M,B) =Q|S|

i=1(Mxi+B−yi) deg(R(M,B)) =|S|=2q+β−s {(x ,y )}

l8

S

i

m ( )8 D

( ) =P

S’= i

∀m ∈D:km :=deg gcd(R(m,B),(Bq−B)2) =2q−ind(m)

|S| −km

(2q−km) ≥ X

mGF(q)

(km−km)+

X

m∈D

(km −km)+ ≥ X

m∈D

(ind(m)−ind(m))

Héger, Takáts Semi-resolving sets forPG(2,q)

(44)

D: non-vertical directions outsideS D⊂GF(q);|D|=q−s

R(M,B) =Q|S|

i=1(Mxi+B−yi) deg(R(M,B)) =|S|=2q+β−s {(x ,y )}

l8

S

i

m ( )8 D

( ) =P

S’= i

∀m ∈D:km :=deg gcd(R(m,B),(Bq−B)2) =2q−ind(m)

|S| −km

(2q−km) ≥ X

mGF(q)

(km−km)+

X

m∈D

(km −km)+ ≥ X

m∈D

(ind(m)−ind(m))

Héger, Takáts Semi-resolving sets forPG(2,q)

(45)

Applying the Szőnyi–Weiner Lemma

D: non-vertical directions outsideS D⊂GF(q);|D|=q−s

R(M,B) =Q|S|

i=1(Mxi+B−yi) deg(R(M,B)) =|S|=2q+β−s {(x ,y )}

l8

S

i

m ( )8 D

( ) =P

S’= i

∀m ∈D:km :=deg gcd(R(m,B),(Bq−B)2) =2q−ind(m)

|S| −km

(2q−km) ≥ X

mGF(q)

(km−km)+≥ X

m∈D

(km −km)+ ≥ X

m∈D

(ind(m)−ind(m))

Héger, Takáts Semi-resolving sets forPG(2,q)

(46)

D: non-vertical directions outsideS D⊂GF(q);|D|=q−s

R(M,B) =Q|S|

i=1(Mxi+B−yi) deg(R(M,B)) =|S|=2q+β−s {(x ,y )}

l8

S

i

m ( )8 D

( ) =P

S’= i

∀m ∈D:km :=deg gcd(R(m,B),(Bq−B)2) =2q−ind(m)

|S| −km

(2q−km) ≥ X

mGF(q)

(km−km)+≥ X

m∈D

(km −km)+ ≥ X

m∈D

(ind(m)−ind(m))

Héger, Takáts Semi-resolving sets forPG(2,q)

(47)

Applying the Szőnyi–Weiner Lemma

D: non-vertical directions outsideS D⊂GF(q);|D|=q−s

R(M,B) =Q|S|

i=1(Mxi+B−yi) deg(R(M,B)) =|S|=2q+β−s {(x ,y )}

l8

S

i

m ( )8 D

( ) =P

S’= i

∀m ∈D:km :=deg gcd(R(m,B),(Bq−B)2) =2q−ind(m)

|S| −km

(2q−km) ≥ X

mGF(q)

(km−km)+≥ X

m∈D

(km −km)+ ≥ X

m∈D

(ind(m)−ind(m))

Héger, Takáts Semi-resolving sets forPG(2,q)

(48)

|S| −km)

(2q−km))≥ X

m∈D

(ind(m)−ind(m))

|S|=2q+β−s,β≥ −1 and km=2q−ind(m), thus

|S| −km

(2q−km) =(ind(m) +β−s)ind(m).

δ:= #1-secants +2·#0-secants. Then X

m∈D

ind(m)≤δ, and X

m∈D

ind(m)≤ |S| −s+2≤2q+β,

thus X

m∈D

(ind(m)−ind(m))≥(q−s)ind(m)−δ.

For any pointP ∈ S/ , we get

ind(P)2−(q−β)ind(P) +δ ≥0.

Héger, Takáts Semi-resolving sets forPG(2,q)

(49)

Applying the Szőnyi–Weiner Lemma

|S| −km)

(2q−km))≥ X

m∈D

(ind(m)−ind(m))

|S|=2q+β−s,β≥ −1 and km=2q−ind(m), thus

|S| −km

(2q−km) =(ind(m) +β−s)ind(m).

δ:= #1-secants +2·#0-secants. Then X

m∈D

ind(m)≤δ, and X

m∈D

ind(m)≤ |S| −s+2≤2q+β,

thus X

m∈D

(ind(m)−ind(m))≥(q−s)ind(m)−δ.

For any pointP ∈ S/ , we get

ind(P)2−(q−β)ind(P) +δ ≥0.

Héger, Takáts Semi-resolving sets forPG(2,q)

(50)

|S| −km)

(2q−km))≥ X

m∈D

(ind(m)−ind(m))

|S|=2q+β−s,β≥ −1 and km=2q−ind(m), thus

|S| −km

(2q−km) =(ind(m) +β−s)ind(m).

δ:= #1-secants +2·#0-secants. Then X

m∈D

ind(m)≤δ, and X

m∈D

ind(m)≤ |S| −s+2≤2q+β,

thus X

m∈D

(ind(m)−ind(m))≥(q−s)ind(m)−δ.

For any pointP ∈ S/ , we get

ind(P)2−(q−β)ind(P) +δ ≥0.

Héger, Takáts Semi-resolving sets forPG(2,q)

(51)

Applying the Szőnyi–Weiner Lemma

|S| −km)

(2q−km))≥ X

m∈D

(ind(m)−ind(m))

|S|=2q+β−s,β≥ −1 and km=2q−ind(m), thus

|S| −km

(2q−km) =(ind(m) +β−s)ind(m).

δ:= #1-secants +2·#0-secants. Then X

m∈D

ind(m)≤δ, and X

m∈D

ind(m)≤ |S| −s+2≤2q+β,

thus X

m∈D

(ind(m)−ind(m))≥(q−s)ind(m)−δ.

For any pointP ∈ S/ , we get

ind(P)2−(q−β)ind(P) +δ ≥0.

Héger, Takáts Semi-resolving sets forPG(2,q)

(52)

|S| −km)

(2q−km))≥ X

m∈D

(ind(m)−ind(m))

|S|=2q+β−s,β≥ −1 and km=2q−ind(m), thus

|S| −km

(2q−km) =(ind(m) +β−s)ind(m).

δ:= #1-secants +2·#0-secants. Then X

m∈D

ind(m)≤δ, and X

m∈D

ind(m)≤ |S| −s+2≤2q+β,

thus X

m∈D

(ind(m)−ind(m))≥(q−s)ind(m)−δ.

For any pointP ∈ S/ , we get

ind(P)2−(q−β)ind(P) +δ ≥0.

Héger, Takáts Semi-resolving sets forPG(2,q)

(53)

Applying the Szőnyi–Weiner Lemma

|S| −km)

(2q−km))≥ X

m∈D

(ind(m)−ind(m))

|S|=2q+β−s,β≥ −1 and km=2q−ind(m), thus

|S| −km

(2q−km) =(ind(m) +β−s)ind(m).

δ:= #1-secants +2·#0-secants. Then X

m∈D

ind(m)≤δ, and X

m∈D

ind(m)≤ |S| −s+2≤2q+β,

thus X

m∈D

(ind(m)−ind(m))≥(q−s)ind(m)−δ.

For any pointP ∈ S/ , we get

ind(P)2−(q−β)ind(P) +δ ≥0.

Héger, Takáts Semi-resolving sets forPG(2,q)

(54)

Proposition

Let P∈/ S,β ≤q/4−5/2. Thenind(P)≤2or ind(P)≥q−β−2.

Proof.

Recall that we have

ind(P)2−(q−β)ind(P) +2q+β ≥0.

Substitutingind(P) =3 orind(P) =q−β−3, we get

β≥(q−9)/4, a contradiction.

Thus ifS is not too large, then every point has a small or a large index.

Héger, Takáts Semi-resolving sets forPG(2,q)

(55)

There are no medium indices

Proposition

Let P∈/ S,β ≤q/4−5/2. Thenind(P)≤2or ind(P)≥q−β−2.

Proof.

Recall that we have

ind(P)2−(q−β)ind(P) +2q+β ≥0.

Substitutingind(P) =3 orind(P) =q−β−3, we get

β≥(q−9)/4, a contradiction.

Thus ifS is not too large, then every point has a small or a large index.

Héger, Takáts Semi-resolving sets forPG(2,q)

(56)

Proposition

Let P∈/ S,β ≤q/4−5/2. Thenind(P)≤2or ind(P)≥q−β−2.

Proof.

Recall that we have

ind(P)2−(q−β)ind(P) +2q+β ≥0.

Substitutingind(P) =3 orind(P) =q−β−3, we get

β≥(q−9)/4, a contradiction.

Thus ifS is not too large, then every point has a small or a large index.

Héger, Takáts Semi-resolving sets forPG(2,q)

(57)

There are no medium indices

Proposition

Let P∈/ S,β ≤q/4−5/2. Thenind(P)≤2or ind(P)≥q−β−2.

Proof.

Recall that we have

ind(P)2−(q−β)ind(P) +2q+β ≥0.

Substitutingind(P) =3 orind(P) =q−β−3, we get

β≥(q−9)/4, a contradiction.

Thus ifS is not too large, then every point has a small or a large index.

Héger, Takáts Semi-resolving sets forPG(2,q)

(58)

T is the set of points with large index.

Proposition

Assumeβ <q/4−5/2 and q≥4. Ifℓ is tangent toS, then

|ℓ∩ T | ≥1; ifℓis skew toS, then |ℓ∩ T | ≥2.

Proof.

Letℓbe a tangent line;c := maximal index onℓ\ S (c >0);

supposec ≤2. There is no skew line;δ = #1-secants +2·#0-secants ≤1+q(c−1). Thus

0≤ind(P)2−(q−β)ind(P) +δ = c2−(q−β)c+1+q(c−1), so

β≥(q−c2−1)/c ≥(q−5)/2.

Héger, Takáts Semi-resolving sets forPG(2,q)

(59)

Points with large index block the non-standard lines

T is the set of points with large index.

Proposition

Assumeβ <q/4−5/2 and q≥4. Ifℓ is tangent toS, then

|ℓ∩ T | ≥1; ifℓis skew toS, then |ℓ∩ T | ≥2.

Proof.

Letℓbe a tangent line;c := maximal index onℓ\ S (c >0);

supposec ≤2. There is no skew line;δ = #1-secants +2·#0-secants ≤1+q(c−1). Thus

0≤ind(P)2−(q−β)ind(P) +δ = c2−(q−β)c+1+q(c−1), so

β≥(q−c2−1)/c ≥(q−5)/2.

Héger, Takáts Semi-resolving sets forPG(2,q)

(60)

T is the set of points with large index.

Proposition

Assumeβ <q/4−5/2 and q≥4. Ifℓ is tangent toS, then

|ℓ∩ T | ≥1; ifℓis skew toS, then |ℓ∩ T | ≥2.

Proof.

Letℓbe a tangent line;c := maximal index onℓ\ S (c >0);

supposec ≤2. There is no skew line;δ = #1-secants +2·#0-secants ≤1+q(c−1). Thus

0≤ind(P)2−(q−β)ind(P) +δ = c2−(q−β)c+1+q(c−1), so

β≥(q−c2−1)/c ≥(q−5)/2.

Héger, Takáts Semi-resolving sets forPG(2,q)

(61)

Points with large index block the non-standard lines

T is the set of points with large index.

Proposition

Assumeβ <q/4−5/2 and q≥4. Ifℓ is tangent toS, then

|ℓ∩ T | ≥1; ifℓis skew toS, then |ℓ∩ T | ≥2.

Proof.

Letℓbe a tangent line;c := maximal index onℓ\ S (c >0);

supposec ≤2. There is no skew line;δ = #1-secants +2·#0-secants ≤1+q(c−1). Thus

0≤ind(P)2−(q−β)ind(P) +δ = c2−(q−β)c+1+q(c−1), so

β≥(q−c2−1)/c ≥(q−5)/2.

Héger, Takáts Semi-resolving sets forPG(2,q)

(62)

T is the set of points with large index.

Proposition

Assumeβ <q/4−5/2 and q≥4. Ifℓ is tangent toS, then

|ℓ∩ T | ≥1; ifℓis skew toS, then |ℓ∩ T | ≥2.

Proof.

Letℓbe a tangent line;c := maximal index onℓ\ S (c >0);

supposec ≤2. There is no skew line;δ = #1-secants +2·#0-secants ≤1+q(c−1). Thus

0≤ind(P)2−(q−β)ind(P) +δ = c2−(q−β)c+1+q(c−1), so

β≥(q−c2−1)/c ≥(q−5)/2.

Héger, Takáts Semi-resolving sets forPG(2,q)

(63)

Points with large index block the non-standard lines

T is the set of points with large index.

Proposition

Assumeβ≤q/4−5/2 and q≥4. Ifℓ is tangent toS, then

|ℓ∩ T | ≥1; ifℓis skew toS, then |ℓ∩ T | ≥2.

Proof.

Letℓbe skew line; suppose that there is at most one point with large index onℓ. Then there are at mostq tangents; soδ ≤q+2.

LetP ∈ℓ,ind(P) =2; then

0≤ind(P)2−(q−β)ind(P) +δ ≤ 4−(q−β)·2+2+q, so

β≥(q−6)/2.

Héger, Takáts Semi-resolving sets forPG(2,q)

(64)

T is the set of points with large index.

Proposition

Assumeβ≤q/4−5/2 and q≥4. Ifℓ is tangent toS, then

|ℓ∩ T | ≥1; ifℓis skew toS, then |ℓ∩ T | ≥2.

Proof.

Letℓbe skew line; suppose that there is at most one point with large index onℓ. Then there are at mostq tangents; soδ ≤q+2.

LetP ∈ℓ,ind(P) =2; then

0≤ind(P)2−(q−β)ind(P) +δ ≤ 4−(q−β)·2+2+q, so

β≥(q−6)/2.

Héger, Takáts Semi-resolving sets forPG(2,q)

(65)

Points with large index block the non-standard lines

T is the set of points with large index.

Proposition

Assumeβ≤q/4−5/2 and q≥4. Ifℓ is tangent toS, then

|ℓ∩ T | ≥1; ifℓis skew toS, then |ℓ∩ T | ≥2.

Proof.

Letℓbe skew line; suppose that there is at most one point with large index onℓ. Then there are at mostq tangents; soδ ≤q+2.

LetP ∈ℓ,ind(P) =2; then

0≤ind(P)2−(q−β)ind(P) +δ ≤ 4−(q−β)·2+2+q, so

β≥(q−6)/2.

Héger, Takáts Semi-resolving sets forPG(2,q)

(66)

T is the set of points with large index.

Proposition

Assumeβ≤q/4−5/2 and q≥4. Ifℓ is tangent toS, then

|ℓ∩ T | ≥1; ifℓis skew toS, then |ℓ∩ T | ≥2.

Proof.

Letℓbe skew line; suppose that there is at most one point with large index onℓ. Then there are at mostq tangents; soδ ≤q+2.

LetP ∈ℓ,ind(P) =2; then

0≤ind(P)2−(q−β)ind(P) +δ ≤ 4−(q−β)·2+2+q, so

β≥(q−6)/2.

Héger, Takáts Semi-resolving sets forPG(2,q)

(67)

Points with large index block the non-standard lines

T is the set of points with large index.

Proposition

Assumeβ≤q/4−5/2 and q≥4. Ifℓ is tangent toS, then

|ℓ∩ T | ≥1; ifℓis skew toS, then |ℓ∩ T | ≥2.

This means thatS ∪ T is a double blocking set.

Héger, Takáts Semi-resolving sets forPG(2,q)

(68)

Proposition

Let|S|<9q/4−3 (that is, β <q/4−3). Then |T | ≤2.

Proof.

Suppose that there are three points with index≥q−β−2. Then the number of tangents is at least 3(q−β−4):

q − − 4β q − − 4β q − − 4β

Héger, Takáts Semi-resolving sets forPG(2,q)

(69)

There are at most two points with large index

Proposition

Let|S|<9q/4−3 (that is, β <q/4−3). Then |T | ≤2.

Proof.

Suppose that there are three points with index≥q−β−2. Then the number of tangents is at least 3(q−β−4):

q − − 4β q − − 4β q − − 4β

Héger, Takáts Semi-resolving sets forPG(2,q)

(70)

Proposition

Let|S|<9q/4−3 (that is, β <q/4−3). Then |T | ≤2.

Proof.

Suppose that there are three points with index≥q−β−2. Then the number of tangents is at least 3(q−β−4). Thus

3q−3β−12≤ |S|=2q+β,

whenceβ ≥q/4−3, a contradiction.

Héger, Takáts Semi-resolving sets forPG(2,q)

(71)

Thank you for your attention!

Héger, Takáts Semi-resolving sets forPG(2,q)

Hivatkozások

KAPCSOLÓDÓ DOKUMENTUMOK

Kouame, “Semi-blind deconvolution for resolution enhancement in ultrasound imaging,” in 2013 IEEE International Conference on Image Processing. Zhang, “Ultrasound image

In the recent years, starting from the paper [20] by Lunardon, linear sets have been used to construct or characterize various objects in finite geometry, such as blocking sets and

We introduce a family of linear sets of PG(1, q 2n ) arising from max- imum scattered linear sets of pseudoregulus type of PG(3, q n ).. For n = 3, 4 and for certain values of

A unital embedded in PG(2, q 2 ) is Hermitian if its points and blocks are the absolute points and lines of a unitary polarity of PG(2, q 2 ).. We prove that there exists only

11th International Workshop on Algorithms, Models and Tools for Parallel Computing on Heterogeneous Platforms (HeteroPar

The importance of physical activity in health protection of future workers: International Conference and Workshop: Proceedings from the International Conference and

This paper deals with elementary problems on complexes of abelian groups related to finite geometry, in particular to arcs and blocking sets of finite

Proceedings of the 3rd International Conference and Workshop Mechatronics in Practice and Education - MECHEDU 2015, Subotica, 14-15 May 2015 / organised by Subotica Tech, College o