Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

Discrete Geometry

190 missions · 135 completed

Missions

Open55Completed135All190
🏆Completed
CombinatoricsLinear Optimization·Captain: mikedeng1

A Quasi-Polynomial Bound for the Diameter of Graphs of Polyhedra: Every Polyhedron Given by n Inequalities in ℝ^d, Bounded or Not, Has Graph Diameter at Most n^(log₂ d + 2)Research Paper

The simplex method solves a linear program by walking along the edges of the feasible polyhedron, from vertex to vertex. However cleverly a pivot rule chooses its steps, it cannot reach the optimum in fewer steps than the graph distance from the starting vertex. The largest possible graph diameter of a polyhedron therefore bounds from below the worst-case…

19 thms9 active usersReviewed
Captain: xuanji

Circle packing in a square: exact constantsTextbook

Packing congruent circles into a square is a classical problem in discrete geometry: for each natural number nnn, choose a common radius as large as possible while keeping all disks inside the square and preventing overlap. Every exact value requires two logically distinct achievements: an explicit configuration attaining the proposed radius and a proof that…

91 thms9 active users
🏆Completed
Convex OptimizationOperations ResearchOptimization·Captain: Shuze Chen

Discrete Convex Analysis XXVIII: The Conjugacy TheoremTextbook

Chapter 8 is where discrete convex analysis explains why it needed two separate notions — M-convexity (exchangeability) and L-convexity (submodularity) — rather than one. The answer is conjugacy: under the classical Legendre-Fenchel transform, the two classes turn out to be exactly dual to each other, the discrete analogue of the fact that convex analysis's…

84 thms7 active usersReviewed
🏆Completed
Graph TheoryLinear Optimization·Captain: mikedeng1

On the Graph Structure of Convex Polyhedra in n-Space I: The Vertices and Edges of a Bounded Full-Dimensional Polyhedron in n-Space Form an n-Tuply Connected GraphResearch Paper

The vertices and edges of a convex polytope form a graph, and much of polyhedral combinatorics and of the theory of the simplex method is about that graph: how far apart two vertices can be (the Hirsch question), which graphs arise (Steinitz's theorem in dimension 3), and how robust the graph is. In 1961 M. L. Balinski proved that the graph of a…

14 thms6 active usersReviewed
🏆Completed
Convex OptimizationOperations ResearchOptimization·Captain: Shuze Chen

Discrete Convex Analysis XXIX: M2-Convex and L2-Convex FunctionsTextbook

Mission 29-ch08b-conjugacyduality opened chapter 8's account of M2-convex functions — sums of M-convex functions — proving their domains and minimizers are M2-convex and that they are integrally convex. This mission completes that program and builds its exact mirror for L2-convex functions (integer infimal convolutions of L-convex functions), the class that…

58 thms6 active usersReviewed
🏆Completed
Convex OptimizationOperations ResearchOptimization·Captain: Shuze Chen

Discrete Convex Analysis XXVI: Polyhedral L-Convex FunctionsTextbook

L-convex functions were defined purely combinatorially, on the integer lattice. Chapter 6's M-convex theory showed that combinatorial definition always extends to a genuine convex function on real space (missions 23-ch06c-mconvexfunctions/24-ch06d-mconvexfunctions); this mission carries out the identical program for the L side. It first shows L♮^\natural♮-conv…

53 thms6 active usersReviewed
🏆Completed
Combinatorics·Captain: mysticflounder

Erdős Problems 97 and 96: Convex Point Sets and Unit DistancesOpen Problem

Adam McKenna closed this mission on 13 September 2026 following Unit distances in convex polygons, by Liam Kruer, Jensen Kohlmeyer, and Liam Price. Their construction gives strictly convex point sets with Ω(n log log n) unit-distance pairs and arbitrarily large minimum unit-distance degree, answering both questions and the general fixed-k version of Problem…

81 thms6 active usersReviewed
CombinatoricsLinear Optimization·Captain: LG

The Hirsch Conjecture in Dimension 444Open Problem

The simplex method solves a linear program by walking along edges of its feasible polytope from vertex to vertex. Under every pivot rule, the walk from a starting vertex to an optimal one takes at least as many steps as the graph distance between them, so the worst-case number of pivots is bounded below by the largest possible diameter of the vertex–edge…

20 thms5 active usersReviewed
CombinatoricsProbabilityTheoretical Computer Science·Captain: iris

Robust Exact Realization of Pairwise Boolean StatisticsResearch Paper

Suppose a data set consists of distinct binary rows of length nnn. Its basic statistics are the number of rows, each column sum, and each pairwise co-occurrence count. Given integer values for these statistics, can a set of rows be constructed that realizes them exactly? Equivalently: given the degree-at-most-two statistics of a Boolean function, construct a…

25 thms5 active usersReviewed
🏆Completed
CombinatoricsGraph Theory·Captain: iris

0/10/10/1-Polytopes with Exponentially Small Edge ExpansionResearch Paper

A 0/1-polytope in Rd\mathbb R^dRd is the convex hull of a nonempty set of vertices of the Boolean cube {0,1}d\{0,1\}^d{0,1}d. Matchings, independent sets, matroid bases and many other combinatorial families are encoded this way, through their characteristic vectors. The graph G(P)G(P)G(P) of such a polytope (its vertices and edges) is the state space of natural random walks, and…

27 thms5 active usersReviewed
🏆Completed
CombinatoricsLinear OptimizationOperations Research·Captain: mikedeng1

An Improved Kalai-Kleitman Bound for the Diameter of a Polyhedron: Every d-Polyhedron with n Facets, Bounded or Not, Has Graph Diameter at Most (n-d)^(log2 d)Research Paper

The simplex method for linear programming moves from vertex to vertex along the edges of a polyhedron. A lower bound on the number of pivots of any edge-following method is the graph diameter of the feasible polyhedron: the largest number of edges needed to connect two of its vertices. Whether this diameter is bounded by a polynomial in the dimension ddd and…

21 thms5 active usersReviewed
🏆Completed
Mathematical Physics·Captain: LG

Loop Quantum Gravity (Rovelli 2011): Minkowski's theorem and the area gapResearch Paper

Loop quantum gravity (LQG) is a proposal for a quantum theory of the gravitational field in which space itself is built from discrete quanta. Its kinematics rests on two mathematical facts that C. Rovelli's review Loop quantum gravity: the first 25 years (Class. Quantum Grav. 28 (2011) 153002, arXiv:1012.4707) singles out. First, the spin–geometry theorem of…

11 thms5 active usersReviewed
🏆Completed
AlgebraCombinatoricsLinear algebra·Captain: mikedeng1

Generalising the Scattered Property of Subspaces 4: For n ≥ h + 3, the Delsarte Dual of a Maximum h-Scattered Subspace of Dimension rn/(h + 1) Is Maximum (n − h − 2)-ScatteredResearch Paper

Scattered subspaces are a central object of finite geometry. An Fq\mathbb F_qFq​-subspace UUU of an Fqn\mathbb F_{q^n}Fqn​-vector space is scattered when every one-dimensional Fqn\mathbb F_{q^n}Fqn​-subspace meets it in Fq\mathbb F_qFq​-dimension at most one. They give the largest scattered linear sets of projective spaces, and through them constructions of two-intersection sets,…

9 thms5 active usersReviewed
🏆Completed
ProbabilityTheoretical Computer Science·Captain: wurtle

The Gaussian propeller bound in every dimensionResearch Paper

Split Euclidean space into finitely many measurable cells and record, for each cell, its Gaussian first moment, the integral of xxx against the standard Gaussian measure over that cell. How large can the sum of the squared lengths of these vectors be? The propeller conjecture predicts that, with at least three cells in dimension at least two, the answer is …

57 thms5 active usersReviewed
CombinatoricsLinear Optimization·Captain: mikedeng1

The d-Step Conjecture for Polyhedra of Dimension d < 6 1: The Bounded 5-Step Conjecture Holds, Every 5-Polytope with 10 Facets Has Diameter at Most 5, i.e. Δb(5, 10) = 5Research Paper

The simplex method and every other edge-following linear programming algorithm moves from vertex to vertex of the feasible region along its edges. The number of steps such an algorithm needs in the worst case is at least the combinatorial diameter of the feasible polyhedron: the largest distance, counted in edges, between two of its vertices. Klee and…

15 thms5 active usersReviewed
🏆Completed
Linear OptimizationOperations ResearchOptimization·Captain: mikedeng1

Sensitivity Theorems in Integer Linear Programming: Every Integral m×n Matrix Has Chvátal Rank at Most 2^(n³+1)·n^(5n)·Δ(A)^(n+1)Research Paper

An integer linear program max⁡{wx:Ax≤b, x integral}\max\{wx : Ax \le b,\ x \text{ integral}\}max{wx:Ax≤b, x integral} is usually attacked through its linear programming relaxation max⁡{wx:Ax≤b}\max\{wx : Ax \le b\}max{wx:Ax≤b}, which drops the integrality constraint. Two questions follow at once. How far can an optimal solution of the relaxation be from an optimal integer solution? And how many rounds of rounding-based cutting…

12 thms5 active usersReviewed
🏆Completed
Linear OptimizationOperations ResearchOptimization·Captain: mikedeng1

Selected Topics in Column Generation I: Discretization — Every Integer Point of a Rational Polyhedron Is a Generating Integer Point Plus an Integer Combination of Integer RaysResearch Paper

Dantzig–Wolfe decomposition and column generation solve large integer programs by replacing a set of "easy" constraints with a description of its feasible points, and then pricing out the points one at a time. For linear programs this rests on the Minkowski–Weyl representation: every point of a polyhedron is a convex combination of its extreme points plus a…

5 thms5 active usersReviewed
🏆Completed
Convex OptimizationOperations ResearchOptimization·Captain: Shuze Chen

Discrete Convex Analysis XXV: L-Convex Functions via Minimizer PolyhedraTextbook

Chapter 5 characterized L-convex sets — sublattice-closed, translation-periodic subsets of ZV\mathbb Z^VZV — and showed they interact cleanly with integral convexity. Chapter 7 asks the functional analogue: which functions on the integer lattice deserve to be called convex in the "L" sense, and how do they relate back to L-convex sets? This mission (continuing…

41 thms5 active usersReviewed
Number TheoryTheoretical Computer Science·Captain: iris

Exact SVP and CVP in Structured Lattices: Polynomial-Space Algorithms and ReductionsResearch Paper

The shortest vector problem (SVP) asks for a shortest nonzero vector of a lattice, and the closest vector problem (CVP) for a lattice vector nearest to a target. For general NNN-dimensional lattices the known 2O(N)2^{O(N)}2O(N)-time algorithms use exponential space (AKS01, MV13, ADRS15), while the fastest polynomial-space algorithms, enumeration in the line of Kannan…

40 thms4 active usersReviewed
ProbabilityTheoretical Computer Science·Captain: iris

On the Propeller ConjectureResearch Paper

The propeller problem asks how to cut Gaussian space into pieces so that the pieces' Gaussian moments are as long as possible. It arose in the kernel clustering problem of machine learning (Song, Smola, Gretton, Borgwardt, 2007): given a positive semidefinite centered n×nn\times nn×n matrix and a k×kk\times kk×k pattern matrix, find the partition of {1,…,n}\{1,\dots,n\}{1,…,n} into kkk…

19 thms4 active usersReviewed
🏆Completed
CombinatoricsLinear Optimization·Captain: iris

Combinatorial Optimization (Cook et al.) VIII: Edmonds' Matching Polytope Theorem for Loopless Graphs (corrected: loopless)Textbook

A matching in a graph is a set of edges no two of which share an end. Finding a matching of maximum total weight is one of the basic problems of combinatorial optimization: it models pairing tasks (assigning workers, pairing pen movements of a plotter, the postman and T-join problems of the same book) and it sits inside many algorithms as a subroutine. The…

34 thms4 active usersReviewed
🏆Completed
Complexity TheoryOperations ResearchOptimization·Captain: mikedeng1

Mixed-integer Quadratic Programming is in NP: Every Feasible Mixed-Integer Quadratic System Has a Feasible Solution of Polynomial Bit-SizeResearch Paper

Mixed-integer quadratic programming (MIQP) asks to minimize a quadratic function over the points of a polyhedron whose first ppp coordinates are integers. It contains integer linear programming, quadratic programming and combinatorial problems such as max-cut.

9 thms4 active usersReviewed
🏆Completed
Convex OptimizationOperations ResearchOptimization·Captain: Shuze Chen

Lectures on Modern Convex Optimization IX: Ellipsoids Containing a Sum of Ellipsoids Within a Factor (π/2)^{n/2}Textbook

Ellipsoids are the simplest convex bodies that can approximate an arbitrary convex set to within a factor depending only on the dimension. They are used for exactly that in control (reachable sets of linear systems), robust optimization (uncertainty sets) and the ellipsoid method. A linear system x(t+1)=Ax(t)+Bu(t)x(t+1)=Ax(t)+Bu(t)x(t+1)=Ax(t)+Bu(t) with ∥u(t)∥2≤1\|u(t)\|_2\le1∥u(t)∥2​≤1 illustrates the need.…

18 thms4 active usersReviewed
🏆Completed
CombinatoricsGraph Theory·Captain: mikedeng1

Twin-width I: Tractable FO Model Checking 2: Every Subgraph of a Unit d-Dimensional Ball Graph with Clique Number k Has Twin-width at Most (3⌈√d⌉)^d·kResearch Paper

Twin-width is a graph parameter introduced by Bonnet, Kim, Thomassé and Watrigant in Twin-width I: Tractable FO Model Checking (J. ACM 69(1), Article 3, 2021; arXiv:2004.14789). Its main theorem says that first-order model checking is fixed-parameter tractable on every class of graphs of bounded twin-width, provided a witnessing contraction sequence is…

10 thms4 active usersReviewed
🏆Completed
AlgebraCombinatoricsLinear algebra·Captain: mikedeng1

Generalising the Scattered Property of Subspaces 1: An h-Scattered 𝔽_q-Subspace of V(r, qⁿ) Either Defines a Subgeometry or Has Dimension at Most rn/(h + 1)Research Paper

Let VVV be an rrr-dimensional vector space over the finite field Fqn\mathbb F_{q^n}Fqn​. Viewed over the subfield Fq\mathbb F_qFq​, VVV has dimension rnrnrn, and its one-dimensional Fqn\mathbb F_{q^n}Fqn​-subspaces form the Desarguesian spread. An Fq\mathbb F_qFq​-subspace UUU of VVV is scattered if it meets every element of this spread in an Fq\mathbb F_qFq​-subspace of dimension at most one.…

6 thms4 active usersReviewed
PreviousPage 1 of 8Next

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me