Search arXivSearch

arXiv · 2609.05100

Layered mixed matrices and reaction networks

Abstract

The purpose of this work is twofold. In the first part, we consider layered mixed matrices introduced by Murota, relate them to existing notions in combinatorial commutative algebra, and investigate the irreducibility of their determinants. Furthermore, for a layered mixed matrix in combinatorial canonical form, we determine the sparsity structure of its inverse. That is, we characterize which entries of the inverse are nonzero. In the second part, we establish for the first time a formal connection between these algebraic results and the theory of buffering structures for reaction networks developed by Mochizuki and Okada. We identify the lattice of buffering structures with the lattice of order ideals of the block poset of the combinatorial canonical form of the associated layered mixed matrix. This allows us to characterize the reducibility of the symbolic Jacobian determinant as a polynomial in the reaction-rate derivatives, as well as the nonzero sensitivity responses of species concentrations to reaction-rate perturbations.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Arne Kuhrs, Máté L. Telek, Nicola Vassena. 2026-09-04. Layered mixed matrices and reaction networks. https://arxiv.org/abs/2609.05100

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO