| foundations | constructive, univalent |
| gh | https://github.com/jcreedcmu |
| foundations | constructive, univalent |
| gh | https://github.com/jcreedcmu |
So here's a restatement of the question that I still don't know the answer to:
Let f : š¹āæ ā š¹ be a boolean function. Turn this into a subset of āāæ by saying
S = { v ā āāæ | f(vā ā„ 0, ā¦, vā ā„ 0) }
Is there a nice purely combinatorial condition on f that is equivalent to "the boundary āS is homeomorphic to āāæā»Ā¹"?
ah, I think I have a counterexample for "if boundary is tame, then occupancy must be monotone or antitone in each variable"
This shape is not monotone or antitone in x.
We hit 1000 `research open` problems, i.e. open conjecture today on Formal Conjectures. And also the big round number milestone 1024 (https://xkcd.com/1000/)
https://google-deepmind.github.io/formal-conjectures/
Many thanks to all the contributors!
https://github.com/google-deepmind/formal-conjectures/graphs/contributors
I don't know if there are other clever ways of doing this with pre-2022 technology, but apparently cqw/cqh are pretty well-supported CSS features by now, and with them and calc you can really nicely solve "I want a fixed aspect ratio div that is as big as possible in its container" by simply saying
width: min(100cqw, calc(100cqh * 9 / 16))