Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in

Get started

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

Combinatorics

1,238 missions · 706 completed

The mathematics of finite and discrete structures — counting the arrangements of a set, deciding when a configuration meeting prescribed constraints can exist, and characterizing the patterns such structures are forced to contain. It encompasses enumerative and extremal combinatorics, graph theory, design theory, and additive combinatorics, with deep ties to algebra, probability, and computer science.

Missions

Open532Completed706All1238
🏆Completed
ProbabilityStochastic Systems·Captain: mikedeng1

Separation of Time-Scales and Model Reduction for Stochastic Reaction Networks 2: Positive Combinations Preserve the Balance Condition When Production and Consumption Sets Are DisjointResearch Paper

Stochastic models of chemical reaction networks in cell biology routinely combine species present in a handful of copies with species present in thousands, and rate constants that differ by orders of magnitude. Simulating such a system exactly is expensive, and model reduction replaces it with a lower-dimensional limit. A systematic approach, developed by Ba…

8 thms3 active usersReviewed
🏆Completed
ProbabilityStochastic Systems·Captain: mikedeng1

Separation of Time-Scales and Model Reduction for Stochastic Reaction Networks 3: The Second Time-Scale r₂ Is Strictly Slower than the First Time-Scale r₁Research Paper

Chemical reaction networks can contain reactions whose rates differ by powers of a large scaling parameter. A species may then change on one time scale while other combinations of species remain nearly fixed until a later one. This matters when replacing a detailed network by a smaller model: the quantities retained at the first scale need not be the…

5 thms3 active usersReviewed
🏆Completed
Graph Theory·Captain: mikedeng1

Cycle Lengths in Expanding Graphs 2: Every α-Expander on n Vertices Has Ω(α³/log(1/α))·n Distinct Cycle LengthsResearch Paper

An expander graph has many edges leaving each small vertex set. This condition is useful when a graph must remain connected after local losses, and it also constrains the cycles that can occur. Knowing that one long cycle exists leaves open how many different lengths its cycles can have. For example, a bipartite graph has no odd cycle, so expansion alone…

9 thms3 active usersReviewed
🏆Completed
Graph Theory·Captain: mikedeng1

Finding Cliques in Social Networks: A New Distribution-Free Model 3: For Every c ≥ 2 and n ≥ c There Is a c-Closed Graph on n Vertices with Ω(c^(−3/2)·2^(c/2)·n^(3/2)) Maximal CliquesResearch Paper

Social networks exhibit triadic closure: two people with many common friends tend to be friends themselves. Fox, Roughgarden, Seshadhri, Wei and Wein (arXiv:1804.07431, SIAM J. Comput. 2020) turn this empirical regularity into a deterministic graph class, the ccc-closed graphs, and ask how hard a classical NP-hard problem, enumerating maximal cliques, becomes…

7 thms3 active usersReviewed
🏆Completed
Operations ResearchOptimizationProbability·Captain: mikedeng1

Online Contention Resolution Schemes with Applications to Bayesian Selection Problems 2: The Degree Relaxation of Matching Has a (b, e^(−2b))-Selectable Randomized Greedy OCRSResearch Paper

In online selection, candidate items reveal themselves one at a time and an algorithm must decide immediately whether to keep each one. When the kept items must form a matching, accepting one edge can prevent a later edge sharing an endpoint from being accepted. A fractional solution supplies useful marginal probabilities, but it does not by itself specify…

11 thms3 active usersReviewed
🏆Completed
Algorithmic Game TheoryOperations ResearchProbability·Captain: mikedeng1

Online Contention Resolution Schemes with Applications to Bayesian Selection Problems 5: A (b, c)-Selectable Greedy OCRS Rounds x ∈ bP to E[f(S)] ≥ c·F(x) for Monotone Submodular fResearch Paper

Many online selection problems ask an algorithm to accept or reject items one at a time, irrevocably, while keeping the accepted set feasible: independent in a matroid, a matching in a graph, or within a knapsack budget. In Bayesian versions, such as prophet inequalities and posted-price mechanisms, a fractional point xxx of a relaxation of the feasible sets…

12 thms3 active usersReviewed
🏆Completed
Operations ResearchOptimizationProbability·Captain: mikedeng1

Online Contention Resolution Schemes with Applications to Bayesian Selection Problems 3: A Knapsack Polytope Has a (b, (1−2b)/(2−2b))-Selectable Randomized Greedy OCRS for b ≤ 1/2Research Paper

In online selection, useful items arrive one at a time and must be accepted or rejected before the next arrival. A knapsack constraint limits the total size of accepted items to one unit. When the order may depend on all of the random outcomes, an algorithm needs a guarantee that survives every such order. Feldman, Svensson, and Zenklusen introduced online…

8 thms3 active usersReviewed
🏆Completed
Algorithmic Game TheoryOperations ResearchProbability·Captain: mikedeng1

Online Contention Resolution Schemes with Applications to Bayesian Selection Problems 1: Every Loopless Matroid Polytope Has a (b, 1−b)-Selectable Deterministic Greedy OCRSResearch Paper

In online selection, items reveal information one at a time, and each decision to accept an item is irrevocable. A matroid constraint permits some subsets and excludes others; it covers choices such as selecting linearly independent vectors or acyclic edges. A fractional solution can assign an acceptance probability to each item, but independent activations…

10 thms3 active usersReviewed
🏆Completed
Algorithmic Game TheoryOperations Research·Captain: mikedeng1

A Little Charity Guarantees Almost Envy-Freeness II: With Additive Valuations Such an Allocation Gives Every Agent Her Maximin Share Divided by 2 − |P|/nResearch Paper

A set of nnn agents must share a set MMM of mmm indivisible goods, each agent valuing bundles of goods by her own valuation. Two fairness notions dominate the literature. Envy-freeness up to any good (EFX), introduced by Caragiannis, Kurokawa, Moulin, Procaccia, Shah and Wang (EC 2016), asks that no agent prefer another's bundle once any single good is removed…

6 thms3 active usersReviewed
🏆Completed
Operations ResearchOptimization·Captain: mikedeng1

Scheduling Problems with Two Competing Agents 9: Total Completion Time Against a Maximum Cost Has at Most n_A·n_B + 1 Nondominated PairsResearch Paper

Many scheduling decisions are not owned by a single decision maker. A machine shared by two departments, a production line serving two customers, or a computing resource shared by two users must process the jobs of two agents, each of which judges a schedule by its own criterion. Agnetis, Mirchandani, Pacciarelli and Pacifici introduced this model in Schedul…

10 thms3 active usersReviewed
🏆Completed
Graph TheoryTheoretical Computer Science·Captain: mikedeng1

A c^k n 5-Approximation Algorithm for Treewidth 1: If tw(G) ≤ k, Pushed Terminal Separations Around a 3/4-Balanced Separation Glue to a Separation of Order k+1 with Sides ≤ 7/8|V|+(|B|+k+1)/2Research Paper

Treewidth measures how closely a graph resembles a tree. Many problems that are NP-hard on general graphs can be solved in time linear in the number of vertices once a tree decomposition of bounded width is available, so computing such decompositions quickly is a basic task in algorithmic graph theory. Bodlaender, Drange, Dregi, Fomin, Lokshtanov and…

12 thms3 active usersReviewed
🏆Completed
Graph Theory·Captain: mikedeng1

Three-Coloring and List Three-Coloring of Graphs Without Induced Paths on Seven Vertices 1: Every Connected P₇-Free Graph Has a Connected 2-Dominating Set of at Most Three Vertices or a K₄Research Paper

Graph coloring asks whether vertices can be assigned colors so that adjacent vertices receive different colors. Restricting the graphs by forbidden induced paths can expose structure that is absent from general graphs. Bonomo, Chudnovsky, Maceli, Schaudt, Stein and Zhong study list three-coloring when the graph has no induced path on seven vertices,…

6 thms3 active usersReviewed
🏆Completed
Complexity TheoryLinear OptimizationTheoretical Computer Science·Captain: mikedeng1

Promise Constraint Satisfaction: Algebraic Structure and a Symmetric Boolean Dichotomy 2: The LP Algorithm Decides PCSPs with Majority or Alternating-Threshold Polymorphisms of All Odd AritiesResearch Paper

A constraint satisfaction problem (CSP) asks whether variables can be assigned values so that every constraint of a given instance holds. Feder and Vardi conjectured, and Bulatov and Zhuk proved in 2017, that every CSP over a finite set of relations is either polynomial-time solvable or NP-complete, and that the answer is governed by the polymorphisms of…

10 thms3 active usersReviewed
🏆Completed
AlgebraDiscrete GeometryLinear algebra·Captain: mikedeng1

Generalising the Scattered Property of Subspaces 2: If h + 1 Divides r and n ≥ h + 1, Maximum h-Scattered 𝔽_q-Subspaces of V(r, qⁿ) of Dimension rn/(h + 1) ExistResearch Paper

A scattered subspace is an Fq\mathbb F_qFq​-subspace UUU of an Fqn\mathbb F_{q^n}Fqn​-vector space VVV that meets every one-dimensional Fqn\mathbb F_{q^n}Fqn​-subspace of VVV in an Fq\mathbb F_qFq​-subspace of dimension at most one. Scattered subspaces produce scattered linear sets in projective spaces over finite fields, and through them two-intersection sets, two-weight codes,…

10 thms3 active usersReviewed
🏆Completed
AlgebraComplexity TheoryTheoretical Computer Science·Captain: mikedeng1

Promise Constraint Satisfaction: Algebraic Structure and a Symmetric Boolean Dichotomy 4: F = Pol(Γ) for a Finite Γ iff F Is Projection-Closed, Finitizable and Contains the IdentityResearch Paper

A constraint satisfaction problem (CSP) asks whether variables ranging over a finite domain DDD can be assigned values so that every constraint from a fixed finite list of relations is satisfied. A central organizing principle of the algebraic theory of CSPs is that the complexity of CSP(Γ)\mathrm{CSP}(\Gamma)CSP(Γ) is governed by its polymorphisms, the functions …

6 thms3 active usersReviewed
🏆Completed
Complexity TheoryGraph TheoryTheoretical Computer Science·Captain: mikedeng1

Algebraic Approach to Promise Constraint Satisfaction 2: Pol(K_k, K_{2k−1}) Has No Olšák Function, So It Maps by a Minion Homomorphism to Pol(H₂, H_K)Research Paper

Given a graph that is promised to be kkk-colourable, how many colours are needed to find a proper colouring in polynomial time? The decision version asks to distinguish kkk-colourable graphs from graphs that are not even ccc-colourable. It has been studied since Garey and Johnson (1976) and is conjectured to be NP-hard for all fixed 3≤k≤c3 \le k \le c3≤k≤c. This is the appr…

9 thms3 active usersReviewed
🏆Completed
AlgebraComplexity TheoryTheoretical Computer Science·Captain: mikedeng1

Algebraic Approach to Promise Constraint Satisfaction 4: No Finite D with 1-in-3 → D → NAE Has a Cyclic Polymorphism of Prime Arity p > 60|D|Research Paper

A promise constraint satisfaction problem (PCSP) is given by a pair of relational structures (A,B)(\mathbf A,\mathbf B)(A,B) with a homomorphism A→B\mathbf A\to\mathbf BA→B: an instance is promised to be satisfiable in A\mathbf AA, and it suffices to satisfy it in B\mathbf BB. The paper of Barto, Bulín, Krokhin and Opršal (arXiv:1811.00970v3) develops the algebraic theory of…

10 thms3 active usersReviewed
🏆Completed
AnalysisNumber Theory·Captain: FormallyCorrect

Ramanujan's Notebooks (Berndt)Textbook

The notebooks Ramanujan kept in India record identities, evaluations, transformations and general principles, usually presented without proofs. They preserve a working mathematician's collection rather than a textbook arranged around a sequence of prerequisite theorems. The Tata Institute of Fundamental Research published an unedited facsimile edition in…

50 thms3 active usersReviewed
🏆Completed
Graph Theory·Captain: mikedeng1

Steinberg's Conjecture is false: There Exists a Planar Graph with No Cycles of Length Four or Five That Is Not 3-ColorableResearch Paper

Deciding whether a planar graph is 3-colorable is NP-complete, so a large part of the theory of planar graph coloring looks for simple local conditions that guarantee 3-colorability. Grötzsch's theorem (1959) is the model result: every triangle-free planar graph is 3-colorable. Forbidding triangles is not the only possibility, and in 1976 Richard Steinberg…

13 thms3 active usersReviewed
🏆Completed
Complexity TheoryOperations ResearchOptimization+1·Captain: mikedeng1

A Comment on "Computational Complexity of Stochastic Programming Problems" 2: The Expected Recourse Value of (10) Is 1 − Vol(P(S; ⪯)), and a 1/(2k!)-Accurate Value Counts Linear ExtensionsResearch Paper

A two-stage stochastic program chooses a first action before uncertainty is observed and then takes a recourse action after the observation. Evaluating the expected optimal recourse value can be difficult even when the recourse problem for each fixed observation is a small linear program. This mission isolates the example in Section 3 of Hanasusanto, Kuhn…

8 thms3 active usersReviewed
🏆Completed
Machine LearningProbabilityTheoretical Computer Science·Captain: mikedeng1

A Learning Theory Approach to Non-Interactive Database Privacy 2: An ε-Differentially Private Mechanism Useful on Databases of Size at Most VCDIM(C)/2 Has Error α ≥ Ω(1/(4+16ε))Research Paper

A data curator holds a database of nnn records and wants to publish answers to a large family of statistical questions about it without revealing any individual record. Differential privacy (Dwork, McSherry, Nissim, Smith 2006) makes the requirement precise, and the most basic questions are counting queries: what fraction of the records satisfy a given…

9 thms3 active usersReviewed
🏆Completed
Operations ResearchProbabilityTheoretical Computer Science·Captain: mikedeng1

Matroid Prophet Inequalities 2: On an Intersection of p Matroids, the Summed-Threshold Algorithm Earns at Least 1/(4p−2) of the Expected OptimumResearch Paper

A prophet inequality compares a gambler who sees independent random rewards one at a time, and must accept or reject each on arrival, with a prophet who sees all rewards in advance. The classical inequality of Krengel, Sucheston and Garling (1977–78, as cited in the paper) says that when only one reward may be kept, a single threshold rule earns at least…

12 thms3 active usersReviewed
🏆Completed
Group Theory·Captain: mikedeng1

New Proofs of Plünnecke-type Estimates for Product Sets in Groups 2: If |BB| ≤ α|B| and |BbB| ≤ β|B| for All b ∈ B, Then |Bʰ| ≤ α^(8h−17) β^(h−2) |B| for Every h > 2Research Paper

Plünnecke-type inequalities turn information about a set and one product (or sum) of it into bounds on all of its iterated products. In an abelian group, Plünnecke's theorem (Plünnecke 1970) and its extension by Ruzsa say that ∣A+A∣≤α∣A∣|A + A| \le \alpha|A|∣A+A∣≤α∣A∣ implies ∣hA∣≤αh∣A∣|hA| \le \alpha^h |A|∣hA∣≤αh∣A∣ for every hhh. Such bounds are a basic tool in additive combinatorics, and their…

9 thms3 active usersReviewed
🏆Completed
Group Theory·Captain: mikedeng1

New Proofs of Plünnecke-type Estimates for Product Sets in Groups 3: If |AB| ≤ α|A|, |AbB| ≤ β|A| for b ∈ B and |A| ≤ γ|B|, Some S ⊆ A Has |SBʰ| ≤ α^(8h−9) β^(h−1) γ^(4h−5) |S| for h > 1Research Paper

Plünnecke–Ruzsa inequalities bound the size of iterated sumsets: if AAA and BBB are finite subsets of an abelian group with ∣A+B∣≤α∣A∣|A+B| \le \alpha|A|∣A+B∣≤α∣A∣, then ∣hB∣≤αh∣A∣|hB| \le \alpha^h|A|∣hB∣≤αh∣A∣ for every hhh, where hB=B+⋯+BhB = B + \dots + BhB=B+⋯+B. They are a basic tool of additive combinatorics, used in Freiman-type structure theorems, sum–product estimates and the study of approximate groups.…

6 thms3 active usersReviewed
🏆Completed
Graph TheoryOperations Research·Captain: mikedeng1

Basic Packing of Arborescences: A Digraph with Roots Has an M-Basic Packing of Arborescences iff π Is M-Independent and D Is M-ConnectedResearch Paper

Packing arc-disjoint arborescences is one of the basic tractable problems of combinatorial optimization. Edmonds' branching theorem (1973) says that a digraph D=(V,A)D=(V,A)D=(V,A) contains kkk arc-disjoint spanning arborescences rooted at a vertex rrr if and only if every non-empty vertex set X⊆V∖rX\subseteq V\setminus rX⊆V∖r is entered by at least kkk arcs. Its undirected counterpart…

12 thms3 active usersReviewed
PreviousPage 11 of 29Next

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