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.
Optimal star-discrepancy order at fixed dimension at least three
Open problem
Fix an integer . For each integer , let range over the ordered configurations in , with repeated points counted with multiplicity, and set where is the normalized half-open anchored-box star discrepancy of Star discrepancy, digital nets, and digital sequences. Determine the exact asymptotic order of as with fixed. In particular, prove or disprove the conjectured order and determine the correct order if this conjecture fails. Here is the natural logarithm, and means that positive constants and an integer exist such that for all .
The configuration set is nonempty because it contains the list with every point equal to . Each empirical fraction and box volume lies in , so for every configuration. Thus 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- 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 and the conjectural rate, and distinguishes the settled planar order . 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
- Art B. Owen, Practical Quasi-Monte Carlo, Chapter 15, printed pp. 17–19 and Theorem 15.7 (standard reference, not scraped)
- Josef Dick, Optimal Polynomial Tractability Exponents for the Inverse Star Discrepancy, arXiv:2607.23571v3 (standard reference, not scraped)