Alphabeta Math
Open problemQuestion: Literature-sourcedProof: Not applicablePipeline-generated‡ sources checked 2026-10-17‡ unresolved
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

This problem is unresolved. Its sources and status may be reviewed, but no solution is accepted here. It cannot be used as a proof premise.

Optimal star-discrepancy order at fixed dimension at least three

Open problem

Fix an integer d≥3. For each integer n≥2, let P=(x1,…,xn) range over the ordered configurations in ([0,1)d)n, with repeated points counted with multiplicity, and set δd(n):=inf⁡{Dn∗(P):P∈([0,1)d)n}, where Dn∗ is the normalized half-open anchored-box star discrepancy of Star discrepancy, digital nets, and digital sequences. Determine the exact asymptotic order of δd(n) as n→∞ with d fixed. In particular, prove or disprove the conjectured order δd(n)≍dn−1(log⁡n)d−1, and determine the correct order if this conjecture fails. Here log⁡ is the natural logarithm, and ≍d means that positive constants cd,Cd and an integer n0(d) exist such that cdn−1(log⁡n)d−1≤δd(n)≤Cdn−1(log⁡n)d−1 for all n≥n0(d).

The configuration set is nonempty because it contains the list with every point equal to 0∈[0,1)d. Each empirical fraction and box volume lies in [0,1], so 0≤Dn∗(P)≤1 for every configuration. Thus δd(n) is a well-defined finite real infimum; attainment is not asserted.

Status

Status reviewed on 2026-10-17: the inspected sources support retaining the fixed-d≥3 question as open. Owen's Practical Quasi-Monte Carlo, printed pp. 18–19, says the best possible rate is not known, records the classical Roth lower baseline n−1(log⁡n)(d−1)/2 and the conjectural n−1(log⁡n)d−1 rate, and distinguishes the settled planar order n−1log⁡n. The Roth bound is stated here only as a classical baseline, not as the strongest known lower bound. Owen's Theorem 15.7, printed p. 27, supplies an upper-order construction.

Dick's version 3 paper, dated 2026-10-15, states a result on uniform polynomial tractability exponents for inverse star discrepancy. Its Remark 1.4 explicitly separates that growing-dimension result from each fixed-dimension ray and gives a fixed-d construction upper bound; it does not state a matching fixed-d lower bound. The refreshed bounded current-results review recorded in the batch coverage and the ROOT cycle-1 report found no inspected source resolving this exact question. That review is not exhaustive and does not prove that no resolution exists. Publication requires a fresh source/version/status check. No proof of the conjectured lower bound is claimed, and this open problem is never a logical supplier.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

12 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources