<?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: A conjecture on the Uniqueness of MV-Polytopes</title>
	<atom:link href="http://trdunlap2.wordpress.com/2009/07/06/a-conjecture-on-the-uniqueness-of-mv-polytopes/feed/" rel="self" type="application/rss+xml" />
	<link>http://trdunlap2.wordpress.com/2009/07/06/a-conjecture-on-the-uniqueness-of-mv-polytopes/</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>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>
</channel>
</rss>
