Simple proofs of estimations of Ramsey numbers and of discrepancy

07/29/2021
by   A. Buchaev, et al.
0

In this expository note we present simple proofs of the lower bound of Ramsey numbers (Erdös theorem), and of the estimation of discrepancy. Neither statements nor proofs require any knowledge beyond high-school curriculum (except a minor detail). Thus they are accessible to non-specialists, in particular, to students. Our exposition is simpler than the standard exposition because no probabilistic language is used. In order to prove the existence of a `good' object we prove that the number of `bad' objects is smaller than the number of all objects.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/06/2021

Learning proofs for the classification of nilpotent semigroups

Machine learning is applied to find proofs, with smaller or smallest num...
research
04/25/2018

Cheap Non-standard Analysis and Computability

Non standard Analysis is an area of Mathematics dealing with notions of ...
research
08/03/2022

On Brooks' Theorem

In this note we give two proofs of Brooks' Theorem. The first is obtaine...
research
11/04/2021

The discrepancy of unsatisfiable matrices and a lower bound for the Komlós conjecture constant

We construct simple, explicit matrices with columns having unit ℓ^2 norm...
research
02/14/2017

On absolutely normal numbers and their discrepancy estimate

We construct the base 2 expansion of an absolutely normal real number x ...
research
04/26/2021

Bijective proofs for Eulerian numbers in types B and D

Let ⟨n k⟩, ⟨B_n k⟩, and ⟨D_n k⟩ be the Eulerian numbers in the types A, ...
research
09/11/2015

Premise Selection and External Provers for HOL4

Learning-assisted automated reasoning has recently gained popularity amo...

Please sign up or login with your details

Forgot password? Click here to reset