OpenAlex ·
A new proof of two-color partition regularity of Pythagorean triples
- Published
- Source
- OpenAlex
- Published in
- arXiv (Cornell University)
- DOI
- 10.48550/arxiv.2609.34676
- Original
- Read it at the publisher
- Topics
Abstract
We give a new proof that if the natural numbers are colored in two colors, then there exists a monochromatic Pythagorean triple. The proof was found by ChatGPT Astra.
The authors’ abstract, as arXiv lists it. arXiv’s listings, abstracts included, are free for anyone to reuse.
Read it on ReadSearch
Each opens after you create an account, and brings you back to this paper.
More in Combinatorics
Large-Scale Autonomous Discovery of Kissing Number Constructions
A Memory-Magic Exchange Law in Streaming Clifford+T Compilation
The Szemerédi-Trotter Estimate in Finite Field with its Applications
Asymptotics of the Brown--Erdős--Sós problem at integer exponents
On the residual finiteness of the non-abelian tensor square $G \otimes G$, the non-abelian exterior square $G \wedge G$ and the weak commutativity construction $\X(G)$
Get the few papers worth your time in Combinatorics every morning.
ReadSearch reads the new papers in your field each day and brings you the few worth reading, each with its key finding in a sentence.