<p>Letting <InlineEquation ID="IEq1"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="10_2025_1177_Article_IEq1.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="64" /> </InlineMediaObject> <EquationSource Format="TEX">\(L_{n}(N, u)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msub> <mi>L</mi> <mi>n</mi> </msub> <mrow> <mo stretchy="false">(</mo> <mi>N</mi> <mo>,</mo> <mi>u</mi> <mo stretchy="false">)</mo> </mrow> </mrow> </math></EquationSource> </InlineEquation> denote a polylogarithm ladder of weight <i>n</i> and index <i>N</i> with <i>u</i> as an algebraic number, there is a rich history surrounding how mathematical objects of this form can be constructed for a given weight or index. This raises questions as to what minimal polynomials for <i>u</i> are permissible in such constructions. Classical relations for the dilogarithm <InlineEquation ID="IEq2"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="10_2025_1177_Article_IEq2.gif" Format="GIF" Height="16" Rendition="HTML" Resolution="72" Type="Linedraw" Width="22" /> </InlineMediaObject> <EquationSource Format="TEX">\(\text {Li}_{2}\)</EquationSource> <EquationSource Format="MATHML"><math> <msub> <mtext>Li</mtext> <mn>2</mn> </msub> </math></EquationSource> </InlineEquation> provide families of weight-2 ladders in such a way so that the base equations for <i>u</i> consist of a fixed number of terms, and subsequent constructions for dilogarithm ladders rely on sporadic cases whereby <i>u</i> is defined via a cyclotomic equation, as in the supernumary ladders due to Abouzahra and Lewin. This motivates our construction of an infinite family of dilogarithm ladders so as to obtain arbitrarily many terms with nonzero coefficients for the minimal polynomials for <i>u</i>. Our construction relies on a derivation of a dilogarithm identity introduced by Khoi in 2014 via the Seifert volumes of manifolds obtained from the use of Dehn surgery.</p>

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

On the minimal polynomials of the arguments of dilogarithm ladders

  • John M. Campbell

摘要

Letting \(L_{n}(N, u)\) L n ( N , u ) denote a polylogarithm ladder of weight n and index N with u as an algebraic number, there is a rich history surrounding how mathematical objects of this form can be constructed for a given weight or index. This raises questions as to what minimal polynomials for u are permissible in such constructions. Classical relations for the dilogarithm \(\text {Li}_{2}\) Li 2 provide families of weight-2 ladders in such a way so that the base equations for u consist of a fixed number of terms, and subsequent constructions for dilogarithm ladders rely on sporadic cases whereby u is defined via a cyclotomic equation, as in the supernumary ladders due to Abouzahra and Lewin. This motivates our construction of an infinite family of dilogarithm ladders so as to obtain arbitrarily many terms with nonzero coefficients for the minimal polynomials for u. Our construction relies on a derivation of a dilogarithm identity introduced by Khoi in 2014 via the Seifert volumes of manifolds obtained from the use of Dehn surgery.