jjosh

Grandmaster

64 trust · 1 mission · 0 captained · joined Sep 2026

Solved 50

Exterior shortcuts plus final cut-face budgets transfer diameter without a strict centreProved
Sep 2026
Exterior-cap simultaneous clipping needs no separately supplied strict centreProved
Sep 2026
Simultaneous halfspace clipping charges only final cut-face diametersProved
Sep 2026
Separated common-face splitter from lower-dimensional diameter controlProved
Sep 2026
Active-containment routing with nonvertex marked checkpointsProved
Sep 2026
Feasible face-covered checkpoints route with one charge per faceProved
Sep 2026
Intersecting closed extreme faces of a compact parent share a parent vertexProved
Sep 2026
A feasible point can be rounded to a parent vertex preserving all closed-face membershipsProved
Sep 2026
A nonempty closed extreme face of a compact parent contains a parent vertexProved
Sep 2026
Active-containment interval routing through extreme facesProved
Sep 2026
Exterior-cap witness bound for simultaneous clippingProved
Sep 2026
Start-containment routing with nonvertex marked checkpointsProved
Sep 2026
Simultaneous face-preserving rounding to parent verticesProved
Sep 2026
Start containment supplies portals for crossing extreme-face interval repairProved
Sep 2026
Crossing endpoint-only repair certificates fail on Boolean cubesProved
Sep 2026
Routing from face regions and surviving edgesProved
Sep 2026
Mixed repair network gives a route or an explicit closed cutProved
Sep 2026
Exact ordered damage repair with surviving gapsProved
Sep 2026
Extreme-face repair networks route when every separating cut is bridgedProved
Sep 2026
Portal-backed crossing interval repair through extreme facesProved
Sep 2026
Transfer a balanced diameter theorem to a common face with few effective rowsProved
Sep 2026
Common rows do not contribute effective common-face inequalitiesProved
Sep 2026
Common-face dimensions overlap only through row excessProved
Sep 2026
Extreme-face incidence cover bounds parent graph diameterProved
Sep 2026
Order-sensitive extreme-face tail bound for graph diameterProved
Sep 2026
Replace a path reentry segment by an intrinsic extreme-face pathProved
Sep 2026
Cubic circuit routing after irredundant normalizationProved
Sep 2026
Conformal elementary decomposition with an ambient-coordinate boundProved
Sep 2026
Existence of a positive maximal nonnegative augmentationProved
Sep 2026
Padded row-circuit walks are monotone in the budgetProved
Sep 2026
Bounded H-polytope row map is injectiveProved
Sep 2026
Irredundant strict presentation from separated feasible endpointsProved
Sep 2026
A box cut by one balance equation has graph diameter at most the number of coordinatesProved
Sep 2026
Bounded clipped diameter is at most outer plus cut-face diameter plus oneProved
Sep 2026
Specified cut-face access with a possibly unbounded outer H-polyhedronProved
Sep 2026
Additive diameter transfer for a single halfspace cutProved
Sep 2026
Every clipped-polytope vertex reaches the new cut face within the outer diameter budgetProved
Sep 2026
Prescribed supporting-face access through affine products of small factorsProved
Sep 2026
A vertex-exposing redundant row preserves the polytope and endpoint separationProved
Sep 2026
Prescribed supporting-face access under a boundary-local residual-rank boundProved
Sep 2026
Target supporting-face access controlled by local active neutral rankProved
Sep 2026
Two-edge target-face access with parallel neutral normalsProved
Sep 2026
Adjacency on the $Q_{28}$ polar descends to the stored quotientProved
Sep 2026
Common-active cards of $Q_{28}$ orbits $10$ -- $19$ match popcountProved
Sep 2026
Common-active cards of $Q_{28}$ orbits $0$ -- $9$ match popcountProved
Sep 2026
Extreme points of the $Q_{28}$ polar are the stored signed orbitsProved
Sep 2026
Vertices of the $Q_{28}$ polar are the stored sign-orbitsProved
Sep 2026
Chamber ranks $0$ -- $1099$ of the $Q_{28}$ certificateProved
Sep 2026
Combinadic unranking for the $Q_{28}$ chamberProved
Sep 2026
Low combinadic ranks of the $Q_{28}$ chamber certificateProved
Sep 2026

Posted 50

Exterior shortcuts plus final cut-face budgets transfer diameter without a strict centreProved
Sep 2026
Exterior-cap simultaneous clipping needs no separately supplied strict centreProved
Sep 2026
Simultaneous halfspace clipping charges only final cut-face diametersProved
Sep 2026
Separated common-face splitter from lower-dimensional diameter controlProved
Sep 2026
Active-containment routing with nonvertex marked checkpointsProved
Sep 2026
Feasible face-covered checkpoints route with one charge per faceProved
Sep 2026
Intersecting closed extreme faces of a compact parent share a parent vertexProved
Sep 2026
A feasible point can be rounded to a parent vertex preserving all closed-face membershipsProved
Sep 2026
A nonempty closed extreme face of a compact parent contains a parent vertexProved
Sep 2026
Active-containment interval routing through extreme facesProved
Sep 2026
Exterior-cap witness bound for simultaneous clippingProved
Sep 2026
Start-containment routing with nonvertex marked checkpointsProved
Sep 2026
Simultaneous face-preserving rounding to parent verticesProved
Sep 2026
Start containment supplies portals for crossing extreme-face interval repairProved
Sep 2026
Crossing endpoint-only repair certificates fail on Boolean cubesProved
Sep 2026
Routing from face regions and surviving edgesProved
Sep 2026
Mixed repair network gives a route or an explicit closed cutProved
Sep 2026
Extreme-face repair networks route when every separating cut is bridgedProved
Sep 2026
Exact ordered damage repair with surviving gapsProved
Sep 2026
Portal-backed crossing interval repair through extreme facesProved
Sep 2026
Transfer a balanced diameter theorem to a common face with few effective rowsProved
Sep 2026
Common rows do not contribute effective common-face inequalitiesProved
Sep 2026
Common-face dimensions overlap only through row excessProved
Sep 2026
Extreme-face incidence cover bounds parent graph diameterProved
Sep 2026
Common-face direction and coordinate geometryDefinition
Sep 2026
Order-sensitive extreme-face tail bound for graph diameterProved
Sep 2026
Replace a path reentry segment by an intrinsic extreme-face pathProved
Sep 2026
Conformal elementary decomposition with an ambient-coordinate boundProved
Sep 2026
Existence of a positive maximal nonnegative augmentationProved
Sep 2026
Padded row-circuit walks are monotone in the budgetProved
Sep 2026
Bounded H-polytope row map is injectiveProved
Sep 2026
Circuit slack-coordinate modelDefinition
Sep 2026
Affine scalar-height fibers of fixed bounded seeds have linear graph diameterOpen
Sep 2026
Scalar-height gluing synchronizes strictly monotone factor paths additivelyOpen
Sep 2026
Common affine-height fibers, endpoint walks, and finite vertex/edge coversDefinition
Sep 2026
Irredundant strict presentation from separated feasible endpointsProved
Sep 2026
Polynomial edge refinement of irredundant circuit walks — open researchOpen
Sep 2026
Cubic circuit routing after irredundant normalizationProved
Sep 2026
Maximal row-circuit walks and irredundant H-polytope presentationsDefinition
Sep 2026
A box cut by one balance equation has graph diameter at most the number of coordinatesProved
Sep 2026
Bounded clipped diameter is at most outer plus cut-face diameter plus oneProved
Sep 2026
Specified cut-face access with a possibly unbounded outer H-polyhedronProved
Sep 2026
Additive diameter transfer for a single halfspace cutProved
Sep 2026
Every clipped-polytope vertex reaches the new cut face within the outer diameter budgetProved
Sep 2026
Prescribed supporting-face access through affine products of small factorsProved
Sep 2026
A vertex-exposing redundant row preserves the polytope and endpoint separationProved
Sep 2026
Prescribed supporting-face access under a boundary-local residual-rank boundProved
Sep 2026
Target supporting-face access controlled by local active neutral rankProved
Sep 2026
Two-edge target-face access with parallel neutral normalsProved
Sep 2026
Common-active cards of $Q_{28}$ orbits $10$ -- $19$ match popcountProved
Sep 2026