Corpus ID: 3005966

An object grammar for the class of L-convex polyominoes

@inproceedings{Frosini2006AnOG,
  title={An object grammar for the class of L-convex polyominoes},
  author={A. Frosini and S. Rinaldi},
  year={2006}
}
We consider the class of L-convex polyominoes, i.e. convex polyomi- noes where any two chosen cells can be connected simply using an internal path having at most one change of direction. The main result of the paper is the definition of an object grammar decomposition of this class, which gives com- binatorial evidence of the rationality of the generating function, and suggests some new combinatorial properties. 

References

SHOWING 1-10 OF 19 REFERENCES
An Object Grammar for Column-Convex Polyominoes
Enumeration of L-convex polyominoes by rows and columns
Ordering and Convex Polyominoes
A Tomographical Characterization of L-Convex Polyominoes
Algebraic Languages and Polyominoes Enumeration
Object grammars and bijections
Reconstruction of L-convex Polyominoes
Object grammars and random generation
  • I. Dutour, J. Fedou
  • Mathematics, Computer Science
  • Discret. Math. Theor. Comput. Sci.
  • 1998
A method for the enumeration of various classes of column-convex polygons
Enumerative combinatorics
...
1
2
...