Bhavik Mehta
Bhavik Mehta
At the moment, constructing Dirichlet characters from a table is done as follows: By way of example, let us use modulus 2520 = 2^3 × 3^2 × 5 × 7....
Continuing work and discussion from #130, it would be nice to both optimise Pollard's algorithm further using more sophisticated walks and possibly use the Pollig-Hellman algorithm in some cases. See...
https://github.com/b-mehta/maths-notes/blob/faab4052da4b5aba0265e6a8f9e90be6d7763cc1/ii/mich/graph_theory.tex#L200 Add the bipartite graph here (consider Hall's theorem)
Draft: - It's unclear how efficient Batch is. It's also unclear if it (and its applicative instance) are defined in the correct way: it might allocate less if the order...
WIP: - needs a _lot_ of tidying up - needs rebasing after merge of #44 - needs documentation to explain some of the below Changes introduced: - There are two...
The exception only says closed terms are a problem, I want to test what happens if I allow non-local terms as well to see if the docstring needs editing
--- [](https://gitpod.io/from-referrer/)
`nat.divisors` unconditionally preserves multiplication, so this bundles it as a monoid hom, similar for `nat.divisors_antidiagonal`. This PR also changes `nat.divisors` to be defined in terms of `nat.divisors_antidiagonal`, which drastically simplifies...
The definition of `G : C ⥤ D` preserving limits of shape `J` can equivalently be stated as: for any `F : J ⥤ C`, the canonical morphism `G.obj (limit...
--- [](https://gitpod.io/from-referrer/)