Skip to main content
CenXiv.org
This website is in trial operation, support us!
We gratefully acknowledge support from all contributors.
Contribute
Donate
cenxiv logo > math > arXiv:2503.14548

Help | Advanced Search

Mathematics > Metric Geometry

arXiv:2503.14548 (math)
[Submitted on 17 Mar 2025 (v1) , last revised 9 Apr 2025 (this version, v3)]

Title: A very short proof of the Figiel-Lindenstrauss-Milman theorem

Title: Figiel-Lindenstrauss-Milman定理的一个非常短的证明

Authors:Tomer Milo
Abstract: We provide a short proof for the Figiel, Lindenstrauss and Milman inequality regarding the number of vertices and faces of certain polytope, with an explicit bound on the universal constant involved. The proof is completely elementary and avoids any form of Dvoretzky's theorem, as well as the spherical isoperimetric inequality.
Abstract: 我们为关于某一多面体顶点数和面数的Figiel、Lindenstrauss和Milman不等式提供了一个简短的证明,并给出了涉及的普遍常数的一个显式界。 该证明完全初等,避免了Dvoretzky定理的任何形式以及球面上的等周不等式。
Comments: 2 pages
Subjects: Metric Geometry (math.MG)
MSC classes: 52A23
Cite as: arXiv:2503.14548 [math.MG]
  (or arXiv:2503.14548v3 [math.MG] for this version)
  https://doi.org/10.48550/arXiv.2503.14548
arXiv-issued DOI via DataCite

Submission history

From: Tomer Milo [view email]
[v1] Mon, 17 Mar 2025 18:50:39 UTC (4 KB)
[v2] Mon, 24 Mar 2025 19:44:08 UTC (4 KB)
[v3] Wed, 9 Apr 2025 12:45:06 UTC (4 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled
  • View Chinese PDF
  • View PDF
  • HTML (experimental)
  • TeX Source
  • Other Formats
license icon view license
Current browse context:
math.MG
< prev   |   next >
new | recent | 2025-03
Change to browse by:
math

References & Citations

  • NASA ADS
  • Google Scholar
  • Semantic Scholar
a export BibTeX citation Loading...

BibTeX formatted citation

×
Data provided by:

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
IArxiv Recommender (What is IArxiv?)
  • Author
  • Venue
  • Institution
  • Topic

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)
  • About
  • Help
  • contact arXivClick here to contact arXiv Contact
  • subscribe to arXiv mailingsClick here to subscribe Subscribe
  • Copyright
  • Privacy Policy
  • Web Accessibility Assistance
  • arXiv Operational Status
    Get status notifications via email or slack

京ICP备2025123034号