Academia.eduAcademia.edu

Outline

Title
Abstract
Introduction
The Complex Case
The Real Case
Conclusion
References
All Topics
Mathematics
Combinatorics

Reaching generalized critical values of a polynomial

Profile image of Zbigniew JelonekZbigniew Jelonek

2013, Mathematische Zeitschrift

https://doi.org/10.1007/S00209-013-1213-2
visibility

…

description

26 pages

link

1 file

Abstract

Let f : K n → K be a polynomial, K = R, C. We give an algorithm to compute the set of generalized critical values. The algorithm uses a finite dimensional space of rational arcs along which we can reach all generalized critical values of f .

Related papers

Counting real rational functions with all real critical values
Boris Shapiro

We study the number R n of real rational degree n functions (considered up to a linear fractional transformation of the independent variable) with a given set of 2n − 2 distinct real critical values. We present a combinatorial interpretation of these numbers and pose a number of related questions.

View PDFchevron_right
C A ] 2 5 D ec 2 01 5 Circulants and critical points of polynomials
Volha Kushel

2018

We prove that for any circulant matrix C of size n× n with the monic characteristic polynomial p(z), the spectrum of its (n− 1)× (n− 1) submatrix Cn−1 constructed with first n− 1 rows and columns of C consists of all critical points of p(z). Using this fact we provide a simple proof for the Schoenberg conjecture recently proved by R.Pereira and S.Malamud. We also prove full generalization of a higher order Schoenberg-type conjecture proposed by M. de Bruin and A. Sharma and recently proved by W.S.Cheung and T.W.Ng. in its original form, i.e. for polynomials whose mass centre of roots equals zero. In this particular case, our inequality is stronger than it was conjectured by de Bruin and Sharma. Some Schmeisser’s-like results on majorization of critical point of polynomials are also obtained.

View PDFchevron_right
A delineability-based method for computing critical sets of algebraic surfaces
Juan Alcázar

Journal of Symbolic Computation, 2007

In this paper, we address the problem of determining a real finite set of z-values where the topology type of the level curves of a (maybe singular) algebraic surface may change. We use as a fundamental and crucial tool McCallum's theorem on analytic delineability of polynomials (see . An improved projection operation for cylindrical algebraic decomposition. In: Caviness, B.F., Johnson, J.R. (Eds.), Quantifier Elimination and Cylindrical Algebraic Decomposition. Springer Verlag, pp. 242-268]). Our results allow to algorithmically compute this finite set by analyzing the real roots of a univariate polynomial; namely, the double discriminant of the implicit equation of the surface. As a consequence, an application to offsets is shown.

View PDFchevron_right
Circulants and critical points of polynomials
Volha Kushel

Journal of Mathematical Analysis and Applications, 2016

We prove that for any circulant matrix C of size n × n with the monic characteristic polynomial p(z), the spectrum of its (n − 1) × (n − 1) submatrix Cn−1 constructed with first n − 1 rows and columns of C consists of all critical points of p(z). Using this fact we provide a simple proof for the Schoenberg conjecture recently proved by R. Pereira and S. Malamud. We also prove full generalization of a higher order Schoenberg-type conjecture proposed by M. de Bruin and A. Sharma and recently proved by W.S. Cheung and T.W. Ng. in its original form, i.e. for polynomials whose mass centre of roots equals zero. In this particular case, our inequality is stronger than it was conjectured by de Bruin and Sharma. Some Schmeisser's-like results on majorization of critical point of polynomials are also obtained. where equality holds if, and only if, all λj lie on a straight line passing through the origin of the complex plane.

View PDFchevron_right
Estimation of the number of the critical values at infinity of a polynomial function {$f\colon {\bf C}\sp 2\to {\bf C}$}
Mutsuo Oka

Publications of the Research Institute for Mathematical Sciences, 1995

View PDFchevron_right
Estimation of the Number of the Critical Values at Infinity of a Polynomial Function $ f:\ mathbf {C}^ 2\ rightarrow\ mathbf {C} $
Thanh Thanh

Publications of the Research Institute for …, 1995

View PDFchevron_right
Non-accessible critical points of Cremer polynomials
Jan Kiwi Krauskopf

Ergodic Theory and Dynamical Systems, 2000

It is shown that a polynomial with a Cremer periodic orbit has a non-accessible critical point in its Julia set provided that the Cremer periodic orbit is approximated by small cycles. Also, this paper contains a new proof of the Douady–Shishikura inequality for the number of non-repelling cycles of a complex polynomial.

View PDFchevron_right
An optimal condition for determining the exact number of roots of a polynomial system
Wolfgang Küchlin

Proceedings of the 1991 international symposium on Symbolic and algebraic computation - ISSAC '91, 1991

We present two algorithms for interpolating sparse rational functions. The first is the interpolation algorithm in a sense of sparse partial fraction representation of rational functions. The second is the algorithm for computing the entier and the remainder of a rational function. The first algorithm works without apriori known bound on the degree of a rational function, the second one is in the parallel class NC provided that the degree is known. The presented algorithms complement the sparse interpolation results of [GKS 90].

View PDFchevron_right
A remark about polynomials with specified local minima and no other critical points
Eduardo D. Sontag

2013

This fact must surely be well-known, but it seems worth giving a simple and quite explicit proof: Proposition 1.1 Take any finite subset X of R n , n ≥ 2. Then, there is a polynomial function P : R n → R which has local minima on the set X, and has no other critical points.

View PDFchevron_right
Critical Points of Real Polynomials and Topology of Real Algebraic T-Surfaces
Eugenii Shustin

Geometriae Dedicata

The paper is devoted to a special class of real polynomials, so-called T-polynomials, which arise in the combinatorial version of the Viro theorem. We study the relation between the numbers of real critical points of a given index of a T-polynomial and the combinatorics of lattice triangulations of Newton polytopes. We obtain upper bounds for the numbers of extrema and saddles of generic T-polynomials of a given degree in three variables, and derive from them upper bounds for Betti numbers of real algebraic surfaces in \mathbbRP3\mathbb{R}P^3 defined by T-polynomials. The latter upper bounds are stronger than the known upper bounds for arbitrary real algebraic surfaces in \mathbbRP3\mathbb{R}P^3 . Another result is the existence of an asymptotically maximal family of real polynomials of degree min three variables with 31m 3/36 + O(m 2) saddle points.

View PDFchevron_right

References (47)

  1. I. S. Antypolis, A new approach to primary decomposition, J. of Symbolic Computation 11, (1996) 1-15.
  2. S. Basu, R. Pollack, M.F. Roy, Algorithms in real algebraic geometry, Springer, 2006.
  3. R. Benedetti, J-J. Risler, Real Algebraic and Semi-algebraic Sets, Actualités Mathématiques, Hermann, 1990.
  4. J. Bochnak, M. Coste, M.F. Roy, Real algebraic geometry, E.M.G vol. 36 (1998) Springer.
  5. H.Flenner, L.O'Carroll, W.Vogel, Joins and Intersections, Springer-Verlag, Berlin-Heidelberg 1999,.
  6. Z. Jelonek, The set of points at which a polynomial map is not proper, Ann. Polon. Math. 58 (1993), 259-266.
  7. Z. Jelonek, Testing sets for properness of polynomial mappings, Math. Ann. 315 (1999), 1-35.
  8. Z. Jelonek, On the Lojasiewicz exponent, Hokkaido Journal of Math. 35, (2006), 471-485 ,
  9. Z. Jelonek, K. Kurdyka, On asymptotic critical values of a complex polynomial, J. für die reine und angewandte Mathematik 565 (2003), 1-11.
  10. Z. Jelonek, K. Kurdyka, Quantitative Generalized Bertini-Sard Theorem for smooth affine varieties", Discrete and Computational Geometry 34, (2005), 659-678.
  11. M. Goresky, R.MacPherson,Stratified Morse theory. Springer (1988).
  12. V. Guillemin, A. Pollack, Differential topology. Prentice-Hall (1974).
  13. H.V. Hà, T.S. Pham Minimizing polynomial functions. Acta Math. Vietnam. 32 (2007), no. 1, 7182.
  14. H.V. Hà, T.S. Pham Global optimization of polynomials using the truncated tangency variety and sums of squares. ( SIAM J. Optim. 19 (2008), no. 2, 941951
  15. K. Kurdyka, P. Orro, S. Simon, Semialgebraic Sard theorem for generalized critical values, J. of Diff. Geom. 56 (2000), 67-92.
  16. A. Parusiński, On the bifurcation set of complex polynomial with isolated singularities at infinity, Compositio Math. 97 (1995), 369-384.
  17. A. Parusiński, A note on singularities at infinity of complex polynomials, in "Symplectic Singu- larities and Geometry of Gauge fields", eds. R. Budzyński et al., Banach Center Publications 39, Warszawa (1997), 131-141.
  18. M. Safey El Din, Testing Sign Conditions on a Multivariate Polynomial and Applications, Math. Comput. Sci. 1 (2007), 177-207.
  19. M. Safey El Din, Computing the global optimum of a multivariate polynomial over the reals, ISSAC 2008 Proceedings, D. Jeffrey (eds), Austria (Hagenberg), 2008.
  20. Z. Jelonek) Instytut Matematyczny, Polska Akademia Nauk, Św. Tomasza 30, 31-027 Kraków, Poland References
  21. S. Basu, R. Pollack, M.-F. Roy, Algorithms in real algebraic geometry, Springer, 2006.
  22. R. Benedetti, J.-J. Risler, Real Algebraic and Semi-algebraic Sets, Actualités Mathématiques, Hermann, 1990.
  23. J. Bochnak, M. Coste, M.-F. Roy, Real algebraic geometry, E.M.G vol. 36 (1998) Springer.
  24. M. Coste, M. J. de la Puente, Atypical values at infinity of a polynomial function on the real plane: an erratum, and an algorithmic criterion, J. Pure Appl. Algebra 162 (2001), no. 1, 2335.
  25. H. Flenner, L. O'Carroll, W. Vogel, Joins and Intersections, Springer-Verlag, Berlin-Heidelberg 1999.
  26. S. Iitaka, Algebraic Geometry, Springer Verlag 1982.
  27. Z. Jelonek, The set of points at which a polynomial map is not proper, Ann. Polon. Math. 58 (1993), 259-266.
  28. Z. Jelonek, Testing sets for properness of polynomial mappings, Math. Ann. 315 (1999), 1-35.
  29. Z. Jelonek, On the Lojasiewicz exponent, Hokkaido Journal of Math. 35, (2006), 471-485.
  30. Z. Jelonek, K. Kurdyka, On asymptotic critical values of a complex polynomial, J. für die reine und angewandte Mathematik 565 (2003), 1-11.
  31. Z. Jelonek, K. Kurdyka, Quantitative Generalized Bertini-Sard Theorem for smooth affine varieties, Discrete and Computational Geometry 34, (2005), 659-678.
  32. R. Guning, H. Rossi, Analytic functions of several complex variables, Prentice-Hall (1965).
  33. M. Goresky, R. MacPherson, Stratified Morse theory. Springer (1988).
  34. V. Guillemin, A. Pollack, Differential topology. Prentice-Hall (1974).
  35. H. V. Hà, D. T. Lê, Sur la topologie des polynômes complexes. Acta Math. Vietnam. 9 (1984), no. 1, 21-32.
  36. H. V. Hà, T. S. Pham, Minimizing polynomial functions, Acta Math. Vietnam. 32 (2007), no. 1, 71-82.
  37. H. V. Hà, T. S. Pham, Global optimization of polynomials using the truncated tangency variety and sums of squares, SIAM J. Optim. 19 (2008), no. 2, 941-951.
  38. K. Kurdyka, Ensembles semi-algébriques symétriques par arcs, Math. Ann. 281 (1988), 445- 462.
  39. K. Kurdyka, P. Orro, S. Simon, Semialgebraic Sard theorem for generalized critical values, J. Diff. Geom. 56 (2000), 67-92.
  40. A. Parusiński, On the bifurcation set of complex polynomial with isolated singularities at infinity, Compositio Math. 97 (1995), 369-384.
  41. A. Parusiński, A note on singularities at infinity of complex polynomials, in "Symplectic Singu- larities and Geometry of Gauge fields", eds. R. Budzyński et al., Banach Center Publications 39, Warszawa (1997), 131-141.
  42. M. Raibaut, Motivic Milnor fibers of a rational function, C. R. Math. Acad. Sci. Paris 350 (2012), no. 9-10, 519-524.
  43. M. Safey El Din, Testing Sign Conditions on a Multivariate Polynomial and Applications, Math. Comput. Sci. 1 (2007), 177-207.
  44. M. Safey El Din, Computing the global optimum of a multivariate polynomial over the reals, ISSAC 2008 Proceedings, D. Jeffrey (eds), Austria (Hagenberg), 2008.
  45. P. Scheiblechner, On a generalization of Stickelberger's theorem, J. Symbolic Comput. 45 (2010), no. 12, 1459-1470.
  46. M. Suzuki, Propriétés topologiques des polynômes de deux variables complexes, et automor- phismes algébriques de l'espace C 2 , J. Math. Soc. Japan 26 (1974), 241-257.
  47. R. Thom, Ensembles et morphismes, stratifiés, Bull. Amer. Math. Soc. 75 (1969), 240-284.

Related papers

On types of degenerate critical points of real polynomial functions
Tiến Phạm

Journal of Symbolic Computation

In this paper, we consider the problem of identifying the type (local minimizer, maximizer or saddle point) of a given isolated real critical point c, which is degenerate, of a multivariate polynomial function f. To this end, we introduce the definition of faithful radius of c by means of the curve of tangency of f. We show that the type of c can be determined by the global extrema of f over the Euclidean ball centered at c with a faithful radius. We propose algorithms to compute a faithful radius of c and determine its type.

View PDFchevron_right
Majorization of the Critical Points of a Polynomial by Its Zeros
Gerhard Schmeisser

Computational Methods and Function Theory, 2004

Let z 1 , . . . , z n be the zeros of a polynomial f (z) and let ζ 1 , . . . , ζ n be those of zf (z). Suppose that for both polynomials the zeros are labelled in order of non-increasing modulus. We show that

View PDFchevron_right
On asymptotic critical values of a complex polynomial
Zbigniew Jelonek

Journal für die reine und angewandte Mathematik (Crelles Journal), 2003

Let f : C n ! C be a polynomial of degree d. We prove that the set of asymptotic critical values of f (i.e. values for which Malgrange's Condition fails) has at most d nÀ1 À 1 points. We give an asymptotically sharp bound for the number of bifurcation points of f. We give also an algorithm to compute this set.

View PDFchevron_right
Counting real rational functions with all real critical values, Moscow
Boris Shapiro

2011

Abstract. We study the number ♯R n of real rational degree n functions (considered up to a linear fractional transformation of the independent variable) with a given set of 2n − 2 distinct real critical values. We present a combinatorial interpretation of these numbers and pose a number of related questions. This paper continues the series [A2–A6, S, SV] dealing with the topology of the sets of ordinary, trigonometric, and exponential polynomials with the maximal possible number of real critical values. Recall that a degree n rational function is any holomorphic degree n map CP 1 → CP 1. A rational function f is called real if

View PDFchevron_right
Bounds and majorization relations for the critical points of polynomials
Mohammad Adm

Linear Algebra and its Applications, 2012

We apply several matrix inequalities to the derivative companion matrices of complex polynomials to establish new bounds and majorization relations for the critical points of these polynomials in terms of their zeros.

View PDFchevron_right

Related topics

  • Mathematics
  • Combinatorics
  • Pure Mathematics

    • Cited by

    On the Set of Points at Infinity of a Polynomial Image of $${\mathbb R}^n$$ R n
    Jose Fernando

    Discrete & Computational Geometry, 2014

    In this work we prove that the set of points at infinity S ∞ := Cl RP m (S)∩H ∞ of a semialgebraic set S ⊂ R m that is the image of a polynomial map f : R n → R m is connected. This result is no longer true in general if f is a regular map. However, it still works for a large family of regular maps that we call quasi-polynomial maps. Keywords Polynomial and regular maps and images • Quasi-polynomial maps • Set of points at infinity • Connectedness Mathematics Subject Classification 14P10 • 14E05 (primary) • 14P05 • 14E15 (secondary) Dedicated to Ignacio Luengo on the occasion of his 60th birthday.

    View PDFchevron_right
    On topological approaches to the Jacobian conjecture in ℂ n
    Francisco Braun

    Proceedings of the Edinburgh Mathematical Society, 2020

    We obtain a new theorem for the non-properness set $S_f$ of a non-singular polynomial mapping $f:\mathbb C^n \to \mathbb C^n$ . In particular, our result shows that if f is a counterexample to the Jacobian conjecture, then $S_f\cap Z \neq \emptyset $ , for every hypersurface Z dominated by $\mathbb C^{n-1}$ on which some non-singular polynomial $h: \mathbb C^{n}\to \mathbb C$ is constant. Also, we present topological approaches to the Jacobian conjecture in $\mathbb C^n$ . As applications, we extend bidimensional results of Rabier, Lê and Weber to higher dimensions.

    View PDFchevron_right
    580 California St., Suite 400
    San Francisco, CA, 94104
    © 2025 Academia. All rights reserved