Siphon faces in slow–fast mass-action networks: code and computations
Authors/Creators
Description
Supplementary code, computation logs and data for the paper “Siphon faces in slow–fast
mass-action networks: tropical entry–exit, relaxation oscillations and siphon breaking” (M.-
M. Beldiman and A.-D. Halanay). The record lists the 3474 minimal planar fold–face net-
works of the paper’s enumeration theorem (450 with five reactions and 3024 with six), each
with witness rate constants and its singular cycle. The Julia scripts reproduce every com-
putation of the paper: the exit points of networks with reducible siphon matrices (Perron
integral, diagonal blocks, tropical recursion and simulations); relaxation oscillations through
a siphon face; the enumeration of minimal fold–face networks by exact locking certificates; an
independent check of all witnesses in exact rational arithmetic, with a certified lower bound
of the exit point, which makes the enumeration theorem computer-assisted with no floating-
point step; siphon breaking and the floor of exponentially weak breaking; and the data of
the two figures, which two Python scripts draw. The logs of all runs are included; random
searches use fixed seeds. The minimal canard networks of the companion planar paper are
at doi:10.5281/zenodo.23714936. Data: CC BY 4.0. Code: MIT. See README.md.