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

Marguerite Bin

dblp:393/2867 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2026
—ORCID · unresolved

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

Theory of computation · 1 · 1 since 2021

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
1 paper
Computational geometry · 50% Distributed computing theory · 25% Combinatorics and discrete mathematics · 25%

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

TopicWeightPapersLastEvidence papers
Distributed computing theory
combinatorial topology
1.012026
Intersection Patterns of Set Systems on Manifolds with Slowly Growing Homological Shatter Functions · SoCG 2026
Computational geometry › convex geometry › helly-type theorem
fractional helly theorem
1.012026
Intersection Patterns of Set Systems on Manifolds with Slowly Growing Homological Shatter Functions · SoCG 2026
Computational geometry › convex geometry
helly-type theorem
1.012026
Intersection Patterns of Set Systems on Manifolds with Slowly Growing Homological Shatter Functions · SoCG 2026

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

van kampen–flores theorem · 1.0topological combinatorics · 1.0
YearPublicationVenuePosition
2026 Intersection Patterns of Set Systems on Manifolds with Slowly Growing Homological Shatter Functions
abstract
A theorem of Matoušek asserts that for any k ≥ 2, any set system whose shatter function is o(n^k) enjoys a fractional Helly theorem of order k: in the k-wise intersection hypergraph, positive density implies a linear-size clique. Kalai and Meshulam conjectured a generalization of that phenomenon to homological shatter functions. It was verified for set systems with bounded homological shatter functions and whose ground set has a forbidden homological minor (which includes ℝ^d by a homological analogue of the van Kampen-Flores theorem). We present two contributions to this line of research: - We study homological minors in certain manifolds (possibly with boundary), for which we prove analogues of the van Kampen-Flores theorem and of the Hanani-Tutte theorem. - We introduce graded analogues of the Radon and Helly numbers of set systems and relate their growth rate to the original parameters. This allows to extend the verification of the Kalai-Meshulam conjecture to sufficiently slowly growing homological shatter functions.
Sergey Avvakumov, Marguerite Bin, Xavier Goaoc
SoCG2