← All problems

The Gröbner basis characterization of 0- and 1-inductively pierced codes

13 years old · traced to

Let C\mathcal{C} be a code on nn neurons, and let ICI_{\mathcal{C}} be its toric ideal. A reduced Gröbner basis is the unique reduced Gröbner basis of ICI_{\mathcal{C}} with respect to a chosen monomial order.

The Gröbner basis characterization. For each nn, there exists a monomial order such that C\mathcal{C} is 00- or 11-inductively pierced if and only if the reduced Gröbner basis of ICI_{\mathcal{C}} contains only binomials of degree at most 22.

This conjecture seeks a Gröbner-theoretic characterization of low-order inductive piercing for combinatorial neural codes, extending the stated result for codes on three neurons. Its resolution status is not established by the supplied source context.

References

2 papers in this index state this conjecture (2013–2019). The statement above is taken from the most recent of them; the others are arXiv:1308.2632.

Source: Melissa Beer, Robert Davis, Thomas Elgin, Matthew Hertel, Kira Laws, Rajinder Mavi, Paula Mercurio and Alexandra Newlon, “Universal Gröbner Bases of Toric Ideals of Combinatorial Neural Codes”, arXiv:1904.10127 (2019).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.