English

Gowers Norm, Function Limits, and Parameter Estimation

Computational Complexity 2015-03-27 v2 Data Structures and Algorithms

Abstract

Let {fi:Fpi{0,1}}\{f_i:\mathbb{F}_p^i \to \{0,1\}\} be a sequence of functions, where pp is a fixed prime and Fp\mathbb{F}_p is the finite field of order pp. The limit of the sequence can be syntactically defined using the notion of ultralimit. Inspired by the Gowers norm, we introduce a metric over limits of function sequences, and study properties of it. One application of this metric is that it provides a characterization of affine-invariant parameters of functions that are constant-query estimable. Using this characterization, we show that the property of being a function of a constant number of low-degree polynomials and a constant number of factored polynomials (of arbitrary degrees) is constant-query testable if it is closed under blowing-up. Examples of this property include the property of having a constant spectral norm and degree-structural properties with rank conditions.

Keywords

Cite

@article{arxiv.1410.5053,
  title  = {Gowers Norm, Function Limits, and Parameter Estimation},
  author = {Yuichi Yoshida},
  journal= {arXiv preprint arXiv:1410.5053},
  year   = {2015}
}

Comments

arXiv admin note: text overlap with arXiv:1212.3849, arXiv:1308.4108 by other authors

R2 v1 2026-06-22T06:28:34.865Z