Misiurewicz point

In mathematics, a Misiurewicz point is a parameter in the Mandelbrot set (the parameter space of quadratic polynomials) for which the critical point… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Let a sufficiently smooth function f on [−1, 1] be sampled at n + 1 equispaced points, and let k ≥ 0 be given. An Euler–Maclaurin… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2015
2015
The behavior under iteration of the critical points of a polynomial map plays an essential role in understanding its dynamics. We… (More)
  • table 1
  • table 2
  • table 3
  • table 4
Is this relevant?
2009
2009
We describe a spatio-temporal triangulation method to be used with rolling shutter cameras. We show how a single pair of rolling… (More)
  • figure 1
  • figure 2
  • table 1
  • figure 3
  • figure 4
Is this relevant?
2007
2007
We show that the set of Misiurewicz maps has Lebesgue measure zero in the space of rational functions for any fixed degree d ≥ 2. 
Is this relevant?
Highly Cited
2005
Highly Cited
2005
As known, the problem of choosing ‘‘good’’ nodes is a central one in polynomial interpolation. While the problem is essentially… (More)
  • figure 1
  • table 1
  • table 2
  • table 3
  • figure 2
Is this relevant?
Highly Cited
2004
Highly Cited
2004
We carry out a systematic study of entanglement entropy in relativistic quantum field theory. This is defined as the von Neumann… (More)
  • figure 1
  • figure 2
Is this relevant?
2004
2004
In this paper we will show that piecewise C mappings / on [0,1] or S satisfying the so-called Misiurewicz conditions are globally… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
2003
Highly Cited
2003
Recent advances in airborne light detection and ranging (LIDAR) technology allow rapid and inexpensive measurements of topography… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table I
Is this relevant?
Highly Cited
1994
Highly Cited
1994
One of the primary goals of low-level vision is to segment the domain D of an image I into the parts D i on which distinct… (More)
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
1985
Highly Cited
1985
The problem of decomposing a polygon into simpler components is of interest in fields such as computational geometry, syntactic… (More)
  • figure 1.1
  • figure 2.1
  • figure 2.2
  • figure 2.3
  • figure 3.1
Is this relevant?