Neural ring homomorphism preserves mandatory sets required for open convexity

Abstract

It has been studied by Curto et al. (SIAM J. on App. Alg. and Geom., 1(1) : 222 x2013 238, 2017) that a neural code that has an open convex realization does not have any local obstruction relative to the neural code. Further, a neural code C has no local obstructions if and only if it contains the set of mandatory codewords, C(), which depends only on the simplicial complex =(C). Thus if C ⊃eq C(), then C cannot be open convex. However, the problem of constructing C() for any given code C is undecidable. There is yet another way to capture the local obstructions via the homological mandatory set, MH(). The significance of MH() for a given code C is that MH() ⊂eq C() and so C will have local obstructions if C⊃eqMH(). In this paper we study the affect on the sets C() and MH() under the action of various surjective elementary code maps. Further, we study the relationship between Stanley-Reisner rings of the simplicial complexes associated with neural codes of the elementary code maps. Moreover, using this relationship, we give an alternative proof to show that MH() is preserved under the elementary code maps.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…