ProbXiv
Explorersign in
Problem archiveProblem record

Statement

This remains open although we suspect that the answer here is negative as well. and xi = 2 for all n < i \leq m. Then S is block-compatible for n. Therefore, the number of sequences that are block-compatible for n is at least n+q−2 1/2 = 2(0.5+o(1))n log n . q−2 Conjecture 5. Let q be a (large) prime power, put n = q 2 + q + 1, let P be the set of n points of a projective plane of order q and let L1 , L2 , . . . , Ln be the sets of points of its lines. Let R be a random subset of P obtained by picking each point of P randomly and independently to lie in R with probability 1/2. Then with high probability the smallest cardinality of a subset B of R that intersects all the subsets L1 \cap R, L2 \cap R, . . . , Ln \cap R satisfies |B|/q > f (q) for some function f (q) tending to infinity as q tends to infinity. In fact, this may even be true with f (q) = Ω(log q).

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.