A Quantum-Inspired Mechanical Method for Proving of Ramsey’s Theorem by Symbolic Computation over the Finite Field GF(2)
Pages 368 - 385
Abstract
This paper presents a quantum-inspired method for proving Ramsey’s theorem using symbolic computation on conventional computers, an improvement of the classical Ramsey’s theorem, and a mechanized proof of implemented by symbolic computation on the finite field GF(2).
References
[1]
Ramsey FP On a problem in formal logic Proc. Lond. Math. Soc. Ser. 2 1930 30 1 264-286
[2]
Piskac R, de Moura L, and Bjorner N Deciding effectively propositional logic with equality Microsoft Res. Tech. Rep. 2008 30 264-286
[3]
Berardi S and Steila S An intuitionistic version of Ramsey’s theorem and its use in program termination Ann. Pure Appl. Logic 2015 166 12 1382-1406
[4]
Campos, M., Griffiths, S., Morris, R., Sahasrabudhe, J.: An Exponential Improvement for Diagonal Ramsey (2023). https://arxiv.org/pdf/2303.09521.pdf
[5]
Erdős P and Szeckers G Gessel I and Rota GC A combinatorial problem in geometry Classic Papers in Combinatorics 2009 Birk-häuser Boston Modern Birkhäuser Classics
[6]
McKay BD and Radziszowski SP J. Graph Theory 1995 19 3 309-322
[7]
Exoo G A lower bound for r(5, 5) J. Graph Theory 1989 13 97-98
[8]
Angeltveit V and McKay B J. Graph Theory 2018 89 1 5-13
[9]
Gaitan F and Clark L Ramsey numbers and adiabatic quantum computing Phys. Rev. Lett. 2012 108
[10]
Wang H and McKay BD Determining Ramsey numbers on a quantum computer Phys. Rev. A 2016 93 3
[11]
Bian Z, Chuak F, Macready WG, et al. Experimental determination of Ramsey numbers Phys. Rev. Lett. 2013 111
[12]
Walker K An upper bound for the Ramsey number J. Comb. Theory Ser. A 1971 11 1 1-10
[13]
Mackey, J.: Combinatorial remedies. Ph.D. thesis. Department of Mathematics, University of Hawaii (1994)
[14]
Lu J and Zeng Z A mechanical proof of Ramsey’s theorem via symbolic computation J. Syst. Sci. Math. Sci. Chin. Ser. 2021 41 12 3311-3323
[15]
Ranjbar M, Macready WG, Clark L, and Gaitan F Generalized Ramsey numbers through adiabatic quantum optimization Quant. Inf. Process. 2016 15 9 3519-3542
[16]
Barton, L.: Ramsey Theory (2021). https://www.cs.umd.edu/~ gasarch/ courses/250/S22/slides/comb/otherpaperkings.pdf
[17]
Kalbfleisch JG and Stanton RG On the maximal triangle-free edge-chromatic graphs in three colors J. Comb. Theory 1968 5 9-20
[18]
Grinstead CM and Roberts SM On the Ramsey numbers and J. Comb. Theory Ser. B 1982 33 1 27-51
[19]
Graham RL, Rothschild BL, and Spencer JH Ramsey Theory 1990 2 Wiley-Interscience
[20]
Graham RL and Spencer JH Ramsey theory Sci. Am. 1990 263 7 112-117
[21]
McKay BD and Min ZK The value of the Ramsey number J. Graph Theory 1996 16 99-105
[22]
Schwartz JT Fast probabilistic algorithms for verification of polynomial identities J. ACM 1980 27 4 701-717
[23]
Zippel R Ng EW Probabilistic algorithms for sparse polynomials Symbolic and Algebraic Computation 1979 Heidelberg Springer 216-226
Index Terms
- A Quantum-Inspired Mechanical Method for Proving of Ramsey’s Theorem by Symbolic Computation over the Finite Field GF(2)
Index terms have been assigned to the content through auto-classification.
Recommendations
Analytica – An Experiment in Combining Theorem Proving and Symbolic Computation
Analytica is an automatic theorem prover for theorems in elementary analysis. The prover is written in the Mathematica language and runs in the Mathematica environment. The goal of the project is to use a powerful symbolic computation system to prove ...
Star-critical Ramsey number of F n versus K 4
For two graphs G and H , the Ramsey number r ( G , H ) is the smallest positive integer r , such that any red/blue coloring of the edges of graph K r contains either a red subgraph that is isomorphic to G or a blue subgraph that is isomorphic to H . Let ...
The Ramsey number R (C8,K8)
For two given graphs G"1 and G"2, the Ramsey number R(G"1,G"2) is the smallest integer n such that for any graph G of order n, either G contains G"1 or the complement of G contains G"2. Let C"m denote a cycle of length m and K"n a complete graph of ...
Comments
Information & Contributors
Information
Published In
Nov 2024
416 pages
ISBN:978-3-031-77018-0
DOI:10.1007/978-3-031-77019-7
- Editors:
- Chutiporn Anutariya,
- Marcello M. Bonsangue
© The Author(s), under exclusive license to Springer Nature Switzerland AG 2025.
Publisher
Springer-Verlag
Berlin, Heidelberg
Publication History
Published: 25 November 2024
Author Tags
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 28 Jan 2025