N-curve: Difference between revisions
No edit summary |
mNo edit summary |
||
Line 45: | Line 45: | ||
and |
and |
||
: <math>\alpha(t)=\cos^{3}(2\pi t)+ i \sin^{3}(2\pi t) \ |
: <math>\alpha(t)=\cos^{3}(2\pi t)+ i \sin^{3}(2\pi t), 0\leq t \leq 1 </math> |
||
The parametric equations of <math>\alpha\cdot u_{n}</math> are <math>x=\cos^3 (2\pi t)+ \cos(2\pi nt)-1, y=\sin^{3}(2\pi t)+ \sin(2\pi nt)</math> |
The parametric equations of <math>\alpha\cdot u_{n}</math> are <math>x=\cos^3 (2\pi t)+ \cos(2\pi nt)-1, y=\sin^{3}(2\pi t)+ \sin(2\pi nt)</math> |
||
⚫ | |||
See the figure. |
|||
⚫ | |||
[[File:curve3.jpg]] |
[[File:curve3.jpg]] |
||
Line 63: | Line 67: | ||
Let ρ denote the [[Rhodonea curve]] <math> r = \cos(2\theta)</math>, which is a loop at 1. Its parametric equations are |
Let ρ denote the [[Rhodonea curve]] <math> r = \cos(2\theta)</math>, which is a loop at 1. Its parametric equations are |
||
: <math> x = \cos(4\pi t)\cos(2\pi t), y = \cos(4\pi t)\sin(2\pi t) |
: <math> x = \cos(4\pi t)\cos(2\pi t), y = \cos(4\pi t)\sin(2\pi t), 0\leq t \leq 1 </math> |
||
With the loop ρ we shall ''n''-curve the cosine curve |
With the loop ρ we shall ''n''-curve the cosine curve |
||
Line 72: | Line 76: | ||
: <math>x=2\pi[t-1+\cos(4\pi nt)\cos(2\pi nt)], \quad y=\cos(2\pi t)+ 2\pi \cos(4\pi nt)\sin(2\pi nt)</math> |
: <math>x=2\pi[t-1+\cos(4\pi nt)\cos(2\pi nt)], \quad y=\cos(2\pi t)+ 2\pi \cos(4\pi nt)\sin(2\pi nt)</math> |
||
See the figure. |
See the figure. |
||
It is a curve that starts at the point (0, 1) and ends at <math>(\2pi, 1)</math>. |
|||
[[File:curve4.jpg]] |
[[File:curve4.jpg]] |
||
Revision as of 15:32, 9 November 2009
This article needs additional citations for verification. (October 2009) |
We take the functional theoretic algebra C[0, 1] of curves. For each loop γ at 1, and each positive integer n, we define a curve called n-curve. The n-curves are interesting in two ways.
(1) Their f-products give rise to many beautiful curves.
(2) Using the n-curves, we can define a transformation of curves, called n-curving.
Multiplicative inverse of a curve
A curve γ in the FTA , is invertible, i.e.
exists if
If , where , then
The set G of invertible curves is a non-commutative group under multiplication. Also the set H of loops at 1 is an Abelian subgroup of G. If , then the mapping is an inner automorphism of the group G.
We use these concepts to define n-curves and n-curving.
n-Curves and their products
If x is a real number and [x] denotes the greatest integer not greater than x, then
If and n is a positive integer, then define a curve by
is also a loop at 1 and we call it an n-curve. Note that every curve in H is a 1-curve.
Suppose Then, since .
Example of a product of n-curves
Products of n-curves often yield beautiful new curves. Let us take u, the unit circle centered at the origin and α, the astroid. Then,
and
The parametric equations of are
See the figure.
Since both are loops at 1, so is the product.
n-Curving
If , then, as mentioned above, the n-curve . Therefore the mapping is an inner automorphism of the group G. We extend this map to the whole of C[0, 1], denote it by and call it n-curving with γ. It can be verified that
This new curve has the same initial and end points as α.
Example of n-curving
Let ρ denote the Rhodonea curve , which is a loop at 1. Its parametric equations are
With the loop ρ we shall n-curve the cosine curve
The curve has the parametric equations
See the figure.
It is a curve that starts at the point (0, 1) and ends at Failed to parse (syntax error): {\displaystyle (\2pi, 1)} .
References
- Sebastian Vattamattam, "Transforming Curves by n-Curving", in Bulletin of Kerala Mathematics Association, Vol. 5, No. 1, December 2008