Gröbner bases of neural ideals
From MaRDI portal
Publication:4576004
DOI10.1142/S0218196718500261zbMath1395.92013arXiv1612.05660OpenAlexW2963289040MaRDI QIDQ4576004
Ethan Petersen, Jessica Liu, Kaitlyn Phillipson, Luis David García-Puente, Ryan Kruse, Anne Shiu, Dane Miyata, Rebecca E. Garcia
Publication date: 12 July 2018
Published in: International Journal of Algebra and Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1612.05660
Symbolic computation and algebraic computation (68W30) Mathematical biology in general (92B99) Applications of commutative algebra (e.g., to statistics, control theory, optimization, etc.) (13P25)
Related Items
Nondegenerate Neural Codes and Obstructions to Closed-Convexity ⋮ Open, closed, and non-degenerate embedding dimensions of neural codes ⋮ The case for algebraic biology: from research to education ⋮ Hyperplane Neural Codes and the Polar Complex ⋮ Gröbner Bases of Convex Neural Code Ideals (Research) ⋮ Polarization of neural rings ⋮ Small Gröbner fans of ideals of points ⋮ Neural Codes, Decidability, and a New Local Obstruction to Convexity ⋮ Geometric characterization of data sets with unique reduced Gröbner bases ⋮ Neural codes and the factor complex ⋮ Embedding dimension phenomena in intersection complete codes
Uses Software
Cites Work
- Unnamed Item
- The neural ring: an algebraic tool for analyzing the intrinsic structure of neural codes
- Obstructions to convexity in neural codes
- Polybori: A framework for Gröbner-basis computations with Boolean polynomials
- The Gröbner fan of an ideal
- Neural ideals in SageMath
- Neural ideals and stimulus space visualization
- On open and closed convex codes
- Multigraded commutative algebra of graph decompositions
- Sparse neural codes and convexity
- Phylogenetic ideals and varieties for the general Markov model
- Ideals, Varieties, and Algorithms
- What Makes a Neural Code Convex?
This page was built for publication: Gröbner bases of neural ideals
