Ask a Question

Prefer a chat interface with context about you and your work?

An ๐‘™โ‚ extremal problem for polynomials

An ๐‘™โ‚ extremal problem for polynomials

Let <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="German upper M Subscript n"> <mml:semantics> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:msub> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:mi mathvariant="fraktur">M</mml:mi> </mml:mrow> <mml:mi>n</mml:mi> </mml:msub> </mml:mrow> <mml:annotation encoding="application/x-tex">{\mathfrak {M}_n}</mml:annotation> </mml:semantics> </mml:math> </inline-formula> be the maximum of the <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="l 1"> <mml:semantics> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:msub> <mml:mi>l</mml:mi> <mml:mn>1</mml:mn> </mml:msub> </mml:mrow> <mml:annotation encoding="application/x-tex">{l_1}</mml:annotation> </mml:semantics> โ€ฆ