Related papers: An improved lower bound for finite additive 2-base…

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…

The concept of additive basis has been investigated in the literature for several mathematicians which works with number theorem. Recently, the concept of finitely stable additive basis was introduced. In this note we provide a…

For nonnegative integers $n$ and $d$, let $A(n,d)$ be the maximum cardinality of a binary code of length $n$ and minimum distance at least $d$. We consider a slight sharpening of the semidefinite programming bound of Gijswijt, Mittelmann…

A beta expansion is the analogue of the base 10 representation of a real number, where the base may be a non-integer. Although the greedy beta expansion of 1 using a non-integer base is in general infinitely long and non-repeating, it is…

We show that $A_2(7,4) \leq 388$ and, more generally, $A_q(7,4) \leq (q^2-q+1)[7]_q + q^4 - 2q^3 + 3q^2 - 4q + 4$ by semidefinite programming for $q \leq 101$. Furthermore, we extend results by Bachoc et al. on SDP bounds for $A_2(n,d)$,…

We consider the problem of finding lower bounds on the number of unlabeled $n$-element lattices in some lattice family. We show that if the family is closed under vertical sum, exponential lower bounds can be obtained from vertical sums of…

For a fixed integer $k \ge 0$, consider representations of positive integers as sums of binomial coefficients of the form $\binom{n}{k}$. While exact minimal bounds for the number of required summands are known only in a few low-dimensional…

Two sets $A, B \subseteq \{0, 1\}^n$ form a Uniquely Decodable Code Pair (UDCP) if every pair $a \in A$, $b \in B$ yields a distinct sum $a+b$, where the addition is over $\mathbb{Z}^n$. We show that every UDCP $A, B$, with $|A| =…

A set $A$ of nonnegative integers is an asymptotic basis of order $h$ if every sufficiently large integer can be represented as the sum of $h$ not necessarily distinct elements of $A$. The asymptotic basis $A$ is minimal if removing any…

We show in this note that the average number of terms in the optimal double-base number system is in Omega(n / log n). The lower bound matches the upper bound shown earlier by Dimitrov, Imbert, and Mishra (Math. of Comp. 2008).

Let $A$ and $B$ be additive sets of $\mathbb{Z}_{2k}$, where $A$ has cardinality $k$ and $B=v.\complement A$ with $v\in\mathbb{Z}_{2k}^{\times}$. In this note some bounds for the cardinality of $A+B$ are obtained, using four different…

A Sidon set is a set of integers containing no nontrivial solutions to the equation $a+b=c+d$. We improve on the lower bound on the diameter of a Sidon set with $k$ elements: if $k$ is sufficiently large and ${\cal A}$ is a Sidon set with…

We prove that to store n bits x so that each prefix-sum query Sum(i) := sum_{k < i} x_k can be answered by non-adaptively probing q cells of log n bits, one needs memory > n + n/log^{O(q)} n. Our bound matches a recent upper bound of n +…

The Binary Two-Up Sequence is the lexicographically earliest sequence of distinct nonnegative integers with the property that the binary expansion of the n-th term has no 1-bits in common with any of the previous floor(n/2) terms. We show…

Notice that the square of $9376$ is $87909376$ which has as its rightmost four digits $9376$. To generalize this remarkable fact, we show that, for each integer $n\ge 2$, there exists at least one and at most two positive integers $x$ with…

Let $G$ be a finite additive abelian group with exponent $d^kn, d,n>1,$ and $k$ a positive integer. For $S$ a sequence over $G$ and $A=\{1,2,\ldots,d^kn-1\}\setminus\{d^kn/d^i:i\in[1,k]\}, $ we investigate the lower bound of the number…

Positive bases, which play a key role in understanding derivative free optimization methods that use a direct search framework, are positive spanning sets that are positively linearly independent. The cardinality of a positive basis in…

The main result in this paper concerns a new five-variable expander. It is proven that for any finite set of real numbers $A$, $$|\{(a_1+a_2+a_3+a_4)^2+\log a_5 :a_1,a_2,a_3,a_4,a_5 \in A \}| \gg \frac{|A|^2}{\log |A|}.$$ This bound is…

Let $G$ be a finite abelian group and $s$ be a positive integer. A subset $A$ of $G$ is called a {\em perfect $s$-basis of $G$} if each element of $G$ can be written uniquely as the sum of at most $s$ (not-necessarily-distinct) elements of…

We find an upper bound for the sum $\sum_{x<n\leq 2x}\textbf{1}_{\mathbb{P}}(n+h_{i_{1}})\cdots\textbf{1}_{\mathbb{P}}(n+h_{i_{m+1}})w_{n}$, where $(h_{i_{1}},...,h_{i_{m+1}})$ is any $(m+1)$-tuple of elements in the admissible set…