Calculating Distance on a 3D Complex Eisenstein Lattice

  • Thread starter Thread starter GmL
  • Start date Start date
  • Tags Tags
    Vectors
Click For Summary
SUMMARY

The discussion focuses on calculating the distance between two vectors in a 3-dimensional complex Eisenstein lattice. The initial inquiry compares this calculation to the Euclidean distance formula, D=sqrt((x2-x1)^2+(y2-y1)^2+...+(n2-n1)^2). However, it is clarified that the orientation of the vectors is crucial, particularly when dealing with parallel vectors. The method involves finding the cross product to determine a normal vector and then projecting a new vector formed from points on the original vectors onto this normal vector to calculate the distance.

PREREQUISITES
  • Understanding of complex numbers and Eisenstein integers
  • Familiarity with vector mathematics and operations, including cross product
  • Knowledge of Euclidean distance calculations in R^3
  • Basic concepts of vector projection and magnitude
NEXT STEPS
  • Study the properties of complex Eisenstein lattices
  • Learn about vector projections and their applications in 3D space
  • Explore advanced vector operations, including cross products and their geometric interpretations
  • Investigate the implications of vector orientation in distance calculations
USEFUL FOR

Mathematicians, physicists, and computer scientists interested in advanced vector calculations, particularly in the context of complex lattices and geometric interpretations in three dimensions.

GmL
Messages
13
Reaction score
0
Hi, all.

I am interested in finding the distance between two vectors in a 3-dimensional complex Eisenstein lattice.

Is it simply an extension of finding the Euclidean distance between two real vectors?

i.e. D=sqrt((x2-x1)^2+(y2-y1)^2+...+(n2-n1)^2)?

Thanks.
 
Physics news on Phys.org
*Bump*

Anyone?
 
Thats the formula for magnitude of a vector. You got to tell me how they are oriented.

If you want to find distance between two paralle vectors, find the cross product of the two vectors which will give you a normal vector, pick points from each vector and make another vector from those points, then find the projection of the the new vector on to the normal vector. Get the magnitude of that projection. You have a distance between two parallel vectors, or any vectors that do not intersect. If they intersect the distance is zero because you have to pick the shortest distance, which is where they intersect, which has zero distance because they intersect.
 
I didn't quite mean the distance between two parallel vectors. I meant to say that the vectors denote a position in the real-complex plane (in three dimensions and given in terms of Eisenstein Integers). I know how to derive the distance between two vectors, but that does not help in this case.
 
The Euclidian distance between x = (x1, ..., xm) and y = (y1, ... , ym) in Rm is defined to be || x - y || = square root ( (x1 - y1)^2 + ... + (xm - ym)^2 )

hope you're still interested in that :)
 
can you please tell more specificly about the points you mentioned.how to take the points and to draw the vector from that point.
please help me i am interested to find distance between two points
 

Similar threads

  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 16 ·
Replies
16
Views
4K
  • · Replies 2 ·
Replies
2
Views
4K
  • · Replies 0 ·
Replies
0
Views
1K
Replies
3
Views
4K
  • · Replies 8 ·
Replies
8
Views
4K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 16 ·
Replies
16
Views
3K
  • · Replies 7 ·
Replies
7
Views
2K