Related papers: On finitary Hindman's numbers
We provide two new proofs of the infinitude of prime numbers, using the additive Ramsey-theoretic result known as Folkman's theorem (alternatively, one can think of these proofs as using Hindman's theorem). This adds to the existing…
We provide primitive recursive bounds for the finite version of Gowers' $c_0$ theorem for both the positive and the general case. We also provide multidimensional versions of these results.
We present a natural restriction of Hindman's Finite Sums Theorem that admits a simple combinatorial proof (one that does not also prove the full Finite Sums Theorem) and low computability-theoretic and proof-theoretic upper bounds, yet…
We improve the previuosly known bound for some vertex Folkman numbers.
We give a purely combinatorial proof for a two-fold generalization of van der Waerden-Brauer's theorem and Hindman's theorem. We also give tower bounds for a finite version of it.
We prove upper and lower bounds on the effective content and logical strength for a variety of natural restrictions of Hindman's Finite Sums Theorem. For example, we show that Hindman's Theorem for sums of length at most 2 and 4 colors…
We furnish an explicit bound for the prime number theorem in short intervals on the assumption of the Riemann hypothesis.
In a recent work Friedlander studied the problem of how large consecutive prime gaps should be in order that the sum of the reciprocals should be divergent. Supposing a very deep Hypothesis, a generalization of the Hardy--Littlewood prime…
We prove upper and lower bounds for certain sums of products of fractional parts by using majoring and minorizing functions from Fourier analysis. In special cases the upper bounds are sharp if there exist counterexamples to the Littlewood…
This paper answers in the affirmative a question raised by Karl Schwede concerning an upper bound on the multiplicity of F-pure rings.
We prove an estimate on the number of rational points on the Grassmannian variety of bounded twisted height, refining the classical results of Schmidt ([12]) and Thunder ([20]) over the rational field: most importantly, our formula counts…
This paper addresses a question posed by F\'elix, Halperin and Thomas. We prove that the Lusternik-Schnirelmann category of a relative Sullivan algebra is finite if such invariants of the base algebra and fiber algebra are both finite.…
It is shown that the question raised in Section 5.7 of [1] has an affirmative answer.
Using the structure of Singer cycles in general linear groups, we prove that a conjecture of Zeng, Han and He (2007) holds in the affirmative in a special case, and outline a plausible approach to prove it in the general case. This…
On the assumption of the Riemann hypothesis, we give explicit upper bounds on the difference between consecutive prime numbers.
We investigate the Friedman--Goldfarb--Harrington theorem from two perspectives. Firstly, in the frameworks of classical and modal propositional logics, we study the forms of sentences whose existence is guaranteed by the FGH theorem.…
We show a short proof of Higman's lemma using Friedman's adjacent Ramsey theorem for pairs. This provides an alternative proof of the known upper bound for the reverse mathematical status of Higman's lemma and that of its miniaturised…
In this short note we resort to the well known Hellmann-Feynman theorem to prove that some non-relativistic Hamiltonian operators support an infinite number of bound states.
Much recent progress has been made concerning the probable existence of Odd Perfect Numbers, forming part of what has come to be known as Sylvester's Web Of Conditions. This paper proves some results concerning certain properties of the…
We provide new upper and lower bounds on the minimum possible ratio of the spectral and Frobenius norms of a (partially) symmetric tensor. In the particular case of general tensors our result recovers a known upper bound. For symmetric…