Gr\"obner Bases of Neural Ideals
The brain processes information about the environment via neural codes. The neural ideal was introduced recently as an algebraic object that can be used to better understand the combinatorial structure of neural codes. Every neural ideal has a particular generating set, called the canonical form, that directly encodes a minimal description of the receptive field structure intrinsic to the neural code. On the other hand, for a given monomial order, any polynomial ideal is also generated by its unique (reduced) Gr\"obner basis with respect to that monomial order. How are these two types of generating sets -- canonical forms and Gr\"obner bases -- related? Our main result states that if the canonical form of a neural ideal is a Gr\"obner basis, then it is the universal Gr\"obner basis (that is, the union of all reduced Gr\"obner bases). Furthermore, we prove that this situation -- when the canonical form is a Gr\"obner basis -- occurs precisely when the universal Gr\"obner basis contains only pseudo-monomials (certain generalizations of monomials). Our results motivate two questions: (1)~When is the canonical form a Gr\"obner basis? (2)~When the universal Gr\"obner basis of a neural ideal is {\em not} a canonical form, what can the non-pseudo-monomial elements in the basis tell us about the receptive fields of the code? We give partial answers to both questions. Along the way, we develop a representation of pseudo-monomials as hypercubes in a Boolean lattice.
Code (0)
등록된 구현이 없습니다.
Tasks
FormSimilar Papers 제목 키워드 기반
Learning to Compute Gröbner Bases
Solving a polynomial system, or computing an associated Gr\"obner basis, has been a fundamental task in computational algebra. However, it is also known for its notorious doubly exponential time complexity in the number …
Dataset GenerationPredicting the cardinality and maximum degree of a reduced Gröbner basis
We construct neural network regression models to predict key metrics of complexity for Gr\"obner bases of binomial ideals. This work illustrates why predictions with neural networks from Gr\"obner computations are not a …
regressionAn Efficient Algorithm for Determining the Equivalence of Zero-one Reaction Networks
Zero-one reaction networks play a crucial role in cell signaling. Determining the equivalence of reaction networks is a fundamental computational problem in the field of chemical reaction networks. In this work, we devel…
Testing Binomiality of Chemical Reaction Networks Using Comprehensive Gröbner Systems
We consider the problem of binomiality of the steady state ideals of biochemical reaction networks. We are interested in finding polynomial conditions on the parameters such that the steady state ideal of a chemical reac…
Beyond Grobner Bases: Basis Selection for Minimal Solvers
Many computer vision applications require robust estimation of the underlying geometry, in terms of camera motion and 3D structure of the scene. These robust methods often rely on running minimal solvers in a RANSAC fram…