{"id":"palomar/PALOMAR-2026-09-25-000020","url":"https://github.com/mmislan/palomar-p080-phosphorylation-attainment/tree/44cb5b18313448ede0f9e0df869c538602ffc66d","json":"https://data.palomar-registry.org/entries/PALOMAR-2026-09-25-000020-v1.json","repo":"https://github.com/mmislan/palomar-p080-phosphorylation-attainment","tags":["math.DS","msc:34C23","msc:92C45","phosphorylation","steady-states","dynamical-systems"],"score":0,"title":"Attainment of 2n-1 positive steady states in sequential distributive phosphorylation","trust":"high","domain":"math.DS","source":"palomar","authors":["Michael Mislan"],"reviews":0,"subject":"math.DS","summary":"For every integer n >= 1, the standard sequential distributive n-site phosphorylation mechanism admits positive reaction rates and 2n-1 distinct positive stationary states with common positive kinase, phosphatase and substrate totals. The construction establishes a uniform lower bound on the number of positive equilibria of the full mass-action system.","category":"research","comments":0,"disputed":false,"division":"math","mentions":0,"verified":true,"discussed":0,"published":"2026-09-25","reactions":{},"formalized":true,"formalizes":[{"title":"The 2n-1 steady-state bound is sharp for sequential distributive phosphorylation","identifier":"","relationship":"formalizes"}]}