bon-cdp

3 ms·

1. 1.▲
   by bon-cdp 1y ago

   A little update after thinking about it more, since its dependant on the character table for the cyclic subgroup with k (O(k)) (this is kinda the whole idea - to do so with Frobenius Reciprocity); o(p(n)^3) is kinda inaccurate, as it ends u
2. 2.▲
   by bon-cdp 1y ago

   Overall you are so right to be skeptical. This is something I'm actively working on and just wanted to share the idea as I validate (sorry if that's wrong) The crypto thing (trustdog) was just a hackathon thing i recently did (whi
3. 3.▲
   by bon-cdp 1y ago

   Had this idea while working on wreath-sheaf attention to use categorical bootstrap to approach Kronecker Coefficient computation. Code is uploaded to https://github.com/bon-cdp/heir/tree/experimental/unif
4. 4.▲
   Kronecker in (O(p(n)^3): A Novel approach to 80-year-old P-hard problem [pdf](github.com)

   11 points by bon-cdp 1y ago|4 comments
5. 5.▲
   Solving Diverse Problems with Sheaf-Wreath Attention [pdf](github.com)

   2 points by bon-cdp 1y ago|1 comments
6. 6.▲
   by bon-cdp 1y ago

   Here's an idea I had while working on google's HEIR project as an open source contributor. Essentially you're using a wreath product to encode a problem of the form: "At each position p, select a transformation from grou