Skip to main content

Rigidity of the Equidistant Metric

  • Chapter
Book cover Geometry of Cuts and Metrics

Part of the book series: Algorithms and Combinatorics ((AC,volume 15))

  • 1083 Accesses

Abstract

In this chapter we study h-rigidity of the equidistant metric 2t 1 n for n, t integers, n ≥ 3, t ≥ 1. As was already mentioned, 2t 1 n is hypercube embeddable. Indeed, a hypercube embedding of 2t 1 n is obtained by labeling the n points by pairwise disjoint sets, each of cardinality t.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Deza, M.M., Laurent, M. (1997). Rigidity of the Equidistant Metric. In: Geometry of Cuts and Metrics. Algorithms and Combinatorics, vol 15. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04295-9_22

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-04295-9_22

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-04294-2

  • Online ISBN: 978-3-642-04295-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics