Simultaneous systems of representatives and combinatorial number theory (Q581584): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
Property / review text | |||
With \(A\subset {\mathbb{N}}_ 0\), let \(hA=\{n\in {\mathbb{N}}_ 0|\) \(n=a_ 1+...+a_ h\), \(a_ i\in A\), \(a_ 1\leq...\leq a_ h\}\), and let \(r(n)\) denote the number of such representations. We call A an asymptotic basis of order h (for \({\mathbb{N}}_ 0)\) if \(n\in hA\) for all sufficiently large \(n\in {\mathbb{N}}_ 0\). For an asymptotic basis A of order 2, \textit{P. Erdős} and \textit{M. B. Nathanson} have proved [Lect. Notes Math. 751, 98-107 (1979; Zbl 0414.10053)] that A contains a minimal asymptotic basis of order 2 if there exists a constant \(c>\log^{-1}(4/3)\) such that \(r(n)\geq c \log n\) for all sufficiently large n. This result is partly generalized to asymptotic bases of order \(h>2\). We must then restrict ourselves to representations of n with h distinct addends, and let r(n) count the elements of a distinguished set of pairwise disjoint such representations. Now \(c>\log^{-1}(h^ 2/(h^ 2-h+1)).\) The proof rests on a deep combinatorial result on simultaneous systems of representatives for finite families of finite sets. | |||
Property / review text: With \(A\subset {\mathbb{N}}_ 0\), let \(hA=\{n\in {\mathbb{N}}_ 0|\) \(n=a_ 1+...+a_ h\), \(a_ i\in A\), \(a_ 1\leq...\leq a_ h\}\), and let \(r(n)\) denote the number of such representations. We call A an asymptotic basis of order h (for \({\mathbb{N}}_ 0)\) if \(n\in hA\) for all sufficiently large \(n\in {\mathbb{N}}_ 0\). For an asymptotic basis A of order 2, \textit{P. Erdős} and \textit{M. B. Nathanson} have proved [Lect. Notes Math. 751, 98-107 (1979; Zbl 0414.10053)] that A contains a minimal asymptotic basis of order 2 if there exists a constant \(c>\log^{-1}(4/3)\) such that \(r(n)\geq c \log n\) for all sufficiently large n. This result is partly generalized to asymptotic bases of order \(h>2\). We must then restrict ourselves to representations of n with h distinct addends, and let r(n) count the elements of a distinguished set of pairwise disjoint such representations. Now \(c>\log^{-1}(h^ 2/(h^ 2-h+1)).\) The proof rests on a deep combinatorial result on simultaneous systems of representatives for finite families of finite sets. / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 11B13 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 05A05 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 11P99 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 4128934 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
combinatorial number theory | |||
Property / zbMATH Keywords: combinatorial number theory / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
additive number theory | |||
Property / zbMATH Keywords: additive number theory / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
representation of integers | |||
Property / zbMATH Keywords: representation of integers / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
minimal asymptotic basis | |||
Property / zbMATH Keywords: minimal asymptotic basis / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
simultaneous systems of representatives | |||
Property / zbMATH Keywords: simultaneous systems of representatives / rank | |||
Normal rank |
Revision as of 18:56, 1 July 2023
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Simultaneous systems of representatives and combinatorial number theory |
scientific article |
Statements
Simultaneous systems of representatives and combinatorial number theory (English)
0 references
1990
0 references
With \(A\subset {\mathbb{N}}_ 0\), let \(hA=\{n\in {\mathbb{N}}_ 0|\) \(n=a_ 1+...+a_ h\), \(a_ i\in A\), \(a_ 1\leq...\leq a_ h\}\), and let \(r(n)\) denote the number of such representations. We call A an asymptotic basis of order h (for \({\mathbb{N}}_ 0)\) if \(n\in hA\) for all sufficiently large \(n\in {\mathbb{N}}_ 0\). For an asymptotic basis A of order 2, \textit{P. Erdős} and \textit{M. B. Nathanson} have proved [Lect. Notes Math. 751, 98-107 (1979; Zbl 0414.10053)] that A contains a minimal asymptotic basis of order 2 if there exists a constant \(c>\log^{-1}(4/3)\) such that \(r(n)\geq c \log n\) for all sufficiently large n. This result is partly generalized to asymptotic bases of order \(h>2\). We must then restrict ourselves to representations of n with h distinct addends, and let r(n) count the elements of a distinguished set of pairwise disjoint such representations. Now \(c>\log^{-1}(h^ 2/(h^ 2-h+1)).\) The proof rests on a deep combinatorial result on simultaneous systems of representatives for finite families of finite sets.
0 references
combinatorial number theory
0 references
additive number theory
0 references
representation of integers
0 references
minimal asymptotic basis
0 references
simultaneous systems of representatives
0 references