bio | website | math.uchicago.edu/~vipul |
---|---|---|
location | Chicago | |
age | 28 | |
visits | member for | 4 years, 10 months |
seen | Jun 4 at 22:30 | |
stats | profile views | 3,236 |
Mathematics Ph.D. student at the University of Chicago
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 |
Introducing division strategically in operads to accommodate formulas like the Baker-Campbell-Hausdorff formula
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). |
Jul 8 |
awarded | Nice Question |
Jun 27 |
revised |
Introducing division strategically in operads to accommodate formulas like the Baker-Campbell-Hausdorff formula
deleted 11 characters in body |
Jun 27 |
comment |
Introducing division strategically in operads to accommodate formulas like the Baker-Campbell-Hausdorff formula
Thanks. I had originally thought that my construction was like divided power algebras, and it resembles it in some ways, but it didn't seem to fit precisely enough for the setting I was in. I'll check out Barwick's papers. |
Jun 27 |
asked | Introducing division strategically in operads to accommodate formulas like the Baker-Campbell-Hausdorff formula |