Related papers: A Construction for Difference Sets with Local Prop…

The notions and certain fundamental characteristics of the proximal and limiting normal cones with respect to a set are first presented in this paper. We present the ideas of the limiting coderivative and subdifferential with respect to a…

A More Sums Than Differences (MSTD) set is a set of integers A contained in {0, ..., n-1} whose sumset A+A is larger than its difference set A-A. While it is known that as n tends to infinity a positive percentage of subsets of {0, ...,…

We show that for any set of reals X there is a subset Y such X and Y have same Lebesgue outer measure and the distance between any two distinct points in Y is irrational.

Let $A$ be a subset of a finite abelian group such that $A$ has a small difference set $A-A$ and the density of $A$ is small. We prove that, counter--intuitively, the smallness (in terms of $|A-A|$) of the Fourier coefficients of $A$…

A Locally Recoverable Code is a code such that the value of any single coordinate of a codeword can be recovered from the values of a small subset of other coordinates. When we have $\delta$ non overlapping subsets of cardinality $r_i$ that…

A two-dimensional grid with dots is called a \emph{configuration with distinct differences} if any two lines which connect two dots are distinct either in their length or in their slope. These configurations are known to have many…

We characterize the existence of certain geometric configurations in the fractal percolation limit set $A$ in terms of the almost sure dimension of $A$. Some examples of the configurations we study are: homothetic copies of finite sets,…

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…

A finite set of real numbers is called convex if the differences between consecutive elements form a strictly increasing sequence. We show that, for any pair of convex sets $A, B\subset\mathbb R$, each of size $n^{1/2}$, the convex grid…

Let $V \subset \mathbb{R}$ be a finite set with $|V| = n $ and suppose we are given each pairwise distance independently with probability $p$. We show that if $p = (1+\epsilon)/n$, for some fixed $\epsilon >0$, then we can reconstruct a…

Let $n$ be a positive integer, and let $A$ be a set of $k\ge 2n-1$ integers. For the restricted sumset $$ S_n(A)=\{a_1+\cdots +a_n:\ a_1,\ldots,a_n\in A,\ \text{and}\ a_i^2\neq a_j^2\ \text{for} \ 1\le i<j\le n\}, $$ by a 2002 result of Liu…

We study a variant of Erd\H os' unit distance problem, concerning dot products between successive pairs of points chosen from a large finite point set. Specifically, given a large finite set of $n$ points $E$, and a sequence of nonzero dot…

We study the finite dimensional partition properties of the countable homogeneous dense local order. Some of our results use ideas borrowed from the partition calculus of the rationals and are obtained thanks to a strengthening of…

For a given subset $A\subseteq \mathbb F_q^*$, we study the problem of finding a large packing set $B$ of $A$, that is, a set $B \subseteq \mathbb F_q^*$ such that $|AB|=|A||B|$. We prove the existence of such a $B$ of size $|B|\ge…

One of the many theorems Freiman proved, in the second half of the twentieth century, in the subject which later came to be known as "structure theory of set addition", was 'Freiman's $3k-4$ theorem' for subsets of $\Z$. In this article we…

We study the structure of infinite discrete sets D definable in expansions of ordered Abelian groups whose theories are strong and definably complete, with particular emphasis on the set D' comprised of differences between successive…

We use fast-growing finite and infinite sequences of natural numbers and more complicated constructs to define models of hypercomputation and interpret non-arithmetic predicates, with the strongest extensions reaching full second order…

One says that a property $P$ of sets of natural numbers can be made into itself iff there is a numbering $\alpha_0,\alpha_1,\ldots$ of all left-r.e. sets such that the index set $\{e: \alpha_e$ satisfies $P\}$ has the property $P$ as well.…

We study the structure of sets $S\subseteq\{0, 1\}^n$ with small sensitivity. The well-known Simon's lemma says that any $S\subseteq\{0, 1\}^n$ of sensitivity $s$ must be of size at least $2^{n-s}$. This result has been useful for proving…

According to their strength, the tracing properties of a code can be categorized as frameproof, separating, IPP and TA. It is known that if the minimum distance of the code is larger than a certain threshold then the TA property implies the…