In this paper we give a computer proof of a new polynomial identity, which extends a recent result of Alladi and the first author. In addition, we provide computer proofs for new finite analogs of Jacobi and Euler formulas. All computer proofs are done with the aid of the new computer algebra packag
A Proof of Halpern–Läuchli Partition Theorem
✍ Scribed by S.A. Argyros; V. Felouzis; V. Kanellopoulos
- Publisher
- Elsevier Science
- Year
- 2002
- Tongue
- English
- Weight
- 116 KB
- Volume
- 23
- Category
- Article
- ISSN
- 0195-6698
No coin nor oath required. For personal study only.
✦ Synopsis
A proof of the Halpern-Läuchli partition theorem and its version for strong subtrees is given. We prove a general statement which has, as an immediate consequence, the above-mentioned results. The proof of this is direct and avoids metamathematical arguments. Some consequences for partitions of finite products of metric spaces are also presented.
📜 SIMILAR VOLUMES
Sane copiosam tu et uberem messem ex hoc agro collegisti, nos pauculas spicas contemptas tibi potius quam non visas. Triumphus igutur hic omnis tuus est: mihi abunde satis si armillis aut hasta donatus, sequar hunc candidae famae tuae currum. wJustus Lipsius In this paper we prove that, except fo
This article gives a simple proof of a result of Moser, which says that, for any rational number r between 2 and 3, there exists a planar graph G whose circular chromatic number is equal to r.
## Abstract A new proof of Menger's theorem is presented.