Neural codes and the factor complex
Combinatorial aspects of commutative algebra (05E40) Combinatorial aspects of simplicial complexes (05E45) Computational methods for problems pertaining to biology (92-08) Neural biology (92C20) Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory (94B75)
Given the set \([n]:=\{1,\dots,n\}\), we call neural code on \(n\) neurons, any subset of \(2^{[n]}\). It is important for these codes to be convex and a class of convex codes is that of \textit{max-intersection-complete codes}. In the referenced paper [\textit{C. Curto} et al., J. Pure Appl. Algebra 223, No. 9, 3919--3940 (2019; Zbl 1415.92044)], the authors ask an algebraic signature for such codes and this is the question addressed by the present paper. Consider \(R=\mathbb{F}_2[x_1,\dots,x_n] \) and define \textit{pseudomonomials} as polynomials of the form \[ \prod_{i \in \sigma} x_i \prod_{j \in \tau} (1-x_j),\quad \tau,\sigma \in 2^{[n]},\, \sigma \cap \tau =\emptyset. \] The ideals generated by such pseudomonomials are called pseudomonomial ideals. For an element of \(c \in 2^{[n]}\), its indicator polynomial is \(\prod_{i \in c} x_i \prod_{j \in [n]\setminus c} (1-x_j)\). Now if we take as generators for an ideal all the indicator polynomials of the non-codewords of a neural code \(C\) we get a neural ideal. For such kind of ideal, say \(J\), we can consider all pseudomonomials that are minimal w.r.t. divisibility with all the pseudomonomials in \(J\) and the set of all those monomials is the canonical form of \(J\), denoted by \(CF(J).\) To a neural code we can also associate a simplicial complex, that is denoted by \(\Delta(C)\) and it is by definition the smallest simplicial complex containing the given code. We denote by \(I(\Delta(C))\) the associated Steiner-Reisner ideal. Now, we can state the result which answer to the question that is posed in [\textit{C. Curto} et al., J. Pure Appl. Algebra 223, No. 9, 3919--3940 (2019; Zbl 1415.92044)]: Theorem 1. A code \(C\) on \(n\) neurons is max-intersection-complete if and only if for every non-monomial \(\phi\) in the canonical form of the neural ideal of \(C\), there exists \(i \in [n]\) such that: \begin{enumerate} \item every associated prime of \(I(\Delta(C))\) that contains \(x_i\) also contains \(\phi\), and \item \( (1 - x_i ) \mid \phi\). \end{enumerate} This theorem is proved using and actually introducing the factor complex of \(C\), another simplicial complex, particularly well-suited to represent the combinatorial properties of \(C\). From Theorem 1, an algorithm is deduced and it is shown to be advantageous with respect to those in literature. The paper also characterize those codes that are closed under intersection of codewords, called intersection-complete codes.
- Algebraic signatures of convex and non-convex codes
- An algebraic approach to reverse engineering finite dynamical systems arising from biology
- Convex union representability and convex codes
- Every binary code can be realized by convex sets
- Gröbner bases of neural ideals
- Neural ideals and stimulus space visualization
- Neural ideals in SageMath
- Obstructions to convexity in neural codes
- On open and closed convex codes
- Reverse-engineering of polynomial dynamical systems
- Sparse neural codes and convexity
- Strengthening relationships between neural ideals and receptive fields
- Strongly maximal intersection-complete neural codes on grids are convex
- The neural ring: an algebraic tool for analyzing the intrinsic structure of neural codes
- What makes a neural code convex?
- Embedding dimension phenomena in intersection complete codes
- State polytopes related to two classes of combinatorial neural codes
- Algebraic signatures of convex and non-convex codes
- Indices for Testing Neural Codes
- The neural ring: an algebraic tool for analyzing the intrinsic structure of neural codes
- Gröbner bases of neural ideals
- Polarization of neural codes
- Hyperplane Neural Codes and the Polar Complex
- Gröbner bases of convex neural code ideals (research)
- Polarization of neural rings
- Morphisms of Neural Codes
- Strengthening relationships between neural ideals and receptive fields
- Nondegenerate Neural Codes and Obstructions to Closed-Convexity
- Oriented matroids and combinatorial neural codes
- Wheels: a new criterion for non-convexity of neural codes
- Canonical forms of neural ideals
- Algebraic network reconstruction of discrete dynamical systems
This page was built for publication: Neural codes and the factor complex
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2300577)
