Pablo Soberon Bravo
CUNY Bernard M Baruch College, NY·Mathematics & Statistics·Early-career
Many problems in computing and combinatorics, the mathematics of counting and arrangements, can be turned into geometry problems. For example, a data set can become a collection of points or lines in the plane.
- Fields
Mathematics & Statistics
Computer Science
- Topics
discrete geometry
combinatorics
topology
- Grants
- 1 known grant, through May 2029
What they work on
- Show that high-dimensional mass partition problems, such as the Stone-Tukey theorem on cutting several objects into equal halves at once, are deeply connected to fair partition problems such as envy-free division.
- Connect mass partition results with problems about how convex sets intersect, explaining why key results in these areas rely on similar equivariant topology methods.
- Develop new ways to use topological tools to solve combinatorial problems, and apply these geometric results to computational problems in supervised learning.
- Establish a program that prepares students from minoritized groups for summer research opportunities in mathematics.
More about the research
Studying the structure of finite collections of geometric shapes then helps solve the original problem. Surprisingly, many advances in this area use equivariant topology, which studies shapes and their symmetries and seems at first to have little to do with the original problem.
Why it matters
This is mainly basic mathematics. It could show why topology works so well for solving geometric and combinatorial problems and connect several fields. The project lists computational applications in supervised learning, a part of machine learning, where geometric partition results may help analyze data. Its preparation program may also widen access to math research for students from minoritized groups.
Known grants
From NIH and NSF research grants. Labs often have other funding we can't see.
Closest labs
Bhargav Narayanan
Rutgers University-New Brunswick, NJ·Mathematics & Statistics·Early-career
Study up-sets and down-sets in the Boolean hypercube from a probabilistic viewpoint, where they encode events of interest in probabilistic combinatorics and statistical physics.
Damir Dzhafarov
University of Connecticut, CT·Mathematics & Statistics
Determine the computability-theoretic and reverse-mathematical strength of Milliken's tree theorem, a generalization of Ramsey's theorem from structural Ramsey theory, by resolving fundamental open questions about it.
Jesus De Loera
University of California-Davis, CA·Mathematics & Statistics
Study slices and shadows of polytopes, meaning their cross-sections and projections, using enumerative and extremal combinatorics with computer-aided experimentation.
The school
CUNY Bernard M Baruch College: 1 labs on PI Pages, $6M a year on research.
Reach out
A start for your email. Fill in the brackets.