ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let m(d,k)m(d,k) denote the maximum possible number of modes of a mixture of kk Gaussian distributions in dimension dd.

Sturmfels's conjecture. For all integers d,k≥1d,k\geq 1, the maximum number of modes is

m(d,k)=(d+k−1d).m(d,k)=\binom{d+k-1}{d}.

This conjecture was proposed in the context of the maximum-number-of-modes problem after the known result m(d,2)=d+1m(d,2)=d+1. The source does not provide evidence here that the conjecture has been resolved, so its status is recorded as 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.