Skip to main content Accessibility help

We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.

Close cookie message
×
Hostname: page-component-848d4c4894-2xdlg Total loading time: 0 Render date: 2024-06-16T08:57:31.307Z Has data issue: false hasContentIssue false

The Slice Rank Polynomial Method – A Survey a Few Years Later

Published online by Cambridge University Press:  23 May 2024

By
Lisa Sauermann
Edited by
Felix Fischer  and
Robert Johnson
Felix Fischer
Affiliation:
Queen Mary University of London
Robert Johnson
Affiliation:
Queen Mary University of London
Get access

Summary

The slice rank polynomial method was introduced by Tao in 2016 following the breakthrough of Ellenberg and Gijswijt on the famous Cap-Set Problem, which in turn was building on work of Croot, Lev and Pach. This survey gives an introduction to the slice rank polynomial method, shows some of its early applications, and discusses the developments since then.

Type
Chapter
Information
Surveys in Combinatorics 2024 , pp. 201 - 238
Publisher: Cambridge University Press
Print publication year: 2024

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

Alon, N. and Dubiner, M., A lattice point problem and additive number theory, Combinatorica 15 (1995), 301–309.CrossRefGoogle Scholar
Alon, N., Shpilka, A., and Umans, C., On sunflowers and matrix multiplication, Comput. Complexity 22 (2013), 219–243.CrossRefGoogle Scholar
Alweiss, R., Lovett, S., Wu, K., and Zhang, J., Improved bounds for the sunflower lemma, Ann. of Math. 194 (2021), 795–815.CrossRefGoogle Scholar
Babai, L. and Frankl, P., Linear algebra methods in combinatorics, book draft, 2022.Google Scholar
Bateman, M. and Katz, N. H., New bounds on cap sets, J. Amer. Math. Soc. 25 (2012), 585–613.CrossRefGoogle Scholar
Behrend, F. A., On sets of integers which contain no three terms in arithmetical progression, Proc. Nat. Acad. Sci. U.S.A. 32 (1946), 331–332.CrossRefGoogle ScholarPubMed
Bhattacharyya, A., Chen, V., Sudan, M., and Xie, N., Testing linear-invariant non-linear properties, Theory Comput. 7 (2011), 75–99.CrossRefGoogle Scholar
Bhattacharyya, A. and Xie, N., Lower Bounds for Testing Triangle-freeness in Boolean Functions, Comput. Complexity 24 (2015), 65–101.CrossRefGoogle Scholar
Blasiak, J., Church, T., Cohn, H., Grochow, J. A., Naslund, E., W. F. Sawin, William, and Umans, C., On cap sets and the group-theoretic approach to matrix multiplication, Discrete Anal. (2017), 3.CrossRefGoogle Scholar
Bloom, T. F., A quantitative improvement for Roth’s theorem on arithmetic progressions, J. Lond. Math. Soc. 93 (2016), 643–663.CrossRefGoogle Scholar
Bloom, T. F. and Sisask, O., Breaking the logarithmic barrier in Roth’s theorem on arithmetic progressions, arXiv preprint arXiv:2007.03528 (2020).Google Scholar
Borenstein, E. and Croot, E., On a certain generalization of the Balog–Szemerédi– Gowers theorem, SIAM J. Discrete Math. 25 (2011), 685–694.CrossRefGoogle Scholar
Bourgain, J., On triples in arithmetic progression, Geom. Funct. Anal. 9 (1999), 968–984.CrossRefGoogle Scholar
Bourgain, J., Roth’s theorem on progressions revisited, J. Anal. Math. 104 (2008), 155–192.CrossRefGoogle Scholar
Cohen, A. and Moshkovitz, G., Partition and analytic rank are equivalent over large fields, Duke Math. J., in press.Google Scholar
Cohn, H., Kleinberg, R. D., Szegedy, B., and Umans, C., Group-theoretic algorithms for matrix multiplication, In: Proc. 46th Annual IEEE Symposium on Foundations of Computer Science, 2005, 379–388.Google Scholar
Coppersmith, D. and S.Winograd, Matrix multiplication via arithmetic progressions, J. Symbolic Comput. 9 (1990), 251–280.CrossRefGoogle Scholar
Croot, E., Lev, V., and Pach, P., Progression-free sets in Zn4 are exponentially small, Ann. of Math. 185 (2017), 331–337.CrossRefGoogle Scholar
van Dobben de Bruyn, J. and Gijswijt, D., On the size of subsets of Fnq avoiding solutions to linear systems with repeated columns, arXiv preprint arXiv:2111.09879 (2021).Google Scholar
Edel, Y., Extensions of generalized product caps, Des. Codes Cryptogr. 31 (2004), 5–14.CrossRefGoogle Scholar
Edel, Y., Sequences in abelian groups G of odd order without zero-sum subsequences of length exp(G), Des. Codes Cryptogr. 47 (2008), 125–134.CrossRefGoogle Scholar
Ellenberg, J. S. and Gijswijt, D., On large subsets of Fnq with no three-term arithmetic progression, Ann. of Math. 185 (2017), 339–343.CrossRefGoogle Scholar
Elsholtz, C. and Pach, P. P., Caps and progression-free sets in Zn4 Des. Codes Cryptogr. 88 (2020), 2133–2170.CrossRefGoogle Scholar
Erdős, P., Ginzburg, A., and Ziv, A., Theorem in the additive number theory, Bull. Res. Council Israel 10F (1961), 41–43.Google Scholar
Erdős, P. and Rado, R., Intersection theorems for systems of sets, J. London Math. Soc. 35 (1960), 85–90.CrossRefGoogle Scholar
Erdős, P. and Szemerédi, E., Combinatorial properties of systems of sets, J. Combinatorial Theory Ser. A 24 (1978), 308–313.CrossRefGoogle Scholar
Erdős, P. and Turán, P., On Some Sequences of Integers, J. London Math. Soc. 11 (1936), 261–264.CrossRefGoogle Scholar
Fox, J., A new proof of the graph removal lemma, Ann. of Math. 174 (2011), 561–579.CrossRefGoogle Scholar
Fox, J. and Lovász, L. M., A tight bound for Green’s arithmetic triangle removal lemma in vector spaces, Adv. Math. 321 (2017), 287–297.CrossRefGoogle Scholar
Fox, J., M. Lovász, L., and Sauermann, L., A polynomial bound for the arithmetic k-cycle removal lemma in vector spaces, J. Combinatorial Theory Ser. A 160 (2018), 186–201.CrossRefGoogle Scholar
Fox, J. and Sauermann, L., Erdős-Ginzburg-Ziv constants by avoiding three-term arithmetic progressions, Electron. J. Combin. 25 (2018), 2.14.CrossRefGoogle Scholar
Gijswijt, D., Excluding affine configurations over a finite field, arXiv preprint arXiv:2112.12620 (2021).Google Scholar
Gowers, W. T. and Wolf, J., Linear forms and higher-degree uniformity for functions on Fnq, Geom. Funct. Anal. 21 (2011), 36–69.CrossRefGoogle Scholar
Green, B., Finite field models in additive combinatorics, In: Surveys in combinatorics 2005, Cambridge University Press, Cambridge, 2005, pp. 1–27.Google Scholar
Green, B., A Szemerédi-type regularity lemma in abelian groups, with applications, Geom. Funct. Anal. 15 (2005), 340–376.CrossRefGoogle Scholar
Green, B., Sárközy’s theorem in function fields, Q. J. Math. 68 (2017), 237–242.CrossRefGoogle Scholar
Grochow, J. A., New applications of the polynomial method: the cap set conjecture and beyond, Bull. Amer. Math. Soc. 56 (2019), 29–64.CrossRefGoogle Scholar
Guth, L., Polynomial methods in combinatorics, Univ. Lecture Ser. 64, American Mathematical Society, Providence, RI, 2016.Google Scholar
Harborth, H., Ein Extremalproblem für Gitterpunkte, J. Reine Angew. Math. 262 (1973), 356–360.Google Scholar
Haviv, I. and Xie, N., Sunflowers and testing triangle-freeness of functions, Comput. Complexity 26 (2017), 497–530.CrossRefGoogle Scholar
Heath-Brown, D. R., Integer sets containing no arithmetic progressions, J. London Math. Soc. 35 (1987), 385–394.CrossRefGoogle Scholar
Hegedus̋, G., The Erdős-Ginzburg-Ziv constant and progression-free subsets, J. Number Theory 186 (2018), 238–247.CrossRefGoogle Scholar
Janzer, O., Polynomial bound for the partition rank vs the analytic rank of tensors, Discrete Anal. (2020), 7.Google Scholar
Kleinberg, R., Sawin, W., and Speyer, D. E., The growth rate of tri-colored sum-free sets, Discrete Anal. (2018), 12.CrossRefGoogle Scholar
Král’, D., Serra, O., and Vena, L., A combinatorial proof for the removal lemma for groups, J. Combin. Theory Ser. A 116 (2009), 971–978.CrossRefGoogle Scholar
Král’, D., Serra, O., and Vena, L., A removal lemma for systems of linear equations over finite fields, Israel J. Math. 187 (2012), 193–207.CrossRefGoogle Scholar
Li, A. and Sauermann, L., Sárközy’s Theorem in Various Finite Field Settings, arXiv preprint arXiv:2212.12754 (2022).Google Scholar
Lovász, L. M. and Sauermann, L., A lower bound for the k-multicolored sum-free problem in Znm, Proceedings of the London Mathematical Society 119 (2019), 55–103.CrossRefGoogle Scholar
Meshulam, R., On subsets of finite abelian groups with no 3-term arithmetic progressions, J. Combin. Theory Ser. A 71 (1995), 168–172.CrossRefGoogle Scholar
Milićević, L., Polynomial bound for partition rank in terms of analytic rank, Geom. Funct. Anal. 29 (2019), 1503–1530.CrossRefGoogle Scholar
Mimura, M. and Tokushige, N., Avoiding a shape, and the slice rank method for a system of equations, arXiv preprint arXiv:1909.10509 (2019).Google Scholar
Mimura, M. and Tokushige, N., Solving linear equations in a vector space over a finite field, Discrete Math. 344 (2021), 112603.CrossRefGoogle Scholar
Moshkovitz, G. and Zhu, D. G., Quasi-linear relation between partition and analytic rank, arXiv preprint arXiv:2211.05780 (2022).Google Scholar
Munhá Correia, D., Sudakov, B., and Tomon, I., Flattening rank and its combinatorial applications, Linear Algebra Appl. 625 (2021), 113–125.CrossRefGoogle Scholar
Naslund, E., Exponential bounds for the Erdős-Ginzburg-Ziv constant, Combin. Theory Ser. A 174 (2020), 105185.CrossRefGoogle Scholar
Naslund, E., The partition rank of a tensor and k-right corners in Fnq, J. Combin. Theory Ser. A 174 (2020), 105190.CrossRefGoogle Scholar
Naslund, E., Monochromatic equilateral triangles in the unit distance graph, Bull. Lond. Math. Soc. 52 (2020), 687–692.CrossRefGoogle Scholar
Naslund, E., The chromatic number of Rn with multiple forbidden distances, Mathematika 69 (2023), 692–718.CrossRefGoogle Scholar
Naslund, E., Upper Bounds For Families Without Weak Delta-Systems, Combinatorica, in press.Google Scholar
Naslund, E. and Sawin, W., Upper bounds for sunflower-free sets, Forum Math. Sigma 5 (2017), e15.CrossRefGoogle Scholar
Norin, S., A distribution on triples with maximum entropy marginal, Forum Math. Sigma 7 (2019), e46.CrossRefGoogle Scholar
Omar, M., Partition Rank and Partition Lattices, arXiv preprint arXiv:2208.06932 (2022).Google Scholar
Pebody, L., Proof of a conjecture of Kleinberg-Sawin-Speyer, Discrete Anal. (2018), 13.CrossRefGoogle Scholar
Pellegrino, G., Sul massimo ordine delle calotte in S4,3, Matematiche (Catania) 25 (1970), 149–157.Google Scholar
Roth, K. F., On certain sets of integers, J. London Math. Soc. 28 (1953), 104–109.CrossRefGoogle Scholar
Reiher, C., On Kemnitz’ conjecture concerning lattice-points in the plane, Ramanujan J. 13 (2007), 333–337.CrossRefGoogle Scholar
Salem, R. and Spencer, D. C., On sets of integers which contain no three terms in arithmetical progression, Proc. Nat. Acad. Sci. U.S.A. 28 (1942), 561–563.CrossRefGoogle ScholarPubMed
Sanders, T., On certain other sets of integers, J. Anal. Math. 116 (2012), 53–82.CrossRefGoogle Scholar
Sanders, T., On Roth’s theorem on progressions, Ann. of Math. 174 (2011), 619–636.CrossRefGoogle Scholar
Sauermann, L., On the size of subsets of Fnq without p distinct elements summing to zero, Israel Journal of Mathematics 243 (2021), 63–79.CrossRefGoogle Scholar
Sauermann, L., Finding solutions with distinct variables to systems of linear equations over Fp, Mathematische Annalen 386 (2023), 1-33.CrossRefGoogle Scholar
Sauermann, L. and Zakharov, D., On the Erdős–Ginzburg–Ziv Problem in large dimension, arXiv preprint arXiv:2302.14737 (2023).Google Scholar
Sawin, W. and Tao, T., Notes on the “slice rank” of tensors, https://terrytao.wordpress.com/2016/08/24/n, 2016.Google Scholar
Schoen, T., Improved bound in Roth’s theorem on arithmetic progressions, Adv. Math. 386 (2021), 107801.CrossRefGoogle Scholar
Shapira, A., A proof of Green’s conjecture regarding the removal properties of sets of linear equations, J. Lond. Math. Soc. 81 (2010), 355–373.CrossRefGoogle Scholar
Szemerédi, E., On sets of integers containing no k elements in arithmetic progression, Acta Arith. 27 (1975), 199–245.CrossRefGoogle Scholar
Szemerédi, E., Integer sets containing no arithmetic progressions, Acta Math. Hungar. 56 (1990), 155–158.CrossRefGoogle Scholar
Tao, T., A symmetric formulation of the Croot-Lev-Pach-Ellenberg-Gijswijt capset bound, http://terrytao.wordpress.com/2016/05/18/a, 2016.Google Scholar
Tyrrell, F., New lower bounds for cap sets, Discrete Analysis, in press.Google Scholar
Zakharov, D., Convex geometry and Erdős–Ginzburg–Ziv problem, arXiv preprint arXiv:2002.09892 (2020).Google Scholar

Save book to Kindle

To save this book to your Kindle, first ensure coreplatform@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.

Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

Available formats
×

Save book to Dropbox

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Dropbox.

Available formats
×

Save book to Google Drive

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Google Drive.

Available formats
×