Numbers, Information and Complexity

1. Front Matter

   Pages i-xx

   PDF

2. Numbers and Combinatorics

   1. On Prefix-Free and Suffix-Free Sequences of Integers

      • Rudolf Ahlswede, Levon H. Khachatrian, András Sárközy

      Pages 1-16

   2. Almost Arithmetic Progressions

      • Egbert Harzheim

      Pages 17-20

   3. A Method to Estimate Partial-Period Correlations

      • Aimo Tietäväinen

      Pages 21-27

   4. Splitting Properties in Partially Ordered Sets and Set Systems

      • Rudolf Ahlswede, Levon H. Khachatrian

      Pages 29-44

   5. Old and New Results for the Weighted t-Intersection Problem via AK-Methods

      • Christian Bey, Konrad Engel

      Pages 45-74

   6. Some New Results on Macaulay Posets

      • Sergei L. Bezrukov, Uwe Leck

      Pages 75-94

   7. Minimizing the Absolute Upper Shadow

      • Béla Bollobás, Imre Leader

      Pages 95-100

   8. Convex Bounds for the 0,1 Co-Ordinate Deletions Function

      • David E. Daykin

      Pages 101-104

   9. The Extreme Points of the Probabilistic Capacities Cone Problem

      • David E. Daykin

      Pages 105-107

   10. On Shifts of Cascades

       • David E. Daykin

       Pages 109-116

   11. Erdös-Ko-Rado Theorems of Higher Order

       • Péter L. Erdős, László A. Székely

       Pages 117-124

   12. On the Prague Dimension of Kneser Graphs

       • Zoltán Füredi

       Pages 125-128

   13. The Cycle Method and Its Limits

       • Gyula O. H. Katona

       Pages 129-141

   14. Extremal Problems on Δ-Systems

       • Alexandr V. Kostochka

       Pages 143-150

3. Information Theory

   1. Channels and Networks

      1. The AVC with Noiseless Feedback and Maximal Error Probability: A Capacity Formula with a Trichotomy

         • Rudolf Ahlswede, Ning Cai

         Pages 151-176

      2. Calculation of the Asymptotically Optimal Capacity of a T-User M-Frequency Noiseless Multiple-Access Channel

         • Leonid Bassalygo, Mark Pinsker

         Pages 177-180

      3. A Survey of Coding Methods for the Adder Channel

         • Gurgen H. Khachatrian

         Pages 181-196

      4. Communication Network with Self-Similar Traffic

         • Boris Tsybakov

         Pages 197-219

      5. Error Probabilities for Identification Coding and Least Length Single Sequence Hopping

         • Edward C. van der Meulen, Sándor Csibi

         Pages 221-238

Numbers, Information and Complexity is a collection of about 50 articles in honour of Rudolf Ahlswede. His main areas of research are represented in the three sections, `Numbers and Combinations', `Information Theory (Channels and Networks, Combinatorial and Algebraic Coding, Cryptology, with the related fields Data Compression, Entropy Theory, Symbolic Dynamics, Probability and Statistics)', and `Complexity'.
Special attention was paid to the interplay between the fields. Surveys on topics of current interest are included as well as new research results.
The book features surveys on Combinatorics about topics such as intersection theorems, which are not yet covered in textbooks, several contributions by leading experts in data compression, and relations to Natural Sciences are discussed.

• Symbol
• code
• combinatorics
• communication
• complexity
• data compression
• information
• information theory
• statistics

• Friedrich Schiller-Universität Jena, Germany

  Ingo Althöfer

• National University of Singapore, Singapore

  Ning Cai

• IBM Germany, Germany

  Gunter Dueck

• Universität Bielefeld, Germany

  Levon Khachatrian

• Russian Academy of Sciences, Russia

  Mark S. Pinsker

• Eötvös Lorand University, Hungary

  Andras Sárközy

• Universität Dortmund, Germany

  Ingo Wegener

• University of Southern California, Los Angeles, USA

  Zhen Zhang

Policies and ethics