Math and TheoryProof complexity
1 research manuscript in theoretical computer science. Catalogue areas: Proof complexity.
Results in Proof complexity
Unbounded coalesced-mass certificates for resolution trees
Determined exactlyCoalesced clause-mass certificate for resolution trees (Kunisky's Komlós approach)
For every n ≥ 3, the coalesced clause-mass certificate over finite unrestricted resolution refutations of the formula of all 2ⁿ full signed clauses has exact supremum n + 1; a three-variable witness exceeds 61/25 > 1 + √2.
Manuscript: Unbounded coalesced-mass certificates for resolution treesLean proof: Unbounded coalesced-mass certificates for resolution treesVerification: Unbounded coalesced-mass certificates for resolution trees
Other subjects
Discrete analysis, tilings, probability and entropyOptimizationQuantum informationValuation theoryMatrix theoryMatroid theorySampling algorithms and information theoryGraph theory and graph polynomialsInteger sequences and combinatoricsFinite geometryQuadratic forms and number theoryBoolean functions and decision treesInequalities and real analysisFair divisionStochastic thermodynamics