Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Isaac Mabillard

dblp:145/3393 · DBLP profile ↗
← Back
3ranked-venue papers
2as first author
0since 2021 · last 2016
—ORCID · none

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

Theory of computation · 3 · 2 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
3 papers
Combinatorics and discrete mathematics · 61% Computational geometry · 39%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Combinatorics and discrete mathematics
topological combinatorics
0.732016
Eliminating Higher-Multiplicity Intersections, II. The Deleted Product Criterion in the r-Metastable Range · SoCG 2016
On Generalized Heawood Inequalities for Manifolds: A Van Kampen-Flores-type Nonembeddability Result · SoCG 2015
Eliminating Tverberg Points, I. An Analogue of the Whitney Trick · SoCG 2014
Computational geometry › topological data analysis
simplicial complexes
0.212015
On Generalized Heawood Inequalities for Manifolds: A Van Kampen-Flores-type Nonembeddability Result · SoCG 2015
Computational geometry › computational topology
simplicial complex embeddability
0.122016
Eliminating Higher-Multiplicity Intersections, II. The Deleted Product Criterion in the r-Metastable Range · SoCG 2016
Eliminating Tverberg Points, I. An Analogue of the Whitney Trick · SoCG 2014
Computational geometry › topological data analysis
betti numbers
0.112015
On Generalized Heawood Inequalities for Manifolds: A Van Kampen-Flores-type Nonembeddability Result · SoCG 2015

Methods — techniques the papers use, named apart from their topics

haefliger-weber criterion · 0.2volovikov map · 0.2van kampen–flores theorem · 0.2topological methods · 0.2
YearPublicationVenuePosition
2016 Eliminating Higher-Multiplicity Intersections, II. The Deleted Product Criterion in the r-Metastable Range
abstract
Motivated by Tverberg-type problems in topological combinatorics and by classical results about embeddings (maps without double points), we study the question whether a finite simplicial complex K can be mapped into R^d without higher-multiplicity intersections. We focus on conditions for the existence of almost r-embeddings, i.e., maps from K to R^d without r-intersection points among any set of r pairwise disjoint simplices of K. Generalizing the classical Haefliger-Weber embeddability criterion, we show that a well-known necessary deleted product condition for the existence of almost r-embeddings is sufficient in a suitable r-metastable range of dimensions (r d > (r+1) dim K +2). This significantly extends one of the main results of our previous paper (which treated the special case where d=rk and dim K=(r-1)k, for some k> 3).
Isaac Mabillard, Uli Wagner 0001
SoCG1
2015 On Generalized Heawood Inequalities for Manifolds: A Van Kampen-Flores-type Nonembeddability Result
abstract
The fact that the complete graph K_5 does not embed in the plane has been generalized in two independent directions. On the one hand, the solution of the classical Heawood problem for graphs on surfaces established that the complete graph K_n embeds in a closed surface M if and only if (n-3)(n-4) is at most 6b_1(M), where b_1(M) is the first Z_2-Betti number of M. On the other hand, Van Kampen and Flores proved that the k-skeleton of the n-dimensional simplex (the higher-dimensional analogue of K_{n+1}) embeds in R^{2k} if and only if n is less or equal to 2k+2. Two decades ago, Kuhnel conjectured that the k-skeleton of the n-simplex embeds in a compact, (k-1)-connected 2k-manifold with kth Z_2-Betti number b_k only if the following generalized Heawood inequality holds: binom{n-k-1}{k+1} is at most binom{2k+1}{k+1} b_k. This is a common generalization of the case of graphs on surfaces as well as the Van Kampen--Flores theorem. In the spirit of Kuhnel's conjecture, we prove that if the k-skeleton of the n-simplex embeds in a 2k-manifold with kth Z_2-Betti number b_k, then n is at most 2b_k binom{2k+2}{k} + 2k + 5. This bound is weaker than the generalized Heawood inequality, but does not require the assumption that M is (k-1)-connected. Our proof uses a result of Volovikov about maps that satisfy a certain homological triviality condition.
Xavier Goaoc, Isaac Mabillard, Pavel Paták, Zuzana Patáková, Martin Tancer, Uli Wagner 0001
SoCG2
2014 Eliminating Tverberg Points, I. An Analogue of the Whitney Trick
abstract
Motivated by topological Tverberg-type problems, we consider multiple (double, triple, and higher multiplicity) self-intersection points of maps from finite simplicial complexes (compact polyhedra) into Rd, and study conditions under which such multiple points can be eliminated.
Isaac Mabillard, Uli Wagner 0001
SoCG1