Refuting Dovgoshey–Rovenska Conjecture 4.2, arXiv:2610.11596v1, Section 4, p. 13: sharp bounds and corollaries of Petrov (2022) and Dovgoshey et al. (2026)
We refute Conjecture 4.2 in Section 4, p. 13, of Dovgoshey and Rovenska, arXiv:2610.11596v1, extend their (2026) central-edge bounds, and derive companion corollaries from Petrov's (2022) homogeneous-tree characterization and Dovgoshey et al.'s (2026) perfect-binary-tree theorem. A four-point ultrametric has six central edges against four in a metric. For every n >= 4, the three-central minima are 2 ceil(n/2) over metrics and 2n - 4 + ceil(n/2) over ultrametrics. Conjecture 4.1 is corrected to orders 1 and even; Problem 4.3 has minimum order 1 for k=1, k for even k, and k+1 for odd k >= 3. Earlier counterexamples to Conjecture 4.1 by Love (2023) and Bargetz et al. (2024) are credited. For every feasible pair with n >= 3, the metric edge minimum is (k-1) ceil(n/2). The tree corollaries give the isometry groups and sphere counts of minimum-order ultrametrics, with explicit coverage of the related questions.
Authors
- Wenlin Zhang (ORCID: https://orcid.org/0009-0005-2414-7968)
- Haobo Ma
Institutions
- National University of Singapore (SG)
Publication Details
- Journal
- Zenodo (CERN European Organization for Nuclear Research)
- Published
- 2026-11-19
- DOI
- https://doi.org/10.5281/zenodo.24369117
- Primary Topic
- p-Adic Analysis and Mathematical Physics
- Type
- preprint