On the Perelman-Pukhov quotient of successive radii: better and asymptotically optimal bounds
Pith reviewed 2026-06-30 03:20 UTC · model grok-4.3
The pith
The Perelman-Pukhov quotient of successive radii is bounded strictly below i+1 for several (n,i) pairs, with the correct order in n when i equals n minus a fixed constant.
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
Core claim
Perel'man and Pukhov proved the quotient is at most i+1. The paper shows the quotient is at most a strictly smaller value than i+1 in the cases i=3 for 4≤n≤8, i=4 for n=5 and 6, i=5 for n=6, i=6 for n=7, and for all i ≥ n - Θ(log n). The new bounds have the correct order of growth with n when i = n - m for any fixed m and n growing. The n=5 i=3 case receives an additional improvement by refining an earlier idea and using the optimal lower bound on the inradius in three dimensions in terms of circumradius and diameter.
What carries the argument
Relations that connect successive inner and outer radii to the diameter and minimal width of the convex body, with an extra application of the optimal three-dimensional inradius lower bound in the n=5 i=3 case.
If this is right
- For i=3 the quotient is bounded by a number strictly less than 4 when the dimension is between 4 and 8.
- Analogous strict improvements hold for the other listed small values of (n,i).
- When i equals n minus a fixed m the upper bound grows linearly with n, which is the right order.
- The n=5 i=3 case admits an even smaller explicit bound coming from three-dimensional geometry.
Where Pith is reading between the lines
- The same diameter-and-width technique could be checked on other radius sequences to see whether similar sharpenings appear.
- Numerical sampling of convex bodies in dimensions 4 to 8 could reveal how close the new bounds are to being attained.
- The fact that the order is optimal when i is n minus constant suggests the classical bound cannot be improved by more than a constant factor in that regime.
Load-bearing premise
The derivations rely on the auxiliary inequalities that link successive radii to diameter and minimal width being sufficiently tight, and on the three-dimensional inradius bound being optimal for the n=5 i=3 case; if those relations are weaker than assumed, the claimed improvements do not hold.
What would settle it
A convex body in dimension 4 for which the ratio of the second successive outer radius to the third successive inner radius meets or exceeds the paper's stated new upper bound would falsify the improvement in that case.
read the original abstract
Perel'man in 1987 and independently Pukhov in 1979 proved that the quotient between the $(n-i+1)$-th successive outer radius and the $i$-th successive inner radius of a convex body in $n$-dimensions is not larger than $i+1$. Apart from the solved cases by Jung 1901 $(i=1)$ and Steinhagen 1921 $(i=n)$, only Perel'man (1987, $n=3$, $i=2$) and Gonz\'alez Merino (2017, $n\geq 4$, $i=2$ and $i=n-1$) provided small improvements that beat this bound. In this paper, we obtain sharper inequalities using relations between these inner and outer measures with the diameter and minimal width. We improve the current bounds in the following cases: $i=3$ when $4\leq n \leq 8$, $i=4$ when $n=5$, $6$, $i=5$ when $n=6$, $i=6$ when $n=7$, and for every $i\geq n-\Theta(\log n)$. Notably, our bounds provide the right order in $n$ when $i=n-m$, with $m$ constant and $n$ arbitrarily large. Additionally, we improve the case $n=5$, $i=3$ even further by refining an idea of Perel'man and using the optimal lower bound of the inradius in terms of the circumradius and the diameter in 3-space (see [7]).
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The manuscript establishes improved upper bounds, strictly less than i+1, on the Perelman-Pukhov quotient between the (n-i+1)-th successive outer radius and the i-th successive inner radius of convex bodies in R^n. The improvements are obtained by relating the successive radii to the diameter and minimal width (with an additional refinement for the n=5, i=3 case that imports the optimal 3D inradius bound from reference [7]). The paper also derives bounds of the correct order in n when i = n-m for fixed m and n large.
Significance. If the derivations hold, the results advance convex geometry by supplying the first explicit improvements beyond the classical Jung, Steinhagen, Perelman, and González Merino cases in several dimensions, together with the first asymptotically sharp order for fixed codimension m. The approach relies on inequality chaining from established facts rather than parameter fitting, which strengthens the contribution when the auxiliary relations apply as stated.
minor comments (3)
- [Abstract and §1] The abstract and introduction would benefit from an explicit table or list of the new numerical bounds for each (n,i) pair rather than only describing the ranges of improvement.
- [§3 and §4] Notation for the successive radii R_k and r_k should be recalled or referenced at the start of each proof section to aid readability.
- [§2] The dependence on the minimal-width and diameter inequalities (cited from prior literature) could be stated more explicitly when they are first invoked, including the precise constants used.
Simulated Author's Rebuttal
We thank the referee for the positive assessment of the manuscript, the recognition of its significance in advancing bounds on Perelman-Pukhov quotients, and the recommendation for minor revision. No major comments were raised in the report.
Circularity Check
No circularity: bounds derived from external geometric inequalities
full rationale
The paper improves Perelman-Pukhov bounds by chaining relations between successive radii, diameter, and minimal width, plus one external 3D inradius result from reference [7]. No step reduces a claimed bound to a fitted parameter on the same data, a self-definition, or a load-bearing self-citation whose content is unverified. Prior self-citations (e.g., González Merino 2017) address only previously solved cases and are not invoked to justify the new inequalities. The derivation chain is therefore self-contained against independent geometric facts.
Axiom & Free-Parameter Ledger
Reference graph
Works this paper leans on
-
[1]
A., Saor\'in G\'omez, E
Abardia-Ev\'equoz, J., Hern\'andez Cifre, M. A., Saor\'in G\'omez, E. Mean projection and section radii of convex bodies. Acta Math. Hung. 155 (2018), no. 1, 89--103
2018
-
[2]
A., Prochno, J
Alonso-Guti\'errez, D., Dafnis, N., Hern\'andez Cifre, M. A., Prochno, J. On mean outer radii of random polytopes. Indiana Univ. Math. J. 63 (2014), no. 2, 579--595
2014
-
[3]
Ellipsoids of maximal volume in convex bodies
Ball, K. Ellipsoids of maximal volume in convex bodies. Geom. Dedicata 41 (1992), no. 2, 241--250
1992
-
[4]
Estimating sizes of a convex body by successive diameters and widths
Betke, U., Henk, M. Estimating sizes of a convex body by successive diameters and widths. Mathematika 39 (1992), no. 2, 247--257
1992
-
[5]
A generalization of Steinhagen’s theorem
Betke, U., Henk, M. A generalization of Steinhagen’s theorem. Abh. Math. Sem. Univ. Hamburg. 63 (1993), no. 1, 165--176
1993
-
[6]
Radii of regular polytopes
Brandenberg, R. Radii of regular polytopes. Discr. Comput. Geom. 33 (2005), no. 1, 43--55
2005
-
[7]
Brandenberg, R., Gonz\'alez Merino, B., Runge, M. A complete system of inequalities for the diameter, in-, and circumradius in the 3-dimensional Euclidean space. arxiv:2509.05028
-
[8]
No dimension independent core-sets for containment under homothetics
Brandenberg, R., König, S. No dimension independent core-sets for containment under homothetics. Discr. Comput. Geom. 49 (2013), no. 1, 3--21
2013
-
[9]
Radii minimal projections of polytopes and constrained optimization of symmetric polynomials
Brandenberg, R., Theobald, T. Radii minimal projections of polytopes and constrained optimization of symmetric polynomials. Adv. Geom. 6 (2006), no. 1, 71--83
2006
-
[10]
Gelfand numbers and metric entropy of convex hulls in Hilbert spaces
Carl, B., Hinrichs, A., Pajor, A. Gelfand numbers and metric entropy of convex hulls in Hilbert spaces. Positivity 17 (2013), no. 1, 171--203
2013
-
[11]
Successive radii and Orlicz Minkowski sum
Chen, F., Tang, C., Luo, M. Successive radii and Orlicz Minkowski sum. Monatsh. Math. 179 (2016), no. 2, 201--219
2016
-
[12]
An extension of Jung’s theorem
Dekster, B. An extension of Jung’s theorem. Israel J. Math. 50 (1985), no. 3, 169--180
1985
-
[13]
On the ratio between successive radii of a symmetric convex body
González Merino, B. On the ratio between successive radii of a symmetric convex body. Math. Inequal. Appl. 16 (2013), no. 2, 569--576
2013
-
[14]
Improving bounds for the Perel'man-Pukhov quotient for inner and outer radii
Gonz\'alez Merino, B. Improving bounds for the Perel'man-Pukhov quotient for inner and outer radii. J. Convex Anal. 24 (2017), no. 4, 1099--1116
2017
-
[15]
On successive radii of p-sums of convex bodies
González Merino, B., Hernández Cifre, M.A. On successive radii of p-sums of convex bodies. Adv. Geom. 14 (2014), no. 1, 117--128
2014
-
[16]
Successive radii and Minkowski addition
González Merino, B., Hernández Cifre, M.A. Successive radii and Minkowski addition. Monatsh. Math. 166 (2012), no. 3-4, 395--409
2012
-
[17]
Successive radii of families of convex bodies
González Merino, B., Hernández Cifre, M.A., Hinrichs, A. Successive radii of families of convex bodies. Bull. Aust. Math. Soc. 91 (2015), no. 2, 331--344
2015
-
[18]
Inner and outer j-radii of convex bodies in finite-dimensional normed spaces
Gritzmann, P., Klee, V. Inner and outer j-radii of convex bodies in finite-dimensional normed spaces. Discrete Comput. Geom. 7 (1992), no. 3, 255--280
1992
-
[19]
Computational complexity of inner and outer j-radii of polytopes in finite-dimensional normed spaces
Gritzmann, P., Klee, V. Computational complexity of inner and outer j-radii of polytopes in finite-dimensional normed spaces. Math. Program. 59 (1993), no. 1, 163--213
1993
-
[20]
A generalization of Jung's theorem
Henk, M. A generalization of Jung's theorem. Geom. Dedicata 42 (1992), no. 2, 235--240
1992
-
[21]
Intrinsic volumes and successive radii
Henk, M., Hernández Cifre, M.A. Intrinsic volumes and successive radii. J. Math. Anal. Appl. 343 (2008), no. 2, 733--742
2008
-
[22]
Successive minima and radii
Henk, M., Hernández Cifre, M.A. Successive minima and radii. Canad. Math. Bull. 52 (2009), no. 3, 380--387
2009
-
[23]
Successive radii and ball operators in generalized Minkowski spaces
Jahn, T. Successive radii and ball operators in generalized Minkowski spaces. Adv. Geom. 17 (2017), no. 3, 347--354
2017
-
[24]
Über die kleinste Kugel, die eine räumliche Figur einschließt
Jung, H. Über die kleinste Kugel, die eine räumliche Figur einschließt. J. Reine Angew. Math. 123 (1901), 241--257
1901
-
[25]
Mean radii of symmetrizations of a convex body
Lombardi, N., Saor\'in G\'omez, E. Mean radii of symmetrizations of a convex body. Beitr. Alg. Geom. 65 (2024), no. 2, 415--440
2024
-
[26]
Perelman, G. Y. On the k -radii of a convex body. (Russian) Sibirsk. Mat. Zh. 28 (1987), no. 4, 185--186. English translation: Siberian Math. J. 28 , (1987), no. 4, 665--666
1987
-
[27]
n-widths in approximation theory
Pinkus, A. n-widths in approximation theory. Ergebnisse der Mathematik und ihrer Grenzgebiete (3) [Results in Mathematics and Related Areas (3)], 7, Springer-Verlag, Berlin, 1985
1985
-
[28]
Pukhov, S. V. Inequalities for the Kolmogorov and Bernstein widths in Hilbert space. (Russian) Mat. Zametki. 25 (1979), no. 4, 619--628, 637. English translation: Math. Notes. 25 (1979), no. 4, 320--326
1979
-
[29]
Sobre los sistemas completos de desigualdades entre tres elementos de una figura convexa planas
Santal\'o, L. Sobre los sistemas completos de desigualdades entre tres elementos de una figura convexa planas. Math. Notes 17 (1961), 82--104
1961
-
[30]
Über die größte Kugel in einer konvexen Punktmenge Abh
Steinhagen, P. Über die größte Kugel in einer konvexen Punktmenge Abh. Hamb. Sem. 1 (1921), 15--26
1921
- [31]
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.