<?xml version="1.0" encoding="ISO-8859-1"?>

<rss version="2.0" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:content="http://purl.org/rss/1.0/modules/content/">
	<channel>
		<title><![CDATA[Physics Forums - Linear & Abstract Algebra]]></title>
		<link>http://www.physicsforums.com</link>
		<description>Vector spaces and linear transformations. Groups and other algebraic structures along with Number Theory.</description>
		<language>en</language>
		<lastBuildDate>Tue, 18 Jun 2013 23:54:45 GMT</lastBuildDate>
		<generator>vBulletin</generator>
		<ttl>60</ttl>
		<image>
			<url>http://www.physicsforums.com/images/physicsforums/misc/rss.jpg</url>
			<title><![CDATA[Physics Forums - Linear & Abstract Algebra]]></title>
			<link>http://www.physicsforums.com</link>
		</image>
		<item>
			<title>Problem A1 from the 2009 Putnam Exam</title>
			<link>http://www.physicsforums.com/showthread.php?t=697507&amp;goto=newpost</link>
			<pubDate>Mon, 17 Jun 2013 20:01:04 GMT</pubDate>
			<description>Here is the problem: 
 
Let f be a real-valued function on the plane such that 
for every square ABCD in the plane, f(A) + f(B) + 
f(C) +f(D) = 0....</description>
			<content:encoded><![CDATA[<div>Here is the problem:<br />
<br />
Let f be a real-valued function on the plane such that<br />
for every square ABCD in the plane, f(A) + f(B) +<br />
f(C) +f(D) = 0. Does it follow that f(P) = 0 for all<br />
points P in the plane?<br />
<br />
<br />
<br />
Below is my solution:<br />
<br />
Create a 3x3 set of boxes (where each box has equal lengths as all of the other boxes) like so:<br />
<br />
.  .  .  .<br />
.  .  .  .<br />
.  .  .  .<br />
.  .  .  .<br />
<br />
The periods represent vertices. Now, denote the value of the function at each vertice by a(1),...,a(16).<br />
<br />
Now, since the sum of any four vertices making a square is zero, we get 18 unique equations (each containing a linear relationship between a unique quadruple of vertices):<br />
<br />
9 (each representing a unit box)<br />
+<br />
4 (each representing a box of side length 2 units)<br />
+ <br />
1 (this equation relates the vertices of the entire 3x3 square)<br />
+ <br />
4 (each representing a box of side length sqrt(2) units (the diagonal squares)<br />
<br />
<br />
Writing these into a matrix, we get an 18x16 matrix mapping a vector whose coordinates are the values of the function at each vertex) to the zero vector. Since we have 18 homogeneous equations and 16 variables, all of the variables must be zero. From this we can clearly conclude that the value of the function is zero for everywhere on the plane.<br />
<br />
Is this solution correct? I can't see any errors, I just thought it was an interesting answer (it was different from the official answer, which I've posted below) and wasn't sure if I was missing anything.<br />
<br />
OFFICIAL ANSWER: <br />
<br />
Yes, it does follow. Let P be any point in the plane. Let<br />
ABCD be any square with center P. Let E; F; G; H<br />
be the midpoints of the segments AB; BC; CD; DA,<br />
respectively. The function f must satisfy the equations<br />
0 = f(A) + f(B) + f(C) + f(D)<br />
0 = f(E) + f(F) + f(G) + f(H)<br />
0 = f(A) + f(E) + f(P) + f(H)<br />
0 = f(B) + f(F) + f(P) + f(E)<br />
0 = f(C) + f(G) + f(P) + f(F)<br />
0 = f(D) + f(H) + f(P) + f(G):<br />
If we add the last four equations, then subtract the &#64257;rst<br />
equation and twice the second equation, we obtain 0 =<br />
4f(P), whence f(P) = 0.</div>

]]></content:encoded>
			<category domain="http://www.physicsforums.com/forumdisplay.php?f=75"><![CDATA[Linear & Abstract Algebra]]></category>
			<dc:creator>hello95</dc:creator>
			<guid isPermaLink="true">http://www.physicsforums.com/showthread.php?t=697507</guid>
		</item>
		<item>
			<title>Solving for a Lie Algebra in General</title>
			<link>http://www.physicsforums.com/showthread.php?t=697480&amp;goto=newpost</link>
			<pubDate>Mon, 17 Jun 2013 17:15:32 GMT</pubDate>
			<description>So, 
 
I just went through the derivation of the Lie algebra for SO(n).  in order to do so, we considered ##b^{-1}ab##, and related it to...</description>
			<content:encoded><![CDATA[<div>So,<br />
<br />
I just went through the derivation of the Lie algebra for SO(n).  in order to do so, we considered ##b^{-1}ab##, and related it to ##U\left(b^{-1}ab\right)##, and since we have a group homomorphism, ##U^{-1}\left(b\right)U\left(a\right)U\left(b\right)##, all of which correspond to the whole similarity matrix thing.  By careful choice of element representation, one is able to massage a commutator structure, then it all reduces down.  What is the deal with the choice of similarity?  Is this why mathematicians always say in passing how important similarity transformations are for physicists?<br />
<br />
cheers</div>

]]></content:encoded>
			<category domain="http://www.physicsforums.com/forumdisplay.php?f=75"><![CDATA[Linear & Abstract Algebra]]></category>
			<dc:creator>pdxautodidact</dc:creator>
			<guid isPermaLink="true">http://www.physicsforums.com/showthread.php?t=697480</guid>
		</item>
		<item>
			<title>Ax=Bx for all x implies A=B</title>
			<link>http://www.physicsforums.com/showthread.php?t=697412&amp;goto=newpost</link>
			<pubDate>Mon, 17 Jun 2013 06:21:47 GMT</pubDate>
			<description>Suppose A and B are matrices of the same size, and x is a column vector such that the matrix products Ax and Bx are defined. 
 
Suppose that Ax=Bx...</description>
			<content:encoded><![CDATA[<div>Suppose A and B are matrices of the same size, and x is a column vector such that the matrix products Ax and Bx are defined.<br />
<br />
Suppose that Ax=Bx for all x. Then is it true that A=B? <br />
<br />
I know that this is true and I can prove it using the idea of transformation matrices, and viewing Ax and Bx each as linear transformations and showing that those two transformations are equivalent, but I was curious if this can be proved without appealing to the notion of a linear transformation.<br />
<br />
Tips?<br />
<br />
BiP</div>

]]></content:encoded>
			<category domain="http://www.physicsforums.com/forumdisplay.php?f=75"><![CDATA[Linear & Abstract Algebra]]></category>
			<dc:creator>Bipolarity</dc:creator>
			<guid isPermaLink="true">http://www.physicsforums.com/showthread.php?t=697412</guid>
		</item>
		<item>
			<title>Mazur-Ulam theorem (bijective isometries are affine maps)</title>
			<link>http://www.physicsforums.com/showthread.php?t=697380&amp;goto=newpost</link>
			<pubDate>Mon, 17 Jun 2013 01:49:48 GMT</pubDate>
			<description><![CDATA[I've been studying the proof of the Mazur-Ulam theorem in the pdf linked to at the end of this Wikipedia article...]]></description>
			<content:encoded><![CDATA[<div>I've been studying the proof of the Mazur-Ulam theorem in the pdf linked to at the end of <a href="http://en.wikipedia.org/wiki/Mazur-Ulam_theorem" target="_blank">this Wikipedia article</a>. I'm struggling with some details in that pdf.<br />
<br />
Theorem: Let E and F be arbitrary normed spaces. If ##f:E\to F## is a bijective isometry, then f is an affine map.<br />
<br />
Some of the things I don't get:<br />
<br />
1. Their definition of &quot;affine map&quot;. How does ##f(tx+(1-t)y)=tf(x)+(1-t)f(y)## for all ##x,y\in X## and all ##t\in[0,1]## imply that f-f(0) is linear? I don't see how to deal with (f-f(0))(ax) where ##a\in\mathbb R## is arbitrary.<br />
<br />
2. The claim that ##\psi## is an isometry. ##\psi:E\to E## is defined by ##\psi(x)=2z-x## for all ##x\in E##. This map sends an arbitrary point in E to the point that's &quot;on the opposite side of z&quot;, i.e. the point y such that y=z+(z-x). They claim that ##\psi## is an isometry, but consider e.g. ##E=\mathbb R##, z=2, x=1. We have ##\psi(1)=2\cdot 2-1=3##, but ##\|\psi(1)\|=3\neq 1=\|1\|##.<br />
<br />
3. If ##\psi## isn't an isometry, then I don't see a reason to think that the map the author denotes by g* should be an isometry either. It's defined by ##g^*=\psi\circ g^{-1}\circ\psi\circ g##, where g is a bijective isometry. The step ##\|g^*(z)-z\|\leq\lambda## relies on ##g^*## being an isometry.<br />
<br />
4. All they're proving is that for all ##a,b\in E##, we have ##f\left(\frac{a+b}{2}\right)=\frac 1 2 f(a)+\frac 1 2 f(b)##. It's not obvious that this implies that f is affine.</div>

]]></content:encoded>
			<category domain="http://www.physicsforums.com/forumdisplay.php?f=75"><![CDATA[Linear & Abstract Algebra]]></category>
			<dc:creator>Fredrik</dc:creator>
			<guid isPermaLink="true">http://www.physicsforums.com/showthread.php?t=697380</guid>
		</item>
		<item>
			<title>Angle between vectors</title>
			<link>http://www.physicsforums.com/showthread.php?t=697321&amp;goto=newpost</link>
			<pubDate>Sun, 16 Jun 2013 19:19:09 GMT</pubDate>
			<description>I have some question guys 
 
i have four points in the x,y plane in cartesian coordinates. 
 
A (Ax,Ay) 
B(Bx,By) 
 
C(Cx,Cy) 
D(Dx,Dy)</description>
			<content:encoded><![CDATA[<div>I have some question guys<br />
<br />
i have four points in the x,y plane in cartesian coordinates.<br />
<br />
A (Ax,Ay)<br />
B(Bx,By)<br />
<br />
C(Cx,Cy)<br />
D(Dx,Dy)<br />
<br />
A and B is vector G<br />
C and D  is vector F<br />
<br />
I would like to know what is the equation to get the angle between those two vectors (G,F) . and what are the limitations of this equation.<br />
<br />
thank you</div>

]]></content:encoded>
			<category domain="http://www.physicsforums.com/forumdisplay.php?f=75"><![CDATA[Linear & Abstract Algebra]]></category>
			<dc:creator>dudu3060</dc:creator>
			<guid isPermaLink="true">http://www.physicsforums.com/showthread.php?t=697321</guid>
		</item>
		<item>
			<title>inverse transformation matrix entry bounds</title>
			<link>http://www.physicsforums.com/showthread.php?t=697014&amp;goto=newpost</link>
			<pubDate>Fri, 14 Jun 2013 18:21:34 GMT</pubDate>
			<description>I have sets of 2d vectors to be transformed by an augmented matrix A that performs an affine transform. 
Matrix A can have values that differ at most...</description>
			<content:encoded><![CDATA[<div>I have sets of 2d vectors to be transformed by an augmented matrix A that performs an affine transform.<br />
Matrix A can have values that differ at most |d| from the identity matrix, to limit the transformation, meaning that the min/max bounds for A are [itex] I_3 \pm dI_3[/itex] <br />
<br />
The problem is that i'd lke to have bounds for the inverse as well, expressed as a function of d, so that if i know that the transformation matrix is bound by d, that the matrix of the inverse transformation is bound by f(d). <br />
I thought the same bounds would apply, but they don't.<br />
Is there a way to find them?</div>

]]></content:encoded>
			<category domain="http://www.physicsforums.com/forumdisplay.php?f=75"><![CDATA[Linear & Abstract Algebra]]></category>
			<dc:creator>atrus_ovis</dc:creator>
			<guid isPermaLink="true">http://www.physicsforums.com/showthread.php?t=697014</guid>
		</item>
		<item>
			<title>Explanation of exponential operator proof</title>
			<link>http://www.physicsforums.com/showthread.php?t=696914&amp;goto=newpost</link>
			<pubDate>Fri, 14 Jun 2013 01:26:18 GMT</pubDate>
			<description><![CDATA[Can someone please explain the below proof in more detail? 
[IMG]http://i4.photobucket.com/albums/y117/The0wnage/Capture_zpsb4f8f1f9.jpg[/IMG] 
 
The...]]></description>
			<content:encoded><![CDATA[<div>Can someone please explain the below proof in more detail?<br />
<a href="http://i4.photobucket.com/albums/y117/The0wnage/Capture_zpsb4f8f1f9.jpg" target="_blank">http://i4.photobucket.com/albums/y11...psb4f8f1f9.jpg</a><br />
<br />
The part in particular which is confusing me is <a href="http://s4.photobucket.com/user/The0wnage/media/Capture2_zpsf444f5b1.jpg.html" target="_blank"><a href="http://i4.photobucket.com/albums/y117/The0wnage/Capture2_zpsf444f5b1.jpg" target="_blank">http://i4.photobucket.com/albums/y11...psf444f5b1.jpg</a></a><br />
<br />
Thanks in advance!</div>

]]></content:encoded>
			<category domain="http://www.physicsforums.com/forumdisplay.php?f=75"><![CDATA[Linear & Abstract Algebra]]></category>
			<dc:creator>gkirkland</dc:creator>
			<guid isPermaLink="true">http://www.physicsforums.com/showthread.php?t=696914</guid>
		</item>
		<item>
			<title>Tensor notation and common operations</title>
			<link>http://www.physicsforums.com/showthread.php?t=696814&amp;goto=newpost</link>
			<pubDate>Thu, 13 Jun 2013 15:03:23 GMT</pubDate>
			<description><![CDATA[Hello, 
sorry for my english.. 
I have more doubts about the tensor notation. 
If i have a (1,1)-tensor A[itex]\mu[/itex] [itex]\nu[/itex] 
what does...]]></description>
			<content:encoded><![CDATA[<div>Hello,<br />
sorry for my english..<br />
I have more doubts about the tensor notation.<br />
If i have a (1,1)-tensor A<sup>[itex]\mu[/itex]</sup><sub> [itex]\nu[/itex]</sub><br />
what does it correspond A<sub>[itex]\nu[/itex]</sub><sup> [itex]\mu[/itex]</sup>, A<sup> [itex]\nu[/itex]</sup><sub>[itex]\mu[/itex]</sub>??<br />
<br />
And what does it correspond in index notation A<sup>-1</sup> and A<sup>+</sup> ??<br />
And if i have a (p,q)-tensor how does it appear in index notation the inverse tensor and hermitian conjugate tensor?</div>

]]></content:encoded>
			<category domain="http://www.physicsforums.com/forumdisplay.php?f=75"><![CDATA[Linear & Abstract Algebra]]></category>
			<dc:creator>oliveriandrea</dc:creator>
			<guid isPermaLink="true">http://www.physicsforums.com/showthread.php?t=696814</guid>
		</item>
		<item>
			<title>Family of sets without maximal element</title>
			<link>http://www.physicsforums.com/showthread.php?t=696748&amp;goto=newpost</link>
			<pubDate>Thu, 13 Jun 2013 03:18:20 GMT</pubDate>
			<description>I have begun to learn about maximal elements from a linear algebraic perspective (maximal linearly independent subsets of vector spaces). I have a...</description>
			<content:encoded><![CDATA[<div>I have begun to learn about maximal elements from a linear algebraic perspective (maximal linearly independent subsets of vector spaces). I have a few questions of which I have been able to get few insights online:<br />
<br />
1) Does every family of sets have a maximal element? How can I make a family of sets that does not have a maximal element? I have to obviously make the hypothesis of Zorn's lemma fail, but I can't quite see how to do that.<br />
<br />
2) Does every chain of sets have a maximal element? It seems that a chain of sets necessarily satisfies the criteria for Zorn's lemma but I am not sure.<br />
<br />
Thanks!<br />
<br />
BiP</div>

]]></content:encoded>
			<category domain="http://www.physicsforums.com/forumdisplay.php?f=75"><![CDATA[Linear & Abstract Algebra]]></category>
			<dc:creator>Bipolarity</dc:creator>
			<guid isPermaLink="true">http://www.physicsforums.com/showthread.php?t=696748</guid>
		</item>
		<item>
			<title>The definition of an algebra</title>
			<link>http://www.physicsforums.com/showthread.php?t=696663&amp;goto=newpost</link>
			<pubDate>Wed, 12 Jun 2013 19:02:34 GMT</pubDate>
			<description><![CDATA["Let R be a commutative ring. We say that M is an algebra over R, or that M is an R-algebra if M is an R-module that is also a ring (not necessarily...]]></description>
			<content:encoded><![CDATA[<div>&quot;Let R be a commutative ring. We say that M is an <em>algebra over</em> R, or that M is an <em>R-algebra</em> if M is an R-module that is also a ring (not necessarily commutative), and the ring and module operations are compatible, i.e., [tex]r(xy) = (rx)y = x(ry)[/tex] for all [itex]x, y \in M[/itex] and [itex]r \in R[/itex].&quot;<br />
<br />
I'm not really sure why the second equality is true, because it implies commutativity and the definition tells us that an R-module is not necessarily commutative, right?<br />
<br />
Thank you in advance</div>

]]></content:encoded>
			<category domain="http://www.physicsforums.com/forumdisplay.php?f=75"><![CDATA[Linear & Abstract Algebra]]></category>
			<dc:creator>Artusartos</dc:creator>
			<guid isPermaLink="true">http://www.physicsforums.com/showthread.php?t=696663</guid>
		</item>
		<item>
			<title>Need resources for solving nonlinear matrix equations</title>
			<link>http://www.physicsforums.com/showthread.php?t=696595&amp;goto=newpost</link>
			<pubDate>Wed, 12 Jun 2013 10:53:43 GMT</pubDate>
			<description><![CDATA[In my work I've encountered equations of the type: 
 
(Ax).*(Bx) + Cx = d 
 
Where A,B and C are non-unitary square matrices, x and d column vectors...]]></description>
			<content:encoded><![CDATA[<div>In my work I've encountered equations of the type:<br />
<br />
(Ax).*(Bx) + Cx = d<br />
<br />
Where A,B and C are non-unitary square matrices, x and d column vectors and .* denote component-wise multiplication.<br />
<br />
I have a few books which discuss nonlinear matrix equations, but not of this kind. Any suggestions?</div>

]]></content:encoded>
			<category domain="http://www.physicsforums.com/forumdisplay.php?f=75"><![CDATA[Linear & Abstract Algebra]]></category>
			<dc:creator>Kosh Naranek</dc:creator>
			<guid isPermaLink="true">http://www.physicsforums.com/showthread.php?t=696595</guid>
		</item>
		<item>
			<title><![CDATA[zeta(3) and Euler's formula]]></title>
			<link>http://www.physicsforums.com/showthread.php?t=696507&amp;goto=newpost</link>
			<pubDate>Tue, 11 Jun 2013 19:33:59 GMT</pubDate>
			<description><![CDATA[Hi everyone. I'm trying to understand the step where they wrote 
 
1/2 &#8719;1/(1+p^-3) =1/2 &#425;(-1)^ord(k)/k^3  
 
How can I see this? I know the Euler...]]></description>
			<content:encoded><![CDATA[<div>Hi everyone. I'm trying to understand the step where they wrote<br />
<br />
1/2 &#8719;1/(1+p^-3) =1/2 &#425;(-1)^ord(k)/k^3 <br />
<br />
How can I see this? I know the Euler product formula, but it has a negative sign before the p^-3, where here we have a + sign.<br />
<br />
Thanks for the help.</div>


	<br />
	<div style="padding:6px">

	

	

	
		<fieldset class="fieldset">
			<legend>Attached Images</legend>
			<table cellpadding="0" cellspacing="3" border="0">
			<tr>
	<td><img class="inlineimg" src="http://www.physicsforums.com/images/attach/jpg.gif" alt="File Type: jpg" width="16" height="16" border="0" style="vertical-align:baseline" /></td>
	<td><a href="http://www.physicsforums.com/attachment.php?attachmentid=59460&amp;d=1370978685" target="_blank">image.jpg</a> (131.7 KB)</td>
</tr>
			</table>
			</fieldset>
	

	

	</div>
]]></content:encoded>
			<category domain="http://www.physicsforums.com/forumdisplay.php?f=75"><![CDATA[Linear & Abstract Algebra]]></category>
			<dc:creator>camilus</dc:creator>
			<guid isPermaLink="true">http://www.physicsforums.com/showthread.php?t=696507</guid>
		</item>
		<item>
			<title>Invertible transformations</title>
			<link>http://www.physicsforums.com/showthread.php?t=696397&amp;goto=newpost</link>
			<pubDate>Tue, 11 Jun 2013 02:50:43 GMT</pubDate>
			<description>For a linear transformation to be invertible, is it a requirement that the domain and codomain be the same vector space, or merely that they have the...</description>
			<content:encoded><![CDATA[<div>For a linear transformation to be invertible, is it a requirement that the domain and codomain be the same vector space, or merely that they have the same dimension? My intuition tells me they merely need the same dimension but someone can correct me please?<br />
<br />
BiP</div>

]]></content:encoded>
			<category domain="http://www.physicsforums.com/forumdisplay.php?f=75"><![CDATA[Linear & Abstract Algebra]]></category>
			<dc:creator>Bipolarity</dc:creator>
			<guid isPermaLink="true">http://www.physicsforums.com/showthread.php?t=696397</guid>
		</item>
		<item>
			<title>Uniqueness of linear maps</title>
			<link>http://www.physicsforums.com/showthread.php?t=696331&amp;goto=newpost</link>
			<pubDate>Mon, 10 Jun 2013 17:19:32 GMT</pubDate>
			<description>Friedberg proves the following theorem: 
Let V and W be vector spaces over a common field F, and suppose that V is finite-dimensional with a basis...</description>
			<content:encoded><![CDATA[<div>Friedberg proves the following theorem:<br />
Let V and W be vector spaces over a common field F, and suppose that V is finite-dimensional with a basis [itex] \{ x_{1}...x_{n} \}. [/itex] For any vectors [itex] y_{1}...y_{n} [/itex] in W, there exists exactly one linear transformation [itex] T: V &#8594; W [/itex] such that [itex] T(x_{i}) = y_{i} [/itex] for i = 1,...,n.<br />
<br />
He uses this theorem to assert the following:<br />
Suppose that V and W are finite-dimensional vector spaces with ordered bases [itex] = \{ x_{1}...x_{n} \} [/itex] and [itex] = \{ y_{1}...y_{m} \} [/itex], respectively. Let [itex] T: V &#8594;W [/itex] be a linear map. Then there exist scalars [itex] a_{ij} \in F \mbox{ (i = 1,..., m and j = 1,...,n) } [/itex] such that<br />
<br />
[tex] T(x_{j}) = \sum^{m}_{i=1}a_{ij}y_{i} \mbox{ for } 1 \leq j \leq n [/tex]<br />
<br />
He doesn't really prove the assertion he makes regarding the matrix representation, and it is not obvious to me. Obviously the first theorem (regarding the action of linear maps upon bases) is necessary to show that the matrix representation exists and is the unique linear map satisfying the action of the linear map upon bases. The problem is that in the first theorem, he uses n vectors from W. In the second theorem, the basis he uses for W has m vectors which may or may not be equal to n. If it is not equal to n, why is he allowed to use the theorem? <br />
<br />
I apologize if I'm not clear enough. Please let me know which part is not clear and I will clarify further. <br />
<br />
BiP</div>

]]></content:encoded>
			<category domain="http://www.physicsforums.com/forumdisplay.php?f=75"><![CDATA[Linear & Abstract Algebra]]></category>
			<dc:creator>Bipolarity</dc:creator>
			<guid isPermaLink="true">http://www.physicsforums.com/showthread.php?t=696331</guid>
		</item>
		<item>
			<title>Finding the inverse of matrices larger than 2x2</title>
			<link>http://www.physicsforums.com/showthread.php?t=696145&amp;goto=newpost</link>
			<pubDate>Sun, 09 Jun 2013 15:06:50 GMT</pubDate>
			<description><![CDATA[Is there a way without using the algorithm to find A-1 of a square matrix greater than 2x2?  
 
The question we are given in the books is:  
 
[-25  ...]]></description>
			<content:encoded><![CDATA[<div>Is there a way without using the algorithm to find A<sup>-1</sup> of a square matrix greater than 2x2? <br />
<br />
The question we are given in the books is: <br />
<br />
[-25   -9  -27]<br />
[536 185 537]<br />
[154  52  143]<br />
<br />
We are asked to find A<sup>-1</sup> of the second and third column without computing the first column. <br />
<br />
(Sorry about the format...I couldn't figure out how to use the brackets on this one.)<br />
<br />
Thanks.</div>

]]></content:encoded>
			<category domain="http://www.physicsforums.com/forumdisplay.php?f=75"><![CDATA[Linear & Abstract Algebra]]></category>
			<dc:creator>dwn</dc:creator>
			<guid isPermaLink="true">http://www.physicsforums.com/showthread.php?t=696145</guid>
		</item>
	</channel>
</rss>
