State polytopes related to two classes of combinatorial neural codes

DOI10.1016/J.AAM.2022.102418MaRDI QIDQ2081911zbMATH OpenOpenAlexFDO

Authors Yanyan Li

Publication date 30 September 2022

Published in Advances in Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1808.06721

zbMATH Keywords

combinatorial neural codes Euler diagrams Gröbner basis state polytopes

Mathematics Subject Classification ID

Polytopes and polyhedra (52B99) Neural networks for/in biological studies, artificial life and related topics (92B20)

Abstract: Combinatorial neural codes are

0 / 1

vectors that are used to model the co-firing patterns of a set of place cells in the brain. One wide-open problem in this area is to determine when a given code can be algorithmically drawn in the plane as a Venn diagram-like figure. A sufficient condition to do so is for the code to have a property called

k

-inductively pierced. Gross, Obatake, and Youngs recently used toric algebra to show that a code on three neurons is

1

-inductively pierced if and only if the toric ideal is trivial or generated by quadratics. No result is known for additional neurons in the same generality, part of the difficulty coming from the large number of codewords possible when additional neurons are used. In this article, we study two infinite classes of combinatorial neural codes in detail. For each code, we explicitly compute its universal Gr"obner basis. This is done for the first class by recognizing that the codewords form a Lawrence-type matrix. With the second class, this is done by showing that the matrix is totally unimodular. These computations allow one to compute the state polytopes of the corresponding toric ideals, from which all distinct initial ideals may be computed efficiently. Moreover, we show that the state polytopes are combinatorially equivalent to well-known polytopes: the permutohedron and the stellohedron.

Review text

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.

Recommendations

Cites work

Cited in

(2)

Describes a project that uses

Uses Software

This page was built for publication: State polytopes related to two classes of combinatorial neural codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2081911)