tag:blogger.com,1999:blog-11295132.post8819797877805758669..comments2017-11-19T22:29:51.657-08:00Comments on A Neighborhood of Infinity: Hopf Algebra = Group + MonadDan Piponihttps://plus.google.com/107913314994758123748noreply@blogger.comBlogger16125tag:blogger.com,1999:blog-11295132.post-70113860452022782152012-03-21T08:04:48.328-07:002012-03-21T08:04:48.328-07:00Hi, I am interested in the paper regarding combina...Hi, I am interested in the paper regarding combinatorial applications of Hopf Algebra.<br />However the link is no longer working.<br /><br />Any idea of what is the title of the paper?<br /><br />Thanks a lot!<br />yoyostein88@gmail.com<br /><br />"Now I have this machinery for working with Hopf algebras I might as well construct some examples that aren't simply generated by some underlying group. I found some pretty combinatorial examples in this paper."Yoyosteinnoreply@blogger.comtag:blogger.com,1999:blog-11295132.post-47376976744572183392008-11-22T05:25:00.000-08:002008-11-22T05:25:00.000-08:00Comoputational monads go back to the calculation o...Comoputational monads go back to the calculation of sine tables in antiquity, and then intersected algrebra under the influence of formal logic at about the time of the Asclepios (Hermetic monadology). This is not well known, because the true origin of differential calculus lies here. This history was touched on by Delambre on route to the SI (metric system), which accordingly holds the planet together! As errors of estimate, CMs then disappear behind the Weierstrass Approximation Theorem in tandem with statisticsal mechanics, and then colonize cosmology via Stone's extension to compactifications. The fabulous superstrings now fall to earth as M-branes, familiar as rigid rotators, or the atoms of the Ancients. Of course, this is only half of what topology now does, which is what bought me to this blog.<BR/><BR/>DiedLaughingAnonymousnoreply@blogger.comtag:blogger.com,1999:blog-11295132.post-67470528350127011972008-08-19T17:32:00.000-07:002008-08-19T17:32:00.000-07:00Kevin,If you're interested in solving large linear...Kevin,<BR/><BR/>If you're interested in solving large linear systems there will be some bindings to the standard C libraries out there. But I suggest asking in <A HREF="http://www.haskell.org/mailman/listinfo/haskell-cafe" REL="nofollow">haskell-cafe</A> where I've seen people discuss these things. haskell-cafe is a pretty friendly place and there are a quite a few mathematicians 'there'.<BR/><BR/>Incidentally, the benchmark for compactly computing homology is probably <A HREF="http://portal.acm.org/citation.cfm?id=800071.802261" REL="nofollow">this</A>.sigfpehttps://www.blogger.com/profile/08096190433222340957noreply@blogger.comtag:blogger.com,1999:blog-11295132.post-39439723719817002392008-08-19T17:16:00.000-07:002008-08-19T17:16:00.000-07:00Sigpfe -- thanks for that! It's pretty amazing tha...Sigpfe -- thanks for that! <BR/><BR/>It's pretty amazing that it takes 20 lines to code to compute homology. (I'd been dreading trying to define a chain complex class in C++...) <BR/><BR/>The coolest thing about all this ribbon graph stuff is the way it links algebra and geometry (and physics!). For instance, Kontsevich has a great paper where he shows how to understand the cohomology of moduli space by thinking about homotopy-associative algebras. My project is ultimately related to this.<BR/><BR/>The only reason Haskell might not be appropriate for what I want to do is that at some stage I'll want to invert very large matrices. But I presume that Haskell can just call some fast + optimized C program to do this part, is that right?<BR/><BR/>Thanks,<BR/>KevinAnonymousnoreply@blogger.comtag:blogger.com,1999:blog-11295132.post-41747650653466127742008-08-19T17:03:00.000-07:002008-08-19T17:03:00.000-07:00Kevin,Chain complexes and homology? Funny you shou...Kevin,<BR/><BR/>Chain complexes and homology? <A HREF="http://sigfpe.blogspot.com/2006/08/algebraic-topology-in-haskell.html" REL="nofollow">Funny you should ask</A> :-)<BR/><BR/>Years ago I read the paper by Penner on fat/ribbon graphs, matrix models and the computation of the Euler characteristics of moduli spaces and thought it was pretty amazing. I'd love to see some related Haskell code.<BR/><BR/>I (apparently) got fellow blogger <A HREF="http://sigfpe.blogspot.com/2006/08/algebraic-topology-in-haskell.html" REL="nofollow">Mikael Johannson</A> interested in Haskell a while back and I think he did a bunch of homological algebra type things with it.sigfpehttps://www.blogger.com/profile/08096190433222340957noreply@blogger.comtag:blogger.com,1999:blog-11295132.post-15991907516219050652008-08-19T16:51:00.000-07:002008-08-19T16:51:00.000-07:00Great blog! Haskell does seem to be the perfect l...Great blog! <BR/><BR/>Haskell does seem to be the perfect language for pure mathematics. I've been trying to do some computations involving ribbon graphs and the moduli space of curves in C++, but from reading your blog it looks like it would be far easier in Haskell. <BR/><BR/>Do you know of any implementations of things like chain complexes, homology, etc. in Haskell?<BR/><BR/>Best,<BR/>KevinAnonymousnoreply@blogger.comtag:blogger.com,1999:blog-11295132.post-85085550186709229092008-08-08T14:20:00.000-07:002008-08-08T14:20:00.000-07:00Very interesting! I wonder what happens when you m...Very interesting! I wonder what happens when you monadify/Kleislify the axioms of other algebraic structures, say monoids, fields or vector spaces.<BR/><BR/>I.e.<BR/>class Field m a where<BR/> zero :: m a<BR/> one :: m a<BR/> add :: a -> a -> m a<BR/> mult :: a -> a -> m a<BR/> ...<BR/><BR/>instance (Monad m) => Field m Float where ...<BR/><BR/>With this setup: What is V Float Float? Because of the instance given in the previous paragraph this has (additionall to vector addition) a bilinear add and a bilinear mult.<BR/><BR/>Also, what is Maybe Z? Or [Z]? All of these come, thanks to the instance (Monad m) => Group m Z, equipped with a compatible multiplication, (>>= mult).Anonymousnoreply@blogger.comtag:blogger.com,1999:blog-11295132.post-23068762992041952362008-08-05T16:30:00.000-07:002008-08-05T16:30:00.000-07:00Got it! I was looking at toListWith's data signat...Got it! I was looking at toListWith's data signature and I mixed up the (k, a) there and the (k, a) in V.Christianhttps://www.blogger.com/profile/14449473944213707260noreply@blogger.comtag:blogger.com,1999:blog-11295132.post-59945107906700107972008-08-05T09:12:00.000-07:002008-08-05T09:12:00.000-07:00Christian,Elements of vectors are written as lists...Christian,<BR/><BR/>Elements of vectors are written as lists of pairs (k,a) where k is the coefficient and a is the basis vector label. I need to collect together pairs with the same basis label. Data.Map can do this. But fromList and toList use the *first* element of the pair as key, not the second element, and they sort on the first element. So I needed to swap.<BR/><BR/>The code would have been slightly shorter if I'd used lists of (a,k). But it's more conventional in mathematics texts to write the coefficient before the basis element.<BR/><BR/>I'm pretty sure the definition of V is correct because the quickChecks work. Of course 'pretty sure' isn't a proof.sigfpehttps://www.blogger.com/profile/08096190433222340957noreply@blogger.comtag:blogger.com,1999:blog-11295132.post-38042115257876672342008-08-05T09:03:00.000-07:002008-08-05T09:03:00.000-07:00I'm not sure if I need to read on to understand it...I'm not sure if I need to read on to understand it but it seems to me that x in reduce x is already (k, a). I don't understand why there is a need to fmap swap x first. Is the definition of V a typo?Christianhttps://www.blogger.com/profile/14449473944213707260noreply@blogger.comtag:blogger.com,1999:blog-11295132.post-85445663552326548762008-08-03T15:10:00.000-07:002008-08-03T15:10:00.000-07:00Those were just the the kind of resources I was lo...Those were just the the kind of resources I was looking for. Greatly appreciate it. Hope you ran a good marathon!topologicalmusingshttp://topologicalmusings.wordpress.com/noreply@blogger.comtag:blogger.com,1999:blog-11295132.post-25273788107204814692008-08-03T15:04:00.000-07:002008-08-03T15:04:00.000-07:00That was a terse reply. I was on my way out to run...That was a terse reply. I was on my way out to run half of the San Francisco marathon.<BR/><BR/>Anyway, I found <A HREF="http://stefan-klinger.de/files/monadGuide.pdf" REL="nofollow">this</A> useful for getting the correspondence between a category theoretic notion of monads and the actual notation as used in a Haskell program. I also enjoy lots of papers by <A HREF="http://cs.ioc.ee/~tarmo/papers/" REL="nofollow">Uustalu</A>and Vene as they come with category theoretical language and Haskell code so it's easy to see the correspondence.sigfpehttps://www.blogger.com/profile/08096190433222340957noreply@blogger.comtag:blogger.com,1999:blog-11295132.post-11171509049582074472008-08-03T05:12:00.000-07:002008-08-03T05:12:00.000-07:00In that case there so many papers I don't know whe...In that case there so many papers I don't know where to start!sigfpehttps://www.blogger.com/profile/08096190433222340957noreply@blogger.comtag:blogger.com,1999:blog-11295132.post-53735071555736657472008-08-03T01:29:00.000-07:002008-08-03T01:29:00.000-07:00Well, I do have a fair amount of background (thoug...Well, I do have a fair amount of background (though quite modest, I should say) in computer science. Thanks!topologicalmusingshttp://topologicalmusings.wordpress.com/noreply@blogger.comtag:blogger.com,1999:blog-11295132.post-82302287931054767872008-08-02T20:57:00.000-07:002008-08-02T20:57:00.000-07:00I think the intersection of Haskell programmers an...I think the intersection of Haskell programmers and mathematicians is still fairly small and there aren't too many books, if any at all, on the subject geared to someone with a categorical, but not computer science background.sigfpehttps://www.blogger.com/profile/08096190433222340957noreply@blogger.comtag:blogger.com,1999:blog-11295132.post-58661051312505106882008-08-02T20:41:00.000-07:002008-08-02T20:41:00.000-07:00I am not exactly sure if you have answered the fol...I am not exactly sure if you have answered the following question before, but pardon me if I am repeating it anyway.<BR/><BR/>Are there some good online resources (articles, books,blogs, etc.) that may help one to (re)learn Haskell from a (more) categorical perspective?<BR/><BR/>Thanks,topologicalmusingshttp://topologicalmusings.wordpress.com/noreply@blogger.com