On the image of convolutions along an arithmetic progression
Abstract
We consider the question of determining the structure of the set of all d-dimensional vectors of the form N-1(1A*1-A(x1), ..., 1A*1-A(xd)) for A ⊂eq \1,...,N\, and also the set of all (2N+1)-1(1B*1B(x1), ..., 1B*1B(xd)), for B ⊂eq \-N, -N+1, ..., 0, 1, ..., N\, where x1,...,xd are fixed positive integers (we let N ∞). Using an elementary method related to the Birkhoff-von Neumann theorem on decompositions of doubly-stochastic matrices we show that both the above two sets of vectors roughly form polytopes; and of particular interest is the question of bounding the number of corner vertices, as well as understanding their structure.
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.