Skip to the Main Content

Note:These pages make extensive use of the latest XHTML and CSS Standards. They ought to look great in any standards-compliant modern browser. Unfortunately, they will probably look horrible in older browsers, like Netscape 4.x and IE 4.x. Moreover, many posts use MathML, which is, currently only supported in Mozilla. My best suggestion (and you will thank me when surfing an ever-increasing number of sites on the web which have been crafted to use the new standards) is to upgrade to the latest version of your browser. If that's not possible, consider moving to the Standards-compliant and open-source Mozilla browser.

July 25, 2025

The Clowder Project

Posted by John Baez

guest post by Emily de Oliveira Santos

I’d like to share here a personal project which might be of interest to the readers of this blog: the Clowder Project.

Clowder is a wiki and reference work for category theory built using the same general infrastructure and tag system of the Stacks Project, Gerby. The intention is for it to eventually become for category theory what the Stacks Project is for algebraic geometry.

Posted at 11:18 AM UTC | Permalink | Followups (3)

July 24, 2025

2-Rig Conjectures Proved?

Posted by John Baez

Kevin Coulembier has come out with a paper claiming to prove some conjectures that Todd Trimble, Joe Moeller and I made in 2-Rig extensions and the splitting principle:

Posted at 2:58 PM UTC | Permalink | Followups (5)

Lawvere’s Work on Arms Control

Posted by John Baez

Did you know that Lawvere did classified work on arms control in the 1960s, back when he was writing his thesis? Did you know that the French government offered him a job in military intelligence?

Posted at 12:48 PM UTC | Permalink | Followups (4)

July 7, 2025

How to Count n-Ary Trees

Posted by John Baez

How do you count rooted planar nn-ary trees with some number of leaves? For n=2n = 2 this puzzle leads to the Catalan numbers. These are so fascinating that the combinatorist Richard Stanley wrote a whole book about them. But what about n>2n \gt 2?

I’ll sketch one way to solve this puzzle using generating functions. This will give me an excuse to talk a bit about something called ‘Lagrange inversion’.

Posted at 8:24 AM UTC | Permalink | Followups (7)