Enumeration of lozenge tilings of hexagons with cut off corners

Details Enumeration of lozenge tilings of hexagons with cut off corners Enumeration of lozenge tilings of hexagons with cut off corners

2001-04-04

arxiv.org/abs/math/0104058v1

J. Combin. Theory Ser. A 100 (2002), 201-231.

Mathematics

Combinatorics

23 pages, AmS-TeX

Scientific paper

Motivated by the enumeration of a class of plane partitions studied by Proctor and by considerations about symmetry classes of plane partitions, we consider the problem of enumerating lozenge tilings of a hexagon with ``maximal staircases'' removed from some of its vertices. The case of one vertex corresponds to Proctor's problem. For two vertices there are several cases to consider, and most of them lead to nice enumeration formulas. For three or more vertices there do not seem to exist nice product formulas in general, but in one special situation a lot of factorization occurs, and we pose the problem of finding a formula for the number of tilings in this case.

Affiliated with

Also associated with

No associations

Rating

Enumeration of lozenge tilings of hexagons with cut off corners does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Enumeration of lozenge tilings of hexagons with cut off corners, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Enumeration of lozenge tilings of hexagons with cut off corners will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-602930