ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let Δi\Delta_i denote the graph associated with the ii-dimensional subspaces of the finite polar space, and let κi\kappa_i, χi\chi_i, and ξi\xi_i be its corresponding graph parameters. For 0≤i<n0 \leq i < n, let θi\theta_i be any of κi\kappa_i, χi\chi_i, or ξi\xi_i. Distinctness conjecture. If 0≤i<j<n0 \leq i < j < n, then

(∣Δi∣,θi)≠(∣Δj∣,θj).(|\Delta_i|,\theta_i)\neq (|\Delta_j|,\theta_j).

The claim asserts that the order and any one of these graph parameters together distinguish the graphs associated with different dimensions. The surrounding text indicates that the result follows from preceding propositions comparing the parameters, but the supplied span does not explicitly establish whether this statement is proved or conjectural.

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.