On norming systems of linear equations
Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 reserved pith:DQ3W3NDRrecord.jsonopen to challenge →
read the original abstract
A system of linear equations $L$ is said to be norming if a natural functional $t_L(\cdot)$ giving a weighted count for the set of solutions to the system can be used to define a norm on the space of real-valued functions on $\mathbb{F}_q^n$ for every $n>0$. For example, Gowers uniformity norms arise in this way. In this paper, we initiate the systematic study of norming linear systems by proving a range of necessary and sufficient conditions for a system to be norming. Some highlights include an isomorphism theorem for the functional $t_L(\cdot)$, a proof that any norming system must be variable-transitive and the classification of all norming systems of rank at most two.
This paper has not been read by Pith yet.
Forward citations
Cited by 1 Pith paper
-
Sidorenko Inequalities for Two-Sided Group Correlation Kernels
A directed kernel C_f on finite groups satisfies t(F, C_f) ≥ (E f(g))^{2e(F)} for every finite directed graph F.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.