In this paper, we give some sufficient conditions for a $n$-dimensional rectangle to be tiled with a set of bricks. These conditions are obtained by using the so-called Frobenius number.
The Frobenius number for the triple of the 2-step star numbers
The Frobenius number for Fibonacci triplet associated with number of representations
Constructing the set of complete intersection numerical semigroups with a given Frobenius number
![QR code for arXiv:math/0605746 [math.CO]](http://oss.arxitics.com/images/favicon.svg)