Simplex design factorial-size conjecture

From papers

Let Δd1={\vbxRd:i=1dxi=1, xi0}\Delta^{d-1}=\{\vb{x}\in\mathbb{R}^d:\sum_{i=1}^d x_i=1,\ x_i\geq 0\} be the probability simplex, and let σ\sigma be the normalized measure supported on it and constant there. Consider the affine space

Rd/(i=1dxi=1).\mathbb{R}^d/\left(\sum_{i=1}^d x_i=-1\right).

A finite subset XX of this space is a tt-design for σ\sigma when its discrete averages reproduce the corresponding σ\sigma-averages for polynomials of degree at most tt.

Simplex design factorial-size conjecture. There exists a tt-design XRd/(i=1dxi=1)X\subset \mathbb{R}^d/\left(\sum_{i=1}^d x_i=-1\right) for σ\sigma, with tdt\leq d, such that

X=d!(dt+1)!.\lvert X\rvert=\frac{d!}{(d-t+1)!}.

The conjecture proposes a factorial-size construction extending the previously established simplex 33-design and pseudodesign constructions. Its validity beyond the dimensions and strengths covered by the preceding theorem remains open.

Progress summary

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Sources & referencesView supporting material

Primary source

Jakub Czartowski, “Comment and correction for "On Explicit Construction of Simplex t-designs" by M. S. Baladram”, arXiv:2505.05894 (2025).

Solutions 0

No solutions have been posted yet.