On finiteness theorems for sums of generalized polygonal numbers

Abstract In this paper, we consider mixed sums of generalized polygonal numbers. Specifically, we obtain a finiteness condition for universality of such sums; this means that it suffices to check representability of a finite subset of the positive integers in order to conclude that the sum of generalized polygonal numbers represents every positive integer. The sub-class of sums of generalized polygonal numbers which we consider is those sums of <m:math xmlns:m="http://www.w3.org/1998/Math/MathML"> <m:msub> <m:mi>m</m:mi> <m:mi>i</m:mi> </m:msub> </m:math> {m_{i}} -gonal numbers for which <m:math xmlns:m="http://www.w3.org/1998/Math/MathML"> <m:mrow> <m:mrow> <m:mtext>lcm</m:mtext> <m:mo>⁢</m:mo> <m:mrow> <m:mo stretchy="false">(</m:mo> <m:mrow> <m:msub> <m:mi>m</m:mi> <m:mn>1</m:mn> </m:msub> <m:mo>-</m:mo> <m:mn>2</m:mn> </m:mrow> <m:mo>,</m:mo> <m:mi mathvariant="normal">…</m:mi> <m:mo>,</m:mo> <m:mrow> <m:msub> <m:mi>m</m:mi> <m:mi>r</m:mi> </m:msub> <m:mo>-</m:mo> <m:mn>2</m:mn> </m:mrow> <m:mo stretchy="false">)</m:mo> </m:mrow> </m:mrow> <m:mo>≤</m:mo> <m:mi>𝔐</m:mi> </m:mrow> </m:math> {\text{lcm}(m_{1}-2,\dots,m_{r}-2)\leq\mathfrak{M}} and we obtain a bound on the asymptotic growth of a constant <m:math xmlns:m="http://www.w3.org/1998/Math/MathML"> <m:msub> <m:mi mathvariant="normal">Γ</m:mi> <m:mi>𝔐</m:mi> </m:msub> </m:math> {\Gamma_{\mathfrak{M}}} such that it suffices to check the representability condition for <m:math xmlns:m="http://www.w3.org/1998/Math/MathML"> <m:mrow> <m:mi>n</m:mi> <m:mo>≤</m:mo> <m:msub> <m:mi mathvariant="normal">Γ</m:mi> <m:mi>𝔐</m:mi> </m:msub> </m:mrow> </m:math> {n\leq\Gamma_{\mathfrak{M}}} .

Authors

Institutions

Publication Details

Journal
Forum Mathematicum
Published
2026-05-27
DOI
https://doi.org/10.1515/forum-2025-0402
Primary Topic
Advanced Topology and Set Theory
Type
preprint
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
preprint

On finiteness theorems for sums of generalized polygonal numbers

Ben Kane, Zichen Yang
Forum Mathematicum
Advanced Topology and Set Theory
preprint

On finiteness theorems for sums of generalized polygonal numbers

Ben Kane, Zichen Yang
preprint en

Abstract

Abstract In this paper, we consider mixed sums of generalized polygonal numbers. Specifically, we obtain a finiteness condition for universality of such sums; this means that it suffices to check representability of a finite subset of the positive integers in order to conclude that the sum of generalized polygonal numbers represents every positive integer. The sub-class of sums of generalized polygonal numbers which we consider is those sums of <m:math xmlns:m="http://www.w3.org/1998/Math/MathML"> <m:msub> <m:mi>m</m:mi> <m:mi>i</m:mi> </m:msub> </m:math> {m_{i}} -gonal numbers for which <m:math xmlns:m="http://www.w3.org/1998/Math/MathML"> <m:mrow> <m:mrow> <m:mtext>lcm</m:mtext> <m:mo>⁢</m:mo> <m:mrow> <m:mo stretchy="false">(</m:mo> <m:mrow> <m:msub> <m:mi>m</m:mi> <m:mn>1</m:mn> </m:msub> <m:mo>-</m:mo> <m:mn>2</m:mn> </m:mrow> <m:mo>,</m:mo> <m:mi mathvariant="normal">…</m:mi> <m:mo>,</m:mo> <m:mrow> <m:msub> <m:mi>m</m:mi> <m:mi>r</m:mi> </m:msub> <m:mo>-</m:mo> <m:mn>2</m:mn> </m:mrow> <m:mo stretchy="false">)</m:mo> </m:mrow> </m:mrow> <m:mo>≤</m:mo> <m:mi>𝔐</m:mi> </m:mrow> </m:math> {\text{lcm}(m_{1}-2,\dots,m_{r}-2)\leq\mathfrak{M}} and we obtain a bound on the asymptotic growth of a constant <m:math xmlns:m="http://www.w3.org/1998/Math/MathML"> <m:msub> <m:mi mathvariant="normal">Γ</m:mi> <m:mi>𝔐</m:mi> </m:msub> </m:math> {\Gamma_{\mathfrak{M}}} such that it suffices to check the representability condition for <m:math xmlns:m="http://www.w3.org/1998/Math/MathML"> <m:mrow> <m:mi>n</m:mi> <m:mo>≤</m:mo> <m:msub> <m:mi mathvariant="normal">Γ</m:mi> <m:mi>𝔐</m:mi> </m:msub> </m:mrow> </m:math> {n\leq\Gamma_{\mathfrak{M}}} .

Forum Mathematicum
University of Science and Technology of China (CN), University of Hong Kong (HK)
Openalex Percentile: Top 99%
Advanced Topology and Set Theory
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.