I'm familiar with a few examples of adjoint functor triples $F\dashv G\dashv H$:
- equivalences of categories
- left/right Kan extensions
- induction/coinduction from a ring homomorphism
- the forgetful functor from Top to Set
I'm curious if there are other simple examples I haven't heard about. Of the four listed, I actually find the last example most interesting, in both simplicity and that the two categories involved are actually very specific, rather than broad classes.
There is a simple example between the category of graphs $\mathbf{Gph}$ and the category of sets $\mathbf{Set}$, see this post. To summarise it: we have the forgetful functor $U: \mathbf{Gph} \to \mathbf{Set}$. It has a left adjoint $F: \mathbf{Set} \to \mathbf{Gph}$, which assigns to a set $X$ the graph $F(X)$ with vertex set $X$ and no edges. Then there is also $C: \mathbf{Gph} \to \mathbf{Set}$ that sends a graph to the set of its connected components. We have $C \dashv F \dashv U$.
Interestingly, we can add a fourth functor to this list. Consider $G: \mathbf{Set} \to \mathbf{Gph}$ that sends a set $X$ to the graph $G(X)$ with vertex set $X$ and edges between any two vertices (and on functions it does nothing). Then $U$ is left adjoint to $G$.
A similar example would be to consider the category of preorders and order-preserving maps $\mathbf{PreOrd}$. Then the forgetful functor $U: \mathbf{PreOrd} \to \mathbf{Set}$ has both a left and right adjoint. Similar to the graphs example the left adjoint adds no order relations to our set, while the right adjoint adds all order relations.
It is worth noting that this last example fails if we would consider the category of partial orders instead. In fact, the forgetful functor from partial orders to the category of sets has no right adjoint, see this post.