Polymath5 has officially started. There have been some interesting patterns showing up in some of the examples and now some theoretical questions are being asked. The program is roughly to show that every completely multiplicative sequence cannot have bounded discrepancy then show every low discrepancy sequence can be cleaned up to be quasi-multiplicative and then extend the proof that every completely multiplicative sequence cannot have bounded discrepancy to one showing that quasi-multiplicative sequence cannot have bounded discrepancy.

### Like this:

Like Loading...

*Related*

This entry was posted on January 19, 2010 at 6:05 pm and is filed under Polymath. You can follow any responses to this entry through the RSS 2.0 feed.
You can leave a response, or trackback from your own site.

## Leave a Reply