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
Graph TheoryTheoretical Computer Science·Captain: mikedeng1

New bounds for online coloring three-colorable graphsResearch Paper

A proper coloring assigns different colors to adjacent vertices of a graph. In the online vertex-coloring problem, vertices arrive one at a time with their edges to earlier vertices, and each color choice is immediate and irrevocable. The algorithm has to commit before learning which future vertices will connect to its current color classes. This separates…

12 thms2 active usersReviewed
🏆Completed
Theoretical Computer Science·Captain: mikedeng1

Three Standard Deviations Suffice While One Does NotResearch Paper

A collection of measurements can depend on the same binary decisions. Each decision contributes a real coefficient to each measurement, and choosing its sign changes all measurements at once. Discrepancy theory asks how small all resulting totals can be made simultaneously. In the matrix formulation, the columns describe decisions, the rows describe…

15 thms2 active usersReviewed
🏆Completed
Probability·Captain: mikedeng1

Tight Bounds for Tusnády's Problem in the PlaneResearch Paper

A coloring assigns each point one of two signs, interpreted as membership in two groups. For a region of the plane, its imbalance is the absolute difference between the numbers of points of the two signs inside it. Small imbalance simultaneously over many regions is a basic objective of geometric discrepancy theory. Axis-parallel rectangles are a natural…

13 thms2 active usersReviewed
🏆Completed
Complexity Theory·Captain: mikedeng1

Monotone circuit lower bounds from spread matchingsResearch Paper

A monotone Boolean circuit computes with AND and OR gates only. Exponential lower bounds for such circuits are a long line of unconditional results in circuit complexity, and matching resisted improvement for decades. Razborov proved in 1985 that computing matching requires monotone circuits of size nΩ(log⁡n)n^{\Omega(\log n)}nΩ(logn). That bound stood until Cavalar, Göös,…

16 thms2 active usersReviewed
🏆Completed
Computational GeometryDiscrete Geometry·Captain: mikedeng1

Strong Lower Bounds for Weak Epsilon-NetsResearch Paper

A collection of regions often has to be met by a small set of representative points. In discrete geometry this is a piercing problem: every region must contain at least one chosen point. When the regions are convex and each contains a prescribed fraction of a finite input set, the minimum required number of representatives is the weak epsilon-net problem.…

11 thms2 active usersReviewed
🏆Completed
Graph TheoryInformation Theory·Captain: mikedeng1

The Multiple Unicast Conjecture is FalseResearch Paper

A multiple unicast instance models several independent communications sharing the same network. Each session has its own source and destination, and each connection has a capacity that must be shared by the sessions using it. Traditional routing sends each packet along a path, allowing a session to divide its traffic among several paths. Network coding also…

16 thms2 active usersReviewed
Probability·Captain: mikedeng1

Algorithmic thresholds for finding large independent sets in random graphsResearch Paper

In a binomial random graph Gn,pG_{n,p}Gn,p​ the largest independent set has size about 2log⁡1/(1−p)(np)2\log_{1/(1-p)}(np)2log1/(1−p)​(np), while simple greedy procedures find one of size about half of that. Karp asked in 1976 whether an efficient algorithm can do better, and the question remains open. Since an unconditional answer is out of reach, current work asks which classes of algorithms can…

22 thms2 active usersReviewed
cryptography·Captain: mikedeng1

The Authentication Complexity of Byzantine ConsensusResearch Paper

Byzantine agreement (BA) asks nnn parties, each holding an input bit, to output a common bit despite up to ttt parties behaving arbitrarily, with the common output equal to the honest parties' input whenever those inputs coincide. It is a building block of state-machine replication and secure multiparty computation. Its resilience depends on the initial…

25 thms2 active usersReviewed
Operations ResearchTheoretical Computer Science·Captain: mikedeng1

Coordinating Boundaries: Improved Approximation Algorithms for Unweighted Non-Preemptive Throughput MaximizationResearch Paper

Nonpreemptive throughput maximization is a basic real-time scheduling problem: a set of jobs, each available only during a time window, must be placed on identical machines so that as many jobs as possible finish by their deadlines. It models admission control in real-time systems and allocation of communication resources (Bar-Noy, Guha, Naor and Schieber,…

20 thms2 active usersReviewed
Complexity TheoryOperations Research·Captain: mikedeng1

Closing All-Exp Gaps in Local Search for the Traveling Salesman Problem and Maximum Constraint AssignmentResearch Paper

Local search is the oldest heuristic for the Traveling Salesman Problem (TSP): start from a tour and keep replacing it by a better neighboring tour until no neighbor is better. For the 2-opt neighborhood, studied by Croes in 1958, a move replaces two edges of the tour by two other edges. The method is used in practice, and the number of its iterations is…

29 thms2 active usersReviewed
Graph TheoryInformation Theory·Captain: mikedeng1

Optimal girth-dependent bounds for the Bethe approximation of the permanentResearch Paper

The permanent of an n×nn\times nn×n matrix, per(A)=∑σ∈Sym(n)∏iAi,σ(i)\mathrm{per}(A)=\sum_{\sigma\in\mathrm{Sym}(n)}\prod_i A_{i,\sigma(i)}per(A)=∑σ∈Sym(n)​∏i​Ai,σ(i)​, is the partition function of the weighted perfect-matching model, and computing it is #P-hard even for 0–1 matrices (Valiant 1979). Randomized approximation to any factor 1+ε1+\varepsilon1+ε is possible in polynomial time (Jerrum–Sinclair–Vigoda 2004),…

27 thms2 active usersReviewed
🏆Completed
ProbabilityTheoretical Computer Science·Captain: iris

A Hitting Set Lemma for HDX & ApplicationsResearch Paper

The hitting set lemma for expander graphs bounds the probability that a random walk stays inside a fixed set of vertices: for a graph whose normalized second singular value is at most λ\lambdaλ and a set SSS of density μ\muμ, a (d−1)(d-1)(d−1)-step walk from a random vertex stays in SSS with probability at most μ(μ+λ)d−1\mu(\mu+\lambda)^{d-1}μ(μ+λ)d−1. Results of this type underlie…

29 thms2 active usersReviewed
Complexity TheoryTheoretical Computer Science·Captain: iris

A Near-Linear Element-Kernel for d-Hitting SetResearch Paper

ddd-Hitting Set is a central covering problem of parameterized complexity: many deletion problems whose obstructions have bounded size (Cluster Vertex Deletion, Feedback Vertex Set in Tournaments, Split Vertex Deletion, ddd-Path Vertex Cover) are instances of it. A kernel shrinks an instance in polynomial time to an equivalent one whose size depends on the…

38 thms2 active usersReviewed
Theoretical Computer Science·Captain: iris

A Complete Characterization of Central String Queries in Compact SpaceResearch Paper

Text indexes such as compressed suffix trees answer queries about a string TTT of length nnn over an alphabet [0 . . σ)[0\,.\,.\,\sigma)[0..σ) while using space close to the nlog⁡σn\log\sigmanlogσ bits of the text itself. One of their standard components is the longest common prefix information of the sorted suffixes. Sadakane [Sad02] showed that the permuted LCP array PLCPT\mathrm{PLCP}_TPLCPT​ ca…

85 thms2 active usersReviewed
Graph TheoryProbabilityTheoretical Computer Science·Captain: iris

Hypergraph Recovery from Anonymous Projection StreamsResearch Paper

Many networks record interactions among whole groups, but the data often arrive only as low-order co-occurrences: which pairs, or which qqq-sets, of participants appeared together, and how often. The groups {a,b,c}\{a,b,c\}{a,b,c} and {a,b,d}\{a,b,d\}{a,b,d} contribute two copies of the pair {a,b}\{a,b\}{a,b}, and nothing in the counts says which copy came from which group. Counted pair…

46 thms2 active usersReviewed
🏆Completed
Complexity TheoryInformation Theory·Captain: iris

The One-and-a-Half Johnson Bound Is Tight for Proximity Gaps of General Linear CodesResearch Paper

Hash-based succinct arguments (SNARKs) such as FRI-based and STIR/WHIR-style systems test that a committed word is close to a linear code. To keep proofs short, they test many words at once by testing a single random linear combination. This batching is sound when the code has the proximity-gaps property at radius ρ\rhoρ: if fff or ggg is far from the code CCC,…

31 thms2 active usersReviewed
Complexity TheoryProbabilityTheoretical Computer Science·Captain: iris

A Subsampling Theorem for Constraint Satisfaction Problems with Large ArityResearch Paper

A constraint satisfaction problem asks for an assignment of values to variables that satisfies as many local constraints as possible. A subsampling theorem says that the optimum of a large instance is approximately preserved when the instance is restricted to a small uniformly random set of variables. Such statements are the basis of constant-query property…

24 thms2 active usersReviewed
Information TheoryProbabilityTheoretical Computer Science·Captain: iris

Secret Sharing Despite Non-Extractable RandomnessResearch Paper

Information-theoretic cryptography is usually analysed with perfectly uniform randomness, while physical sources are imperfect and only known to belong to some source class, a fixed family of distributions. If a single deterministic extractor maps every source of the class to a nearly uniform string, every task that needs uniform randomness becomes…

18 thms2 active usersReviewed
AnalysisGraph Theory·Captain: iris

Graphon Colourings and Limits of Graph PartitionsResearch Paper

The Cheeger constant of a graph measures its worst bottleneck: the smallest ratio between the number of edges leaving a vertex set and the volume of that set. It controls the spectral gap of the random walk through the Cheeger–Buser inequalities, and through them mixing times, expansion and the quality of spectral partitioning.

50 thms2 active usersReviewed
ProbabilityRandom Matrix Theory·Captain: iris

Matrix Spencer: Eight Standard Deviations Suffice and an Almost-Linear Time Algorithm for Dense InputResearch Paper

Spencer's "six standard deviations suffice" theorem says that every family of nnn sets on nnn points has a {−1,1}\{-1,1\}{−1,1}-coloring of discrepancy at most 6n6\sqrt n6n​, while independent random signs lose a factor log⁡n\sqrt{\log n}logn​ (Spencer 1985). The Matrix Spencer conjecture of Meka asks for the noncommutative form: for symmetric matrices …

59 thms2 active usersReviewed
🏆Completed
Graph TheoryTheoretical Computer Science·Captain: iris

Paths and Intersections: Repelling PairsResearch Paper

The distance realization problem asks, given a metric DDD on a finite set TTT of terminals and a family of graphs, whether some graph in the family with nonnegative edge lengths, possibly with extra Steiner vertices, has shortest-path metric exactly DDD on TTT. The question goes back to Hakimi and Yau (1965) and appears in phylogenetics, hierarchical classification…

38 thms2 active usersReviewed
Complexity TheoryTheoretical Computer Science·Captain: iris

An Improved Streaming Algorithm for Exact Pattern MatchingResearch Paper

Given a pattern PPP of length mmm followed by a text TTT of length nnn, one character at a time, can an algorithm report each occurrence of PPP in TTT as soon as it ends, while remembering very little? Exact Pattern Matching in the streaming model is the basic problem of a large area: it is used as a black box in streaming algorithms for kkk-mismatch, matching with…

34 thms2 active usersReviewed
Graph TheoryProbabilityQuantum Information·Captain: iris

Entanglement in random graph statesResearch Paper

Graph states are multi-qubit stabilizer states indexed by graphs (Hein, Eisert, Briegel, 2004, doi). They are used in measurement-based quantum computation, error correction and secret sharing, so it is useful to measure their entanglement by combinatorial invariants of the underlying graph. Two graph states are equivalent under single-qubit Clifford…

27 thms2 active usersReviewed
Graph TheoryTheoretical Computer Science·Captain: iris

A Near-Optimal Generalized Sorting AlgorithmResearch Paper

Ordinary comparison sorting assumes that any two elements can be compared. In many settings only some comparisons are possible or affordable: in the nuts and bolts problem a nut can only be compared with a bolt, and in pairwise preference or ranking problems only certain pairs are ever presented together. Generalized sorting, introduced by Huang, Kannan and…

51 thms2 active usersReviewed
Graph TheoryProbabilityTheoretical Computer Science·Captain: iris

Half-Optimal Induced Matchings in Random Graphs: Online and Low-Degree AlgorithmsResearch Paper

An induced matching (or strong matching) of a graph is a set of pairwise vertex-disjoint edges whose endpoints span no other edges. Induced matchings appear in strong edge colouring (each colour class of a strong edge colouring is an induced matching), in the Ruzsa–Szemerédi problem, and in the analysis of graph algorithms and interference-free scheduling.…

23 thms2 active usersReviewed
PreviousPage 29 of 50Next

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