-
The documentation states ` this homomorphism is a permutation equivalence`. Here `this` can be understood as meaning `the return value of ActionHomomorphism`. But it is easy to make `ActionHomomorph…
-
Hi,
I'd be more than happy to submit some pull requests on these various terms. I'd much rather get an opinion first before starting on a PR:
- [ ] application (as a compliment to `partial applica…
-
> Revisiting #1544, I am (now) conscious that the *opposite* choice is already made regarding the name of the homomorphism property in `Algebra.Morphism.Structures.IsMagmaHomomorphism`, which for what…
-
Given an HMF over F, you can restrict that HMF to another HMF over any subfield F_0; for example, you can restrict an HMF over a real quadratic field to get a classical modular form (over QQ). [Sam T…
-
calculate a useful hash function that can be queried for closeness when related authors publish stuff together. If it funtions like f(A+B) = f(B+A) then first-authorship no-longer matters.
a suggesti…
silky updated
10 years ago
-
PR #467 implemented the bi-Heyting algebra of sub-C-sets, which is the propositional fragment of the logic of a presheaf topos. We should upgrade it to predicate logic, which would involve implementin…
-
Consider the following demo code:
```
LoadPackage( "CAP" );
cat := CreateCapCategory( );
myobj := SymmetricGroup( 3 );
AddObject( cat, myobj );
mymor := GroupHomomorphismByImages( myobj, myobj…
-
Without that, we may end up with incorrect recognition of certain factors/images; with bad answers to user inputs in general; and also with unexpected `Error()`s during recognition.
Partial progres…
-
```
>> The type scheme: '∀(a, m, b). a -> b -> a -> Bool' cannot be generalized to '∀(a, b, m). a -> b -> a -> Bool'.
70 | law homomorphism: forall(f: a -> b, x: a). Applicative.ap(Applicative.po…
-
From Gordon Royle via the GAP forum:
I am using the GAP package “digraphs” to determine whether or not there is a homomorphism from a digraph d1 to a digraph d2 (in fact they are graphs, but that d…