Table of Contents
Fetching ...

Neural codes via homological invariants of polarized neural ideals

Selvi Kara, Ellie Lew

Abstract

For a neural code $\mathcal{C}\subseteq\mathbb{F}_2^n$, polarizing the canonical form generators of the neural ideal $J_{\mathcal{C}}$ yields a squarefree monomial ideal $\mathcal{P}(J_{\mathcal{C}})\subset k[x_1,\dots,x_n,y_1,\dots,y_n]$, the polarized neural ideal, and an associated simplicial complex $Δ_{\mathcal{C}}$, the polar complex. We study the graded invariants $\operatorname{pd}(\mathcal{P}(J_{\mathcal{C}}))$ and $\operatorname{reg}(\mathcal{P}(J_{\mathcal{C}}))$ via the topology of $Δ_{\mathcal{C}}$, showing that simple geometric features of the Hamming cube $\mathbb{F}_2^n$ (with Hamming distance) organize their extremal behavior. We prove $\operatorname{reg}(\mathcal{P}(J_{\mathcal{C}}))\le 2n-1$, with equality precisely when $\mathcal{C}$ is obtained from $\mathbb{F}_2^n$ by deleting an antipodal pair. Using connectedness properties of induced subcomplexes of $Δ_{\mathcal{C}}$, we obtain $\operatorname{pd}(\mathcal{P}(J_{\mathcal{C}}))\le 2n-3$, and we give an explicit family of codes attaining equality, each consisting of antipodal pairs. At the opposite end, we identify the cube geometry behind the smallest values: $\operatorname{reg}(\mathcal{P}(J_{\mathcal{C}}))=1$ forces $\mathcal{C}$ to be a coordinate subcube of $\mathbb{F}_2^n$, while $\operatorname{pd}(\mathcal{P}(J_{\mathcal{C}}))=0$ forces $\mathcal{C}$ to be the complement of one. Finally, we construct families realizing large regions of the $(\operatorname{pd},\operatorname{reg})$-plot for fixed $n$.

Neural codes via homological invariants of polarized neural ideals

Abstract

For a neural code , polarizing the canonical form generators of the neural ideal yields a squarefree monomial ideal , the polarized neural ideal, and an associated simplicial complex , the polar complex. We study the graded invariants and via the topology of , showing that simple geometric features of the Hamming cube (with Hamming distance) organize their extremal behavior. We prove , with equality precisely when is obtained from by deleting an antipodal pair. Using connectedness properties of induced subcomplexes of , we obtain , and we give an explicit family of codes attaining equality, each consisting of antipodal pairs. At the opposite end, we identify the cube geometry behind the smallest values: forces to be a coordinate subcube of , while forces to be the complement of one. Finally, we construct families realizing large regions of the -plot for fixed .
Paper Structure (20 sections, 29 theorems, 125 equations, 5 figures)

This paper contains 20 sections, 29 theorems, 125 equations, 5 figures.

Key Result

Theorem 2.8

smb Let $\mathcal{C}\subseteq\mathbb{F}_2^n$ and let $\mathcal{U}=\{U_1,\dots,U_n\}$ be a realization in a stimulus space $X$. Fix $\sigma,\tau\subseteq[n]$ with $\sigma\cap\tau=\emptyset$. Then

Figures (5)

  • Figure 1: $n=3$
  • Figure 2: $n=4$
  • Figure 4: Two collections of receptive fields in $\mathbb{R}^2$.
  • Figure 5: Realization of all-or-nothing code $\mathcal{C}_0 = \{000, 111\}$ for $n=3$
  • Figure 6: Realization of $\mathcal{C} = \mathbb{F}_2^3 \setminus \{ 001, 110\}$

Theorems & Definitions (78)

  • Definition 2.2
  • Definition 2.3
  • Example 2.4
  • Definition 2.5
  • Remark 2.6
  • Theorem 2.8
  • Definition 2.10
  • Theorem 2.11: smb
  • Remark 2.12
  • Remark 2.13
  • ...and 68 more