2017
DOI: 10.1007/s00493-016-3640-2
|View full text |Cite
|
Sign up to set email alerts
|

Fermat-Like Equations that are not Partition Regular

Abstract: Abstract. By means of elementary conditions on coefficients, we isolate a large class of Fermat-like Diophantine equations that are not partition regular, the simplest examples being x n +y m = z k with k / ∈ {n, m}.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
10
0

Year Published

2018
2018
2019
2019

Publication Types

Select...
3
2

Relationship

2
3

Authors

Journals

citations
Cited by 11 publications
(10 citation statements)
references
References 14 publications
(13 reference statements)
0
10
0
Order By: Relevance
“…To our knowledge, the last progress done in this area about is found in [12], where M. Riggio and the first named author used nonstandard analysis to identify a large class of Fermat-like equations that are not partition regular, the simplest examples being x m + y n = z k where k / ∈ {n, m}. 3 At the moment this paper was completed, it was breaking news that M. J. H. Heule, O. Kullmann and V. W. Marek [18] solved a problem posed by P. Erdős and R. Graham in the 1970s, namely the Boolean Pythagorean triples problem, that asked whether the equation x 2 + y 2 = z 2 is partition regular for 2-colorings of N. By using a computer-assisted proof, they have been able to prove that any 2-coloring of {1, 2, .…”
Section: Multiplicative Rado's Theorema Nonlinear Diophantine Equatimentioning
confidence: 99%
See 2 more Smart Citations
“…To our knowledge, the last progress done in this area about is found in [12], where M. Riggio and the first named author used nonstandard analysis to identify a large class of Fermat-like equations that are not partition regular, the simplest examples being x m + y n = z k where k / ∈ {n, m}. 3 At the moment this paper was completed, it was breaking news that M. J. H. Heule, O. Kullmann and V. W. Marek [18] solved a problem posed by P. Erdős and R. Graham in the 1970s, namely the Boolean Pythagorean triples problem, that asked whether the equation x 2 + y 2 = z 2 is partition regular for 2-colorings of N. By using a computer-assisted proof, they have been able to prove that any 2-coloring of {1, 2, .…”
Section: Multiplicative Rado's Theorema Nonlinear Diophantine Equatimentioning
confidence: 99%
“…In the last years, the interest on problems related to the partition regularity of nonlinear Diophantine equations has been rising constantly (see, e.g., [28,23,6,37,33,34,3,12,13,18]). We hope that this paper will contribute to a general Ramsey theory of nonlinear Diophantine equations.…”
Section: Final Remarks and Open Questionsmentioning
confidence: 99%
See 1 more Smart Citation
“…From the previous theorem, we see that many "Fermat-like" equations are not partition regular: In [41], the previous corollary is extended to allow m and n to be equal, in which case the equations are shown to be not partition regular (as long as, in the case when m = n = k − 1, one excludes the trivial solution x = y = z = 2). The methods are similar to the previous proof.…”
Section: Non-partition Regularity Of Some Equationsmentioning
confidence: 99%
“…MANY STARS: ITERATED NONSTANDARD EXTENSIONSNotes and referencesIterated hyperextensions were introduced in[36], where they are used to give a new approach to the proof of Rado's theorem in the theory of partition regularity of equations (see Chapter 10 below). Further applications to the study of partition regularity of equations are obtained in[82,81,83,41,37]. A survey on the main properties of iterated hyperextensions, also in relation with hyperfinite generators of ultrafilters, is presented in[35].…”
mentioning
confidence: 99%