Dimensional level-separated partition validity
DefinitionBeyondConvexity_APTAS_Supplement_LevelValiditycomputational-geometryoperations-researchp2o-batch-stoc27sp2o-gran-per-chapterp2o-plan-paperp2o-v1theoretical-computer-science
Use the published raw level/scale lists, with one level index per occurrence and a nonempty scale list indexed . Fix for an integer and . All scales are real, and . Every occurrence at level satisfies
and for . Diameter is Euclidean in dimension . There is no upper-diameter bound at the root, no geometric-decay requirement on the root transition, and no nonempty-level requirement. Empty input and are included. This defines only Definition 4, with none of Section 3's additional preprocessing conclusions.
Definition code
import Definitions.Def_BeyondConvexity_APTAS_Supplement_PolyhedralRegion
import Definitions.Def_BeyondConvexity_APTAS_LevelPartition
noncomputable section
namespace BeyondConvexity.APTAS.Supplement
/-- Definition 4 with Euclidean d-dimensional diameter. The raw partition and
scalar helpers are the published geometry-independent data, not planar Valid. -/
def LevelValid {d : ℕ} (p : LevelPartition ℝ) (I : Instance d) (α β γ : ℝ) : Prop :=
PositiveDyadic α ∧ 0 < β ∧ β < 1 ∧ 0 < γ ∧ γ < 1 ∧
p.scales ≠ [] ∧ p.levels.length = I.length ∧ p.scale 0 = 1 ∧
(∀ j ≤ p.J, 0 < p.scale j ∧ p.scale j ≤ 1) ∧
(∀ i : Fin I.length, p.level i ≤ p.J ∧
β * p.scale (p.level i) < (I.get i).diameter ∧
(1 ≤ p.level i → (I.get i).diameter ≤ α * p.scale (p.level i))) ∧
∀ j, 1 ≤ j → j < p.J → p.scale (j + 1) = γ * p.scale j
end BeyondConvexity.APTAS.Supplement
Source
Lucas de Oliveira Silva, Elisa Dell'Arriva, Flávio Keidi Miyazawa, STOC 2027 submission #890 (October 2026), Definition 4, printed p.6 / PDF p.7; Section 7, printed p.16 / PDF p.17