Papers
Topics
Authors
Recent
Assistant
AI Research Assistant
Well-researched responses based on relevant abstracts and paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses.
Gemini 2.5 Flash
Gemini 2.5 Flash 78 tok/s
Gemini 2.5 Pro 58 tok/s Pro
GPT-5 Medium 35 tok/s Pro
GPT-5 High 28 tok/s Pro
GPT-4o 78 tok/s Pro
Kimi K2 218 tok/s Pro
GPT OSS 120B 465 tok/s Pro
Claude Sonnet 4.5 35 tok/s Pro
2000 character limit reached

Simplicial isometric embeddings of indefinite metric polyhedra (1211.0584v5)

Published 3 Nov 2012 in math.MG

Abstract: In this paper, isometric embedding results of Greene, Gromov and Rokhlin are extended to what are called "indefinite metric polyhedra". Two definitions for an indefinite metric polyhedron are given, an intuitive definition and a more useful definition. The more useful definition is used to show that every indefinite metric polyhedron (with the maximal degree of every vertex bounded above) admits a simplicial isometric embedding into Minkowski space of an appropriate signature. This result is then used to show that the two definitions coincide. A simple example is given to show that the dimension bounds in the compact case are essentially sharp. Finally it is shown that if we relax our embedding conditions to be pl instead of simplicial, then the necessary dimension bounds can be reduced to a surprisingly low signature.

Summary

We haven't generated a summary for this paper yet.

Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.