The coarse bounded H-complexity conjecture
Let be a finite PL map, and let coarse bounded sublevel and superlevel -complexity and global -complexity be the homological complexity measures defined for .
Coarse bounded H-complexity conjecture. The coarse bounded sublevel -complexity (respectively, the coarse bounded superlevel -complexity) of is a lower bound for the global -complexity of .
This conjecture motivates the terminology “coarse”; the preceding theorem establishes the corresponding lower bounds for the coarse bounded sublevel and superlevel -complexities in terms of connected components. Its general status is not resolved in the supplied text.
References
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
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.