Skip to content
Open access

AN EXACT AFFINE-CORE FORMULA FOR BOUNDED UNIONS OF TRANSLATES

Oct 2026 · Bulletin of the Australian Mathematical Society · 0 citations

Abstract

<jats:p> For a nonempty subset <jats:italic>B</jats:italic> of a group <jats:italic>G</jats:italic> , let <jats:inline-formula> <jats:alternatives> <mml:math xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:mnf="http://cambridge.org/core/manifest" xmlns:cup="http://contentservices.cambridge.org" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:m="http://cambridge.org/core/metadata" xmlns:core="http://cambridge.org/core" xmlns:c="http://cambridge.org/core/content" display="inline"> <mml:msub> <mml:mi>μ</mml:mi> <mml:mrow> <mml:mi>G</mml:mi> <mml:mo>,</mml:mo> <mml:mi>B</mml:mi> </mml:mrow> </mml:msub> <mml:mo stretchy="false">(</mml:mo> <mml:mi>n</mml:mi> <mml:mo>,</mml:mo> <mml:mi>c</mml:mi> <mml:mo stretchy="false">)</mml:mo> </mml:math> <jats:tex-math>$\mu _{G,B}(n,c)$</jats:tex-math> <jats:inline-graphic xmlns:xlink="http://www.w3.org/1999/xlink" mime-subtype="png" content-type="simple" xlink:href="S0004972726102123_inline1.png"> <jats:alt-text content-type="machine-generated">mu Subscript upper G comma upper B Baseline left parenthesis n comma c right parenthesis</jats:alt-text> </jats:inline-graphic> </jats:alternatives> </jats:inline-formula> be the least possible value of <jats:inline-formula> <jats:alternatives> <mml:math xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:mnf="http://cambridge.org/core/manifest" xmlns:cup="http://contentservices.cambridge.org" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:m="http://cambridge.org/core/metadata" xmlns:core="http://cambridge.org/core" xmlns:c="http://cambridge.org/core/content" display="inline"> <mml:munder> <mml:mo movablelimits="true">max</mml:mo> <mml:mrow> <mml:mi>∅</mml:mi> <mml:mo>≠</mml:mo> <mml:mi>S</mml:mi> <mml:mo>⊆</mml:mo> <mml:mi>B</mml:mi> <mml:mo>,</mml:mo> <mml:mtext> </mml:mtext> <mml:mo stretchy="false">|</mml:mo> <mml:mi>S</mml:mi> <mml:mo stretchy="false">|</mml:mo> <mml:mo>≤</mml:mo> <mml:mi>c</mml:mi> </mml:mrow> </mml:munder> <mml:mo stretchy="false">|</mml:mo> <mml:mi>A</mml:mi> <mml:mi>S</mml:mi> <mml:mo stretchy="false">|</mml:mo> </mml:math> <jats:tex-math>$\max _{\varnothing \ne S\subseteq B,\ |S|\le c}|AS|$</jats:tex-math> <jats:inline-graphic xmlns:xlink="http://www.w3.org/1999/xlink" mime-subtype="png" content-type="simple" xlink:href="S0004972726102123_inline2.png"> <jats:alt-text content-type="machine-generated">max Underscript empty set not equals upper S subset of or equal to upper B comma StartAbsoluteValue upper S EndAbsoluteValue less than or equals c Endscripts StartAbsoluteValue upper A upper S EndAbsoluteValue</jats:alt-text> </jats:inline-graphic> </jats:alternatives> </jats:inline-formula> over all <jats:italic>n</jats:italic> -element subsets <jats:inline-formula> <jats:alternatives> <mml:math xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:mnf="http://cambridge.org/core/manifest" xmlns:cup="http://contentservices.cambridge.org" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:m="http://cambridge.org/core/metadata" xmlns:core="http://cambridge.org/core" xmlns:c="http://cambridge.org/core/content" display="inline"> <mml:mi>A</mml:mi> <mml:mo>⊆</mml:mo> <mml:mi>G</mml:mi> </mml:math> <jats:tex-math>$A\subseteq G$</jats:tex-math> <jats:inline-graphic xmlns:xlink="http://www.w3.org/1999/xlink" mime-subtype="png" content-type="simple" xlink:href="S0004972726102123_inline3.png"> <jats:alt-text content-type="machine-generated">upper A subset of or equal to upper G</jats:alt-text> </jats:inline-graphic> </jats:alternatives> </jats:inline-formula> . Given <jats:inline-formula> <jats:alternatives> <mml:math xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:mnf="http://cambridge.org/core/manifest" xmlns:cup="http://contentservices.cambridge.org" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:m="http://cambridge.org/core/metadata" xmlns:core="http://cambridge.org/core" xmlns:c="http://cambridge.org/core/content" display="inline"> <mml:msub> <mml:mi>b</mml:mi> <mml:mn>0</mml:mn> </mml:msub> <mml:mo>∈</mml:mo> <mml:mi>B</mml:mi> </mml:math> <jats:tex-math>$b_0\in B$</jats:tex-math> <jats:inline-graphic xmlns:xlink="http://www.w3.org/1999/xlink" mime-subtype="png" content-type="simple" xlink:href="S0004972726102123_inline4.png"> <jats:alt-text content-type="machine-generated">b 0 element of upper B</jats:alt-text> </jats:inline-graphic> </jats:alternatives> </jats:inline-formula> , set <jats:inline-formula> <jats:alternatives> <mml:math xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:mnf="http://cambridge.org/core/manifest" xmlns:cup="http://contentservices.cambridge.org" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:m="http://cambridge.org/core/metadata" xmlns:core="http://cambridge.org/core" xmlns:c="http://cambridge.org/core/content" display="inline"> <mml:mi>D</mml:mi> <mml:mo>=</mml:mo> <mml:msubsup> <mml:mi>b</mml:mi> <mml:mn>0</mml:mn> <mml:mrow> <mml:mo>−</mml:mo> <mml:mn>1</mml:mn> </mml:mrow> </mml:msubsup> <mml:mi>B</mml:mi> </mml:math> <jats:tex-math>$D=b_0^{-1}B$</jats:tex-math> <jats:inline-graphic xmlns:xlink="http://www.w3.org/1999/xlink" mime-subtype="png" content-type="simple" xlink:href="S0004972726102123_inline5.png"> <jats:alt-text content-type="machine-generated">upper D equals b 0 Superscript negative 1 Baseline upper B</jats:alt-text> </jats:inline-graphic> </jats:alternatives> </jats:inline-formula> and <jats:inline-formula> <jats:alternatives> <mml:math xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:mnf="http://cambridge.org/core/manifest" xmlns:cup="http://contentservices.cambridge.org" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:m="http://cambridge.org/core/metadata" xmlns:core="http://cambridge.org/core" xmlns:c="http://cambridge.org/core/content" display="inline"> <mml:mi>H</mml:mi> <mml:mo>=</mml:mo> <mml:mo stretchy="false" fence="false">⟨</mml:mo> <mml:mi>D</mml:mi> <mml:mo stretchy="false" fence="false">⟩</mml:mo> </mml:math> <jats:tex-math>$H=\langle D\rangle $</jats:tex-math> <jats:inline-graphic xmlns:xlink="http://www.w3.org/1999/xlink" mime-subtype="png" content-type="simple" xlink:href="S0004972726102123_inline6.png"> <jats:alt-text content-type="machine-generated">upper H equals left angle bracket upper D right angle bracket</jats:alt-text> </jats:inline-graphic> </jats:alternatives> </jats:inline-formula> . We prove that <jats:inline-formula> <jats:alternatives> <mml:math xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:mnf="http://cambridge.org/core/manifest" xmlns:cup="http://contentservices.cambridge.org" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:m="http://cambridge.org/core/metadata" xmlns:core="http://cambridge.org/core" xmlns:c="http://cambridge

Read PDF

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.