<?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: Expanding polynomials over finite fields of large characteristic, and a regularity lemma for definable sets</title>
	<atom:link href="http://terrytao.wordpress.com/2012/11/14/expanding-polynomials-over-finite-fields-of-large-characteristic-and-a-regularity-lemma-for-definable-sets/feed/" rel="self" type="application/rss+xml" />
	<link>http://terrytao.wordpress.com/2012/11/14/expanding-polynomials-over-finite-fields-of-large-characteristic-and-a-regularity-lemma-for-definable-sets/</link>
	<description>Updates on my research and expository papers, discussion of open problems, and other maths-related topics.  By Terence Tao</description>
	<lastBuildDate>Sat, 18 May 2013 09:04:42 +0000</lastBuildDate>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.com/</generator>
	<item>
		<title>By: Rectification and the Lefschetz principle &#124; What's new</title>
		<link>http://terrytao.wordpress.com/2012/11/14/expanding-polynomials-over-finite-fields-of-large-characteristic-and-a-regularity-lemma-for-definable-sets/#comment-219477</link>
		<dc:creator><![CDATA[Rectification and the Lefschetz principle &#124; What's new]]></dc:creator>
		<pubDate>Thu, 14 Mar 2013 21:17:53 +0000</pubDate>
		<guid isPermaLink="false">http://terrytao.wordpress.com/?p=6289#comment-219477</guid>
		<description><![CDATA[[...] This principle (first laid out in an appendix of Lefschetz&#8217;s book), among other things, often allows one to use the methods of complex analysis (e.g. Riemann surface theory) to study many other fields of characteristic zero. There are many variants and extensions of this principle; see for instance this MathOverflow post for some discussion of these. I used this baby version of the Lefschetz principle recently in a paper on expanding polynomial maps. [...]]]></description>
		<content:encoded><![CDATA[<p>[...] This principle (first laid out in an appendix of Lefschetz&#8217;s book), among other things, often allows one to use the methods of complex analysis (e.g. Riemann surface theory) to study many other fields of characteristic zero. There are many variants and extensions of this principle; see for instance this MathOverflow post for some discussion of these. I used this baby version of the Lefschetz principle recently in a paper on expanding polynomial maps. [...]</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Mixing for progressions in non-abelian groups &#171; What&#8217;s new</title>
		<link>http://terrytao.wordpress.com/2012/11/14/expanding-polynomials-over-finite-fields-of-large-characteristic-and-a-regularity-lemma-for-definable-sets/#comment-203695</link>
		<dc:creator><![CDATA[Mixing for progressions in non-abelian groups &#171; What&#8217;s new]]></dc:creator>
		<pubDate>Wed, 12 Dec 2012 05:04:10 +0000</pubDate>
		<guid isPermaLink="false">http://terrytao.wordpress.com/?p=6289#comment-203695</guid>
		<description><![CDATA[[...] online submission system). This paper is loosely related in subject topic to my two previous papers on polynomial expansion and on recurrence in quasirandom groups (with Vitaly Bergelson), although the methods here are [...]]]></description>
		<content:encoded><![CDATA[<p>[...] online submission system). This paper is loosely related in subject topic to my two previous papers on polynomial expansion and on recurrence in quasirandom groups (with Vitaly Bergelson), although the methods here are [...]</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Terence Tao</title>
		<link>http://terrytao.wordpress.com/2012/11/14/expanding-polynomials-over-finite-fields-of-large-characteristic-and-a-regularity-lemma-for-definable-sets/#comment-197382</link>
		<dc:creator><![CDATA[Terence Tao]]></dc:creator>
		<pubDate>Thu, 29 Nov 2012 01:40:02 +0000</pubDate>
		<guid isPermaLink="false">http://terrytao.wordpress.com/?p=6289#comment-197382</guid>
		<description><![CDATA[For the first question, if one considers images $latex P(E)$ of arbitrary subsets $latex E$ of $latex {\Bbb F}^2$ then one could simply take $latex E = P^{-1}(C)$ for some arbitrary set $latex C$, in which case one does not do any better than the easy bound $latex &#124;P(E)&#124; \gg &#124;E&#124;/&#124;{\Bbb F}&#124;$ (assuming P non-constant of course).

For the second question, there are some scattered results of this type.  A typical result here is &lt;a HREF=&quot;http://imrn.oxfordjournals.org/content/1999/10/547.extract&quot; rel=&quot;nofollow&quot;&gt;Wolff&#039;s result on the Falconer distance conjecture&lt;/a&gt;, that if $latex E \subset {\bf R}^2$ is a compact set with Hausdorff dimension greater than 4/3, then the distance set $latex \Delta(E) := \{ &#124;x-y&#124;: x,y \in E \}$ has positive Lebesgue measure; among other things, this (morally, at least) implies that the image of $latex A^4$ under the polynomial $latex P(x,y,z,w) := (x-y)^2+(z-w)^2$ has positive Lebesgue measure whenever $latex A \subset {\bf R}$ is a compact set of dimension at least $latex 1/2$.  I don&#039;t know if anyone has studied the problem for arbitrary polynomials P though.  (In principle, the results of Elekes and Szabo could be transferable to this setting, but in practice it is often quite difficult to convert a discrete incidence combinatorics result into a continuous geometric measure theory result; for instance, the near-resolution of the Erdos distance problem by Guth and Katz has, to date, not led to further progress on the continuous counterpart, namely the Falconer distance conjecture.)]]></description>
		<content:encoded><![CDATA[<p>For the first question, if one considers images <img src='http://s0.wp.com/latex.php?latex=P%28E%29&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='P(E)' title='P(E)' class='latex' /> of arbitrary subsets <img src='http://s0.wp.com/latex.php?latex=E&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='E' title='E' class='latex' /> of <img src='http://s0.wp.com/latex.php?latex=%7B%5CBbb+F%7D%5E2&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='{&#92;Bbb F}^2' title='{&#92;Bbb F}^2' class='latex' /> then one could simply take <img src='http://s0.wp.com/latex.php?latex=E+%3D+P%5E%7B-1%7D%28C%29&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='E = P^{-1}(C)' title='E = P^{-1}(C)' class='latex' /> for some arbitrary set <img src='http://s0.wp.com/latex.php?latex=C&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='C' title='C' class='latex' />, in which case one does not do any better than the easy bound <img src='http://s0.wp.com/latex.php?latex=%7CP%28E%29%7C+%5Cgg+%7CE%7C%2F%7C%7B%5CBbb+F%7D%7C&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='|P(E)| &#92;gg |E|/|{&#92;Bbb F}|' title='|P(E)| &#92;gg |E|/|{&#92;Bbb F}|' class='latex' /> (assuming P non-constant of course).</p>
<p>For the second question, there are some scattered results of this type.  A typical result here is <a HREF="http://imrn.oxfordjournals.org/content/1999/10/547.extract" rel="nofollow">Wolff&#8217;s result on the Falconer distance conjecture</a>, that if <img src='http://s0.wp.com/latex.php?latex=E+%5Csubset+%7B%5Cbf+R%7D%5E2&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='E &#92;subset {&#92;bf R}^2' title='E &#92;subset {&#92;bf R}^2' class='latex' /> is a compact set with Hausdorff dimension greater than 4/3, then the distance set <img src='http://s0.wp.com/latex.php?latex=%5CDelta%28E%29+%3A%3D+%5C%7B+%7Cx-y%7C%3A+x%2Cy+%5Cin+E+%5C%7D&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='&#92;Delta(E) := &#92;{ |x-y|: x,y &#92;in E &#92;}' title='&#92;Delta(E) := &#92;{ |x-y|: x,y &#92;in E &#92;}' class='latex' /> has positive Lebesgue measure; among other things, this (morally, at least) implies that the image of <img src='http://s0.wp.com/latex.php?latex=A%5E4&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='A^4' title='A^4' class='latex' /> under the polynomial <img src='http://s0.wp.com/latex.php?latex=P%28x%2Cy%2Cz%2Cw%29+%3A%3D+%28x-y%29%5E2%2B%28z-w%29%5E2&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='P(x,y,z,w) := (x-y)^2+(z-w)^2' title='P(x,y,z,w) := (x-y)^2+(z-w)^2' class='latex' /> has positive Lebesgue measure whenever <img src='http://s0.wp.com/latex.php?latex=A+%5Csubset+%7B%5Cbf+R%7D&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='A &#92;subset {&#92;bf R}' title='A &#92;subset {&#92;bf R}' class='latex' /> is a compact set of dimension at least <img src='http://s0.wp.com/latex.php?latex=1%2F2&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='1/2' title='1/2' class='latex' />.  I don&#8217;t know if anyone has studied the problem for arbitrary polynomials P though.  (In principle, the results of Elekes and Szabo could be transferable to this setting, but in practice it is often quite difficult to convert a discrete incidence combinatorics result into a continuous geometric measure theory result; for instance, the near-resolution of the Erdos distance problem by Guth and Katz has, to date, not led to further progress on the continuous counterpart, namely the Falconer distance conjecture.)</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Derrick</title>
		<link>http://terrytao.wordpress.com/2012/11/14/expanding-polynomials-over-finite-fields-of-large-characteristic-and-a-regularity-lemma-for-definable-sets/#comment-197255</link>
		<dc:creator><![CDATA[Derrick]]></dc:creator>
		<pubDate>Wed, 28 Nov 2012 15:25:57 +0000</pubDate>
		<guid isPermaLink="false">http://terrytao.wordpress.com/?p=6289#comment-197255</guid>
		<description><![CDATA[Does the result on on asymmetric moderate expanders extend to the case when one considers the image of arbitrary subsets $latex E$ of $latex \mathbb F^2$ as opposed to Cartesian products of sets $latex E=A\times B$?

Do you think analogous statements can be made in a geometric measure theory context?  Perhaps, define strong expansion to be something along the lines of the image of a set with large fractal dimension contains an interval, moderate expansion says that large fractal dimension implies positive Lebesgue measure, and weak expansion to mean the a set with large fractal dimension would imply that the fractal dimension of the image would be bigger than $latex (1-c)$ times that fractal dimension of the set plus $latex c$.]]></description>
		<content:encoded><![CDATA[<p>Does the result on on asymmetric moderate expanders extend to the case when one considers the image of arbitrary subsets <img src='http://s0.wp.com/latex.php?latex=E&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='E' title='E' class='latex' /> of <img src='http://s0.wp.com/latex.php?latex=%5Cmathbb+F%5E2&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='&#92;mathbb F^2' title='&#92;mathbb F^2' class='latex' /> as opposed to Cartesian products of sets <img src='http://s0.wp.com/latex.php?latex=E%3DA%5Ctimes+B&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='E=A&#92;times B' title='E=A&#92;times B' class='latex' />?</p>
<p>Do you think analogous statements can be made in a geometric measure theory context?  Perhaps, define strong expansion to be something along the lines of the image of a set with large fractal dimension contains an interval, moderate expansion says that large fractal dimension implies positive Lebesgue measure, and weak expansion to mean the a set with large fractal dimension would imply that the fractal dimension of the image would be bigger than <img src='http://s0.wp.com/latex.php?latex=%281-c%29&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='(1-c)' title='(1-c)' class='latex' /> times that fractal dimension of the set plus <img src='http://s0.wp.com/latex.php?latex=c&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='c' title='c' class='latex' />.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Terence Tao</title>
		<link>http://terrytao.wordpress.com/2012/11/14/expanding-polynomials-over-finite-fields-of-large-characteristic-and-a-regularity-lemma-for-definable-sets/#comment-194251</link>
		<dc:creator><![CDATA[Terence Tao]]></dc:creator>
		<pubDate>Mon, 19 Nov 2012 20:15:11 +0000</pubDate>
		<guid isPermaLink="false">http://terrytao.wordpress.com/?p=6289#comment-194251</guid>
		<description><![CDATA[Sorry, I meant to say that the &lt;i&gt;conclusions&lt;/i&gt; of the transference argument should extend to the $latex &#124;F&#124;^\delta$ case (in the prime order case, at least), even if the transference method itself breaks down.  (For instance, one could speculatively consider some sort of &quot;approximate embedding&quot; of such smallish sets into characteristic zero which isn&#039;t an exact embedding in the Freiman sense, but is still somehow &quot;good enough&quot; for some vestige of the characteristic zero arguments to be applicable.)

For large sets, I agree that $latex &#124;F&#124;^{1/2}$ is the natural barrier (for weak expansion, at least) since it is the last place where subfield obstructions can occur.  (For moderate or strong expansion, there is the possibility of larger counterexamples, e.g. by intersecting together large arithmetic progressions with large geometric progressions, so I don&#039;t have a firm intuition for this case.)  My arguments use Deligne&#039;s work (via the Lang-Weil bound) but because of the need to use Cauchy-Schwarz several times to eliminate all the arbitrary sets A, it only starts working at $latex &#124;F&#124;^{1-1/16}$.  I can believe that by being more careful, one could  reduce the number of applications of Cauchy-Schwarz to get down to $latex &#124;F&#124;^{1-1/8}$ or $latex &#124;F&#124;^{1-1/4}$, but to get all the way down to $latex &#124;F&#124;^{1-1/2}$ would require a very different idea; it can&#039;t just be using Cauchy-Schwarz to &quot;complete&quot; all sums involving A, followed by Deligne to estimate the completed sums.  (In sufficiently &quot;additive&quot; or &quot;multiplicative&quot; situations one can use the relevant Fourier transform as a replacement for Cauchy-Schwarz, and this can get down to the right barrier of $latex &#124;F&#124;^{1/2}$, but this trick does not appear to be available in the general case.)

In any case, I agree that the theories for small, medium, and large sets will initially all be rather different from each other (much as is the case with the Bourgain-Gamburd expansion machinery), though perhaps a unified treatment will eventually emerge (for instance, one may optimistically hope that the small set theory will eventually extend all the way up to $latex &#124;F&#124;^{1/2}$, and the large set theory down to $latex &#124;F&#124;^{1/2}$, thus ultimately eliminating the need for a medium set theory).
]]></description>
		<content:encoded><![CDATA[<p>Sorry, I meant to say that the <i>conclusions</i> of the transference argument should extend to the <img src='http://s0.wp.com/latex.php?latex=%7CF%7C%5E%5Cdelta&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='|F|^&#92;delta' title='|F|^&#92;delta' class='latex' /> case (in the prime order case, at least), even if the transference method itself breaks down.  (For instance, one could speculatively consider some sort of &#8220;approximate embedding&#8221; of such smallish sets into characteristic zero which isn&#8217;t an exact embedding in the Freiman sense, but is still somehow &#8220;good enough&#8221; for some vestige of the characteristic zero arguments to be applicable.)</p>
<p>For large sets, I agree that <img src='http://s0.wp.com/latex.php?latex=%7CF%7C%5E%7B1%2F2%7D&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='|F|^{1/2}' title='|F|^{1/2}' class='latex' /> is the natural barrier (for weak expansion, at least) since it is the last place where subfield obstructions can occur.  (For moderate or strong expansion, there is the possibility of larger counterexamples, e.g. by intersecting together large arithmetic progressions with large geometric progressions, so I don&#8217;t have a firm intuition for this case.)  My arguments use Deligne&#8217;s work (via the Lang-Weil bound) but because of the need to use Cauchy-Schwarz several times to eliminate all the arbitrary sets A, it only starts working at <img src='http://s0.wp.com/latex.php?latex=%7CF%7C%5E%7B1-1%2F16%7D&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='|F|^{1-1/16}' title='|F|^{1-1/16}' class='latex' />.  I can believe that by being more careful, one could  reduce the number of applications of Cauchy-Schwarz to get down to <img src='http://s0.wp.com/latex.php?latex=%7CF%7C%5E%7B1-1%2F8%7D&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='|F|^{1-1/8}' title='|F|^{1-1/8}' class='latex' /> or <img src='http://s0.wp.com/latex.php?latex=%7CF%7C%5E%7B1-1%2F4%7D&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='|F|^{1-1/4}' title='|F|^{1-1/4}' class='latex' />, but to get all the way down to <img src='http://s0.wp.com/latex.php?latex=%7CF%7C%5E%7B1-1%2F2%7D&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='|F|^{1-1/2}' title='|F|^{1-1/2}' class='latex' /> would require a very different idea; it can&#8217;t just be using Cauchy-Schwarz to &#8220;complete&#8221; all sums involving A, followed by Deligne to estimate the completed sums.  (In sufficiently &#8220;additive&#8221; or &#8220;multiplicative&#8221; situations one can use the relevant Fourier transform as a replacement for Cauchy-Schwarz, and this can get down to the right barrier of <img src='http://s0.wp.com/latex.php?latex=%7CF%7C%5E%7B1%2F2%7D&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='|F|^{1/2}' title='|F|^{1/2}' class='latex' />, but this trick does not appear to be available in the general case.)</p>
<p>In any case, I agree that the theories for small, medium, and large sets will initially all be rather different from each other (much as is the case with the Bourgain-Gamburd expansion machinery), though perhaps a unified treatment will eventually emerge (for instance, one may optimistically hope that the small set theory will eventually extend all the way up to <img src='http://s0.wp.com/latex.php?latex=%7CF%7C%5E%7B1%2F2%7D&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='|F|^{1/2}' title='|F|^{1/2}' class='latex' />, and the large set theory down to <img src='http://s0.wp.com/latex.php?latex=%7CF%7C%5E%7B1%2F2%7D&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='|F|^{1/2}' title='|F|^{1/2}' class='latex' />, thus ultimately eliminating the need for a medium set theory).</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: valuevar</title>
		<link>http://terrytao.wordpress.com/2012/11/14/expanding-polynomials-over-finite-fields-of-large-characteristic-and-a-regularity-lemma-for-definable-sets/#comment-194234</link>
		<dc:creator><![CDATA[valuevar]]></dc:creator>
		<pubDate>Mon, 19 Nov 2012 19:27:23 +0000</pubDate>
		<guid isPermaLink="false">http://terrytao.wordpress.com/?p=6289#comment-194234</guid>
		<description><![CDATA[Terry, Prop. 3.3 of http://arxiv.org/pdf/math/0509024.pdf works uniformly for small and medium-sized sets, which are (in my view) the hardest cases; I didn&#039;t optimize things for large sets because other (easier) methods worked for them in the context I was working in.

I gave these matters some thoughts a few years ago (I think Akshay and I talked about them). I would be pretty impressed if the transference arguments that work for very small sets could be extended to size $latex &#124;F&#124;^\delta$, $latex \delta&gt;0$ a small constant. I would imagine there would still be a large gap between small and large sets even in this case, and that would be the main challenge.

My intuition is that there should be large-set methods that work for all $latex &#124;A&#124;\geq \sqrt{F}$ (see: Deligne). Don&#039;t you agree?]]></description>
		<content:encoded><![CDATA[<p>Terry, Prop. 3.3 of <a href="http://arxiv.org/pdf/math/0509024.pdf" rel="nofollow">http://arxiv.org/pdf/math/0509024.pdf</a> works uniformly for small and medium-sized sets, which are (in my view) the hardest cases; I didn&#8217;t optimize things for large sets because other (easier) methods worked for them in the context I was working in.</p>
<p>I gave these matters some thoughts a few years ago (I think Akshay and I talked about them). I would be pretty impressed if the transference arguments that work for very small sets could be extended to size <img src='http://s0.wp.com/latex.php?latex=%7CF%7C%5E%5Cdelta&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='|F|^&#92;delta' title='|F|^&#92;delta' class='latex' />, <img src='http://s0.wp.com/latex.php?latex=%5Cdelta%3E0&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='&#92;delta&gt;0' title='&#92;delta&gt;0' class='latex' /> a small constant. I would imagine there would still be a large gap between small and large sets even in this case, and that would be the main challenge.</p>
<p>My intuition is that there should be large-set methods that work for all <img src='http://s0.wp.com/latex.php?latex=%7CA%7C%5Cgeq+%5Csqrt%7BF%7D&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='|A|&#92;geq &#92;sqrt{F}' title='|A|&#92;geq &#92;sqrt{F}' class='latex' /> (see: Deligne). Don&#8217;t you agree?</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Milad</title>
		<link>http://terrytao.wordpress.com/2012/11/14/expanding-polynomials-over-finite-fields-of-large-characteristic-and-a-regularity-lemma-for-definable-sets/#comment-194083</link>
		<dc:creator><![CDATA[Milad]]></dc:creator>
		<pubDate>Mon, 19 Nov 2012 09:46:32 +0000</pubDate>
		<guid isPermaLink="false">http://terrytao.wordpress.com/?p=6289#comment-194083</guid>
		<description><![CDATA[Sorry for asking this question here, but how do you use mathematical symbols between your sentences?
Do you use a special program or something?!

&lt;i&gt;[The short answer is yes. See the second section of http://terrytao.wordpress.com/about/ - T.]&lt;/i&gt;]]></description>
		<content:encoded><![CDATA[<p>Sorry for asking this question here, but how do you use mathematical symbols between your sentences?<br />
Do you use a special program or something?!</p>
<p><i>[The short answer is yes. See the second section of <a href="http://terrytao.wordpress.com/about/" rel="nofollow">http://terrytao.wordpress.com/about/</a> - T.]</i></p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Terence Tao</title>
		<link>http://terrytao.wordpress.com/2012/11/14/expanding-polynomials-over-finite-fields-of-large-characteristic-and-a-regularity-lemma-for-definable-sets/#comment-193917</link>
		<dc:creator><![CDATA[Terence Tao]]></dc:creator>
		<pubDate>Sun, 18 Nov 2012 18:29:27 +0000</pubDate>
		<guid isPermaLink="false">http://terrytao.wordpress.com/?p=6289#comment-193917</guid>
		<description><![CDATA[Thanks, Harald, for pointing that out! (Though, strictly speaking, your examples (say, Proposition 3.3 of http://arxiv.org/pdf/math/0509024.pdf for sake of concreteness) are actually polynomial functions of the products $latex x_1 \ldots x_{20}, y_1 \ldots y_{20}$ and their inverses, and they don&#039;t quite give expansion in the senses I state above because epsilon is not required to depend linearly on delta in the limit $latex \delta \to 0$, but it is certainly in the same spirit.)

The methods in my paper (based on regularity lemmas) only work for very large sets (of size $latex &#124;F&#124;^{1-1/16}$ or larger, basically).  For extremely small sets (of size less than $latex \log &#124;F&#124;$) there should be some sort of Lefschetz principle that allows one to embed the configuration into the complex field, where the work of &lt;a HREF=&quot;http://www.springerlink.com/content/r007063h6q17020p/&quot; rel=&quot;nofollow&quot;&gt;Elekes and Szabo&lt;/a&gt; gives satisfactory results.   It seems reasonable to conjecture that the Elekes-Szabo theory extends to sets of cardinality up to $latex &#124;F&#124;^c$ for some absolute constant c (for fields of prime order at least, to avoid subfield obstructions), but then there is presumably some crossover to the large set case when $latex P(A,A)$ begins to have positive density in F.]]></description>
		<content:encoded><![CDATA[<p>Thanks, Harald, for pointing that out! (Though, strictly speaking, your examples (say, Proposition 3.3 of <a href="http://arxiv.org/pdf/math/0509024.pdf" rel="nofollow">http://arxiv.org/pdf/math/0509024.pdf</a> for sake of concreteness) are actually polynomial functions of the products <img src='http://s0.wp.com/latex.php?latex=x_1+%5Cldots+x_%7B20%7D%2C+y_1+%5Cldots+y_%7B20%7D&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='x_1 &#92;ldots x_{20}, y_1 &#92;ldots y_{20}' title='x_1 &#92;ldots x_{20}, y_1 &#92;ldots y_{20}' class='latex' /> and their inverses, and they don&#8217;t quite give expansion in the senses I state above because epsilon is not required to depend linearly on delta in the limit <img src='http://s0.wp.com/latex.php?latex=%5Cdelta+%5Cto+0&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='&#92;delta &#92;to 0' title='&#92;delta &#92;to 0' class='latex' />, but it is certainly in the same spirit.)</p>
<p>The methods in my paper (based on regularity lemmas) only work for very large sets (of size <img src='http://s0.wp.com/latex.php?latex=%7CF%7C%5E%7B1-1%2F16%7D&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='|F|^{1-1/16}' title='|F|^{1-1/16}' class='latex' /> or larger, basically).  For extremely small sets (of size less than <img src='http://s0.wp.com/latex.php?latex=%5Clog+%7CF%7C&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='&#92;log |F|' title='&#92;log |F|' class='latex' />) there should be some sort of Lefschetz principle that allows one to embed the configuration into the complex field, where the work of <a HREF="http://www.springerlink.com/content/r007063h6q17020p/" rel="nofollow">Elekes and Szabo</a> gives satisfactory results.   It seems reasonable to conjecture that the Elekes-Szabo theory extends to sets of cardinality up to <img src='http://s0.wp.com/latex.php?latex=%7CF%7C%5Ec&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='|F|^c' title='|F|^c' class='latex' /> for some absolute constant c (for fields of prime order at least, to avoid subfield obstructions), but then there is presumably some crossover to the large set case when <img src='http://s0.wp.com/latex.php?latex=P%28A%2CA%29&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='P(A,A)' title='P(A,A)' class='latex' /> begins to have positive density in F.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: valuevar</title>
		<link>http://terrytao.wordpress.com/2012/11/14/expanding-polynomials-over-finite-fields-of-large-characteristic-and-a-regularity-lemma-for-definable-sets/#comment-193916</link>
		<dc:creator><![CDATA[valuevar]]></dc:creator>
		<pubDate>Sun, 18 Nov 2012 18:17:32 +0000</pubDate>
		<guid isPermaLink="false">http://terrytao.wordpress.com/?p=6289#comment-193916</guid>
		<description><![CDATA[For what it is worth, my paper on SL_2 included a proof that a function P(x,y) was expanding in your sense for any sets (large or small). This was then used in a crucial step (since P(x,y) appeared as a trace of a product of elements of SL_2). Of course, P wasn&#039;t quite a polynomial - rather, it was a polynomial on x, y, x^{-1} and y^{-1}. I&#039;ve remained interested in the question, though - for which polynomials (on x and y, or on x, y, x^{-1} and y^{-1}) can we prove expansion even for very small subsets of finite fields?]]></description>
		<content:encoded><![CDATA[<p>For what it is worth, my paper on SL_2 included a proof that a function P(x,y) was expanding in your sense for any sets (large or small). This was then used in a crucial step (since P(x,y) appeared as a trace of a product of elements of SL_2). Of course, P wasn&#8217;t quite a polynomial &#8211; rather, it was a polynomial on x, y, x^{-1} and y^{-1}. I&#8217;ve remained interested in the question, though &#8211; for which polynomials (on x and y, or on x, y, x^{-1} and y^{-1}) can we prove expansion even for very small subsets of finite fields?</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: acbd</title>
		<link>http://terrytao.wordpress.com/2012/11/14/expanding-polynomials-over-finite-fields-of-large-characteristic-and-a-regularity-lemma-for-definable-sets/#comment-192718</link>
		<dc:creator><![CDATA[acbd]]></dc:creator>
		<pubDate>Wed, 14 Nov 2012 19:48:06 +0000</pubDate>
		<guid isPermaLink="false">http://terrytao.wordpress.com/?p=6289#comment-192718</guid>
		<description><![CDATA[Impressive breadth of tools and references!  

A tiny nitpick: in the paper, there are some missing letters and accents in the tricky ref 27 (the others seem fine). According to the french wikipedia, the TeX should rather read something like: 

\bibitem{sga2}
A. Grothendieck, M. Raynaud, (Y. Laszlo, ed.), 
Cohomologie locale des faisceaux coh\&#039;erents et th\&#039;eor\`emes de Lefschetz locaux et globaux (SGA 2). Documents Math\&#039;ematiques, 4, Soci\&#039;et\&#039;e Math\&#039;ematique de France, Paris (2005). [New edition of the 1968 original].

&lt;i&gt;[Thanks, this will be corrected in the next revision of the ms - T.]&lt;/i&gt;]]></description>
		<content:encoded><![CDATA[<p>Impressive breadth of tools and references!  </p>
<p>A tiny nitpick: in the paper, there are some missing letters and accents in the tricky ref 27 (the others seem fine). According to the french wikipedia, the TeX should rather read something like: </p>
<p>\bibitem{sga2}<br />
A. Grothendieck, M. Raynaud, (Y. Laszlo, ed.),<br />
Cohomologie locale des faisceaux coh\&#8217;erents et th\&#8217;eor\`emes de Lefschetz locaux et globaux (SGA 2). Documents Math\&#8217;ematiques, 4, Soci\&#8217;et\&#8217;e Math\&#8217;ematique de France, Paris (2005). [New edition of the 1968 original].</p>
<p><i>[Thanks, this will be corrected in the next revision of the ms - T.]</i></p>
]]></content:encoded>
	</item>
</channel>
</rss>
