Computer-aided proof of Erdős discrepancy properties
From MaRDI portal
Publication:892235
DOI10.1016/j.artint.2015.03.004zbMath1344.68205arXiv1405.3097OpenAlexW2090857454MaRDI QIDQ892235
Boris Konev, Alexej P. Lisitsa
Publication date: 18 November 2015
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1405.3097
Irregularities of distribution, discrepancy (11K38) Arithmetic combinatorics; higher degree uniformity (11B30)
Related Items
Nonexistence Certificates for Ovals in a Projective Plane of Order Ten ⋮ Optimal-depth sorting networks ⋮ Computer-aided constructions of commafree codes ⋮ Simulating strong practical proof systems with extended resolution ⋮ \texttt{cake\_lpr}: verified propagation redundancy checking in CakeML ⋮ Decomposing SAT Instances with Pseudo Backbones ⋮ Functional Encryption for Inner Product with Full Function Privacy ⋮ The resolution of Keller's conjecture ⋮ Strong extension-free proof systems ⋮ Non-clausal redundancy properties ⋮ The Erdős discrepancy problem ⋮ Formally verifying the solution to the Boolean Pythagorean triples problem ⋮ A nonexistence certificate for projective planes of order ten with weight 15 codewords ⋮ Covered clauses are not propagation redundant ⋮ The resolution of Keller's conjecture
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Symmetry in Gardens of Eden
- Automated theorem provers: a practical tool for the working mathematician?
- Some unsolved problems
- Symmetry definitions for constraint satisfaction problems
- A revision of the proof of the Kepler conjecture
- Transmitting in the \(n\)-dimensional cube
- The four-colour theorem
- Solution of the Robbins problem
- A panorama of discrepancy theory
- A proof of the Kepler conjecture
- The Non-Existence of Finite Projective Planes of Order 10
- Completely multiplicative functions taking values in ${-1,1}$
- A SAT Attack on the Erdős Discrepancy Conjecture
- Towards an Optimal CNF Encoding of Boolean Cardinality Constraints
- Every planar map is four colorable
- Discrepancy in arithmetic progressions
- On the hereditary discrepancy of homogeneous arithmetic progressions
- Roth’s Orthogonal Function Method in Discrepancy Theory and Some New Connections
- On the Erdős Discrepancy Problem
- Theory and Applications of Satisfiability Testing
- A Machine-Checked Proof of the Odd Order Theorem
- Remark concerning integer sequences
- Optimal private halfspace counting via discrepancy
- Erdős and Arithmetic Progressions
- Theory and Applications of Satisfiability Testing
- On Highly Composite and Similar Numbers
- Principles and Practice of Constraint Programming – CP 2004
- A concise introduction to mathematical logic
- Note on irregularities of distribution
- Geometric discrepancy. An illustrated guide
This page was built for publication: Computer-aided proof of Erdős discrepancy properties
