No abstract

No abstract

In a recent paper, Duval, Goeckner, Klivans and Martin disproved the longstanding conjecture by Stanley, that every Cohen-Macaulay simplicial complex is partitionable. We construct counterexamples to this conjecture that are even balanced, i.e., their underlying graph has a minimal coloring. This answers a question by Duval et al. in the negative.

We showcase applications of nonlinear algebra in the sciences and engineering. Our survey is organized into eight themes: polynomial optimization, partial differential equations, algebraic statistics, integrable systems, configuration spaces of frameworks, biochemical reaction networks, algebraic vision, and tensor decompositions. Conversely, developments on these topics inspire new questions and algorithms for algebraic geometry.

<p style='text-indent:20px;'>We showcase applications of nonlinear algebra in the sciences and engineering. Our review is organized into eight themes: polynomial optimization, partial differential equations, algebraic statistics, integrable systems, configuration spaces of frameworks, biochemical reaction networks, algebraic vision, and tensor decompositions. Conversely, developments on these topics inspire new questions and algorithms for algebraic geometry.</p>