[in preparation] Gómez, S., González, I., Hansberg, A., Matos-Wiederhold, T., Amoeba trees, 2025+.
This paper proves that zero-dimensional spaces are homeomorphically determined by the isomorphism class of their lattice of uniform topologies. The general case for completely regular spaces is Problem 3.18.
In this paper, it is proved that if you color the complete graph on the reals in a Baire-measurable fashion where each color class is non-meager, you can find a color-consistent member of a family of graphs where each blown-up clique is a Cantor set. The Lebesgue-measure analog of this (non-meager is replaced by non-null) is unknown, and some hints are provided in the paper.
Is there a locally checkable problem that admits a Lebesgue-measurable solutions but no Baire-measurable ones? Problem 2.14.
Is the (un-pointed) Cantor topological conjugacy relation Borel? How complex is it? [Solved, it is Borel, 2023+].
A Ramsey-like result for small-dimensional simplices is proved here. The general case for higher dimensions is unknown and likely uses different techniques.
Page 6 of this proves that there are 2-adequate patterns mod m and Lemma 1 of this paper proves there are n-adequate patterns mod 2. When are there n-patterns mod m?
Any finite coloring of the integers produces monochromatic sets of the form {x, y, xy, x+y}. [Solved in 2022].
We leveraged advancements in Graph Neural Networks to optimize a noisy communication network with machine learning to estimate its Shannon capacity. With a masters student at Brandeis. GitHub repo.
As Research Advisor, guided a HS student in developing a Python library for Ramsey-theoretical functions and presenting our project at the Canadian Undergraduate Mathematics Conference, significantly contributing to her acceptance into Brown University.
With a HS student, rediscovered a theorem in graph Ramsey theory.
With an undergrad at UofT, we study graph automorphism groups.
With an undergrad at UofT, we studied variants of colored group actions on graphs and their uses.
Masters student at the University of Genoa. Software engineering.
Under the supervision of Dr. Gergely Ambrus (Alfréd Rényi Institute of Mathematics), we solved a problem about transversal properties of families of convex sets. The presentation with an MIT grad student won a honorary mention at the XXXVI Coloquio Víctor Neumann Lara.