Mauro Di Nasso

dblp:46/5103 · DBLP profile ↗
← Back
8ranked-venue papers
7as first author
2since 2021 · last 2025
0000-0001-6103-9775ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 8 · 7 first-author · 2 since 2021
YearPublicationVenuePosition
2025 Foundations of iterated star maps and their use in combinatorics
Mauro Di Nasso, Renling Jin
Ann. Pure Appl. Log.1
2025 SELF-DIVISIBLE ULTRAFILTERS AND CONGRUENCES IN $\beta {\mathbb {Z}}$
abstract
Abstract We introduce self-divisible ultrafilters, which we prove to be precisely those $w$ such that the weak congruence relation $\equiv _w$ introduced by Šobot is an equivalence relation on $\beta {\mathbb Z}$ . We provide several examples and additional characterisations; notably we show that $w$ is self-divisible if and only if $\equiv _w$ coincides with the strong congruence relation $\mathrel {\equiv ^{\mathrm {s}}_{w}}$ , if and only if the quotient $(\beta {\mathbb Z},\oplus )/\mathord {\mathrel {\equiv ^{\mathrm {s}}_{w}}}$ is a profinite group. We also construct an ultrafilter $w$ such that $\equiv _w$ fails to be symmetric, and describe the interaction between the aforementioned quotient and the profinite completion $\hat {{\mathbb Z}}$ of the integers.
Mauro Di Nasso, Lorenzo Luperi Baglini, Rosario Mennuni, Moreno Pierobon, Mariaclara Ragosta
J. Symb. Log.1
2016 High density piecewise Syndeticity of Product Sets in Amenable Groups
abstract
Abstract 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 = ℤ, 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 = ℤ d , this result was first proven by the current set of authors using completely different techniques.
Mauro Di Nasso, Isaac Goldbring, Renling Jin, Steven Leth, Martino Lupini, Karl Mahlburg
J. Symb. Log.1
2006 An Aristotelian notion of size
Vieri Benci, Mauro Di Nasso, Marco Forti
Ann. Pure Appl. Log.2
2003 Combinatorial principle in nonstandard analysis
Mauro Di Nasso, Karel Hrbacek
Ann. Pure Appl. Log.1
2002 An Axiomatic Presentation of The Nonstandard Methods in Mathematics
abstract
Abstract A nonstandard set theory *ZFC is proposed that axiomatizes the nonstandard embedding *. Besides the usual principles of nonstandard analysis, all axioms of ZFC except regularity are assumed. A strong form of saturation is also postulated. *ZFC is a conservative extension of ZFC.
Mauro Di Nasso
J. Symb. Log.1
2001 The generic filter property in nonstandard analysis
Mauro Di Nasso
Ann. Pure Appl. Log.1
1998 Pseudo-Superstructures as Nonstandard Universes
abstract
Abstract A definition of nonstandard universe which gets over the limitation to the finite levels of the cumulative hierarchy is proposed. Though necessarily nonwellfounded, nonstandard universes are arranged in strata in the likeness of superstructures and allow a rank function taking linearly ordered values. Nonstandard universes are also constructed which model the whole ZFC theory without regularity and satisfy the κ-saturation property.
Mauro Di Nasso
J. Symb. Log.1