Related papers: The fourth positive element in the greedy $B_h$-se…
Let $A$ be a nonempty finite subset of an additive abelian group $G$. Define $A + A := \{a + b : a, b \in A\}$ and $A \dotplus A := \{a + b : a, b \in A~\text{and}~ a \neq b\}$. The set $A$ is called a {\em sum-dominant (SD) set} if $|A +…
Let $a$ and $b$ be positive integers with prime factorisations $a = p_1^np_2^n$ and $b = q_1^nq_2^n$. We prove that the number of essentially distinct $\alpha$-graceful labelings of the complete bipartite graph $K_{a, b}$ equals the…
We show that for each element $g$ of a Garside group, there exists a positive integer $m$ such that $g^m$ is conjugate to a periodically geodesic element $h$, an element with $|h^n|_\D=|n|\cdot|h|_\D$ for all integers $n$, where $|g|_\D$…
Erd\"os conjectured the existence of an infinite Sidon sequence of positive integers which is also an asymptotic basis of order 3. We make progress towards this conjecture in several directions. First we prove the conjecture for all cyclic…
A lot of recent activity in the theory of cluster algebras has been directed towards various constructions of "natural" bases in them. One of the approaches to this problem was developed several years ago by P.Sherman - A.Zelevinsky who…
We give a short proof of the fact that every set of natural numbers with positive upper Banach density contains the sum of two infinite sets. The approach simplifies earlier existing proofs.
Let $G$ be a finite group and let $h$ be a positive integer. A $\text{BH}(G,h)$ matrix is a $G$-invariant $|G|\times |G|$ matrix $H$ whose entries are complex $h$th roots of unity such that $HH^*=|G|I_{|G|}$, where $H^*$ denotes the complex…
Let $G$ be a finite additive abelian group. For given $k$ a positive integer, the $k$-Harborth constant $g^k(G)$ is defined to be the smallest positive integer $t$ such that given a set $S$ of elements of $G$ with size $t$ there exists a…
A nonempty set $A\subset\mathbb{N}$ is $\ell$-strong Schreier if $\min A\geqslant \ell|A|-\ell+1$. We define a set of positive integers to be sparse if either the set has at most two numbers or the differences between consecutive numbers in…
Let $G$ be a finite abelian group and let $\exp(G)$ denote the least common multiple of the orders of all elements of $G$. A $BH(G,h)$ matrix is a $G$-invariant $|G|\times |G|$ matrix $H$ whose entries are complex $h$th roots of unity such…
Let $\mathbb{N}$ denote the set of all nonnegative integers. Let $k\ge 3$ be an integer and $A_{0} = \{a_{1}, \dots{}, a_{t}\}$ $(a_{1} < \ldots< a_{t})$ be a nonnegative set which does not contain an arithmetic progression of length $k$.…
Given a positive integer $h$ and a nonempty finite set of integers $A=\{a_{1},a_{2},\ldots,a_{k}\}$, the restricted $h$-fold signed sumset of $A$, denoted by $h^{\wedge}_{\pm}A$, is defined as $$h^{\wedge}_{\pm}A=\left\lbrace \sum_{i=1}^{k}…
We prove an upper bound for the number of representations of a positive integer $N$ as the sum of four $k$-th powers of integers of size at most $B$, using a new version of the Determinant method developed by Heath-Brown, along with recent…
A hierarchy on a set $S$, also called a total partition of $S$, is a collection $\mathcal{H}$ of subsets of $S$ such that $S \in \mathcal{H}$, each singleton subset of $S$ belongs to $\mathcal{H}$, and if $A, B \in \mathcal{H}$ then $A \cap…
We consider positional numeration systems with negative real base $-\beta$, where $\beta>1$, and study the extremal representations in these systems, called here the greedy and lazy representations. We give algorithms for determination of…
Solving a problem by Erd\H{o}s, we prove that every positive integer $n$ can be written as a sum $$n = b_{1} + b_{2} + \ldots + b_{r}$$ of distinct $3$-smooth integers with $1 \le b_{1} < b_{2} < \ldots < b_{r} < 6b_{1}$.
Given a positive rational number $n/d$ with $d$ odd, its odd greedy expansion starts with the largest odd denominator unit fraction at most $n/d$, adds the largest odd denominator unit fraction so the sum is at most $n/d$, and continues as…
Suppose that P is an infinite set of primes such that P = A + B + C, where A,B,C are sets with at least two elements. We show that if P(x) > c x/log^d x (where P(x) = the number of elements of P that are <= x), and if A,B,C is a "regular"…
A real sequence $(b_k)_{k=0}^\infty$ is called totally positive if all minors of the infinite matrix $ \left\| b_{j-i} \right\|_{i, j =0}^\infty$ are nonnegative (here $b_k=0$ for $k<0$). In this paper, we investigate the problem of…
Sidon sets are those sets such that the sums of two of its elements never coincide. They go back to the 30s when Sidon asked for the maximal size of a subset of consecutive integers with that property. This question is now answered in a…