Extremal Combinatorics of Reaction Systems

Extremal combinatorics is the study of the size that a certain collection of objects must have in order to certainly satisfy a property. Reaction systems are a recent formalism for computation inspired by chemical reactions. This work is a first contribution to the study of the behaviour of large reaction systems by means of extremal combinatorics. We defined several different properties that capture some basic behaviour of a reaction system and we prove that they must necessarily be satisfied by large enough systems. Explicit bounds and formulae are also provided.

[1]  J. Spencer.  Ramsey Theory , 1990 .

[2]  Andrzej Ehrenfeucht,et al.  Basic Notions of Reaction Systems , 2004, Developments in Language Theory.

[3]  Stasys Jukna,et al.  Extremal Combinatorics - With Applications in Computer Science , 2001, Texts in Theoretical Computer Science. An EATCS Series.

[4]  Andrzej Ehrenfeucht,et al.  Combinatorics of Life and Death for Reaction Systems , 2010, Int. J. Found. Comput. Sci..

[5]  Grzegorz Rozenberg,et al.  Developments in Language Theory II , 2002 .

[6]  Arto Salomaa,et al.  Functional Constructions between reaction Systems and Propositional Logic , 2013, Int. J. Found. Comput. Sci..

[7]  Andrzej Ehrenfeucht,et al.  Reaction Systems , 2007, Fundam. Informaticae.