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 79 tok/s
Gemini 2.5 Pro 41 tok/s Pro
GPT-5 Medium 25 tok/s Pro
GPT-5 High 23 tok/s Pro
GPT-4o 99 tok/s Pro
Kimi K2 199 tok/s Pro
GPT OSS 120B 444 tok/s Pro
Claude Sonnet 4 36 tok/s Pro
2000 character limit reached

Borsuk's partition problem in four-dimensional $\ell_{p}$ space (2206.15277v2)

Published 30 Jun 2022 in math.MG

Abstract: In 1933, Borsuk made a conjecture that every $n$-dimensional bounded set can be divided into $n+1$ subsets of smaller diameter. Up to now, the problem is still open for $4\leq n\leq 63$. In this paper, we firstly discuss the Banach-Mazur distance between the $n$-dimensional cube and the $\ell_{p}$ ball $(1\leq p< 2)$, then we study the generalized Borsuk's partition problem in metric spaces and prove that all bounded sets $X$ in every four-dimensional $\ell_{p}$ space can be divided into $24$ subsets of smaller diameter.

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 (2)

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

Collections

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