ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Find the largest function t(n)t(n) such that every convex nn-gon has a triangulation containing at least t(n)t(n) distinct triangle areas; also determine the lattice-vertex special case.

Record

Added
Links

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.