Polynomial Lemniscates and Their Fingerprints: from Geometry to Topology

نویسندگان

  • ANASTASIA FROLOVA
  • DMITRY KHAVINSON
چکیده

We study shapes given by polynomial lemniscates, and their fingerprints. We focus on the inflection points of fingerprints, their number and geometric meaning. Furthermore, we study dynamics of zeros of lemniscate-generic polynomials and their ‘explosions’ that occur by planting additional zeros into a defining polynomial at a certain moment, and then studying the resulting deformation. We call this dynamics polynomial fireworks and show that it can be realized by a construction of a non-unitary operad.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

VIII CONGRESO COLOMBIANO DE METODOS NUMERICOS: Simulación en Ciencias y Aplicaciones Industriales

We consider the approximation of planar regions by pairs of lemniscates that are stitched together continuously. Lemniscates are level curves of the absolute value of an univariate complex polynomial. We approximate coastal sides or 2D meander like regions such that profiles of arteries, rivers and sinuous roads using lemniscates of two foci and use confocal lemniscates to build orthogonal grid...

متن کامل

Lemniscate growth

It was recently noticed that lemniscates do not survive Laplacian growth [12] (2010). This raises the question: “Is there a growth process for which polynomial lemniscates are solutions?” The answer is “yes”, and the law governing the boundary velocity is reciprocal to that of Laplacian growth. Viewing lemniscates as solutions to a moving-boundary problem gives a new perspective on results from...

متن کامل

Omega and PIv Polynomial in Dyck Graph-like Z(8)-Unit Networks

Design of crystal-like lattices can be achieved by using some net operations. Hypothetical networks, thus obtained, can be characterized in their topology by various counting polynomials and topological indices derived from them. The networks herein presented are related to the Dyck graph and described in terms of Omega polynomial and PIv polynomials.

متن کامل

On the size of multivariate polynomial lemniscates and the convergence of rational approximants

In a previous paper, the author introduced a class of multivariate rational interpolants, which are called optimal Padé-type approximants (OPTA). The main goal of this paper is to extend classical results on convergence both in measure and in capacity of sequences of Padé approximants to the multivariate case using OPTA. To this end, we obtain some estimations of the size of multivariate polyno...

متن کامل

Polynomials and lemniscates of indefiniteness

For a large indefinite linear system, there exists the option to directly precondition for the normal equations. Matrix nearness problems are formulated to assess the attractiveness of this alternative. Polynomial preconditioning leads to polynomial approximation problems involving lemniscate-like sets, both in the plane and in Cn×n. A natural matrix analytic extension for lemniscates is introd...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2017