Sets in R^d determining k taxicab distances

DOI10.2140/INVOLVE.2020.13.487zbMATH Open1446.52012arXiv1911.08067OpenAlexW2990431409MaRDI QIDQ2192425FDOQ2192425

Olivia Edwards, Anne Marie Loftin, Vajresh Balaji, Alex Rice, Bineyam Tsegaye, Solomon Mcharo, Lo Phillips

Publication date: 17 August 2020

Published in: Involve (Search for Journal in Brave)

Abstract: We address an analog of a problem introduced by ErdH{o}s and Fishburn, itself an inverse formulation of the famous ErdH{o}s distance problem, in which the usual Euclidean distance is replaced with the metric induced by the $el{l}^1$-norm, commonly referred to as the $extittaxicabmetric$. Specifically, we investigate the following question: given $d,kinmathbbN$, what is the maximum size of a subset of $mathbb{R}^d$ that determines at most $k$ distinct taxicab distances, and can all such optimal arrangements be classified? We completely resolve the question in dimension $d=2$, as well as the $k=1$ case in dimension $d=3$, and we also provide a full resolution in the general case under an additional hypothesis.

Full work available at URL: https://arxiv.org/abs/1911.08067

zbMATH Keywords

discrete geometrygeometric combinatorics[https://portal.mardi4nfdi.de/w/index.php?title=+Special%3ASearch&search=Erd%EF%BF%BD%EF%BF%BDs+distance+problem&go=Go Erd��s distance problem]\(\ell_1\) metric

Mathematics Subject Classification ID

Erd?s problems and related topics of discrete geometry (52C10) General theory of distance geometry (51K05)

Cites Work

• On the Erdős distinct distances problem in the plane
• On Sets of Distances of n Points
• Maximum planar sets that determine \(k\) distances
• Uniqueness of maximum planar five-distance sets
• A proof of Erdős-Fishburn's conjecture for \(g(6)=13\)
• Embedding into rectilinear spaces
• Equilateral dimension of the rectilinear space
• Title not available (Why is that?)

Cited In (4)

• Distinct distances with \(\ell_p\) metrics
• Distinct Distances in Three and Higher Dimensions
• A reduction for the distinct distances problem in \(\mathbb{R}^d\)
• Distinct distances in homogeneous sets in Euclidean space

This page was built for publication: Sets in \(\mathbb{R}^d\) determining \(k\) taxicab distances

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2192425)