A classical additive basis question is Waring\u27s problem. It has been extended to integer polynomial and non-integer power sequences. In this paper, we will consider a wider class of functions, namely functions from a Hardy field, and show that they are asymptotic bases. © 2010 Akadémiai Kiadó, Budapest, Hungary
AbstractLet A be an asymptotic basis of order h. Define Ik(A)={F|F⫅A,|F|=kandA⧹Fis a basis} where |F...
This thesis is focused of two problems - one in additive combinatorics and one in combinatorial prob...
Let A be an asymptotic basis for N and X a finite subset of A such that A\X is still an asymptotic b...
The set A of nonnegative integers is an asymptotic basis of order h if every sufficiently large inte...
Some remarks on the Erdős–Turán conjecture by Martin Helm (Mainz) Notation. In additive number the...
AbstractAn asymptotic basis A of order h is minimal if no proper subset of A is an asymptotic basis ...
Abstract: Let A be a set of integers. For every integer n, let rA;h(n) denote the number of represen...
It is shown that for anyt > cp log n linear basesB1, …, Bt ofZpn their union (with repetitions)∪i = ...
AbstractLet A be an asymptotic basis for N and X a finite subset of A such that A∖X is still an asym...
We collected several results in integers of additive number theory and translated to results in F_q[...
AbstractWe consider the asymptotic behavior of b-additive functions f with respect to a base b of a ...
AbstractLet Fq be a finite field with q elements and p∈Fq[X,Y]. In this paper we study properties of...
AbstractLet P(S) be the set of all integers which are representable as a sum of distinct terms of S....
In this paper, we study (random) sequences of pseudo s-th powers, as introduced by Erdös and Rényi i...
The study of many problems in additive combinatorics, such as Szemer\'edi's theorem on arithmetic pr...
AbstractLet A be an asymptotic basis of order h. Define Ik(A)={F|F⫅A,|F|=kandA⧹Fis a basis} where |F...
This thesis is focused of two problems - one in additive combinatorics and one in combinatorial prob...
Let A be an asymptotic basis for N and X a finite subset of A such that A\X is still an asymptotic b...
The set A of nonnegative integers is an asymptotic basis of order h if every sufficiently large inte...
Some remarks on the Erdős–Turán conjecture by Martin Helm (Mainz) Notation. In additive number the...
AbstractAn asymptotic basis A of order h is minimal if no proper subset of A is an asymptotic basis ...
Abstract: Let A be a set of integers. For every integer n, let rA;h(n) denote the number of represen...
It is shown that for anyt > cp log n linear basesB1, …, Bt ofZpn their union (with repetitions)∪i = ...
AbstractLet A be an asymptotic basis for N and X a finite subset of A such that A∖X is still an asym...
We collected several results in integers of additive number theory and translated to results in F_q[...
AbstractWe consider the asymptotic behavior of b-additive functions f with respect to a base b of a ...
AbstractLet Fq be a finite field with q elements and p∈Fq[X,Y]. In this paper we study properties of...
AbstractLet P(S) be the set of all integers which are representable as a sum of distinct terms of S....
In this paper, we study (random) sequences of pseudo s-th powers, as introduced by Erdös and Rényi i...
The study of many problems in additive combinatorics, such as Szemer\'edi's theorem on arithmetic pr...
AbstractLet A be an asymptotic basis of order h. Define Ik(A)={F|F⫅A,|F|=kandA⧹Fis a basis} where |F...
This thesis is focused of two problems - one in additive combinatorics and one in combinatorial prob...
Let A be an asymptotic basis for N and X a finite subset of A such that A\X is still an asymptotic b...
DOI
Add to ORKG