On the geometry of real polynomials of the 7-th degree with simple complex critical points
Elizaveta Khokhlova, Yury Kochetkov
Abstract
We consider real monic polynomials with simple complex critical points. Critical values of such polynomial p can be considered as vertices of the uniquely defined polygon, symmetric with respect to the x-axis. The inverse image of this polygon is a tree-like system of ovals that touch each other externally in critical points. This system of ovals will be called the geometrical code of p. Let a1+i· b1,…,an+i· bn, a1<a2<…<an and bi>0, i=1,…,n, be the set of critical points of our polynomial p in the upper halfplane, and c1+i· d1,…,cn+i· dn be their images. The order of numbers ck and the list of signs of numbers dk will be called the algebraic code of p. In our experimental work we study geometrical and algebraic codes of the 7-th degree polynomials and the relations between them.
Create a lesson
Related papers
Uniqueness of the hexagonal lattice's universal optimality
Markus Faulhuber, Philipp Petersen
Hadamard configurations and sharp cubic-period bounds for stealth in dimensions 10, 11, and 12
Josiah Park
Scaling Limits and Fractal Dimensions of ω-Substitution Graph Systems
Qingcheng Zeng, Yumei Xue, Cheng Zeng
Filling Lipschitz spheres in metric spaces
Noa Vikman, Stefan Wenger
Logarithmically Slim Polygons
Panagiotis Tselekidis
An elementary proof of a tangent-cone identity for rank-one planar Lipschitz maps
Igor Buchowiec