Extremal combinatorics is the study of the size that a collection of objects must have in order to certainly satisfy a given property. Reaction systems are a recent formalism for computation inspired by chemical reactions. This work is a first contribution to the study of the behavior of large reaction systems by means of extremal combinatorics. We define several different properties that capture some basic and dynamical behaviors of a reaction system and we prove that they must necessarily be satisfied if the system is large enough. Explicit bounds and formulae are also provided.
Reaction systems and extremal combinatorics properties
Manzoni Luca
2015-01-01
Abstract
Extremal combinatorics is the study of the size that a collection of objects must have in order to certainly satisfy a given property. Reaction systems are a recent formalism for computation inspired by chemical reactions. This work is a first contribution to the study of the behavior of large reaction systems by means of extremal combinatorics. We define several different properties that capture some basic and dynamical behaviors of a reaction system and we prove that they must necessarily be satisfied if the system is large enough. Explicit bounds and formulae are also provided.File in questo prodotto:
File | Dimensione | Formato | |
---|---|---|---|
1-s2.0-S0304397515005034-main.pdf
Accesso chiuso
Tipologia:
Documento in Versione Editoriale
Licenza:
Copyright Editore
Dimensione
378.05 kB
Formato
Adobe PDF
|
378.05 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.