From the 1 of 4 linked papers with an AI index.
4 papers
Nonempty interior of pinned distance and tree sets
Tainara Borges, Benjamin Foster, Yumeng Ou +1
The authors establish new dimensional thresholds under which a compact set in the plane has a point whose pinned distance set contains an interval, improving previous results and e…
From weighted paraboloid restriction to -stars and distance graphs
Tainara Borges, Yumeng Ou, Marcus Pasquariello
In this paper, we study pinned -star distance sets associated to compact subsets of , . For pins , the pinned -star distance set is…
On volume vectors determined by hypergraphs in thin subsets of Euclidean space
Tainara Borges, Ben Foster, Yumeng Ou +2
Generalizing the Falconer distance problem, the authors of this paper recently established the first non-trivial dimensional threshold for any distance graph in high enough of a di…
Falconer-type results for any finite graph with multiple pins
Tainara Borges, Ben Foster, Yumeng Ou +2
A generalization of the celebrated Falconer distance problem asks for a graph , with vertex set and edge set , how large the…