Convex Neural Codes in Dimension 1

2017/02/22 by Rosen, Zvi, Zhang, Yan X. · 1 citation
#Combinatorics (math.CO) #FOS: Biological sciences #FOS: Mathematics #Neurons and Cognition (q-bio.NC)

paper · doi:10.48550/arxiv.1702.06907

Abstract

Neural codes are collections of binary strings motivated by patterns of neural activity. In this paper, we study algorithmic and enumerative aspects of convex neural codes in dimension 1 (i.e. on a line or a circle). We use the theory of consecutive-ones matrices to obtain some structural and algorithmic results; we use generating functions to obtain enumerative results.

Cited by

• Covering Relations in the Poset of Combinatorial Neural Codes

Related

• Classification of Open and Closed Convex Codes on Five Neurons
• What makes a neural code convex?
• Order-forcing in Neural Codes
• Wheels: A New Criterion for Non-convexity of Neural Codes
• Convexity of Neural Codes with Four Maximal Codewords