Primary decomposition of squarefree pseudomonomial ideals (Q6103179)

A squarefree pseudomonomial of a ring \(K[x_1, x_2, \dots , x_n]\) is a polynomial of the form \(z_1z_2 \cdots z_r\) such that \(z_j \in \{x_{i_j} , x_{i_j}-1\}\) for some \(i_j \in\{1, \dots , n\}\) and the \(i_j\)'s are distinct. A squarefree pseudomonomial ideal is an ideal that is generated by squarefree pseudomonomials. Squarefree pseudomonomial ideals have several similarities with monomial ideals and their properties. Squarefree pseudomonomial ideals are interesting for instance in the study of problems such as reverse engineering of finite dynamicalsystems and in the study of neural coding. In particular the primary decomposition of these ideals contains important combinatorial information. For these applications see for instance [\textit{A. Jarrah} et al., Adv. Appl. Math. 39, No. 4, 477--489 (2007; Zbl 1129.93026)], [\textit{A. Veliz-Cuba}, SIAM J. Appl. Dyn. Syst. 11 (1) 31--48 (2012; Zbl 1235.92005)], [\textit{C. Curto} et al., Bull. Math. Biol. 75, 1571--1611 (2013; Zbl 1311.92043)] In this paper the authors present an algorithm and its implementation of the primary decomposition computation for squarefree pseudomonomial ideals. The proof of the algorithm relies on theoretical results adapted from [\textit{C. Curto} et al., Bull. Math. Biol. 75, 1571--1611 (2013; Zbl 1311.92043)].