<?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:media="http://search.yahoo.com/mrss/"
		>
<channel>
	<title>Comments for Tom's Math Weblog</title>
	<atom:link href="http://trdunlap2.wordpress.com/comments/feed/" rel="self" type="application/rss+xml" />
	<link>http://trdunlap2.wordpress.com</link>
	<description>What I'm working on and what I'm finding</description>
	<lastBuildDate>Wed, 08 Jul 2009 18:50:18 +0000</lastBuildDate>
	<generator>http://wordpress.com/</generator>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
		<item>
		<title>Comment on GRTEALA 1: Review of the situation by trdunlap2</title>
		<link>http://trdunlap2.wordpress.com/2009/07/08/grteala-1-review-of-the-situation/#comment-148</link>
		<dc:creator>trdunlap2</dc:creator>
		<pubDate>Wed, 08 Jul 2009 18:50:18 +0000</pubDate>
		<guid isPermaLink="false">http://trdunlap2.wordpress.com/2009/07/08/grteala-1-review-of-the-situation/#comment-148</guid>
		<description>I&#039;ll list the following with more detail in a future post

For $latex L\mathfrak{sl}_2$:
- Plucker relations are a wash so far.
- My work has been assuming the Induction works
- I believe reduction to dim-2 will still work
- There will undoubtedly me infinitely many primitives
- MV-polytopes won&#039;t uniquely factor into primitives without introduction of non-MV-polytopes: a sort of &quot;imaginary&quot; cluster.  But Kamnitzer was surprised I would seek unique factorization anyway.
- I&#039;m excited to check the networks of non-overlapping cords.  There is no proof (that I know of) of their correlation for finite type, only an observation. But would interest me if such a pattern would continue to hold in the affine case.</description>
		<content:encoded><![CDATA[<p>I&#8217;ll list the following with more detail in a future post</p>
<p>For <img src='http://l.wordpress.com/latex.php?latex=L%5Cmathfrak%7Bsl%7D_2&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='L\mathfrak{sl}_2' title='L\mathfrak{sl}_2' class='latex' />:<br />
- Plucker relations are a wash so far.<br />
- My work has been assuming the Induction works<br />
- I believe reduction to dim-2 will still work<br />
- There will undoubtedly me infinitely many primitives<br />
- MV-polytopes won&#8217;t uniquely factor into primitives without introduction of non-MV-polytopes: a sort of &#8220;imaginary&#8221; cluster.  But Kamnitzer was surprised I would seek unique factorization anyway.<br />
- I&#8217;m excited to check the networks of non-overlapping cords.  There is no proof (that I know of) of their correlation for finite type, only an observation. But would interest me if such a pattern would continue to hold in the affine case.</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on A conjecture on the Uniqueness of MV-Polytopes by trdunlap2</title>
		<link>http://trdunlap2.wordpress.com/2009/07/06/a-conjecture-on-the-uniqueness-of-mv-polytopes/#comment-147</link>
		<dc:creator>trdunlap2</dc:creator>
		<pubDate>Tue, 07 Jul 2009 22:43:09 +0000</pubDate>
		<guid isPermaLink="false">http://trdunlap2.wordpress.com/?p=320#comment-147</guid>
		<description>The conjecture is obviously false as stated because I forgot another restriction.  We need a kind of maximality.  For example, in the case of $latex \mathfrak{sl}_2\times\mathfrak{sl}_2$ our polytopes may be rectangles (the &quot;right&quot; answer) or line segments -- or a number of other choices all of which consist of subsets.

I also may have to assume some version of convexity (subject to condition 1) -- this I can&#039;t remember.</description>
		<content:encoded><![CDATA[<p>The conjecture is obviously false as stated because I forgot another restriction.  We need a kind of maximality.  For example, in the case of <img src='http://l.wordpress.com/latex.php?latex=%5Cmathfrak%7Bsl%7D_2%5Ctimes%5Cmathfrak%7Bsl%7D_2&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\mathfrak{sl}_2\times\mathfrak{sl}_2' title='\mathfrak{sl}_2\times\mathfrak{sl}_2' class='latex' /> our polytopes may be rectangles (the &#8220;right&#8221; answer) or line segments &#8212; or a number of other choices all of which consist of subsets.</p>
<p>I also may have to assume some version of convexity (subject to condition 1) &#8212; this I can&#8217;t remember.</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Zero-stability: Examples by trdunlap2</title>
		<link>http://trdunlap2.wordpress.com/2009/05/04/zero-stability-examples/#comment-146</link>
		<dc:creator>trdunlap2</dc:creator>
		<pubDate>Mon, 04 May 2009 20:55:15 +0000</pubDate>
		<guid isPermaLink="false">http://trdunlap2.wordpress.com/?p=316#comment-146</guid>
		<description>Note: I calculate $latex \mathfrak{z}^s_0$ in that last example to be $latex (\mathbb{C}^*)\times  (\mathbb{C}^*)$.  With sufficient choice of $latex \rho$ the defining  $latex \mathbb{C}^*$-action will have four fixed points in the closure, none in the interior.</description>
		<content:encoded><![CDATA[<p>Note: I calculate <img src='http://l.wordpress.com/latex.php?latex=%5Cmathfrak%7Bz%7D%5Es_0&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\mathfrak{z}^s_0' title='\mathfrak{z}^s_0' class='latex' /> in that last example to be <img src='http://l.wordpress.com/latex.php?latex=%28%5Cmathbb%7BC%7D%5E%2A%29%5Ctimes++%28%5Cmathbb%7BC%7D%5E%2A%29&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='(\mathbb{C}^*)\times  (\mathbb{C}^*)' title='(\mathbb{C}^*)\times  (\mathbb{C}^*)' class='latex' />.  With sufficient choice of <img src='http://l.wordpress.com/latex.php?latex=%5Crho&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\rho' title='\rho' class='latex' /> the defining  <img src='http://l.wordpress.com/latex.php?latex=%5Cmathbb%7BC%7D%5E%2A&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\mathbb{C}^*' title='\mathbb{C}^*' class='latex' />-action will have four fixed points in the closure, none in the interior.</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on 0-stable Modules by trdunlap2</title>
		<link>http://trdunlap2.wordpress.com/2009/04/24/0-stable-modules/#comment-144</link>
		<dc:creator>trdunlap2</dc:creator>
		<pubDate>Fri, 24 Apr 2009 22:55:02 +0000</pubDate>
		<guid isPermaLink="false">http://trdunlap2.wordpress.com/2009/04/24/0-stable-modules/#comment-144</guid>
		<description>Tomorrow I give an alternate definition of 0-stable and next week some example calculations.</description>
		<content:encoded><![CDATA[<p>Tomorrow I give an alternate definition of 0-stable and next week some example calculations.</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Special case reflecting onto a vertical edge by trdunlap2</title>
		<link>http://trdunlap2.wordpress.com/2008/12/18/special-case-reflecting-onto-a-vertical-edge/#comment-135</link>
		<dc:creator>trdunlap2</dc:creator>
		<pubDate>Thu, 18 Dec 2008 08:19:59 +0000</pubDate>
		<guid isPermaLink="false">http://trdunlap2.wordpress.com/?p=258#comment-135</guid>
		<description>I believe its only coincidental that the point of contention is the reflection of a reflection.</description>
		<content:encoded><![CDATA[<p>I believe its only coincidental that the point of contention is the reflection of a reflection.</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Another example by trdunlap2</title>
		<link>http://trdunlap2.wordpress.com/2008/12/17/another-example/#comment-134</link>
		<dc:creator>trdunlap2</dc:creator>
		<pubDate>Wed, 17 Dec 2008 22:59:04 +0000</pubDate>
		<guid isPermaLink="false">http://trdunlap2.wordpress.com/?p=254#comment-134</guid>
		<description>Next: Special case when corners reflect onto a vertical line.</description>
		<content:encoded><![CDATA[<p>Next: Special case when corners reflect onto a vertical line.</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on On the &#8220;longest element&#8221; by trdunlap2</title>
		<link>http://trdunlap2.wordpress.com/2008/11/13/on-the-longest-element/#comment-129</link>
		<dc:creator>trdunlap2</dc:creator>
		<pubDate>Sat, 15 Nov 2008 23:05:13 +0000</pubDate>
		<guid isPermaLink="false">http://trdunlap2.wordpress.com/?p=200#comment-129</guid>
		<description>On second thought reflection through the origin might be more natural than rotation about the sl_2 axis.  It produces the same set chamber weights because infact the two differ only by a reflection that&#039;s already in the Weyl group.</description>
		<content:encoded><![CDATA[<p>On second thought reflection through the origin might be more natural than rotation about the sl_2 axis.  It produces the same set chamber weights because infact the two differ only by a reflection that&#8217;s already in the Weyl group.</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Calculations by trdunlap2</title>
		<link>http://trdunlap2.wordpress.com/2008/11/12/calculations-2/#comment-128</link>
		<dc:creator>trdunlap2</dc:creator>
		<pubDate>Sat, 15 Nov 2008 23:03:30 +0000</pubDate>
		<guid isPermaLink="false">http://trdunlap2.wordpress.com/?p=188#comment-128</guid>
		<description>I didn&#039;t mention, the dimensional results of my calculations are consistent with those given in &quot;Loop Groups&quot;.</description>
		<content:encoded><![CDATA[<p>I didn&#8217;t mention, the dimensional results of my calculations are consistent with those given in &#8220;Loop Groups&#8221;.</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Polytopes for LSL2 by Walls by trdunlap2</title>
		<link>http://trdunlap2.wordpress.com/2008/10/14/polytopes-for-lsl2-by-walls/#comment-124</link>
		<dc:creator>trdunlap2</dc:creator>
		<pubDate>Thu, 16 Oct 2008 06:07:54 +0000</pubDate>
		<guid isPermaLink="false">http://trdunlap2.wordpress.com/?p=181#comment-124</guid>
		<description>Applying L&#039;Hopital&#039;s rule to the each formula notice that the limit as either variable goes to plus or minus infinity is the other variable.

Also note that $latex \phi(4,5)=\phi(3,5)=\phi(3,4)=2$ ($latex \phi$ here denoting the formula above.)  So these three cells will never three meet.  This can also be seen because their normal vectors lie on a line.</description>
		<content:encoded><![CDATA[<p>Applying L&#8217;Hopital&#8217;s rule to the each formula notice that the limit as either variable goes to plus or minus infinity is the other variable.</p>
<p>Also note that <img src='http://l.wordpress.com/latex.php?latex=%5Cphi%284%2C5%29%3D%5Cphi%283%2C5%29%3D%5Cphi%283%2C4%29%3D2&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\phi(4,5)=\phi(3,5)=\phi(3,4)=2' title='\phi(4,5)=\phi(3,5)=\phi(3,4)=2' class='latex' /> (<img src='http://l.wordpress.com/latex.php?latex=%5Cphi&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\phi' title='\phi' class='latex' /> here denoting the formula above.)  So these three cells will never three meet.  This can also be seen because their normal vectors lie on a line.</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Polytopes for LSL2 by Walls by trdunlap2</title>
		<link>http://trdunlap2.wordpress.com/2008/10/14/polytopes-for-lsl2-by-walls/#comment-123</link>
		<dc:creator>trdunlap2</dc:creator>
		<pubDate>Wed, 15 Oct 2008 20:32:43 +0000</pubDate>
		<guid isPermaLink="false">http://trdunlap2.wordpress.com/?p=181#comment-123</guid>
		<description>I&#039;m not sure what placement of planes should be possible, but I&#039;d guess that vertices should be on the lattice, which would pose a major restriction.</description>
		<content:encoded><![CDATA[<p>I&#8217;m not sure what placement of planes should be possible, but I&#8217;d guess that vertices should be on the lattice, which would pose a major restriction.</p>
]]></content:encoded>
	</item>
</channel>
</rss>
