ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let C(d,n) be the maximum number of facets of a cubical d-polytope with n vertices, and let t(n) be the maximum number of triangles in R^3 with vertices in an n-point set such that any two triangles intersect only in a common vertex or not at all. Determine the growth of C(d,n) and t(n); in particular, is C(d,n)=o(n^2) for every fixed d, and how large can t(n) be?

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.