Safe Haskell | None |
---|---|
Language | Haskell2010 |
Motivic classes in homology
Synopsis
- interpretSingleLam :: (Dim -> KRing Integer) -> SingleLam -> KRing Integer
- csmPn :: Dim -> KRing Integer
- csm_xlam_P1 :: Partition -> KRing Integer
- csm_xlam_P1_cohom :: Partition -> ZMod G
- test_motivic_csm_vs_aluffi :: Int -> Bool
- type KRing c = Univariate c "u"
- type GRing c = Poly c "u"
- embedInf :: KRing c -> GRing c
- project1 :: GRing c -> KRing c
- delta2 :: Ring c => KRing c -> GRing c
- deltaN :: Ring c => Int -> KRing c -> GRing c
- psi2 :: Ring c => GRing c -> KRing c
- psiNaive :: Ring c => Int -> GRing c -> KRing c
- psiAny :: Ring c => GRing c -> KRing c
- omegaNaive :: Ring c => Int -> KRing c -> KRing c
- omegaH :: Ring c => Int -> KRing c -> KRing c
- separate1st :: forall c n. Ring c => GRing c -> GRing (KRing c)
- unify1st :: forall c n. Ring c => GRing (KRing c) -> GRing c
- unify1st2nd :: forall c n. Ring c => GRing (GRing c) -> GRing c
- crossKs :: Ring c => [KRing c] -> GRing c
- kkToG2 :: Ring c => KRing (KRing c) -> GRing c
- unifyKK :: Ring c => KRing (KRing c) -> KRing c
Documentation
test_motivic_csm_vs_aluffi :: Int -> Bool Source #
Compares Aluffi's CSM formula to the motivic algorithm (up to partitions of size n
)
= Univariate c "u" | lim_n H_*(Sym^n(P1)) |