The true complexity of a system of linear equations

From MaRDI portal
Revision as of 06:44, 7 March 2024 by Import240305080351 (talk | contribs) (Created automatically from import240305080351)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:5850799

DOI10.1112/plms/pdp019zbMath1243.11010arXiv0711.0185OpenAlexW2135651340MaRDI QIDQ5850799

Julia Wolf, Timothy Gowers

Publication date: 15 January 2010

Published in: Proceedings of the London Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0711.0185



Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).


Related Items (32)

Finite configurations in sparse setsOn several notions of complexity of polynomial progressionsAn inverse theorem for the uniformity seminorms associated with the action of \(\mathbb F_p^\infty\)Arithmetic progressions with a pseudorandom stepA continuous model for systems of complexity 2 on simple abelian groupsPointwise ergodic theorems for non-conventional bilinear polynomial averagesStability and exact Turán numbers for matroidsLimits of functions on groupsA refinement of Cauchy-Schwarz complexityNilspace Factors for General Uniformity Seminorms, Cubic Exchangeability and LimitsOn the Ramsey number of the Brauer configurationNoise correlation bounds for uniform low degree functionsLinear forms and higher-degree uniformity for functions on \(\mathbb F^n_p\)Gowers norms control diophantine inequalitiesThe inverse conjecture for the Gowers norm over finite fields in low characteristicOn Roth's theorem on progressionsOn Systems of Complexity One in the PrimesLimits of Boolean functions on \(\mathbb{F}_p^n\)On the asymptotic maximal density of a set avoiding solutions to linear equations modulo a primeHigher-order Fourier analysis of \(\mathbb F_p^n\) and the complexity of systems of linear formsOrbit of the diagonal in the power of a nilmanifoldA removal lemma for linear configurations in subsets of the circleTrue complexity of polynomial progressions in finite fieldsOn the local leakage resilience of linear secret sharing schemesGeneral systems of linear forms: equidistribution and true complexityOn uniformity of q‐multiplicative sequencesBootstrapping partition regularity of linear systemsLINEAR FORMS AND QUADRATIC UNIFORMITY FOR FUNCTIONS ONPOLYNOMIAL PATTERNS IN THE PRIMESConcatenation theorems for anti-Gowers-uniform functions and Host-Kra characteristic factorsGood Bounds in Certain Systems of True Complexity OneLinear forms and quadratic uniformity for functions on \(\mathbb{Z}_{N}\)




This page was built for publication: The true complexity of a system of linear equations