Pages that link to "Item:Q2163062"
From MaRDI portal
The following pages link to Neural codes with three maximal codewords: convexity and minimal embedding dimension (Q2163062):
Displaying 18 items.
- Obstructions to convexity in neural codes (Q504424) (← links)
- On open and closed convex codes (Q1715995) (← links)
- Embedding dimension phenomena in intersection complete codes (Q2064042) (← links)
- Non-monotonicity of closed convexity in neural codes (Q2135080) (← links)
- Periodic neural codes and sound localization in barn owls (Q2163423) (← links)
- Classification of open and closed convex codes on five neurons (Q2280061) (← links)
- Strongly maximal intersection-complete neural codes on grids are convex (Q2335598) (← links)
- Algebraic signatures of convex and non-convex codes (Q2421341) (← links)
- Sparse neural codes and convexity (Q2424284) (← links)
- Minimal embedding dimensions of connected neural codes (Q2659088) (← links)
- Convex Union Representability and Convex Codes (Q3382664) (← links)
- Neural Codes, Decidability, and a New Local Obstruction to Convexity (Q4634350) (← links)
- Permitted Sets and Convex Coding in Nonthreshold Linear Networks (Q5044211) (← links)
- Efficient Neural Codes That Minimize <i>L<sub>p</sub></i> Reconstruction Error (Q5380598) (← links)
- A No-Go Theorem for One-Layer Feedforward Networks (Q5383800) (← links)
- Nondegenerate Neural Codes and Obstructions to Closed-Convexity (Q5883278) (← links)
- Oriented matroids and combinatorial neural codes (Q5886261) (← links)
- Wheels: a new criterion for non-convexity of neural codes (Q6170336) (← links)