Embedding dimension phenomena in intersection complete codes
From MaRDI portal
Publication:2064042
DOI10.1007/s00029-021-00742-2OpenAlexW2976997700MaRDI QIDQ2064042
Publication date: 4 January 2022
Published in: Selecta Mathematica. New Series (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1909.13406
Other problems of combinatorial convexity (52A37) Helly-type theorems and geometric transversal theory (52A35) Combinatorial codes (94B25) Combinatorial aspects of simplicial complexes (05E45)
Related Items (6)
Nondegenerate Neural Codes and Obstructions to Closed-Convexity ⋮ Oriented matroids and combinatorial neural codes ⋮ Non-monotonicity of closed convexity in neural codes ⋮ Open, closed, and non-degenerate embedding dimensions of neural codes ⋮ Planar Convex Codes are Decidable ⋮ Wheels: a new criterion for non-convexity of neural codes
Cites Work
- Unnamed Item
- Unnamed Item
- The neural ring: an algebraic tool for analyzing the intrinsic structure of neural codes
- Obstructions to convexity in neural codes
- Every binary code can be realized by convex sets
- On open and closed convex codes
- Classification of open and closed convex codes on five neurons
- Neural codes and the factor complex
- Sunflowers of convex open sets
- Algebraic signatures of convex and non-convex codes
- Sparse neural codes and convexity
- Minimal embedding dimensions of connected neural codes
- Intersection Patterns of Convex Sets via Simplicial Complexes: A Survey
- $d$-representability of simplicial complexes of fixed dimension
- Helly’s theorem: New variations and applications
- Convex Union Representability and Convex Codes
- Lectures on Polytopes
- Gröbner bases of neural ideals
- Neural Codes, Decidability, and a New Local Obstruction to Convexity
- Hyperplane Neural Codes and the Polar Complex
- Polarization of neural rings
- Morphisms of Neural Codes
- What Makes a Neural Code Convex?
This page was built for publication: Embedding dimension phenomena in intersection complete codes
