Primary decomposition of squarefree pseudomonomial ideals
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)].
- An algebraic approach to reverse engineering finite dynamical systems arising from biology
- scientific article; zbMATH DE number 1693046 (Why is no real title available?)
- scientific article; zbMATH DE number 2190625 (Why is no real title available?)
- Reverse-engineering of polynomial dynamical systems
- The neural ring: an algebraic tool for analyzing the intrinsic structure of neural codes
This page was built for publication: Primary decomposition of squarefree pseudomonomial ideals
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6103179)
