SearcharxivSearch

arXiv · 2503.07614

Bernstein polynomials: a bibliometric data analysis since the year 1949 based on the Scopus database

Abstract

It's hard to imagine human life in the digital and AI age without polynomials because they are everywhere but mostly invisible to ordinary people: in data trends, on computer screens, in the shapes around us, and in the very fabric of technology. One of these, the simple but elegant Bernstein polynomials, was discovered by a scientist from the Russian Empire, Sergei Bernstein, in 1912 and plays a central role in mathematical analysis, computational and applied mathematics, geometric modelling, computer-aided geometric design, computer graphics and other areas of science and engineering. They have been the sub-ject of much research for over a hundred years. However, no work has carried out database-derived research analysis, such as bibliometric, keyword or network analysis, or more generally, data analysis of manuscript data related to Bernstein polynomials extracted from digital academic databases. This work, which appears to be the first-ever attempt at the bibliometric data analysis of Bernstein polynomials, aims to fill this gap and open researchers' eyes to potentially new or underexplored areas of mathematics and engineering where Bernstein polynomials may one day be used to make discoveries. The results may be helpful to academics researching Bernstein polynomials and looking for potential applications, collaborators, supervisors, funding or journals to publish in.

Explore related subjects

Keep this discovery

BibTeXRIS

Rushan Ziatdinov. 2025-02-21. Bernstein polynomials: a bibliometric data analysis since the year 1949 based on the Scopus database. https://arxiv.org/abs/2503.07614

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Perspectives on the unit distance problem

This is a survey on an old open problem in combinatorics called the unit distance problem, and the field of mathematics around it, called incidence geometry. What do we know about the problem? Why is it difficult? How does it connect with other parts of math?

math.HO

A Categorical Approach to Euclidean Ratios and Proportions

A categorial approach to the non-metric geometry in Books V and VI of Euclid's \textit{Elements} is presented. Specifically, we introduce a diagrammatic syntax that can be overlaid immediately on his diagrams, thus bridging intuitive presentation with fidelity to Euclid's arguments. This syntax makes complicated definitions like V.5, and indeed the arguments throughout books V and VI, including arguments about similar figures, intuitively clear. We show in an appendix that this syntax can be used to solve a puzzle regarding ancient mathematics. Finally, we offer evidence that this approach to Euclidean diagrams is rooted in the Aristotelian tradition itself, and that a similar syntax was utilized, in antiquity, for related questions of numeric and proportions. Thus the syntax is plausibly faithful to Euclid's own thought-world, and not an outside-imposition.

math.HO

Some Early Results by Tutte Regarding the Cycle Double Cover Conjecture in 1948

OpenAI recently announced a proof of the Cycle Double Cover (CDC) Conjecture. Most media reports have characterized it as a 50-year-old open problem. In reality, according to a 1987 letter from Tutte to Fleischner, the Cycle Double Cover Problem has been open for at least 80 years. Two early results regarding the CDC conjecture were established in one of Tutte's 1949 publications.

math.HO