arXiv 1311.10242013-11-05math.NTmath.CO

The Postage Stamp Problem - Formulae and proof for the case of 3 denominations

Michael Farinton Challis

英文摘要：

A_k = {1, a_2, ..., a_k} is an h-basis for n if every positive integer not exceeding n can be expressed as the sum of no more than h values a_i; an extremal h-basis A_k is one for which n is as large as possible. Computing such extremal bases has become known as the Postage Stamp Problem. In 1968 Gerd Hofmeister published formulae for solutions to the Postage Stamp Problem with three denominations (h = 3). This paper presents an alternative approach developed independently by the author 25 years later.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

Addition Chains Meet Postage Stamps: Reducing the Number of Multiplications

We introduce stamp chains. A stamp chain is a finite integer sequence that is both an addition chain and an additive 2-basis, i.e., a solution to the postage stamp problem. We provide a simple method for converting known postage stamp solutions of length k into stamp chains of length k+1. Using stamp chains, we construct an algorithm that computes u(x^i) for i=1,...,n in less than n-1 multiplications, if u is a function that can be computed at zero cost, and if there exists another zero-cost function v such that v(a,b) = u(ab). This can substantially reduce the computational cost of repeated m…

2014-02-03math.COmath.NT

The Frobenius postage stamp problem, and beyond

Let $A$ be a finite subset of $\mathbb{Z}^n$, which generates $\mathbb{Z}^n$ additively. We provide a precise description of the $N$-fold sumsets $NA$ for $N$ sufficiently large, with some explicit bounds on "sufficiently large."

2020-04-27math.COmath.NT

邮票问题与矩阵的本质子集

The Postage Stamp Problem and Essential Subsets in Integer Bases

Plagne最近确定了函数E（h）的渐近行为，该函数计算了h阶N的加法基中基本元素的最大可能数量。在这里，我们通过研究函数E（h，k）的渐近行为来扩展他的调查，该函数在h阶的基础上计算大小为k的本质子集的最大可能数量。对于固定的k，当h趋于无穷大时，证明了E（h，k）= Θ_{k}（[h^{k}/ \log h]^{1/（k+1）}）.一个更精确的渐近公式的确定取决于有限循环群中著名的“邮票问题”的解决方案。另一方面，当h固定且k趋于无穷大时，证明了E（h，k）\sim（h-1）{ \log k \over \log \log k}.

2008-07-02math.COmath.NT

局部邮票问题的计算复杂性

The computational complexity of the local postage stamp problem

局部邮票问题（LPSP）是一个被广泛研究的问题：给定一个正整数k，一组正整数1 = a1 < a2 <. < ak and an integer h >= 1，不能表示为线性组合x1 a1 +.的最小正整数是多少？+ xk ak其中x1 +. + xk <= h且每个xi是非负整数？本文证明了LPSP在图灵归约下是NP-难的，但当k固定时可以在多项式时间内求解。

2001-12-22cs.CCmath.COmath.NT

邮票问题的紧致对称解

Compact symmetric solutions to the postage stamp problem

我们推导出上、下界的可能增长率的某些集合的正整数$A_k=\{1= a_1 < a_2 < ... < a_{k}\}$，使所有的整数$n\in \{0, 1, 2, ..., ka_{k}\}$可以表示为不超过$k$元素的$A_k$，与重复。

2008-10-14math.NT

Early Pruning in the Restricted Postage Stamp Problem

A set of non-negative integers is an additive basis with range $n$, if its sumset covers all consecutive integers from 0 to $n$, but not $n+1$. If the range is exactly twice the largest element of the basis, the basis is restricted. Restricted bases have important special properties that facilitate efficient searching. With the help of these properties, we have previously listed the extremal restricted bases up to length $k = 41$. Here, with a more prudent use of the properties, we present an improved search algorithm and list all extremal restricted bases up to $k = 47$.

2015-03-11math.NT

更多相关论文收起更多论文

大邮票数量下邮票问题的改进界

Improved bounds on the postage stamp problem for large numbers of stamps

针对集合$\{1,2,\cdots,n\}$的$h$-折叠基最小基数$F_h(n)$，本文通过概率方法结合Berry-Esseen定理改进下界，利用Jia-Shen构造确立非平凡上界，大幅优化了$h$足够大时的渐近界。

2025-11-11math.COmath.NT

The continuous postage stamp problem

For a real set $A$ consider the semigroup $S(A)$, additively generated by $A$; that is, the set of all real numbers representable as a (finite) sum of elements of $A$. If $A \subset (0,1)$ is open and non-empty, then $S(A)$ is easily seen to contain all sufficiently large real numbers, and we let $G(A) := \sup \{u \in R \colon u \notin S(A) \}$. Thus, $G(A)$ is the smallest number with the property that any $u>G(A)$ is representable as indicated above. We show that if the measure of $A$ is large, then $G(A)$ is small; more precisely, writing for brevity $α:= \mes A$ we have $$ G(A) \le (1-α) \…

2009-11-27math.NT

Notes on Symmetric Bases

A_k = {1, a_2, ... a_k} is an h-basis for n if every positive integer not exceeding n can be expressed as the sum of no more than h values a_i. An extremal h-basis A_k is one for which n is as large as possible. Computing extremal bases is known as the Postage Stamp Problem. A basis A_k is symmetric if A_k = {1, a_2, ... a_k} where a_i + a_(k-i) = a_k for 1<=i<=k-1. Examination of a number of symmetric bases suggests the following conjecture: if the range 0 ... a_k is covered using at most h stamps, then the range 0 ... ha_k is also covered using at most h stamps. This paper shows that this is…

2014-09-22math.COmath.NT

Looking for good Hofmeister and Braunschadel bases

A_k = (1, a_2, ... a_k} is an h-basis for n if every positive integer not exceeding n can be expressed as the sum of no more than h values a_i. An "extremal" h-basis A_k is one for which n is as large as possible. Computing extremal bases has become known as the "global" Postage Stamp Problem. This paper describes the author's early attempts to identify extremal Hofmeister and Braunschadel bases for large t (where t = 12h + r for some 0 <= r <= 11), and also includes a transcription of Prof. Selmer's correspondence with the author about this work which has not been published before. See (Selme…

2014-09-29math.COmath.NT

Notes on "Symmetric Bases with large 2-range"

A_k = {1, a_2, ... a_k} is an h-basis for n if every positive integer not exceeding n can be expressed as the sum of no more than h values a_i. An extremal h-basis A_k is one for which n is as large as possible. Computing extremal bases has become known as the Postage Stamp Problem. This paper is inspired by and based upon a paper entitled "Symmetric bases with large 2-range for k<=75" by Svein Mossige at the University of Bergen (Mossige, Svein, [4]). Computer searches have identified some further bases which are superior to those reported in [4], and the paper also reports an improvement to …

2014-09-22math.COmath.NT