State polytopes related to two classes of combinatorial neural codes (Q2081911): Difference between revisions

The article is devoted to the study of two infinite classes of combinatorial neural codes. These specific classes of codes and their Euler diagrams are introduced in the second section of the paper. One shows that the two classes of codes, \(S_n\) and \(P\)(\(2_n\)) are 1-inductively pierced. In the third section there is a presentation of some results connecting \(S_n\) and \(P\)(\(2_n\)) to toric ideals and the construction of universal Gröbner basis. The construction of state polytopes for the code \(S_n\) as well as for the code \(P\)(\(2_n\)) , is presented in the fourth section. For basic results and the algorithm on refers to a Lecture Note from: \textit{B. Sturmfels} [Gröbner bases and convex polytopes. Providece, RI: AMS, American Mathematical Society (1996; Zbl 0856.13020)]. A short discussion on experimental data is done in the fifth section.