Pages that link to "Item:Q2847925"
From MaRDI portal
The following pages link to Intersection Patterns of Convex Sets via Simplicial Complexes: A Survey (Q2847925):
Displaying 23 items.
- Obstructions to convexity in neural codes (Q504424) (← links)
- Petruska's question on planar convex sets (Q776273) (← links)
- Homomorphisms preserving neural ideals (Q1635318) (← links)
- Every binary code can be realized by convex sets (Q1637597) (← links)
- Quantitative \((p, q)\) theorems in combinatorial geometry (Q2012541) (← links)
- Quantitative combinatorial geometry for concave functions (Q2037171) (← links)
- Embedding dimension phenomena in intersection complete codes (Q2064042) (← links)
- Non-monotonicity of closed convexity in neural codes (Q2135080) (← links)
- Representability and boxicity of simplicial complexes (Q2167318) (← links)
- Algebraic signatures of convex and non-convex codes (Q2421341) (← links)
- Sparse neural codes and convexity (Q2424284) (← links)
- Tverberg-type theorems with altered intersection patterns (nerves) (Q2664116) (← links)
- Helly’s theorem: New variations and applications (Q2979647) (← links)
- Bounding Helly Numbers via Betti Numbers (Q4604384) (← links)
- Neural Codes, Decidability, and a New Local Obstruction to Convexity (Q4634350) (← links)
- The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg (Q5241224) (← links)
- Nerves, minors, and piercing numbers (Q5380512) (← links)
- A No-Go Theorem for One-Layer Feedforward Networks (Q5383800) (← links)
- What Makes a Neural Code Convex? (Q5737775) (← links)
- Helly-type problems (Q5868651) (← links)
- (Q5881548) (← links)
- Fractional Helly theorem for Cartesian products of convex sets (Q6142359) (← links)
- Planar Convex Codes are Decidable (Q6157969) (← links)
