Chordal problem

Chordal problem

In the book[1] there is a generalization of the equichordal point problem attributed to R. Gardner.

A Curve and Its Chord
We consider a point O inside a Jordan curve with the property that for any chord [X,Y] of the curve passing through O the two parts [X,O] and [O,Y] of the chord satisfy the following equation, where α is a fixed real number:
| XO | α + | OY | α = c[2]

where c is a constant not depending on the chord. In this article we will call a point O satisfying equation[2] a chordal point, or α-chordal point.

The template for all chordal problems is this:

Problem: Is there a curve with two or more distinct points with this property?

Contents

Curves with one equichordal point

The center of the circle is a solution of the chordal equation[2] for an arbitrary α. One can show a continuum of solutions for many α, for example, α = 1. The method of construction such solutions is by writing the equation of the curve in the form r = f(θ) in polar coordinates. For α = 1, the solution may be found in this article.[3]

An example

This is an example of a curve with one equichordal point. based on an example in.[4] The core idea is that we may start with any Jordan arc given in polar coordinates by an equation r = r0(θ), 0\leq\theta\leq\pi, and complement it to a closed Jordan curve given by the equation r = r(θ) for all \theta\in[0,2\pi]. Along the way, we must satisfy some number of conditions to ensure continuity of the resulting curve.

Let us define a function r0(θ) by the formula:

r_0(\theta) = x+\left(\frac{1}{2}-x\right)\cos2\theta

where x is a real parameter and x\in(1/4,1/2]. This function is clearly defined for all real θ, but we only use its values for 0\leq\theta\leq\pi. Clearly, r(0) = r(π).

We define the second function r(θ) by the formula:

r(\theta) = \begin{cases}
 r_0(\theta)&\text{ if }0\leq\theta\leq\pi\\
 1-r_0(\theta-\pi)&\text{ if }\pi\leq\theta\leq2\pi.
\end{cases}

This function has the following properties:

  1. r(θ) > 0;
  2. r(θ) is continuous on [0,2π];
  3. r(0) = r(2π), so r(θ) extends uniquely to a -periodic, continuous function on (-\infty,\infty); from now on, we identify r with this extension;
  4. r(θ) + r(θ + π) = 1 for all \theta\in(-\infty,\infty).

These properties imply that the curve given in polar coordinates by the equation r = r(θ) is a closed Jordan curve and that the origin is an equichordal point.

The construction presented here and based on[4] results in a curve which is C1 but not C2, with the exception of x = 1, when the curve becomes a circle. Rychlik[3] formulated conditions on the Fourier series of r(θ) which easily allow constructing of curves with one equichordal point, including analytic curves. Rychlik gives a specific example of an analytic curve:

 r = 0.5+0.2\,\sin\theta + 0.2\,\cos3\theta

Fourier series analysis in Rychlik's paper[3] reveals the pattern of Fourier coefficients of all suitable functions r(θ).

Special cases

For α = 1 we obtain the equichordal point problem, and for α = − 1 we obtain the equireciprocal point problem considered by Klee.[5][6]

We may also consider a more general relationship between | XO | and | OY | . For example, the equiproduct point problem is obtained by considering the equation:

|X-O||O-Y|=c. \,

Equivalently,

\log|X-O| + \log|O-Y| = c'\,.

This naturally leads to a more general class of problems. For a given function f:\mathbb{R}^+\to\mathbb{R} we may study the equations:

f( | XO | ) + f( | OY)) = c.

Even more generally, we could consider a function f(x,y) of two real variables. We need to assume that f is symmetric, i.e. f(x,y) = f(y,x). Then we may consider the equation:

f( | XO | , | OY | ) = c.

Clearly, f(x,y) needs only be defined for positive x and y. Thus, the family of chordal problems of this type is parameterized by symmetric functions of two variables.

The status of various special cases

The equichordal point problem (α = 1)

This has been the most famous of the chordal problems. In this case, the equation[2] states that every chord passing through O has the same length. It has become known as the equichordal point problem, and was fully solved in 1996 by Marek Rychlik.

The equireciprocal point problem (α = −1)

Klee[5] proved that the ellipse solves the equireciprocal point problem, with the ellipse foci serving as the two equireciprocal points. However, in addition to the ellipses, many solutions of low smoothness also exist, as it was shown in.[6] From the point of view of the equichordal point problem, this is due to the lack of hyperbolicity of the fixed points of a certain map of the plane.

Other cases

The method used in Rychlik's proof for the equichordal point problem may only generalize to some rational values of α. A reasonable conjecture could be:

Conjecture: There are no solutions of the Chordal Problem for rational α close to 1.

See also

References

  1. ^ H. Croft, K. J. Falconer, and R. K. Guy. Unsolved Problems in Geometry, volume II of 'Problem Books in Mathematics'. Springer-Verlag, New York, Berlin, 1991.
  2. ^ a b c d The Chordal Equation
  3. ^ a b c Marek Rychlik, The Equichordal Point Problem, Electronic Research Announcements of the AMS, 1996, pages 108-123, available on-line at [1]
  4. ^ a b http://mathworld.wolfram.com/EquichordalPoint.html
  5. ^ a b V. Klee. Can a plane convex body have two equireciprocal points? American Mathematical Monthly, 76:54–55, 1969, correction in 78:1114, 1971
  6. ^ a b K. J. Falconer. On the equireciprocal point problem. Geom. Dedicata, 14:113–126, 1983

Wikimedia Foundation. 2010.

Игры ⚽ Нужна курсовая?

Look at other dictionaries:

  • Chordal graph — A cycle (black) with two chords (green). As for this part, the graph is chordal. However, removing one green edge would result in a non chordal graph. Indeed, the other green edge with three black edges would form a cycle of length four with no… …   Wikipedia

  • Chordal — triangulierter Graph allgemeiner: perfekter Graph Schnittgraph Beispiele: Intervallgraphen Bäume Dreiecksgraphen In der Graphentheorie nennt man einen Graphen G trianguliert oder chordal, wenn er ei …   Deutsch Wikipedia

  • Equichordal point problem — In Euclidean plane geometry, the equichordal point problem is the question whether a closed planar convex body can have two equichordal points.[1] The problem was originally posed in 1916 by Fujiwara and in 1917 by Wilhelm Blaschke, Rothe and… …   Wikipedia

  • Clique problem — The brute force algorithm finds a 4 clique in this 7 vertex graph (the complement of the 7 vertex path graph) by systematically checking all C(7,4)=35 4 vertex subgraphs for completeness. In computer science, the clique problem refers to any of… …   Wikipedia

  • Constraint satisfaction dual problem — The dual problem is a reformulation of a constraint satisfaction problem expressing each constraint of the original problem as a variable. Dual problems only contain binary constraints, and are therefore solvable by algorithms tailored for such… …   Wikipedia

  • Decomposition method (constraint satisfaction) — In constraint satisfaction, a decomposition method translates a constraint satisfaction problem into another constraint satisfaction problem that is binary and acyclic. Decomposition methods work by grouping variables into sets, and solving a… …   Wikipedia

  • Gear — For the gear like device used to drive a roller chain, see Sprocket. This article is about mechanical gears. For other uses, see Gear (disambiguation). Two meshing gears transmitting rotational motion. Note that the smaller gear is rotating… …   Wikipedia

  • Chromatic polynomial — All nonisomorphic graphs on 3 vertices and their chromatic polynomials, clockwise from the top. The independent 3 set: k3. An edge and a single vertex: k2(k − 1). The 3 path: k(k − 1)2. The 3 clique …   Wikipedia

  • Dividing a circle into areas — In geometry, the problem of dividing a circle into areas by means of an inscribed polygon with n sides, in such a way as to maximise the number of areas created by the edges and diagonals, has a solution by an inductive method. Contents 1 Lemma 2 …   Wikipedia

  • Maximal independent set — This article is about the combinatorial aspects of maximal independent sets of vertices in a graph. For other aspects of independent vertex sets in graph theory, see Independent set (graph theory). For other kinds of independent sets, see… …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”