Skip to main content

How to Color a French Flag

Biologically Inspired Algorithms for Scale-Invariant Patterning

  • Conference paper
  • First Online:
Structural Information and Communication Complexity (SIROCCO 2019)

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

Abstract

In the French flag problem, initially uncolored cells on a grid must differentiate to become blue, white or red. The goal is for the cells to color the grid as a French flag, i.e., a three-colored triband, in a distributed manner. To solve a generalized version of the problem in a distributed computational setting, we consider two models: a biologically-inspired version relying on morphogens (gradients of chemicals acting as signals) and a more abstract version based on reliable message passing between cellular agents. We show that both models easily achieve a French ribbon - a French flag in the 1D case. However, extending the ribbon to the 2D flag in the concentration model is somewhat difficult unless each agent has additional positional information. Assuming that cells are are identical, it is impossible to achieve a French flag or even a close approximation. In contrast, using a message-based approach in the 2D case only requires assuming that agents can be represented as constant size state machines. We hope our insights may lay some groundwork for what kind of message passing abstractions or guarantees are useful in analogy to cells communicating at long and short distances to solve patterning problems. In addition, we hope that our models and findings may be of interest in the design of nano-robots.

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

Access this chapter

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 EPUB and 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

Notes

  1. 1.

    However, for clarity, we sometimes highlight the dependency on k.

References

  1. Ancona, A., Bajwa, A., Lynch, N., Mallmann-Trenn, F.: How to color a French flag-biologically inspired algorithms for scale-invariant patterning. arXiv preprint arXiv:1905.00342 (2019)

  2. Flajolet, P.: Approximate counting: a detailed analysis. BIT 25(1), 113–134 (1985)

    Article  MathSciNet  Google Scholar 

  3. Nüsslein-Volhard, C., Wieschaus, E.: Mutations affecting segment number and polarity in drosophila. Nature 287(5785), 795–801 (1980)

    Article  Google Scholar 

  4. Wolpert, L.: Positional information and the spatial pattern of cellular differentiation. J. Theor. Biol. 25(1), 1–47 (1969)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Ayesha Bajwa .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Ancona, B., Bajwa, A., Lynch, N., Mallmann-Trenn, F. (2019). How to Color a French Flag. In: Censor-Hillel, K., Flammini, M. (eds) Structural Information and Communication Complexity. SIROCCO 2019. Lecture Notes in Computer Science(), vol 11639. Springer, Cham. https://doi.org/10.1007/978-3-030-24922-9_22

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-24922-9_22

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-24921-2

  • Online ISBN: 978-3-030-24922-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics