Pages that link to "Item:Q1637597"
From MaRDI portal
The following pages link to Every binary code can be realized by convex sets (Q1637597):
Displaying 8 items.
- 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)
- Neural codes and the factor complex (Q2300577) (← links)
- Minimal embedding dimensions of connected neural codes (Q2659088) (← links)
- Neural Codes, Decidability, and a New Local Obstruction to Convexity (Q4634350) (← links)
- Signless normalized Laplacian for hypergraphs (Q5054045) (← links)
- Planar Convex Codes are Decidable (Q6157969) (← links)