ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let Γ\Gamma be a geometric distance-regular graph with diameter DD and distinct eigenvalues

k=θ0>θ1>⋯>θD.k = \theta_0 > \theta_1 > \cdots > \theta_D.

Let b=b1θ1+1b = \frac{b_1}{\theta_1 + 1}. For a Delsarte clique, let ϕi\phi_i denote the number of clique vertices at distance ii from a vertex at distance ii from the clique. The ϕi\phi_i-bound conjecture. There exists a function f(i,b)f(i,b) such that, if D≥2i+1D \geq 2i + 1, then ϕi≤f(i,b)\phi_i \leq f(i,b). This conjecture seeks uniform bounds on the clique parameters of geometric distance-regular graphs; the preceding proposition establishes such a bound for ϕ1\phi_1 under an additional lower bound on k−θD\frac{k}{-\theta_D}, while the general assertion remains open.

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.