Mudit Aggarwal | Indraprastha Institute of Information Technology(IIIT), Delhi (original) (raw)
Uploads
Papers by Mudit Aggarwal
Let m, k be fixed positive integers. Determining the generating function for the number of tiling... more Let m, k be fixed positive integers. Determining the generating function for the number of tilings of an m × n rectangle by k × 1 rectangles is a long-standing open problem to which the answer is only known in certain special cases. We give an explicit formula for this generating function in the case where m < 2k. This result is used to obtain the generating function for the number of tilings of an m × n × k box with k × k × 1 bricks.
Let m, k be fixed positive integers. Determining the generating function for the number of tiling... more Let m, k be fixed positive integers. Determining the generating function for the number of tilings of an m × n rectangle by k × 1 rectangles is a long-standing open problem to which the answer is only known in certain special cases. We give an explicit formula for this generating function in the case where m < 2k. This result is used to obtain the generating function for the number of tilings of an m × n × k box with k × k × 1 bricks.