Jump to content

N-curve: Difference between revisions

From Wikipedia, the free encyclopedia
Content deleted Content added
m Including Figure 1
m Adding a Curve.
Line 3: Line 3:
{{lowercase}}
{{lowercase}}


==Introduction==
There are many ways of transforming a mathematical curve. Here we introduce a method using the principles of [[functional-theoretic algebra]] (FTA).
There are many ways of transforming a mathematical curve. Here we introduce a method using the principles of [[functional-theoretic algebra]] (FTA).


Line 20: Line 21:


== ''n''-curves and their products==
== ''n''-curves and their products==
If ''x'' is a real number, then [''x''] denotes the greatest integer not greater than ''x'' and <math> x-[x] \in [0, 1].</math>
If ''x'' is a real number and [''x''] denotes the greatest integer not greater than ''x'', then <math> x-[x] \in [0, 1].</math>


If <math>\gamma \in H</math> and ''n'' is a positive integer, then define a curve <math>\gamma_{n}</math> by
If <math>\gamma \in H</math> and ''n'' is a positive integer, then define a curve <math>\gamma_{n}</math> by


<math>\gamma_{n}(t)=\gamma(nt - [nt])</math>. <math>\gamma_{n}</math> is also a loop at ''1'' and we call it an n-curve. Note that every curve in ''H'' is a 1-curve.
<math>\gamma_{n}(t)=\gamma(nt - [nt])</math>. <math>\gamma_{n}</math> is also a loop at ''1'' and we call it an n-curve.
Note that every curve in ''H'' is a 1-curve.


Suppose <math>\alpha, \beta \in H.</math> Then, since <math>\alpha(0)=\beta(1)=1, \alpha \cdot \beta = \beta + \alpha -e</math>, where <math>e(t)=1, \forall t \in [0, 1].</math>
Suppose <math>\alpha, \beta \in H.</math>
Then, since <math>\alpha(0)=\beta(1)=1, \alpha \cdot \beta = \beta + \alpha -e</math>, where <math>e(t)=1, \forall t \in [0, 1].</math>


== Example of a product of ''n''-curves ==
== Example of a Product of ''n''-Curves ==


Let us take ''u'', the unit circle centered at the origin and products of ''n''-curves often yield beautiful new curves. α, the astroid.
Products of ''n''-curves often yield beautiful new curves. Let us take ''u'', the unit circle centered at the origin and α, the [[astroid]].
Then,
Then,


: <math>u_{n}(t)=\cos(2\pi nt)+ i \sin(2\pi nt)</math>
: <math>u_{n}(t)=\cos(2\pi nt)+ i \sin(2\pi nt)</math>
and

: <math>\alpha(t)=\cos^{3}(2\pi t)+ i \sin^{3}(2\pi t)</math>
: <math>\alpha(t)=\cos^{3}(2\pi t)+ i \sin^{3}(2\pi t)</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. Since both <math>\alpha \mbox{ and } u_{n}</math> are loops at 1, so is the product.
See the figure.
[[File:curve3.jpg]]
[[File:curve3.jpg]]
==References==
==References==

Revision as of 09:29, 30 October 2009

You must add a |reason= parameter to this Cleanup template – replace it with {{Cleanup|reason=<Fill reason here>}}, or remove the Cleanup template.


Introduction

There are many ways of transforming a mathematical curve. Here we introduce a method using the principles of functional-theoretic algebra (FTA).

A curve γ in the FTA C[0, 1] of curves, is invertible, i.e.

exists if

If , 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 , where

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.

References

  • Sebastian Vattamattam, ``Transforming Curves by n-Curving, in ``Bulletin of Kerala Mathematics Association, Vol. 5, No. 1, December 2008