<?xml version="1.0" encoding="UTF-8"?><rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"
	xmlns:georss="http://www.georss.org/georss" xmlns:geo="http://www.w3.org/2003/01/geo/wgs84_pos#" xmlns:media="http://search.yahoo.com/mrss/"
		>
<channel>
	<title>Comments on: Coherent configurations and all that, 1</title>
	<atom:link href="http://cameroncounts.wordpress.com/2012/03/30/coherent-configurations-and-all-that-1/feed/" rel="self" type="application/rss+xml" />
	<link>http://cameroncounts.wordpress.com/2012/03/30/coherent-configurations-and-all-that-1/</link>
	<description>always busy counting, doubting every figured guess . . .</description>
	<lastBuildDate>Fri, 24 May 2013 07:17:33 +0000</lastBuildDate>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.com/</generator>
	<item>
		<title>By: Peter Cameron</title>
		<link>http://cameroncounts.wordpress.com/2012/03/30/coherent-configurations-and-all-that-1/#comment-9452</link>
		<dc:creator><![CDATA[Peter Cameron]]></dc:creator>
		<pubDate>Mon, 17 Dec 2012 19:35:12 +0000</pubDate>
		<guid isPermaLink="false">http://cameroncounts.wordpress.com/?p=2199#comment-9452</guid>
		<description><![CDATA[Sorry, I don&#039;t understand why, trying to do graph isomorphism, you throw away some cheap information.]]></description>
		<content:encoded><![CDATA[<p>Sorry, I don&#8217;t understand why, trying to do graph isomorphism, you throw away some cheap information.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Durga</title>
		<link>http://cameroncounts.wordpress.com/2012/03/30/coherent-configurations-and-all-that-1/#comment-9439</link>
		<dc:creator><![CDATA[Durga]]></dc:creator>
		<pubDate>Mon, 17 Dec 2012 14:58:51 +0000</pubDate>
		<guid isPermaLink="false">http://cameroncounts.wordpress.com/?p=2199#comment-9439</guid>
		<description><![CDATA[So, if our interest is only graph isomorphism problem then is it better not to necessiate clousre under transpose to get finer partition? Would the still result in cellular algebra, primarly the  unique (0-1) basis of the algebra?]]></description>
		<content:encoded><![CDATA[<p>So, if our interest is only graph isomorphism problem then is it better not to necessiate clousre under transpose to get finer partition? Would the still result in cellular algebra, primarly the  unique (0-1) basis of the algebra?</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Peter Cameron</title>
		<link>http://cameroncounts.wordpress.com/2012/03/30/coherent-configurations-and-all-that-1/#comment-9429</link>
		<dc:creator><![CDATA[Peter Cameron]]></dc:creator>
		<pubDate>Mon, 17 Dec 2012 12:00:08 +0000</pubDate>
		<guid isPermaLink="false">http://cameroncounts.wordpress.com/?p=2199#comment-9429</guid>
		<description><![CDATA[If you didn&#039;t have closure under transpose, then you could refine your relations still further, by intersecting them with their transposes, since a potential isomorphism preserving a bunch of relations also preserves their transposes.]]></description>
		<content:encoded><![CDATA[<p>If you didn&#8217;t have closure under transpose, then you could refine your relations still further, by intersecting them with their transposes, since a potential isomorphism preserving a bunch of relations also preserves their transposes.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Durga</title>
		<link>http://cameroncounts.wordpress.com/2012/03/30/coherent-configurations-and-all-that-1/#comment-9420</link>
		<dc:creator><![CDATA[Durga]]></dc:creator>
		<pubDate>Mon, 17 Dec 2012 04:13:17 +0000</pubDate>
		<guid isPermaLink="false">http://cameroncounts.wordpress.com/?p=2199#comment-9420</guid>
		<description><![CDATA[If I see coherent algebra as a tool to attack graph isomorphism problem as did by Weisfeilear without invoking group theory, I want to understand what is the meaning of clousure under transpose. I think i have intuitive understand of other conditions based on complet colouring of graph, sum being J means theat set of relation is partitioin, some subset adding to I means that diagonal elements are coloured differently than non-diogonal elments, closure under matrix multiplication has to do with partition being equitable. So what is the similar understanding of requiring closuer under transpose?]]></description>
		<content:encoded><![CDATA[<p>If I see coherent algebra as a tool to attack graph isomorphism problem as did by Weisfeilear without invoking group theory, I want to understand what is the meaning of clousure under transpose. I think i have intuitive understand of other conditions based on complet colouring of graph, sum being J means theat set of relation is partitioin, some subset adding to I means that diagonal elements are coloured differently than non-diogonal elments, closure under matrix multiplication has to do with partition being equitable. So what is the similar understanding of requiring closuer under transpose?</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Peter Cameron</title>
		<link>http://cameroncounts.wordpress.com/2012/03/30/coherent-configurations-and-all-that-1/#comment-6944</link>
		<dc:creator><![CDATA[Peter Cameron]]></dc:creator>
		<pubDate>Tue, 18 Sep 2012 14:44:18 +0000</pubDate>
		<guid isPermaLink="false">http://cameroncounts.wordpress.com/?p=2199#comment-6944</guid>
		<description><![CDATA[That is a very good question. The definition works over the integers, as you say. But the most powerful results come from looking at the representation theory of the algebra, and even the difference between the complex and real numbers makes a big difference. In fact, statisticians (to whom all data is real) only work over the reals. I will come back to this point sometime, and try to say a bit more.]]></description>
		<content:encoded><![CDATA[<p>That is a very good question. The definition works over the integers, as you say. But the most powerful results come from looking at the representation theory of the algebra, and even the difference between the complex and real numbers makes a big difference. In fact, statisticians (to whom all data is real) only work over the reals. I will come back to this point sometime, and try to say a bit more.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Bjarki Holm</title>
		<link>http://cameroncounts.wordpress.com/2012/03/30/coherent-configurations-and-all-that-1/#comment-6943</link>
		<dc:creator><![CDATA[Bjarki Holm]]></dc:creator>
		<pubDate>Tue, 18 Sep 2012 12:05:09 +0000</pubDate>
		<guid isPermaLink="false">http://cameroncounts.wordpress.com/?p=2199#comment-6943</guid>
		<description><![CDATA[Dear Peter,

Thanks for a very nice summary of the development of coherent configurations.

Reading this, I have one question: when you define the algebra associatied with a coherent configuration, you consider the linear span of the basis matrices Ai over the complex numbers. Do you know if there is any particular reason to study these algebras over the complex numbers? This seems a bit strong as we really only need integral linear combinations of the basis matrices, via the numbers c_{ij}^k.]]></description>
		<content:encoded><![CDATA[<p>Dear Peter,</p>
<p>Thanks for a very nice summary of the development of coherent configurations.</p>
<p>Reading this, I have one question: when you define the algebra associatied with a coherent configuration, you consider the linear span of the basis matrices Ai over the complex numbers. Do you know if there is any particular reason to study these algebras over the complex numbers? This seems a bit strong as we really only need integral linear combinations of the basis matrices, via the numbers c_{ij}^k.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Peter Cameron</title>
		<link>http://cameroncounts.wordpress.com/2012/03/30/coherent-configurations-and-all-that-1/#comment-4460</link>
		<dc:creator><![CDATA[Peter Cameron]]></dc:creator>
		<pubDate>Sun, 01 Apr 2012 09:47:01 +0000</pubDate>
		<guid isPermaLink="false">http://cameroncounts.wordpress.com/?p=2199#comment-4460</guid>
		<description><![CDATA[Misha Klin has sent me a lot of information about the topic of this post. I will digest it and say something (including links) later in this series.]]></description>
		<content:encoded><![CDATA[<p>Misha Klin has sent me a lot of information about the topic of this post. I will digest it and say something (including links) later in this series.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Brain Boost* &#171; Log24</title>
		<link>http://cameroncounts.wordpress.com/2012/03/30/coherent-configurations-and-all-that-1/#comment-4447</link>
		<dc:creator><![CDATA[Brain Boost* &#171; Log24]]></dc:creator>
		<pubDate>Fri, 30 Mar 2012 16:02:30 +0000</pubDate>
		<guid isPermaLink="false">http://cameroncounts.wordpress.com/?p=2199#comment-4447</guid>
		<description><![CDATA[[...] &quot;Dark Fields&quot; in this journal  and Peter J. Cameron&#039;s weblog [...]]]></description>
		<content:encoded><![CDATA[<p>[...] &quot;Dark Fields&quot; in this journal  and Peter J. Cameron&#039;s weblog [...]</p>
]]></content:encoded>
	</item>
</channel>
</rss>
