# Category Archives: Combinatorics

## Young Tableau: A Monoid (Part III)

View literate file on Github > import YT Last time, we defined an operation that allowed us to grow a young tableau by a single number. It turns out that we can use this to give a monoid structure to … Continue reading

Posted in Combinatorics, Haskell | Tagged , | Leave a comment

## Hungarian Algorithm (Part II)

View source file on Github [part 1 is not necessary to follow this] When I first looked up the Hungarian algorithm on Wikipedia, I was immediately drawn away from what seemed like a tortured graphical explanation and went straight to … Continue reading

Posted in Algorithm, Combinatorics | Tagged | Leave a comment

## Young Tableau: Row-insertion (Part II)

View literate file on Github > import Control.Lens > import Control.Monad > import Control.Monad.State > import Data.List > import Test.QuickCheck Having defined a Young Tableau, letâ€™s consider one of the ways to construct it. How can you go about adding … Continue reading

Posted in Combinatorics, Haskell | Tagged , | Leave a comment

## Hungarian Algorithm (Part I): Minimal covering of zeros

View source file on Github > module Main where > import Control.Lens hiding (assign) > import Control.Monad > import Data.List > import Data.Ord (comparing) > import Test.QuickCheck hiding (sample) > import qualified Data.IntSet as I I will resist posts on … Continue reading

Posted in Algorithm, Combinatorics, Haskell | Tagged | Leave a comment

## Young Tableau: Introduction (Part I)

View literate file on Github I have a book sitting on my shelf: Young Tableaux by William Fulton (ISBN 0 521 56724 6). I bought it after having the fantastic chance to see these beautiful and deep combinatorial structures in … Continue reading

Posted in Combinatorics, Haskell, Series | Tagged | Leave a comment