Enumeration of L-convex polyominoes by rows and columns

Risultato della ricerca: Articlepeer review

26 Citazioni (Scopus)

Abstract

In this paper, we consider the class of L-convex polyominoes, i.e. the convex polyominoes in whichany two cells can be connected by a path of cells in the polyomino that switches direction betweenthe vertical and the horizontal at most once.Using the ECO method, we prove that the number fn of L-convex polyominoes with perimeter2(n+2) satisfies the rational recurrence relation fn =4fn-1 -2fn-2, with f0 =1, f1 =2, f2 =7.Moreover, we give a combinatorial interpretation of this statement. In the last section, we presentsome open problems
Lingua originaleEnglish
pagine (da-a)336-352
Numero di pagine17
RivistaTheoretical Computer Science
Volume347
Stato di pubblicazionePublished - 2005

All Science Journal Classification (ASJC) codes

  • ???subjectarea.asjc.2600.2614???
  • ???subjectarea.asjc.1700.1700???

Fingerprint

Entra nei temi di ricerca di 'Enumeration of L-convex polyominoes by rows and columns'. Insieme formano una fingerprint unica.

Cita questo