-
I've now written up the new approach to the sign homomorphism in Sec. 4.5 (after commit c20b570).
Please have a look! There's a little puzzle left: I give a pointed map, Bsgn, from n-element sets t…
-
The `@acset_colim` macro is a beloved method of constructing individual ACSets. But, when people try to create rewrite rules, they need to specify a whole diagram of ACSets. After constructing the obj…
-
Hi, I'm having problems with this example:
```
LoadPackage(` "groupexplorer" );
G := Group( [ (1,2,3), (3,4) ] );
H := Subgroup( G, [ (1,2,3) ] );
embed := GroupHomomorphismByFunction( H, G, a …
-
In many applications, we have a sequence of C-Sets (`X1->X2->X3->...`) over time, connected by morphisms. We wish to find all matches of some pattern at every step. The C-Sets may differ only in a sma…
-
We need to extend the `write_json_acset` function to write CSet homomorphisms. @kris-brown, have you done something similar for any of your projects?
-
I have tried to check if this implementation can be used for Additive homomorphism available in ElGamal.
For example, to achieve sometime like this this
`ADD(X,Y) = Enc(plain_text_1+plain_text_2) …
eNipu updated
3 years ago
-
I would like to construct a semidirect product of $H=S(2)$ and $N=A(5)$. The semidirect_product function calls for a homomorphism $f:H\to Aut(N)$. I want to be sensible and map elements of H to the co…
-
There is a problem with computing the kernel of a homomorphism of modules defined over different rings, when the target ring has no variables.
When the target ring was QQ[] I got:
```m2
i1 : A …
-
... as described in https://docs.oscar-system.org/dev/DeveloperDocumentation/printing_details/ (with fixes in PR #2769).
Right now I see this:
```
julia> H, phi = derived_subgroup(symmetric_gro…
-
Despite considerable effort, I have not yet succeeded in defining the cartesian or cocartesian counterparts to the composable homomorphism building blocks.
[`Cartesian.Sub`](https://github.com/cona…
conal updated
3 years ago