Convex Union Representability and Convex Codes

@article{Jeffs2019ConvexUR,
  title={Convex Union Representability and Convex Codes},
  author={R. Amzi Jeffs and Isabella Novik},
  journal={International Mathematics Research Notices},
  year={2019}
}
  • R. JeffsI. Novik
  • Published 12 August 2018
  • Mathematics
  • International Mathematics Research Notices
We introduce and investigate $d$-convex union representable complexes: the simplicial complexes that arise as the nerve of a finite collection of convex open sets in ${\mathbb{R}}^d$ whose union is also convex. Chen, Frick, and Shiu recently proved that such complexes are collapsible and asked if all collapsible complexes are convex union representable. We disprove this by showing that there exist shellable and collapsible complexes that are not convex union representable; there also exist… 

Sunflowers of convex open sets

  • R. Jeffs
  • Mathematics, Computer Science
    Adv. Appl. Math.
  • 2019

Oriented Matroids and Combinatorial Neural Codes

The emerging theory of convex neural codes is related to the established theory of oriented matroids, both categorically and with respect to geometry and computational complexity, and it is shown that deciding whether a combinatorial code is convex is NP-hard.

Neural codes, decidability, and a new local obstruction to convexity

Giusti and Itskov prove that convex neural codes have no "local obstructions," which are defined via the topology of a code's simplicial complex, and reveal a stronger type of local obstruction that prevents a code from being convex, and prove that the corresponding decision problem is NP-hard.

Non-Monotonicity of Closed Convexity in Neural Codes

This work demonstrates that adding non-maximal codewords can only increase the open embedding dimension by 1, and proves a conjecture of Goldrup and Phillipson that adding a single such codeword can increase the closed embedding dimensions by an arbitrarily large amount.

Realizing convex codes with axis-parallel boxes

A general “product theorem” is proved which characterizes the code associated to the collection resulting from this operation, in terms of the codes associated toThe original collections, to characterize the codes realizable by axis-parallel boxes and exhibit differences between this class of codes and thoserealizable by convex open or closed sets.

Order-forcing in Neural Codes

This paper uses order-forcing, a combinatorial tool which recognizes when certain regions in a realization of a code must appear along a line segment between other regions, to construct novel examples of non-convex codes, and to expand existing families of examples.

Open and Closed Convexity of Sparse Neural Codes

This work shows that closed convex codes do not possess the same property, and disproves a conjecture of Goldrup and Phillipson, and presents an example of a code that is neither open convex norclosed convex.

Nondegenerate Neural Codes and Obstructions to Closed-Convexity

This work investigates the concept of degeneracy introduced by Cruz et al., and extends their results to show that nondegeneracy precisely captures the situation when taking closures or interiors of open or closed realizations yields another realization of the code.

What Nerve Complexes Tell Us About Image Shapes

  • J. Peters
  • Mathematics
    Intelligent Systems Reference Library
  • 2019
This chapter explores what nerve structures in cell complexes tell us in approximating shapes revealed by light reflected from curved surfaces. Recall that a nerve, in its simplest form, is a

C O ] 2 A pr 2 02 1 N ON-MONOTONICITY OF CLOSED CONVEXITY IN NEURAL CODES

This work demonstrates that adding non-maximal codewords can only increase the open embedding dimension by 1, and disproves a conjecture of Goldrup and Phillipson, and presents an example of a code that is neither open convex nor closed convex.

References

SHOWING 1-10 OF 26 REFERENCES

Extremal Examples of Collapsible Complexes and Random Discrete Morse Theory

It is proved that after repeated barycentric subdivisions, the discrete Morse vectors found by randomized algorithms have, on average, an exponential number of critical cells asymptotically almost surely.

Sparse neural codes and convexity

It is proved that in $\mathbb{R}^2$ and $3$, realizations of $2-sparse codes using closed sets are equivalent to those with open sets, and this allows us to provide some preliminary results on distinguishing which $2$-s parse codes have embedding dimension at most $2$.

Intersection Patterns of Convex Sets via Simplicial Complexes: A Survey

The task of this survey is to present various results on intersection patterns of convex sets. One of the main tools for studying intersection patterns is a point of view via simplicial complexes. We

Helly, Radon, and Carathéodory Type Theorems

Neural codes, decidability, and a new local obstruction to convexity

Giusti and Itskov prove that convex neural codes have no "local obstructions," which are defined via the topology of a code's simplicial complex, and reveal a stronger type of local obstruction that prevents a code from being convex, and prove that the corresponding decision problem is NP-hard.

Knots in Collapsible and Non-Collapsible Balls

The first explicit example of a simplicial 3-ball B_{15,66} that is not collapsible, and the first explicit triangulation of a 3-sphere S_{18, 125} (with only 18 vertices) that isNot locally constructible is presented.

d-collapsibility is NP-complete for d>=4

  • M. Tancer
  • Mathematics
    Electron. Notes Discret. Math.
  • 2009

Strong Homotopy Types, Nerves and Collapses

This work analyzes vertex-transitive simplicial G-actions and proves a particular case of the Evasiveness conjecture for simplicial complexes and reduces the general conjecture to the class of minimal complexes.

f-Vectors of acyclic complexes

Constructions preserving evasiveness and collapsibility

  • V. Welker
  • Mathematics, Computer Science
    Discret. Math.
  • 1999