Complete Disorder is Impossible: The Mathematical Work of Walter Deuber

  title={Complete Disorder is Impossible: The Mathematical Work of Walter Deuber},
  author={Hans J{\"u}rgen Pr{\"o}mel},
  journal={Combinatorics, Probability and Computing},
  pages={3 - 16}
  • H. Prömel
  • Published 1 January 2005
  • Psychology
  • Combinatorics, Probability and Computing
Complete disorder is impossible – this theme of Ramsey Theory, as stated by Theodore S. Motzkin, was a guiding theme throughout Walter Deuber's scientific life. 
4 Complete Disorder is Impossible : The Mathematical Work of
In 1928 the young British mathematician Frank Plumpton Ramsey had written a paper ‘On a problem in formal logic’, which was published in 1930 in the Proceedings of the London Mathematical Society. It
Recurrence of Space-time Events
A causal-directed graphical space-time model that uses Ramsey theorem to prove that there's always a possibility of predictability whatever how chaotic the system.
Vacancies in Self-Assembled Crystals: An Archetype for Clusters Statistics at the Nanoscale.
A self-assembly method to fabricate perfectly ordered structures where random defects can be introduced is presented and the distribution of cluster sizes as a function of vacancy density is analyzed.
Algorithmen und Komplexität
In diesem Kapitel beschaftigen wir uns mit Algorithmen: automatischen Verfahren zur Losung von Problemen. Wir beginnen damit, den Begriff des Algorithmus selbst zu erklaren – zumindest so genau wie
Sample Size Calculation for Continuous and Discrete Data
The purpose of this paper is to provide a practical guidance to researcher in social science on sample size determination. Sample size calculation is a basic and indispensable requisite for applied
A sunflower anti-Ramsey theorem and its applications
A $h$-sunflower in a hypergraph is a family of edges with $h$ vertices in common. We show that if we colour the edges of a complete hypergraph in such a way that any monochromatic $h$-sunflower has


Two remarks on Ramsey's theorem
Graham-Rothschild Parameter Sets
In their, by now classical, paper ‘Ramsey’s theorem for n-parameter sets’ (Trans. Amer. Math. Soc. 159 (1971), 257–291) Graham and Rothschild introduced a combinatorial structure which turned out be
Investigations of the early order of the canonical material in the name of unity show that the unity displayed lies more in the hermeneutical principles used than in the material itself.
Independent Arithmetic Progressions in Clique-Free Graphs on the Natural Numbers
We show that if G is a Kr-free graph on N, there is an independent set in G which contains an arbitrarily long arithmetic progression together with its difference. This is a common generalization of
Open Problems in Partition Regularity
The aim in this paper is to present some of the natural and appealing open problems in the area of partition regularity in the infinite case.
On a metric generalization of ramsey’s theorem
An increasing sequence of realsx=〈xi:i<ω〉 is simple if all “gaps”xi+1−xi are different. Two simple sequencesx andy are distance similar ifxi+1−xi<xj+1−xj if and only ifyi+1−yi<yj+1−yj for alli andj.
Partition regular systems of linear inequalities
3 (m,p,c)-sets 59 4 Canonical Results 63 5 Coloring Objects of Higher Rank 65 1 Introduction In 1930 Ramsey published his paper On a problem in formal logic 12]. He established a result, nowadays
Independent finite sums in graphs defined on the natural numbers
Independent Finite Sums forKm-Free Graphs
It is shown there exists a sequence ?xn?∞n=1so that wheneverFandHare distinct finite nonempty subsets of N, {?n?Fxn, ?n?Hxn} is not an edge ofG, which is valid for a graphGon an arbitrary cancellative semigroup (S, +).