Skip to main content
SpringerLink
Log in

On Attractive and Friendly Sets in Sequence Spaces

  • Chapter
General Theory of Information Transfer and Combinatorics

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4123))

  • 1771 Accesses

Abstract

To a large extent the present work is far from being conclusive, instead, new directions of research in combinatorial extremal theory are started. Also questions concerning generalizations are immediately noticeable.

The incentive came from problems in several fields such as Algebra, Geometry, Probability, Information and Complexity Theory. Like several basic combinatorial problems they may play a role in other fields. For scenarios of interplay we refer also to [9].

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Harper, L.H.: Optimal assignment of numbers to vertices. J. Soc. Industr. Appl. Math. 12(1), 385–393 (1964)

    MathSciNet  Google Scholar 

  2. Lindsey, H.H.: Assignment of numbers to vertices. Amer. Math. Monthly 71, 508–516 (1964)

    Article  MathSciNet  Google Scholar 

  3. Bernstein, A.J.: Maximal connected arrays on the n–cube. SIAM J. Appl. Math. 15(6), 1485–1489 (1967)

    Article  MATH  MathSciNet  Google Scholar 

  4. Harper, L.H.: Optimal numberings and isoperimetric problems on graphs. J. Combin. Theory 1, 385–393 (1966)

    Article  MATH  MathSciNet  Google Scholar 

  5. Ahlswede, R., Zhang, Z.: An identity in combinatorial extremal theory. Adv. in Math. 80(2), 137–151 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  6. Ahlswede, R., Zhang, Z.: On multi–user write–efficient memories. IEEE Trans. Inform. Theory 40(3), 674–686 (1994)

    Article  MATH  Google Scholar 

  7. Ahlswede, R., Cai, N.: Models of multi–user write–efficient memories and general diametric theorems, Preprint 93–019, SFB 343 Diskrete Strukturen in der Mathematik, Universität Bielefeld, Information and Computation, Vol. 135(1), pp. 37–67 (1997)

    Google Scholar 

  8. Ahlswede, R., Katona, G.: Contributions to the geometry of Hamming spaces. Discrete Mathematics 17, 1–22 (1977)

    Article  MATH  MathSciNet  Google Scholar 

  9. Ahlswede, R.: Advances on extremal problems in number theory and combinatorics. In: European Congress of Mathematics, Barcelona 2000, vol. I, 147–175, Casacuberta, C., Miró–Roig, R.M., Verdera, J. , Xambó–Descamps, S. (eds.), Progress in Mathematics, vol. 201, Birkhäuser Verlag, Basel–Boston–Berlin (2001)

    Google Scholar 

  10. Lawrence, J.: Lopsided sets and orthant–intersection of convex sets. Pacific J. Math. 104, 155–173 (1983)

    MATH  MathSciNet  Google Scholar 

  11. Bandelt, H.J., Chepoi, V., Dress, A., Koolen, J.: Theory of lopsided set systems (preprint)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Fakultät für Mathematik, Universität Bielefeld, Universitätsstr. 25, 33615, Bielefeld, Germany

    R. Ahlswede

  2.  

    L. Khachatrian

Authors
  1. R. Ahlswede
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. L. Khachatrian
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Fakultät für Mathematik, Universität Bielefeld, 100131, 33501, Bielefeld, Germany

    Rudolf Ahlswede

  2. Fakultät für Mathematik, Universität Bielefeld, Universitätsstr. 25, 33615, Bielefeld, Germany

    Lars Bäumer , Ning Cai , Harout Aydinian  & Christian Deppe , ,  & 

  3. Russian Academy of Sciences Institute of Problems of Information Transmission, Bol’shoi Karetnyi per. 19, 101447, Moscow, Russia

    Vladimir Blinovsky

  4. Universität Bielefeld, Fakultät für Mathematik, Universitätsstr. 25, 33615, Bielefeld, Germany

    Haik Mashurian

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Ahlswede, R., Khachatrian, L. (2006). On Attractive and Friendly Sets in Sequence Spaces. In: Ahlswede, R., et al. General Theory of Information Transfer and Combinatorics. Lecture Notes in Computer Science, vol 4123. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11889342_61

Download citation

  • DOI: https://doi.org/10.1007/11889342_61

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-46244-6

  • Online ISBN: 978-3-540-46245-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation