Ribbon lattices and ribbon function identities

We construct a family of generalized lattice models depending on a positive integer n whose partition functions are equal to the n-ribbon functions introduced by Lascoux, Leclerc and Thibon. Using the ribbon lattice model, we provide combinatorial proofs of ribbon function identities relying on the lattice structure and demonstrate the exact solvability of the model for 1,2, and 3 ribbons.