Skip to main content
SpringerLink
Log in

The Restricted Word Shadow Problem

  • Chapter
Book cover Information Theory, Combinatorics, and Search Theory

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

  • 2113 Accesses

Abstract

Recently we introduced and studied the shadow minimization problem under word-subword relation. In this paper we consider this problem for the restricted case and give optimal solution.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. Ahlswede, R., Cai, N.: Shadows and isoperimetry under the sequence-subsequence relation. Combinatorica 17(1), 11–29 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  2. Ahlswede, R., Lebedev, V.: Shadows under the word-subword relation. In: Twelfth International Workshop on Algebraic and Combinatorial Coding Theory, Akademgorodok, Novosibirsk, pp. 16–19 (2010)

    Google Scholar 

  3. Ahlswede, R., Lebedev, V.: Shadows under the word-subword relation. Problems of Information Transmission 48(1), 30–45 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  4. Chowdhury, A., Patkos, B.: Shadows and intersections in vector spaces. J. Combin. Theory Ser. A 117(8), 1095–1106 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  5. Kruskal, J.B.: The Number of Simplices in a Complex, Mathematical Optimization Techniques, Berkeley, Los Angeles, pp. 251–278 (1963)

    Google Scholar 

  6. Katona, G.: A theorem on finite sets. In: Theory of Graphs, Proc. Colloq. Tihany 1966, pp. 187–207. Akadémiai Kiadó (1968)

    Google Scholar 

  7. Lindström, B.A., Zetterström, H.O.: A combinatorial problem in the k-adic number systems. Proc. Amer. Math. Soc. 18, 166–170 (1967)

    Article  MathSciNet  MATH  Google Scholar 

  8. Schützenberger, M.P.: A characteristic property of certain polynomials of E.F. Moore and C.E. Shannon, RLE Quarterly Progress Report, No. 55, Research Laboratory of Electronics, M.I.T., pp. 117–118 (1959)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. IPPI (Institute for Information Transmission Problems of the Russian Academy of Sciences (Kharkevich Institute)), Bol’shoi Karetnyi per. 19, Moscow, Russia

    Rudolf Ahlswede & Vladimir Lebedev

Authors
  1. Rudolf Ahlswede
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Vladimir Lebedev
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Mathematics, University of Bielefeld, Universitätsstr. 25, 33615, Bielefeld, Germany

    Harout Aydinian  & Christian Deppe  & 

  2. Department of Computer Science, University of Salerno, via Ponte don Melillo, 84084, Fisciano, Italy

    Ferdinando Cicalese

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Ahlswede, R., Lebedev, V. (2013). The Restricted Word Shadow Problem. In: Aydinian, H., Cicalese, F., Deppe, C. (eds) Information Theory, Combinatorics, and Search Theory. Lecture Notes in Computer Science, vol 7777. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-36899-8_16

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-36899-8_16

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-36898-1

  • Online ISBN: 978-3-642-36899-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation