On norming systems of linear equations
Combinatorics
2024-11-28 v1 Number Theory
Abstract
A system of linear equations is said to be norming if a natural functional 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 for every . 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 , a proof that any norming system must be variable-transitive and the classification of all norming systems of rank at most two.
Keywords
Cite
@article{arxiv.2411.18389,
title = {On norming systems of linear equations},
author = {Seokjoon Cho and David Conlon and Joonkyung Lee and Jozef Skokan and Leo Versteegen},
journal= {arXiv preprint arXiv:2411.18389},
year = {2024}
}
Comments
30 pages