Timeline for Combinatorial splitting in number rings

14 events

when toggle format	what		by	license	comment
Oct 23, 2016 at 23:12	history	edited	user94040		edited tags
Oct 23, 2016 at 22:38	history	edited	user94040		edited tags
Jun 24, 2016 at 7:50	history	edited	user94040	CC BY-SA 3.0	added 48 characters in body
Jun 24, 2016 at 0:13	history	edited	Myshkin		+ top level tag (nt.)
Jun 23, 2016 at 21:39	history	edited	user94040	CC BY-SA 3.0	added 171 characters in body
Jun 23, 2016 at 7:21	review	Close votes
Jun 23, 2016 at 16:31
Jun 23, 2016 at 7:13	history	edited	user94040	CC BY-SA 3.0	added 8 characters in body
Jun 23, 2016 at 7:12	comment	added	user94040		So you claim $t=2^n$ is the least $t$ we can have?
Jun 23, 2016 at 7:00	comment	added	R. van Dobben de Bruyn		Can't you just take $t = 2^n$ (corresponding to $\mathcal P(\{1,\ldots,n\})$) and have each $a_j$ be equal to a $P_I$ (i.e. $J$ is always a singleton)?
Jun 23, 2016 at 6:27	comment	added	user94040		@KConrad I just want to know if there is an way to split combinatorially structured set of products in a number ring so that the resulting product has a nice structure.
Jun 23, 2016 at 5:19	comment	added	KConrad		Could you write your question in plain English instead of using three nested quantifiers? That is, could you write the question in a manner that conveys how you really came across it?
Jun 23, 2016 at 4:55	history	edited	user94040	CC BY-SA 3.0	added 22 characters in body
Jun 23, 2016 at 3:42	review	First posts
Jun 23, 2016 at 4:55
Jun 23, 2016 at 3:37	history	asked	user94040	CC BY-SA 3.0