|Title:||Enumeration of s-omino towers and row-convex k-omino towers||Language:||English||Authors:||Haupt, Alexander||Keywords:||Bijection; Convex polyomino; Domino; Lagrange inversion||Issue Date:||2021||Source:||Journal of Integer Sequences 24 (3): 21.3.6 (2021)||Abstract (english):||
We first enumerate a generalization of domino towers that was proposed by Brown, which we call S-omino towers. We establish equations that the generating function must satisfy, and then apply the Lagrange inversion formula to find a closed formula for the number of towers. We also show a connection to generalized Dyck paths and describe an explicit bijection. Finally, we consider the set of row-convex k-omino towers, introduced by Brown, and calculate an exact generating function.
|URI:||http://hdl.handle.net/11420/9335||ISSN:||1530-7638||Journal:||Journal of integer sequences||Institute:||Mathematik E-10||Document Type:||Article|
|Appears in Collections:||Publications without fulltext|
Show full item record
checked on Feb 3, 2023
Add Files to Item
Note about this record
Items in TORE are protected by copyright, with all rights reserved, unless otherwise indicated.