An application of linear programming duality to discrete Fourier analysis and additive problems

Details An application of linear programming duality to discrete Fourier analysis and additive problems An application of linear programming duality to discrete Fourier analysis and additive problems

2007-07-30

arxiv.org/abs/0707.4436v1

Mathematics

Combinatorics

This is a preliminary draft. Future drafts will have references, cleaner proofs, and perhaps some applications of the main the

Scientific paper

Suppose that f is a function from Z_p -> [0,1] (Z_p is my notation for the integers mod p, not the p-adics), and suppose that a_1,...,a_k are some places in Z_p. In some additive number theory applications it would be nice to perturb f slightly so that Fourier transform f^ vanishes at a_1,...,a_k, while additive properties are left intact. In the present paper, we show that even if we are unsuccessful in this, we can at least say something interesting by using the principle of the separating hyperplane, a basic ingredient in linear programming duality.

Affiliated with

Also associated with

No associations

Rating

An application of linear programming duality to discrete Fourier analysis and additive problems does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with An application of linear programming duality to discrete Fourier analysis and additive problems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An application of linear programming duality to discrete Fourier analysis and additive problems will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-360036