Mariaclara Ragosta
Mariaclara Ragosta has a total of 4 co-authors. Here are the top co-authors by number of shared publications:
- Mauro Di Nasso
Dipartimento di Matematica, Università di Pisa, Largo Bruno Pontecorvo 5, 56127 Pisa, Italy
3 shared publications - Lorenzo Luperi Baglini
Dipartimento di Matematica Università di Milano via Saldini 50 20133 Milano Italy
1 shared publication Moreno Pierobon
Università di Pisa
1 shared publication- Rosario Mennuni
DIPARTIMENTO DI MATEMATICA UNIVERSIT À DI MILANO VIA SALDINI 50 20133 MILANO ITALY
1 shared publication
Latest Publications
- 6 October 2023
- Published by American Mathematical Society (AMS) in Proceedings of the American Mathematical Society
- Vol. 152 (1) , 81-87
Monochromatic exponential triples: An ultrafilter proof
We present a short ultrafilter proof of the existence of monochromatic exponential triples { a , b , b a } \{a, b, b^a\} in any finite coloring of the natural numbers. We then generalize the construction and prove a new result on the existence of infinite monochromatic exponential patterns.
- 6 October 2023
- Published by American Mathematical Society (AMS) in Proceedings of the American Mathematical Society
- Vol. 152 (1) , 81-87
Monochromatic exponential triples: An ultrafilter proof
We present a short ultrafilter proof of the existence of monochromatic exponential triples { a , b , b a } \{a, b, b^a\} in any finite coloring of the natural numbers. We then generalize the construction and prove a new result on the existence of infinite monochromatic exponential patterns.
- Open Access
- 17 July 2023
- Published by Cambridge University Press (CUP) in The Journal of Symbolic Logic
- Vol. 90 (3) , 1180-1197
SELF-DIVISIBLE ULTRAFILTERS AND CONGRUENCES IN $\beta {\mathbb {Z}}$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.- 17 July 2023
- Published by Cambridge University Press (CUP) in The Journal of Symbolic Logic
- Vol. 90 (3) , 1180-1197
Open AccessSELF-DIVISIBLE ULTRAFILTERS AND CONGRUENCES IN $\beta {\mathbb {Z}}$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. - Open Access
Central sets and infinite monochromatic exponential patterns
We use the combinatorial properties of central sets to prove a result about the existence of exponential monochromatic patterns, in the style of Hindman's Finite Sums Theorem. More precisely, we prove that for every finite coloring of the natural numbers there exists an infinite sequence such that all suitable exponential configurations originating from its distinct elements are monochromatic, including towers of exponentiations. (Some restrictions apply on the order in which elements are considered.)
Open AccessCentral sets and infinite monochromatic exponential patterns
We use the combinatorial properties of central sets to prove a result about the existence of exponential monochromatic patterns, in the style of Hindman's Finite Sums Theorem. More precisely, we prove that for every finite coloring of the natural numbers there exists an infinite sequence such that all suitable exponential configurations originating from its distinct elements are monochromatic, including towers of exponentiations. (Some restrictions apply on the order in which elements are considered.)