Related papers: An exploration of Nathanson's $g$-adic representat…

The number theoretic analogue of a net in metric geometry suggests new problems and results in combinatorial and additive number theory. For example, for a fixed integer g > 1, the study of h-nets in the additive group of integers with…

At a conference in Debrecen in October 2010 Nathanson announced some results concerning the arithmetic diameters of certain sets. He proposed some related results on the representation of integers by sums or differences of powers of 2 and…

If $G$ is a group and $S$ a generating set, $G$ canonically embeds into the automorphism group of its Cayley graph and it is natural to try to minimize, over all generating sets, the index of this inclusion. This infimum is called the…

We define the positive diameter of a finite group $G$ with respect to a generating set $A\subset G$ to be the smallest non-negative integer $n$ such that every element of $G$ can be written as a product of at most $n$ elements of $A$. This…

Let $G$ be a finite directed graph, $\beta(G)$ the minimum size of a subset $X$ of edges such that the graph $G' = (V,E \smallsetminus X)$ is directed acyclic and $\gamma(G)$ the number of pairs of nonadjacent vertices in the undirected…

This paper describes a new link between combinatorial number theory and geometry. The main result states that A is a finite set of relatively prime positive integers if and only if A = (K-K) \cap N, where K is a compact set of real numbers…

For any finite abelian group $G$ and any subset $S\seq G$, we determine the connectivity of the addition Cayley graph induced by $S$ on $G$. Moreover, we show that if this graph is not complete, then it possesses a minimum vertex cut of a…

We continue investigations on the average number of representations of a large positive integer as a sum of given powers of prime numbers. The average is taken over a short interval, whose admissible length depends on whether or not we…

We present a novel conjecture concerning the additive representation of natural numbers using prime powers. Based on extensive computational verification, we conjecture that every integer n > 23 can be expressed as a sum of at most five…

The strong geodetic problem on a graph $G$ is to determine a smallest set of vertices such that by fixing one shortest path between each pair of its vertices, all vertices of $G$ are covered. To do this as efficiently as possible, strong…

We consider the set $A_{n}=\displaystyle\cup_{j=0}^{\infty}\{\varepsilon_{j}(n)\cdot n^j\colon\varepsilon_{j}(n)\in\{0,\pm1,\pm2,...,\pm\lfloor{{n}/{2}}\rfloor\}\} $. Let $\mathcal{S}_{\mathcal{A}}= \bigcup_{a \in\mathcal{A} } A_{a}$ where…

We prove that if G is SL_2(F) or PSL_2(F), where F is a finite field, and A is a set of generators of G, then either |AAA| > |A|^(1+epsilon), where epsilon is an absolute positive real number, or AAA=G. As a corollary we get that the…

A graph $G$ is defined encapsulating the number theoretic notion of the Fundamental Theorem of Arithmetic. We then provide a graph theoretic approach to the fundamental results on the coprimality of two natural numbers, through the use of…

Let S be a closed orientable surface of genus at least 2 and let G be a semisimple real algebraic group of non-compact type. We consider a class of representations from the fundamental group of S to G called positively ratioed…

Using GCD sums, we show that the set of the primes has small common multiplicative energy with an arbitrary exponentially big integer set $S$ and, in particular, size of any arithmetic progression in $S$ having the beginning at zero, is at…

We investigate the Waring-Goldbach problem of representing a positive integer $n$ as the sum of $s$ $k$th powers of almost equal prime numbers. Define $s_k=2k(k-1)$ when $k\ge 3$, and put $s_2=6$. In addition, put $\theta_2=\frac{19}{24}$,…

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…

We consider a natural generalization of the Nagell-Ljunggren equation to the case where the qth power of an integer y, for q >= 2, has a base-b representation that consists of a length-l block of digits repeated n times, where n >= 2.…

The edge isoperimetric problem for a graph $G$ is to determine, for each $n$, the minimum number of edges leaving any set of $n$ vertices. In general this problem is NP-hard, but exact solutions are known in some special cases, for example…

For a real set $A$ consider the semigroup $S(A)$, additively generated by $A$; that is, the set of all real numbers representable as a (finite) sum of elements of $A$. If $A \subset (0,1)$ is open and non-empty, then $S(A)$ is easily seen…