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
-norm, commonly
referred to as the
taxicab metric. Specifically, we investigate the following question: given
, what is the maximum
size of a subset of
that
determines at most
distinct taxicab distances, and can all such optimal arrangements
be classified? We completely resolve the question in
dimension , as
well as the
case
in dimension
,
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
44.192.115.114
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-recommendation form.
Or, visit our
subscription page
for instructions on purchasing a subscription.