<?xml version="1.0" encoding="utf-8"?>
<rss version="2.0"
    xmlns:dc="http://purl.org/dc/elements/1.1/"
     xmlns:admin="http://webns.net/mvcb/"
     xmlns:content="http://purl.org/rss/1.0/modules/content/"
     xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#">
	<channel>
	  <title>Ask MetaFilter questions tagged with latinsquares</title>
      <link>http://ask.metafilter.com/tags/latinsquares</link>
      <description>Questions tagged with 'latinsquares' at Ask MetaFilter.</description>
	  <pubDate>Thu, 01 Feb 2007 16:29:34 -0800</pubDate> <lastBuildDate>Thu, 01 Feb 2007 16:29:34 -0800</lastBuildDate>

      <language>en-us</language>
	  <docs>http://blogs.law.harvard.edu/tech/rss</docs>
	  <ttl>60</ttl>	  
	<item>
	<title>Looking for a special case of latin squares</title>
	<link>http://ask.metafilter.com/56191/Looking%2Dfor%2Da%2Dspecial%2Dcase%2Dof%2Dlatin%2Dsquares</link>	
	<description>Mathfilter: Is there a name for the special case of the latin square in which each possible pair of adjacent elements appears exactly once in all the rows? Sorry my description is so convoluted. Here&apos;s an example latin square that displays this property:&lt;br&gt;
&lt;pre&gt;&lt;br&gt;
1  2  3  4&lt;br&gt;
2  4  1  3&lt;br&gt;
3  1  4  2&lt;br&gt;
4  3  2  1&lt;br&gt;
&lt;/pre&gt;&lt;br&gt;
Are there any proofs about the existance or non-existance of such squares for other sizes? Better yet, is there an algorithm for generating them?</description>
	<guid isPermaLink="false">tag:ask.metafilter.com,2007:site.56191</guid>
	<pubDate>Thu, 01 Feb 2007 16:29:34 -0800</pubDate>
	<category>latinsquares</category>
	<category>math</category>
	<dc:creator>Eamon</dc:creator>
	</item>
	
	</channel>
</rss>

