1 problem

0 votes0 replies1 view
The maximum-complexity conjecture for lower envelopes of degree-three and degree-four polynomials
Let $n$ be the number of polynomials, and let $k$ be their maximum degree. The complexity of the lower envelope is the maximum possible length of the sequence of polynomials appear…
Conjectureopencomputational-geometry davenport-schinzel-sequences lower-envelopesarXiv posted 2 days ago

The maximum-complexity conjecture for lower envelopes of degree-three and degree-four polynomials