A polyhedral map is called {p, q}-equivelar if each face has p edges and each vertex belongs to q faces. In [12], it was shown that there exist infinitely many geometrically realizable {p, q}-equivelar polyhedral maps if q > p = 4, p > q = 4 or q − 3 > p = 3. It was shown in [6] that there exist infinitely many {4, 4}and {3, 6}-equivelar polyhedral maps. In [1], it was shown that {5, 5}and {6, ...

Rate and power allocation in OFDM systems is discussed extensively in literature. These approaches are either based on a finite set of realizable rates or make use of a continuous rate-power function. The motivation of this correspondence was to investigate how to transfer efficiently continuous rate allocations to realizable ones. To increase performance, we suggest to skip some realizable rat...