Wheels: A New Criterion for Non-convexity of Neural Codes
ADVANCES IN APPLIED MATHEMATICS(2023)
摘要
We introduce new geometric and combinatorial criteria that preclude a neural code from being convex, and use them to tackle the classification problem for codes on six neurons. Along the way, we give the first example of a code that is non-convex, has no local obstructions, and has simplicial complex of dimension two. We also characterize convexity for neural codes for which the simplicial complex is pure of low or high dimension.
更多查看译文
关键词
05C90,52A20,92C20
AI 理解论文
溯源树
样例
![](https://originalfileserver.aminer.cn/sys/aminer/pubs/mrt_preview.jpeg)
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要