<?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: The symmetric group, 2</title>
	<atom:link href="http://cameroncounts.wordpress.com/2010/05/05/the-symmetric-group-2/feed/" rel="self" type="application/rss+xml" />
	<link>http://cameroncounts.wordpress.com/2010/05/05/the-symmetric-group-2/</link>
	<description>always busy counting, doubting every figured guess . . .</description>
	<lastBuildDate>Sun, 05 May 2013 21:43:35 +0000</lastBuildDate>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.com/</generator>
	<item>
		<title>By: 2010 in review &#171; Peter Cameron&#039;s Blog</title>
		<link>http://cameroncounts.wordpress.com/2010/05/05/the-symmetric-group-2/#comment-1791</link>
		<dc:creator><![CDATA[2010 in review &#171; Peter Cameron&#039;s Blog]]></dc:creator>
		<pubDate>Sun, 02 Jan 2011 18:31:26 +0000</pubDate>
		<guid isPermaLink="false">http://cameroncounts.wordpress.com/?p=295#comment-1791</guid>
		<description><![CDATA[[...] The symmetric group, 2 May 20105 comments  4 [...]]]></description>
		<content:encoded><![CDATA[<p>[...] The symmetric group, 2 May 20105 comments  4 [...]</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Elvis Alhassan</title>
		<link>http://cameroncounts.wordpress.com/2010/05/05/the-symmetric-group-2/#comment-1438</link>
		<dc:creator><![CDATA[Elvis Alhassan]]></dc:creator>
		<pubDate>Tue, 26 Oct 2010 12:27:38 +0000</pubDate>
		<guid isPermaLink="false">http://cameroncounts.wordpress.com/?p=295#comment-1438</guid>
		<description><![CDATA[Pls help me with notes on how to write the wreath product of the symmetric group S2. Regards.]]></description>
		<content:encoded><![CDATA[<p>Pls help me with notes on how to write the wreath product of the symmetric group S2. Regards.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: The symmetric group, 3 &#171; Peter Cameron&#039;s Blog</title>
		<link>http://cameroncounts.wordpress.com/2010/05/05/the-symmetric-group-2/#comment-1398</link>
		<dc:creator><![CDATA[The symmetric group, 3 &#171; Peter Cameron&#039;s Blog]]></dc:creator>
		<pubDate>Thu, 21 Oct 2010 14:45:29 +0000</pubDate>
		<guid isPermaLink="false">http://cameroncounts.wordpress.com/?p=295#comment-1398</guid>
		<description><![CDATA[[...] Cameron&#039;s Blog Counting the things that need to be counted      &#171; The symmetric group, 2 Anniversary [...]]]></description>
		<content:encoded><![CDATA[<p>[...] Cameron&#039;s Blog Counting the things that need to be counted      &laquo; The symmetric group, 2 Anniversary [...]</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: The symmetric group, 1 &#171; Peter Cameron&#039;s Blog</title>
		<link>http://cameroncounts.wordpress.com/2010/05/05/the-symmetric-group-2/#comment-1396</link>
		<dc:creator><![CDATA[The symmetric group, 1 &#171; Peter Cameron&#039;s Blog]]></dc:creator>
		<pubDate>Thu, 21 Oct 2010 14:42:14 +0000</pubDate>
		<guid isPermaLink="false">http://cameroncounts.wordpress.com/?p=295#comment-1396</guid>
		<description><![CDATA[[...] Next [...]]]></description>
		<content:encoded><![CDATA[<p>[...] Next [...]</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Sam Tarzi</title>
		<link>http://cameroncounts.wordpress.com/2010/05/05/the-symmetric-group-2/#comment-447</link>
		<dc:creator><![CDATA[Sam Tarzi]]></dc:creator>
		<pubDate>Wed, 05 May 2010 22:50:39 +0000</pubDate>
		<guid isPermaLink="false">http://cameroncounts.wordpress.com/?p=295#comment-447</guid>
		<description><![CDATA[There is another way in which, for example, large automorphism groups and small Galois groups for graphs can arise, which is in the sense of Lascar and co-workers (see for example his ICM 2002 address and refs. therein), who studied the quotient of the automorphism group of a saturated relational structure by its (normal) strong automorphism subgroup, which he called the Galois group of the structure or theory.  The uncountably infinite automorphism group of the random graph is simple so it would have trivial Galois group in this sense.  But I don&#039;t know how this relates to the open question.]]></description>
		<content:encoded><![CDATA[<p>There is another way in which, for example, large automorphism groups and small Galois groups for graphs can arise, which is in the sense of Lascar and co-workers (see for example his ICM 2002 address and refs. therein), who studied the quotient of the automorphism group of a saturated relational structure by its (normal) strong automorphism subgroup, which he called the Galois group of the structure or theory.  The uncountably infinite automorphism group of the random graph is simple so it would have trivial Galois group in this sense.  But I don&#8217;t know how this relates to the open question.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: The symmetric group, 2 « Peter Cameron&#039;s Blog &#124; Silcon Group</title>
		<link>http://cameroncounts.wordpress.com/2010/05/05/the-symmetric-group-2/#comment-417</link>
		<dc:creator><![CDATA[The symmetric group, 2 « Peter Cameron&#039;s Blog &#124; Silcon Group]]></dc:creator>
		<pubDate>Wed, 05 May 2010 09:56:49 +0000</pubDate>
		<guid isPermaLink="false">http://cameroncounts.wordpress.com/?p=295#comment-417</guid>
		<description><![CDATA[[...] Originally posted here:Â  The symmetric group, 2 « Peter Cameron&#039;s Blog [...]]]></description>
		<content:encoded><![CDATA[<p>[...] Originally posted here:Â  The symmetric group, 2 « Peter Cameron&#039;s Blog [...]</p>
]]></content:encoded>
	</item>
</channel>
</rss>
