Article
Licensed
Unlicensed
Requires Authentication
On Bases with a T-Order
-
Quan-Hui Yang
and
Feng-Juan Chen
Published/Copyright:
February 24, 2011
Abstract
For any set T = {t1, t2, . . . , tn} ⊆ ℕ, a basis A is said to have a T-order s if every sufficiently large integer is the sum of s – t1 or s – t2 or . . . or s – tn elements taken from A (allowing repetitions), where s is the least integer with this property. We write ord(T)(A) = s. In this paper, we characterize those bases A which have a T-order.
Received: 2010-05-24
Revised: 2010-11-03
Accepted: 2010-11-15
Published Online: 2011-02-24
Published in Print: 2011-February
© de Gruyter 2011
You are currently not able to access this content.
You are currently not able to access this content.
Articles in the same Issue
- Symmetries in Steinhaus Triangles and in Generalized Pascal Triangles
- Unbounded Discrepancy in Frobenius Numbers
- Combinatorial Interpretations of Convolutions of the Catalan Numbers
- Quadratic Forms and Four Partition Functions Modulo 3
- On Bases with a T-Order
- Van der Waerden's Theorem and Avoidability in Words
- On a Class of Ternary Inclusion-Exclusion Polynomials
Articles in the same Issue
- Symmetries in Steinhaus Triangles and in Generalized Pascal Triangles
- Unbounded Discrepancy in Frobenius Numbers
- Combinatorial Interpretations of Convolutions of the Catalan Numbers
- Quadratic Forms and Four Partition Functions Modulo 3
- On Bases with a T-Order
- Van der Waerden's Theorem and Avoidability in Words
- On a Class of Ternary Inclusion-Exclusion Polynomials
