Jump to content

Equichordal point problem: Difference between revisions

From Wikipedia, the free encyclopedia
Content deleted Content added
Rychlik (talk | contribs)
Rychlik (talk | contribs)
Line 33: Line 33:
# In 1992 [[Shäfke]] and [[Volkmer]]<ref name="Volkmer">R. Schäfke and H. Volkmer, Asymptotic analysis of the equichordal problem, J. Reine Angew. Math. 425 (1992), 9-60</ref> showed that there is at most a finite number of values of excentricity for which the curve may exist. They outlined a feasible strategy for a computer-assisted proof. Their methods consists in obtaining extremaly accurate approximations to the hypothetical curve.
# In 1992 [[Shäfke]] and [[Volkmer]]<ref name="Volkmer">R. Schäfke and H. Volkmer, Asymptotic analysis of the equichordal problem, J. Reine Angew. Math. 425 (1992), 9-60</ref> showed that there is at most a finite number of values of excentricity for which the curve may exist. They outlined a feasible strategy for a computer-assisted proof. Their methods consists in obtaining extremaly accurate approximations to the hypothetical curve.
# In 1996 Rychlik<ref name="The_Proof"/> fully solved the problem. The proof does not use a computer. Instead
# In 1996 Rychlik<ref name="The_Proof"/> fully solved the problem. The proof does not use a computer. Instead
it introduces [[complexification]] of the original problem, and develops a generalization of the
it introduces [[complexification]] of the original problem, and develops a generalization of the theory of [[invariant curves]] which allow the use of [[global methods]] of [[complex analysis]]. The prototypical
theory of [[invariant curves]] which allow the use of [[global methods]] of [[complex analysis]]. The prototypical
global theorem is the [[Liouville's Theorem]].
global theorem is the [[Liouville's Theorem]].



Revision as of 09:26, 25 November 2010

The theorem solves the Equichordal Point Problem of Fujiwara, originally posed in 1916. The problem was rediscovered in 1917 by Wilhelm Blaschke, Rothe and Weizenböck[1].

The Theorem

There is no be a Jordan curve with two equichordal points, with respect to which the curve would be star-shaped. In particular, there is no convex and closed curve with two equichordal points.

The Published Proof

The proof was published in the hard to read article [2] There is also easy to read research announcement [3], but it only hints at the ideas used in the proof.

Definition of Excentricity (or Eccentricity)

Let be the hypothetical convex curve with two equichordal points and . Let be the common length of all chords of the curve passing through or . Then excentricity is the ratio:

where is the distance between the points and .

Many results on equichordal points refer to the excentricity. It turns out that the smaller the , the harder is to disprove the existence of the curves with two equichordal points. It can be shown rigorously, that small excentricity means that the curve must be close to the circle[4].

The History of the Problem

The problem has been extensively studied, with significant papers published over eight decades preceding its solution:

  1. In 1916 Fujiwara[5] proved that no convex curves with three equichordal points exist.
  2. In 1917 Blaschke, Rothe and Weitzenböck[1] formulated the problem again.
  3. In 1923 Süss showed certain symmetries and uniqueness of the curve, if it existed.
  4. In 1953 G. A. Dirac showed some explicit bounds on the curve, if it existed.
  5. In 1958 Wirsing[6] showed that the curve, if it exists, must be an analytic curve. In this deep paper, he correctly identified the problem as perturbation problem beyond all orders.
  6. In 1966 Ehrhart[7] proved that there are no equichordal curves with excentricities > 0.5.
  7. In 1988 Michelacci proved that there are no equichordal curves with excentricities > .33. The proof is mildly computer-assisted.
  8. In 1992 Shäfke and Volkmer[4] showed that there is at most a finite number of values of excentricity for which the curve may exist. They outlined a feasible strategy for a computer-assisted proof. Their methods consists in obtaining extremaly accurate approximations to the hypothetical curve.
  9. In 1996 Rychlik[2] fully solved the problem. The proof does not use a computer. Instead

it introduces complexification of the original problem, and develops a generalization of the theory of invariant curves which allow the use of global methods of complex analysis. The prototypical global theorem is the Liouville's Theorem.

See also

Similar problems and their generalizations have also been studied.

  1. The Equireciprocal Point Problem.
  2. The general Chordal Problem of Gardner.
  3. The Equiproduct Point Problem.

References

  1. ^ a b W. Blaschke, W. Rothe, and R. Weitzenböck. Aufgabe 552. Arch. Math. Phys., 27:82, 1917
  2. ^ a b Marek R. Rychlik, A complete solution to the equichordal point problem of Fujiwara, Blaschke, Rothe and Weizenböck, Inventiones Mathematicae, 1997, Volume 129, Number 1, Pages 141-212.
  3. ^ Marek Rychlik, The Equichordal Point Problem, Electronic Research Announcements of the AMS, 1996, pages 108-123, available on-line at [1]
  4. ^ a b R. Schäfke and H. Volkmer, Asymptotic analysis of the equichordal problem, J. Reine Angew. Math. 425 (1992), 9-60
  5. ^ M. Fujiwara. Über die Mittelkurve zweier geschlossenen konvexen Curven in Bezug auf einen Punkt. Tôhoku Math J., 10:99--103, 1916
  6. ^ E. Wirsing, Zur Analytisität von Doppelspeichkurven, Arch. Math. 9 (1958), 300--307.
  7. ^ R. Ehrhart, Un ovale à deux points isocordes?, Enseignement Math. 13 (1967), 119-124