Vol. 13, No. 3, 2020

Download this article
Download this article For screen
For printing
Recent Issues

Volume 17, 1 issue

Volume 16, 5 issues

Volume 15, 5 issues

Volume 14, 5 issues

Volume 13, 5 issues

Volume 12, 8 issues

Volume 11, 5 issues

Volume 10, 5 issues

Volume 9, 5 issues

Volume 8, 5 issues

Volume 7, 6 issues

Volume 6, 4 issues

Volume 5, 4 issues

Volume 4, 4 issues

Volume 3, 4 issues

Volume 2, 5 issues

Volume 1, 2 issues

The Journal
About the Journal
Editorial Board
Editors’ Interests
Subscriptions
 
Submission Guidelines
Submission Form
Policies for Authors
Ethics Statement
 
ISSN: 1944-4184 (e-only)
ISSN: 1944-4176 (print)
Author Index
Coming Soon
 
Other MSP Journals
This article is available for purchase or by subscription. See below.
Sets in $\mathbb{R}^d$ determining $k$ taxicab distances

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

Vol. 13 (2020), No. 3, 487–509
Abstract

We address an analog of a problem introduced by Erdős and Fishburn, itself an inverse formulation of the famous Erdős distance problem, in which the usual Euclidean distance is replaced with the metric induced by the 1-norm, commonly referred to as the taxicab metric. Specifically, we investigate the following question: given d,k , what is the maximum size of a subset of 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.

PDF Access Denied

We have not been able to recognize your IP address 18.217.183.76 as that of a subscriber to this journal.
Online access to the content of recent issues is by subscription, or purchase of single articles.

Please contact your institution's librarian suggesting a subscription, for example by using our journal-recom­mendation form. Or, visit our subscription page for instructions on purchasing a subscription.

You may also contact us at contact@msp.org
or by using our contact form.

Or, you may purchase this single article for USD 30.00:

Keywords
Erdős distance problem, taxicab metric, discrete geometry, geometric combinatorics
Mathematical Subject Classification 2010
Primary: 52C10
Milestones
Received: 5 December 2019
Revised: 14 May 2020
Accepted: 23 May 2020
Published: 14 July 2020

Communicated by Anant Godbole
Authors
Vajresh Balaji
Department of Mathematics
Millsaps College
Jackson, MS
United States
Olivia Edwards
Department of Mathematics
Millsaps College
Jackson, MS
United States
Anne Marie Loftin
Department of Mathematics
Millsaps College
Jackson, MS
United States
Solomon Mcharo
Department of Mathematics
Millsaps College
Jackson, MS
United States
Lo Phillips
Department of Mathematics
Millsaps College
Jackson, MS
United States
Alex Rice
Department of Mathematics
Millsaps College
Jackson, MS
United States
Bineyam Tsegaye
Department of Mathematics
Millsaps College
Jackson, MS
United States