Related papers: Essentialities in additive bases

Let n(2,k) denote the largest integer n for which there exists a set A of k nonnegative integers such that the sumset 2A contains {0,1,2,...,n-1}. A classical problem in additive number theory is to find an upper bound for n(2,k). In this…

Hobby has recently shown that almost all finite hyperfields of even order fail to be the quotient of a field. Using a probabilistic argument, we extend this result to all orders: a finite hyperfield is almost always non-quotient. This…

In this paper we investigate how small the density of a multiplicative basis of order $h$ can be in $\{1,2,\dots,n\}$ and in $\mathbb{Z}^+$. Furthermore, a related problem of Erd\H os is also studied: How dense can a set of integers be, if…

This paper describes several classical constructions of thin bases of finite order in additive number theory, and, in particular, gives a complete presentation of a beautiful construction of J. W. S. Cassels of a class of polynomially…

Let A be a set of integers and let h \geq 2. For every integer n, let r_{A, h}(n) denote the number of representations of n in the form n=a_1+...+a_h, where a_1,...,a_h belong to the set A, and a_1\leq ... \leq a_h. The function r_{A,h}…

Let $W\subseteq \mathbb{Z}$ be a non-empty subset of the integers. A nonempty set $C\subseteq \mathbb{Z}$ is said to be an asymptotic complement to $W$ if $W+C$ contains almost all the integers except a set of finite size. $C$ is said to be…

Let $A$ be an additive basis of order $h$ and $X$ be a finite nonempty subset of $A$ such that the set $A \setminus X$ is still a basis. In this article, we give several upper bounds for the order of $A \setminus X$ in function of the order…

A subset A of {0,1,...,n} is said to be a 2-additive basis for {1,2,...,n} if each j in {1,2,...,n} can be written as j=x+y, x,y in A, x<=y. If we pick each integer in {0,1,...,n} independently with probability p=p_n tending to 0, thus…

We give a construction of an absolutely normal real number $x$ such that for every integer $b $ greater than or equal to $2$, the discrepancy of the first $N$ terms of the sequence $(b^n x \mod 1)_{n\geq 0}$ is of asymptotic order…

We obtain asymptotics for sums of the form $$ \sum_{n=1}^P e(\alpha_kn^k + \alpha_1n), $$ involving lower order main terms. As an application, we show that for almost all $\alpha_2 \in [0,1)$ one has $$ \sup_{\alpha_1 \in [0,1)} \Big|…

This article provide new approach to solve P vs NP problem by using cardinality of bases function. About NP-Complete problems, we can divide to infinite disjunction of P-Complete problems. These P-Complete problems are independent of each…

The happy function $H: \mathbb{N} \rightarrow \mathbb{N}$ sends a positive integer to the sum of the squares of its digits. A number $x$ is said to be happy if the sequence $\{H^n(x)\}^\infty_{n=1}$ eventually reaches one. A basic open…

The number of finite additive 2-bases is known to grow exponentially. While this fact has been established by Marzuola and Miller (2010) using complex analytic techniques embedded in the study of numerical sets, we provide a direct, short…

We consider the differential entropy of probability measures absolutely continuous with respect to a given $\sigma$-finite reference measure on an arbitrary measurable space. We state the asymptotic equipartition property in this general…

We obtain an asymptotic expansion for $p(n)$, the number of partitions of a natural number $n$, starting from a formula that relates its generating function $f(t), t\in (0,1)$ with the characteristic functions of a family of sums of…

Motivated by real-world machine learning applications, we analyze approximations to the non-asymptotic fundamental limits of statistical classification. In the binary version of this problem, given two training sequences generated according…

When developing and assessing density functional theory methods, a finite basis set is usually employed. In most cases, however, the issue of basis set dependency is neglected. Here, we assess several basis sets and functionals. In…

Let F(x_1,...,x_m) = u_1 x_1 + ... + u_m x_m be a linear form with nonzero, relatively prime integer coefficients u_1,..., u_m. For any set A of integers, let F(A) = {F(a_1,...,a_m) : a_i in A for i=1,...,m}. The representation function…

The paper solves the problems of determining the asymptotics of the number of primes and the sums of functions of primes in a subset of the natural series that satisfies the conditions that the asymptotic density of the number of primes in…

In connection with recent work on gaps in the asymptotic subranks of complex tensors the question arose whether the number of nonnegative real numbers that arise as the asymptotic subrank of some complex tensor is countable. In this short…