Polymath5 officially starts

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.

Advertisements

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s


%d bloggers like this: