Skip to content
DraconiticResearch
Search Sources API
197,693 studies31 sourcesUpdated 34 min ago
PreprintarXiv licencearXiv

On Gaussian Curvature of Graphs of Cubic Polynomials

Abstract

The Gaussian curvature of the graphs of cubic polynomials f(z)=(z−a)(z−b)(z−c), with triangle of zeros △=△(a,b,c), is analyzed. We introduce the composed Pythagorean mean B△, a combination of the three classical Pythagorean means, which plays a central role in the description of the critical points of the Gaussian curvature. When △ is not equilateral, the curvature has exactly five critical points: a global maximum at the barycenter, two local minima, and two saddle points, forming a rhombus whose vertices lie on the axes of the Siebeck-Marden ellipse of the triangle. We also initiate a comparative study of B△ with the skew of the triangle by describing a family of polynomials whose zeros determine a specific family of isosceles triangles. The cubic case provides a concrete model strongly suggesting that the critical geometry of the Gaussian curvature of the graph can reveal both analytic and algebraic properties of the underlying holomorphic function.

Related

  1. Deriving Newton's Canonical Forms of Cubic Curves via the Center of Polynomials
    Hua-Lin Huang, Lili Liao, Yu Ye +1
    arXivPreprintCC BY 4.0Full textAlgebra & number theoryarXiv
  2. v-numbers of powers of edge ideals of cubic circulant graphs
    Guangjun Zhu, Jiaxin Li, Yulin Hu
    arXivPreprintCC BY 4.0Full textAlgebra & number theoryarXiv
  3. Least energy sign-changing solutions for asymptotically cubic Kirchhoff equations on locally finite graphs
    Shuai An, Junping Xie, Xingyong Zhang
    arXivPreprintarXiv licenceFull textAnalysis & PDEsarXiv
  4. A cubic chromatic bound for capped graphs
    Hongyang Wang
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  5. On $4$-perfect-matching covers of cubic graphs with two adjacent odd circuits in a $2$-factor
    Ján Karabáš, Edita Máčajová
    arXivPreprintCC BY-NC-ND 4.0Full textCombinatorics & discrete mathematicsarXiv
BibTeX
@misc{cabrera2026gaussian,
  title = {{On Gaussian Curvature of Graphs of Cubic Polynomials}},
  author = {Baruc S. Cabrera and Manuel Cruz-López and Otto Romero-Germán},
  howpublished = {arXiv},
  year = {2026},
  month = sep,
  doi = {10.48550/arxiv.2609.38613},
  eprint = {2609.38613},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2609.38613},
}
RIS
TY  - UNPB
TI  - On Gaussian Curvature of Graphs of Cubic Polynomials
AU  - Baruc S. Cabrera
AU  - Manuel Cruz-López
AU  - Otto Romero-Germán
PY  - 2026
DA  - 2026/09/29
PB  - arXiv
DO  - 10.48550/arxiv.2609.38613
UR  - https://arxiv.org/abs/2609.38613
AB  - The Gaussian curvature of the graphs of cubic polynomials f(z)=(z−a)(z−b)(z−c), with triangle of zeros △=△(a,b,c), is analyzed. We introduce the composed Pythagorean mean B_△, a combination of the three classical Pythagorean means, which plays a central role in the description of the critical points of the Gaussian curvature. When △ is not equilateral, the curvature has exactly five critical points: a global maximum at the barycenter, two local minima, and two saddle points, forming a rhombus whose vertices lie on the axes of the Siebeck-Marden ellipse of the triangle. We also initiate a comparative study of B_△ with the skew of the triangle by describing a family of polynomials whose zeros determine a specific family of isosceles triangles. The cubic case provides a concrete model strongly suggesting that the critical geometry of the Gaussian curvature of the graph can reveal both analytic and algebraic properties of the underlying holomorphic function.
ER  -