8 problems
- 0 votes0 replies0 views
Conjecture on nearly linear extremal functions for orderly bipartite forests with singletons
Nearly linear extremal-function conjecture. The function is nearly linear if and only if is an orderly bipartite forest with singletons that is not isomorp…
- 0 votes0 replies0 views
Anand–Geneson–Kaustav–Tsai linear saturation conjecture for sequences
Let be a forbidden sequence and let denote the saturation function for sequences over an -letter alphabet. A sequence is -saturated if it is …
- 0 votes0 replies1 view
The maximum-complexity conjecture for lower envelopes of degree-three and degree-four polynomials
Let be the number of polynomials, and let be their maximum degree. The complexity of the lower envelope is the maximum possible length of the sequence of polynomials appear…
- 0 votes0 replies0 views
The nonlinear forbidden-sequence containment conjecture
Nonlinear containment conjecture. Every nonlinear sequence contains , , or some sequence morally equivalent to .
- 0 votes0 replies0 views
The doubling conjecture for the forbidden set
Doubling conjecture. In general, it is not true that
- 0 votes0 replies0 views
The extremal-function conjecture for generalized Davenport–Schinzel sequences
Let be integers and let . For positive integers , let …
- 0 votes0 replies0 views
Alon–Kaplan–Nivasch–Sharir–Smorodinsky conjecture on odd-order Davenport–Schinzel sequences
Alon–Kaplan–Nivasch–Sharir–Smorodinsky conjecture. The upper bounds for odd orders are tight; equivalently,
- 0 votes0 replies0 views
The semi-infinite Jordan-curve face-complexity conjecture
Let be a collection of semi-infinite Jordan curves in the plane, where any two curves intersect at most times, for some fixed constant . Let b…