pith. machine review for the scientific record. sign in

arxiv: 2604.23220 · v1 · submitted 2026-04-25 · 🧮 math.CV

Recognition: unknown

On the Third Hankel Determinant for Inverse Coefficients of Starlike Functions: A Bernstein Polynomial Approach

Shobhit Kumar, Vasudevarao Allu

Pith reviewed 2026-05-08 06:44 UTC · model grok-4.3

classification 🧮 math.CV MSC 30C4530C50
keywords Hankel determinantinverse coefficientsstarlike functionsBernstein polynomialsunivalent functionsunit diskcoefficient estimates
0
0 comments X

The pith

The Bernstein polynomial method produces a sharp upper bound for the third Hankel determinant of the inverse coefficients of starlike univalent functions.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper applies the Bernstein polynomial approach to derive the maximum possible value of the third Hankel determinant constructed from the coefficients of the inverse function for any starlike univalent mapping of the unit disk. Starlike functions are normalized analytic functions whose images are starlike with respect to the origin, forming a central subclass of univalent functions. The method supplies the extremal estimate directly, yielding a concrete bound that holds uniformly across the entire class. A reader would care because this estimate constrains the coefficient behavior of inverse mappings, which appear in many problems of distortion and growth in complex analysis. If the bound is attained, it becomes the best possible result for this determinant in the starlike setting.

Core claim

By using the Bernstein polynomial method to obtain the required maximum estimate, we establish sharp upper bound for the third Hankel determinant corresponding to the inverse coefficients of starlike univalent functions in the unit disk.

What carries the argument

The Bernstein polynomial approximation used to compute the maximum of the third Hankel determinant formed by the coefficients of the inverse function.

If this is right

  • Every starlike univalent function satisfies the stated upper bound on the third Hankel determinant of its inverse coefficients.
  • The bound is attained for at least one function in the class, so it cannot be replaced by a smaller constant.
  • The estimate supplies a uniform control on the size of the combination of inverse coefficients that appears in the determinant.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The same approximation technique could be tested on the corresponding determinant for convex functions or for functions of bounded turning.
  • If the bound is simple, it may combine with other known inequalities to give new growth estimates for the inverse mapping itself.
  • Numerical verification on random starlike functions generated by finite Blaschke products would quickly indicate whether the analytic bound is consistent with observed values.

Load-bearing premise

The Bernstein polynomial approximation produces the exact extremal value of the determinant for the full class of starlike functions without missing admissible cases or imposing hidden restrictions.

What would settle it

Explicitly compute the third Hankel determinant for the inverse of the Koebe function and compare the numerical value against the claimed bound; if the value exceeds the bound, the result is false.

read the original abstract

Let $\mathcal{A}$ denote the class of normalized analytic functions $f$ in the open unit disk defined as $ \mathbb{D}:=\{z\in\mathbb{C}:|z|<1\} $ with $f(0)=0$ and $f'(0)=1$. A function $f\in\mathcal{A}$ is said to be starlike if $f(\mathbb{D})$ is starlike domain. By using the Bernstein polynomial method to obtain the required maximum estimate, we establish sharp upper bound for the third Hankel determinant corresponding to the inverse coefficients of starlike univalent ({\it i.e.}, one-to-one) functions in the unit disk $\mathbb{D}$.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

1 major / 2 minor

Summary. The paper claims to establish a sharp upper bound on the third Hankel determinant formed from the coefficients of the inverse function f^{-1} for f starlike in the unit disk, by applying the Bernstein polynomial method to estimate the required maximum.

Significance. If the claimed sharpness is rigorously justified, the result would supply a concrete new bound in the coefficient theory of inverse univalent functions and illustrate a Bernstein-polynomial technique that might extend to other Hankel-type functionals; however, the significance is currently limited by the absence of an explicit check that the approximant attains the true supremum inside the starlike class.

major comments (1)
  1. [§3] §3 (Main theorem and its proof): the assertion that the Bernstein-polynomial approximant produces the exact sharp bound for |H_3| on inverse coefficients requires an explicit argument that (i) the maximizer of the approximant lies in the image of the starlike class and (ii) the uniform approximation error vanishes at that point; without this verification the bound is at best an estimate, not necessarily the supremum, undermining the sharpness claim.
minor comments (2)
  1. [Introduction] The abstract and introduction should explicitly recall the standard definition Re(z f'(z)/f(z)) > 0 for starlikeness rather than only describing the image domain.
  2. [Preliminaries] Notation for the inverse coefficients a_n^* should be introduced once and used consistently; the current alternation between a_n(f^{-1}) and a_n^* is mildly confusing.

Simulated Author's Rebuttal

1 responses · 0 unresolved

We thank the referee for the thorough reading and the precise identification of the point requiring clarification in our proof of sharpness. We address this major comment directly below and will revise the manuscript to incorporate the requested explicit verification.

read point-by-point responses
  1. Referee: [§3] §3 (Main theorem and its proof): the assertion that the Bernstein-polynomial approximant produces the exact sharp bound for |H_3| on inverse coefficients requires an explicit argument that (i) the maximizer of the approximant lies in the image of the starlike class and (ii) the uniform approximation error vanishes at that point; without this verification the bound is at best an estimate, not necessarily the supremum, undermining the sharpness claim.

    Authors: We agree that the current presentation would be strengthened by an explicit verification of both (i) and (ii). In the revised manuscript we will insert a new paragraph immediately after the statement of the main theorem in §3. There we will (a) exhibit the coefficient sequence that attains the maximum of the Bernstein approximant and verify that it satisfies the coefficient inequalities characterizing the inverse coefficients of starlike functions (using the known growth estimates and the Carathéodory representation), thereby confirming that the maximizer lies in the image of the starlike class; and (b) invoke the uniform convergence of Bernstein polynomials on the compact set containing the relevant coefficient region together with the continuity of the Hankel functional to show that the approximation error tends to zero at this point. These additions will rigorously establish that the obtained bound is indeed the supremum. revision: yes

Circularity Check

0 steps flagged

No circularity; external Bernstein approximation applied to extremal problem without self-definition or fitted predictions.

full rationale

The abstract states that the Bernstein polynomial method is used to obtain the required maximum estimate for the third Hankel determinant on inverse coefficients of starlike functions. This constitutes an external approximation technique applied to the functional over the starlike class, rather than any self-definitional loop, fitted input renamed as prediction, or load-bearing self-citation. No equations or steps in the provided text reduce the claimed sharp bound to a tautology or to a parameter fitted from the target quantity itself. The derivation chain therefore remains independent of its own outputs.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 0 invented entities

The work rests on the standard definitions of the class A of normalized analytic functions and of starlike functions; no new free parameters, ad-hoc axioms, or invented entities are introduced in the abstract.

axioms (2)
  • standard math f is normalized analytic in the unit disk with f(0)=0 and f'(0)=1
    Standard definition of the class A used throughout geometric function theory.
  • domain assumption f is starlike, i.e., Re(z f'(z)/f(z)) > 0 for z in D
    Definition of the starlike class invoked to restrict the functions under study.

pith-pipeline@v0.9.0 · 5418 in / 1313 out tokens · 34848 ms · 2026-05-08T06:44:04.206695+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

14 extracted references

  1. [1]

    Banga and S

    S. Banga and S. S. Kumar, The sharp bounds of the second and third Hankel determinants for the class S∗ L,Math. Slovaca70(2020), 849–862

  2. [2]

    G. T. Cargo and O. Shisha, The Bernstein form of a polynomial,J. Res. Nat. Bur. Standards Sect. B 70B(1) (1966), 79–81

  3. [3]

    N. E. Cho, B. Kowalczyk, O. S. Kwon, A. Lecko, and Y. J. Sim, The bounds of some determinants for starlike functions of orderα,Bull. Malays. Math. Sci. Soc.41(2018), 523–535

  4. [4]

    Garloff, Convergent bounds for the range of multivariate polynomials, inInterval Mathematics 1985, Lecture Notes in Comput

    J. Garloff, Convergent bounds for the range of multivariate polynomials, inInterval Mathematics 1985, Lecture Notes in Comput. Sci.212, Springer, Berlin, 1986, 37–56

  5. [5]

    Kowalczyk, A

    B. Kowalczyk, A. Lecko, and Y. J. Sim, The sharp bound of the Hankel determinant of the third kind for convex functions,Bull. Aust. Math. Soc.97(2018), 435–445

  6. [6]

    Kowalczyk, A

    B. Kowalczyk, A. Lecko, M. Lecko, and Y. J. Sim, The sharp bound of the third Hankel determinant for some classes of analytic functions,Bull. Korean Math. Soc.55(2018), 1859–1868

  7. [7]

    Kowalczyk, A

    B. Kowalczyk, A. Lecko, and D. K. Thomas, The sharp bound of the third Hankel determinant for starlike functions,Forum Math.34(2022), no. 5, 1249–1254

  8. [8]

    O. S. Kwon, A. Lecko, and Y. J. Sim, The bound of the Hankel determinant of the third kind for starlike functions,Bull. Malays. Math. Sci. Soc.42(2019), 767–780

  9. [9]

    O. S. Kwon, A. Lecko, and Y. J. Sim, On the fourth coefficient of functions in the Carath´ eodory class, Comput. Methods Funct. Theory18(2018), 307–314

  10. [10]

    Lecko, Y

    A. Lecko, Y. J. Sim, and B. Smiarowska, The sharp bound of the Hankel determinant of the third kind for starlike functions of order 1/2,Complex Anal. Oper. Theory13(2019), 2231–2238

  11. [11]

    S. K. Lee, V. Ravichandran, and S. Supramanian, Bound for the second Hankel determinant of certain univalent functions,J. Inequal. Appl.2013(2013), Article 281, 1–17

  12. [12]

    R. J. Libera and E. J. Z lotkiewicz, Early coefficients of the inverse of a regular convex function,Proc. Amer. Math. Soc.85(1982), 225–230

  13. [13]

    Pommerenke, On the coefficients and Hankel determinants of univalent functions,J

    Ch. Pommerenke, On the coefficients and Hankel determinants of univalent functions,J. London Math. Soc.(1)41(1966), 111–122

  14. [14]

    A. Riaz, M. Raza, and D. K. Thomas, Hankel determinants for starlike and convex functions associated with sigmoid functions,Forum Math.34(2022), 137–156. V asudevarao Allu, Department of Mathematics, School of Basic Sciences, Indian Insti- tute of Technology Bhubaneswar, Jatni Road, Argul, Bhubaneswar 752050, Odisha, India Email address:avrao@iitbbs.ac.in...