On norming systems of linear equations

Abstract

A system of linear equations L is said to be norming if a natural functional tL(·) 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 Fqn 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 tL(·), a proof that any norming system must be variable-transitive and the classification of all norming systems of rank at most two.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…