bio | website | math.uchicago.edu/~vipul |
---|---|---|

location | Chicago | |

age | 29 | |

visits | member for | 5 years, 8 months |

seen | Jun 4 '14 at 22:30 | |

stats | profile views | 3,418 |

Mathematics Ph.D. student at the University of Chicago

Jun
14 |
awarded | Popular Question |

May
9 |
awarded | Popular Question |

Apr
17 |
awarded | Popular Question |

Jan
6 |
awarded | Yearling |

Nov
6 |
awarded | Popular Question |

Oct
3 |
awarded | Nice Question |

Sep
2 |
awarded | Nice Question |

Jul
6 |
awarded | Popular Question |

Jul
2 |
awarded | Inquisitive |

Jul
2 |
awarded | Curious |

Jun
16 |
awarded | Nice Answer |

Apr
18 |
awarded | Nice Answer |

Mar
17 |
awarded | Nice Question |

Mar
4 |
awarded | Notable Question |

Jan
6 |
awarded | Yearling |

Oct
22 |
awarded | Nice Question |

Aug
12 |
revised |
Introducing division strategically in operads to accommodate formulas like the Baker-Campbell-Hausdorff formula
added 273 characters in body |

Jul
10 |
comment |
Introducing division strategically in operads to accommodate formulas like the Baker-Campbell-Hausdorff formula
An alternate description that might be easier for explicitly computing the terms of the sequence is that the exponent on any prime $p$ is the greatest integer of $(n - 1)/(p - 1)$. I think one can work this out from your description by choosing as many of the primes as possible to be $p$. |

Jul
10 |
comment |
Introducing division strategically in operads to accommodate formulas like the Baker-Campbell-Hausdorff formula
UPDATE: The bound seems to be tight at least up to n = 5. See groupprops.subwiki.org/wiki/… for instance |

Jul
10 |
comment |
Thanks, a very useful response! I appreciate it. I think the sequence description you give is the same as that in OEIS (you have to click through to the description of the other sequence). The relation with the Baker-Campbell-Hausdorff formula (I think) is this: all the denominators in the degree n part of the BCH formula must divide the n^{th} term of the sequence. Some of the denominators may well be smaller, and I'm not sure if the bound is tight (i.e., whether the a_n of the sequence must exactly be the lcm of the denominators). |