The coarse bounded H-complexity conjecture

Let FF be a finite PL map, and let coarse bounded sublevel and superlevel HH-complexity and global HH-complexity be the homological complexity measures defined for FF.

Coarse bounded H-complexity conjecture. The coarse bounded sublevel HH-complexity (respectively, the coarse bounded superlevel HH-complexity) of FF is a lower bound for the global HH-complexity of FF.

This conjecture motivates the terminology “coarse”; the preceding theorem establishes the corresponding lower bounds for the coarse bounded sublevel and superlevel HH-complexities in terms of connected components. Its general status is not resolved in the supplied text.

Sources & referencesView supporting material

Primary source

J. Elisenda Grigsby, Kathryn Lindsey and Marissa Masden, “Local and global topological complexity measures OF ReLU neural network functions”, arXiv:2204.06062 (2024).

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.