AN EXACT AFFINE-CORE FORMULA FOR BOUNDED UNIONS OF TRANSLATES

Abstract For a nonempty subset B of a group G , let μ G , B ( n , c ) $\mu _{G,B}(n,c)$ mu Subscript upper G comma upper B Baseline left parenthesis n comma c right parenthesis be the least possible value of max ∅ ≠ S ⊆ B , | S | ≤ c | A S | $\max _{\varnothing \ne S\subseteq B,\ |S|\le c}|AS|$ 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 over all n -element subsets A ⊆ G $A\subseteq G$ upper A subset of or equal to upper G . Given b 0 ∈ B $b_0\in B$ b 0 element of upper B , set D = b 0 − 1 B $D=b_0^{-1}B$ upper D equals b 0 Superscript negative 1 Baseline upper B and H = ⟨ D ⟩ $H=\langle D\rangle $ upper H equals left angle bracket upper D right angle bracket . We prove that

Authors

Institutions

Publication Details

Journal
Bulletin of the Australian Mathematical Society
Published
2026-10-22
DOI
https://doi.org/10.1017/s0004972726102123
Primary Topic
Finite Group Theory Research
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

AN EXACT AFFINE-CORE FORMULA FOR BOUNDED UNIONS OF TRANSLATES

Hongbin Zhao
Bulletin of the Australian Mathematical Society
Finite Group Theory Research
article

AN EXACT AFFINE-CORE FORMULA FOR BOUNDED UNIONS OF TRANSLATES

Hongbin Zhao
article en

Abstract

Abstract For a nonempty subset B of a group G , let μ G , B ( n , c ) $\mu _{G,B}(n,c)$ mu Subscript upper G comma upper B Baseline left parenthesis n comma c right parenthesis be the least possible value of max ∅ ≠ S ⊆ B , | S | ≤ c | A S | $\max _{\varnothing \ne S\subseteq B,\ |S|\le c}|AS|$ 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 over all n -element subsets A ⊆ G $A\subseteq G$ upper A subset of or equal to upper G . Given b 0 ∈ B $b_0\in B$ b 0 element of upper B , set D = b 0 − 1 B $D=b_0^{-1}B$ upper D equals b 0 Superscript negative 1 Baseline upper B and H = ⟨ D ⟩ $H=\langle D\rangle $ upper H equals left angle bracket upper D right angle bracket . We prove that

Bulletin of the Australian Mathematical Society
Fuzhou University (CN)
Openalex Percentile: Top 5%
Finite Group Theory Research
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon