arXiv subjects
Publications and source records attributed to Mauro Di Nasso.
We isolate conditions on the relative size of sets of natural numbers $A,B$ that guarantee a nonempty intersection $Δ(A)\capΔ(B)\ne\emptyset$ of the corresponding sets of distances. Such conditions apply to a large class of zero density sets. We also show that a variant of Khintchine's Recurrence Theorem holds for all infinite sets $A=\{a_1<a_2<...\}$ with $a_n\ll n^{3/2}$.
We prove general sufficient and necessary conditions for the partition regularity of Diophantine equations, which extend the classic Rado's Theorem by covering large classes of nonlinear equations. Sufficient conditions are obtained by exploiting algebraic properties in the space of ultrafilters betaN, grounding on combinatorial properties of positive density sets and IP sets. Necessary conditions are proved by a new technique in nonstandard analysis, based on the use of the relation of u-equivalence for the hypernatural numbers *N.
By means of elementary conditions on coefficients, we isolate a large class of Fermat-like Diophantine equations that are not partition regular, the simplest examples being $x^n+y^m=z^k$ with $k\notin\{n,m\}$.
A set A of natural numbers is finitely embeddable in another such set B if every finite subset of A has a rightward translate that is a subset of B. This notion of finite embeddability arose in combinatorial number theory, but in this paper we study it in its own right. We also study a related notion of finite embeddability of ultrafilters on the natural numbers. Among other results, we obtain connections between finite embeddability and the algebraic and topological structure of the Stone-Cech compactification of the discrete space of natural numbers. We also obtain connections with nonstandard models of arithmetic.
We show that any subset of the natural numbers with positive logarithmic Banach density contains a set that is within a factor of two of a geometric progression, improving the bound on a previous result of the authors. Density conditions on subsets of the natural numbers that imply the existence of approximate powers of arithmetic progressions are developed and explored.
M. Beiglböck, V. Bergelson, and A. Fish proved that if $G$ is a countable amenable group and $A$ and $B$ are subsets of $G$ with positive Banach density, then the product set $AB$ is piecewise syndetic. This means that there is a finite subset $E$ of $G$ such that $EAB$ is thick, that is, $EAB$ contains translates of any finite subset of $G$. When $G=\mathbb{Z}$, this was first proven by R. Jin. We prove a quantitative version of the aforementioned result by providing a lower bound on the density (with respect to a Følner sequence) of the set of witnesses to the thickness of $% EAB$. When $G=\mathbb{Z}^d$, this result was first proven by the current set of authors using completely different techniques.
We provide a framework for proofs of structural theorems about sets with positive Banach logarithmic density. For example, we prove that if $A\subseteq \mathbb{N}$ has positive Banach logarithmic density, then $A$ contains an approximate geometric progression of any length. We also prove that if $A,B\subseteq \mathbb{N}$ have positive Banach logarithmic density, then there are arbitrarily long intervals whose gaps on $A\cdot B$ are multiplicatively bounded, a multiplicative version Jin's sumset theorem. The main technical tool is the use of a quotient of a Loeb measure space with respect to a multiplicative cut.
In this paper we present a use of nonstandard methods in the theory of ultrafilters and in related applications to combinatorics of numbers.
We consider shifts of a set $A\subseteq\mathbb{N}$ by elements from another set $B\subseteq\mathbb{N}$, and prove intersection properties according to the relative asymptotic size of $A$ and $B$. A consequence of our main theorem is the following: If $A=\{a_n\}$ is such that $a_n=o(n^{k/k-1})$, then the $k$-recurrence set $R_k(A)=\{x\mid |A\cap(A+x)|\ge k\}$ contains the distance sets of arbitrarily large finite sets.
We present some applications of the notion of numerosity to measure theory, including the construction of a non-Archimedean model for the probability of infinite sequences of coin tosses.
Erdős conjectured that for any set $A\subseteq \mathbb{N}$ with positive lower asymptotic density, there are infinite sets $B,C\subseteq \mathbb{N}$ such that $B+C\subseteq A$. We verify Erdős' conjecture in the case that $A$ has Banach density exceeding $\frac{1}{2}$. As a consequence, we prove that, for $A\subseteq \mathbb{N}$ with positive Banach density (a much weaker assumption than positive lower density), we can find infinite $B,C\subseteq \mathbb{N}$ such that $B+C$ is contained in the union of $A$ and a translate of $A$. Both of the aforementioned results are generalized to arbitrary countable amenable groups. We also provide a positive solution to Erdős' conjecture for subsets of the natural numbers that are pseudorandom.
By using nonstandard analysis, we prove embeddability properties of difference sets $A-B$ of sets of integers. (A set $A$ is "embeddable" into $B$ if every finite configuration of $A$ has shifted copies in $B$.) As corollaries of our main theorem, we obtain improvements of results by I.Z. Ruzsa about intersections of difference sets, and of Jin's theorem (as refined by V. Bergelson, H. Fürstenberg and B. Weiss), where a precise bound is given on the number of shifts of $A-B$ which are needed to cover arbitrarily large intervals.
Renling Jin proved that if A and B are two subsets of the natural numbers with positive Banach density, then A+B is piecewise syndetic. In this paper, we prove that, under various assumptions on positive lower or upper densities of A and B, there is a high density set of witnesses to the piecewise syndeticity of A+B. Most of the result are shown to hold more generally for subsets of Z^d. The key technical tool is a Lebesgue density theorem for measure spaces induced by cuts in the nonstandard integers.
Beiglboeck, Bergelson and Fish proved that if subsets A,B of a countable discrete amenable group G have positive Banach densities a and b respectively, then the product set AB is piecewise syndetic, i.e. there exists k such that the union of k-many left translates of AB is thick. Using nonstandard analysis we give a shorter alternative proof of this result that does not require G to be countable, and moreover yields the explicit bound that k is not greater than 1/ab. We also prove with similar methods that if $\{A_i\}$ are finitely many subsets of G having positive Banach densities $a_i$ and G is countable, then there exists a subset B whose Banach density is at least the product of the densities $a_i$ and such that the product $BB^{-1}$ is a subset of the intersection of the product sets $A_i A_i^{-1}$. In particular, the latter set is piecewise Bohr.
By using nonstandard analysis, and in particular iterated hyper-extensions, we give foundations to a peculiar way of manipulating ultrafilters on the natural numbers and their pseudo-sums. The resulting formalism is suitable for applications in Ramsey theory of numbers. To illustrate the use of our technique, we give a (rather) short proof of Milliken-Taylor's Theorem, and a ultrafilter version of Rado's theorem about partition regularity of diophantine equations.
In this paper we introduce the notion of elementary numerosity as a special function defined on all subsets of a given set X which takes values in a suitable non-Archimedean field, and satisfies the same formal properties of finite cardinality. We investigate the relationships between this notion and the notion of measure. The main result is that every non-atomic finitely additive measure is obtained from a suitable elementary numerosity by simply taking its ratio to a unit. In the last section we give applications to this result.
We present a short proof of Jin's theorem which is entirely elementary, in the sense that no use is made of nonstandard analysis, ergodic theory, measure theory, ultrafilters, or other advanced tools. The given proof provides the explicit bound 1/c where c=BD(A)*BD(B) to the number of shifts of A+B that are needed to cover a thick set.
We isolate a new class of ultrafilters on N, called "quasi-selective" because they are intermediate between selective ultrafilters and P-points. (Under the Continuum Hypothesis these three classes are distinct.) The existence of quasi-selective ultrafilters is equivalent to the existence of "asymptotic numerosities" for all sets of tuples of natural numbers. Such numerosities are hypernatural numbers that generalize finite cardinalities to countable point sets. Most notably, they maintain the structure of ordered semiring, and, in a precise sense, they allow for a natural extension of asymptotic density to all sequences of tuples of natural numbers.