Related papers: Five Definitions of Critical Point at Infinity

A critical value of a function is the value of this function at one of its critical points. Each critical point of a differentiable multivariate function is described by the equations which consist in equating to zero all of its partial…

In the paper we study properties of the set of critical points for self-similar sets. We introduce simple condition that implies at most countably many critical values and we construct a self-similar set with uncountable set of critical…

For each $\alpha > 2$ there is a binary word with critical exponent $\alpha$.

We consider the notions of (i) critical points, (ii) second-order points, (iii) local minima, and (iv) strict local minima for multivariate polynomials. For each type of point, and as a function of the degree of the polynomial, we study the…

This paper describes infinite sets of polynomial equations in infinitely many variables with the property that the existence of a solution or even an approximate solution for every finite subset of the equations implies the existence of a…

Over an alphabet of size 3 we construct an infinite balanced word with critical exponent 2+sqrt(2)/2. Over an alphabet of size 4 we construct an infinite balanced word with critical exponent (5+sqrt(5))/4. Over larger alphabets, we give…

The paper gives a full description of the growth of the gradient of a polynomial in two complex variables at infinity near any fiber of the polynomial

Critical points of an invariant function may or may not be symmetric. We prove, however, that if a symmetric critical point exists, those adjacent to it are generically symmetry breaking. This mathematical mechanism is shown to carry…

We describe a method to evaluate multivariate polynomials over a finite field and discuss its multiplicative complexity.

X(5) is a paradigm for the structure at the critical point of a particular first-order phase transition for which the intrinsic energy surface has two degenerate minima separated by a low barrier. For a finite system, we show that the…

We give a formula and an estimation for the number of irreducible polynomials in two (or more) variables over a finite field.

We describe how to compute topological objects associated to a polynomial map of several complex variables with isolated singularities. These objects are: the affine critical values, the affine Milnor numbers for all irregular fibers, the…

We present a new approach for estimating the set of bifurcation values at infinity. This yields a significant shrinking of the number of coefficients in the recent algorithm introduced by Jelonek and Kurdyka for reaching critical values at…

We consider high-dimensional percolation at the critical threshold. We condition the origin to be disjointly connected to two points, $x$ and $x'$, and subsequently take the limit as $|x|$, $|x'|$ as well as $|x-x'|$ diverge to infinity.…

In this note, we investigate the measure of singular sets and critical sets of real-valued solutions of elliptic equations in two dimensions. These singular sets and critical sets are finitely many points in the plane. Adapting the Carleman…

Given any n-tuple of complex numbers, one can canonically define a polynomial of degree n+1 that has the entries of this n-tuple as its critical points. In 2002, Beardon, Carne, and Ng studied a map $\theta\colon \mathbb{C}^n\to…

In this paper, we obtain new results on the critical points of a polynomial, these results are useful to the Sendov conjecture.

We show that the number of bifurcation points at infinity of a polynomial function f : C2 -> C is at most the number of branches at infinity of a generic fiber of f and that this upper bound can be diminished by one in certain cases.

Consider a random polynomial $Q_n$ of degree $n+1$ whose zeroes are i.i.d. random variables $\xi_0,\xi_1,\ldots,\xi_n$ in the complex plane. We study the pairing between the zeroes of $Q_n$ and its critical points, i.e. the zeroes of its…

Two-view triangulation is a problem of minimizing a quadratic polynomial under an equality constraint. We derive a polynomial that encodes the local minimizers of this problem using the theory of Lagrange multipliers. This offers a simpler…