<?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/"
	
	>
<channel>
	<title>Comments on: What Kind of Thing is a Sporadic Simple Group?</title>
	<atom:link href="http://www.arsmathematica.net/2006/09/24/what-kind-of-thing-is-a-sporadic-simple-group/feed/" rel="self" type="application/rss+xml" />
	<link>http://www.arsmathematica.net/2006/09/24/what-kind-of-thing-is-a-sporadic-simple-group/</link>
	<description>Dedicated to the mathematical arts.</description>
	<lastBuildDate>Fri, 29 May 2015 09:17:44 +0000</lastBuildDate>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>https://wordpress.org/?v=4.1.41</generator>
	<item>
		<title>By: Walt</title>
		<link>http://www.arsmathematica.net/2006/09/24/what-kind-of-thing-is-a-sporadic-simple-group/#comment-1439</link>
		<dc:creator><![CDATA[Walt]]></dc:creator>
		<pubDate>Sat, 30 Sep 2006 04:06:33 +0000</pubDate>
		<guid isPermaLink="false">http://www.arsmathematica.net/archives/2006/09/24/what-kind-of-thing-is-a-sporadic-simple-group/#comment-1439</guid>
		<description><![CDATA[That&#039;s an interesting result.  I wonder if people will begin to avoid invoking the classification and prove results directly: there is something unaesthetic about depending on a result whose proof is so long.]]></description>
		<content:encoded><![CDATA[<p>That&#8217;s an interesting result.  I wonder if people will begin to avoid invoking the classification and prove results directly: there is something unaesthetic about depending on a result whose proof is so long.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: AlexandreBorovik</title>
		<link>http://www.arsmathematica.net/2006/09/24/what-kind-of-thing-is-a-sporadic-simple-group/#comment-1438</link>
		<dc:creator><![CDATA[AlexandreBorovik]]></dc:creator>
		<pubDate>Thu, 28 Sep 2006 21:15:04 +0000</pubDate>
		<guid isPermaLink="false">http://www.arsmathematica.net/archives/2006/09/24/what-kind-of-thing-is-a-sporadic-simple-group/#comment-1438</guid>
		<description><![CDATA[Actually, there is a number of very specific results of asymptotic nature about finite simple groups ; Ashbacher&#039;s thesis is much more than just a philosophy. One of such results is a paper by Larsen and &lt;i&gt;Pink Finite Subgroups of Algebraic Groups&lt;/i&gt;. I quote the abstract:

    Generalizing a classical theorem of Jordan to arbitrary characteristic, we prove that every finite subgroup of GLn over a field of any characteristic p possesses a subgroup of bounded index which is composed of finite simple groups of Lie type in characteristic p, a commutative group of order prime to p, and a p-group. While this statement can be deduced from the classification of finite simple groups, our proof is self-contained and uses methods only from algebraic geometry and the theory of linear algebraic groups. We believe that our results can serve as a viable substitute for classification in a range of applications in various areas of mathematics.]]></description>
		<content:encoded><![CDATA[<p>Actually, there is a number of very specific results of asymptotic nature about finite simple groups ; Ashbacher&#8217;s thesis is much more than just a philosophy. One of such results is a paper by Larsen and <i>Pink Finite Subgroups of Algebraic Groups</i>. I quote the abstract:</p>
<p>    Generalizing a classical theorem of Jordan to arbitrary characteristic, we prove that every finite subgroup of GLn over a field of any characteristic p possesses a subgroup of bounded index which is composed of finite simple groups of Lie type in characteristic p, a commutative group of order prime to p, and a p-group. While this statement can be deduced from the classification of finite simple groups, our proof is self-contained and uses methods only from algebraic geometry and the theory of linear algebraic groups. We believe that our results can serve as a viable substitute for classification in a range of applications in various areas of mathematics.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: JacquesC</title>
		<link>http://www.arsmathematica.net/2006/09/24/what-kind-of-thing-is-a-sporadic-simple-group/#comment-1436</link>
		<dc:creator><![CDATA[JacquesC]]></dc:creator>
		<pubDate>Tue, 26 Sep 2006 02:43:25 +0000</pubDate>
		<guid isPermaLink="false">http://www.arsmathematica.net/archives/2006/09/24/what-kind-of-thing-is-a-sporadic-simple-group/#comment-1436</guid>
		<description><![CDATA[Small numbers are just bad news.

My own speculation involves &lt;a href=&quot;http://en.wikipedia.org/wiki/Kolmogorov_complexity&quot; rel=&quot;nofollow&quot;&gt;Kolmogorov complexity&lt;/a&gt;, in general agreement of your position.  Basically, when things are controlled by small numbers (dimension, size, whatever), there often isn&#039;t enough &quot;room&quot; for generic phenomena to happen.  Because of the lack of room, unlikely events are &lt;i&gt;forced&lt;/i&gt;.  Which turns out to be consistent with Corfield and Gelfand.  In other words, I think both explanations can be made consistent with each other.]]></description>
		<content:encoded><![CDATA[<p>Small numbers are just bad news.</p>
<p>My own speculation involves <a href="http://en.wikipedia.org/wiki/Kolmogorov_complexity" rel="nofollow">Kolmogorov complexity</a>, in general agreement of your position.  Basically, when things are controlled by small numbers (dimension, size, whatever), there often isn&#8217;t enough &#8220;room&#8221; for generic phenomena to happen.  Because of the lack of room, unlikely events are <i>forced</i>.  Which turns out to be consistent with Corfield and Gelfand.  In other words, I think both explanations can be made consistent with each other.</p>
]]></content:encoded>
	</item>
</channel>
</rss>
