### Abstract

Lingua originale | Italian |
---|---|

pagine (da-a) | 435-446 |

Numero di pagine | 12 |

Rivista | Fundamenta Informaticae |

Volume | 74(4) |

Stato di pubblicazione | Published - 2006 |

### Cita questo

*Fundamenta Informaticae*,

*74(4)*, 435-446.

**Highmann's Theorem on Discrete Sets.** / Restivo, Antonio; Burderi, Fabio; Castiglione, Giuseppa.

Risultato della ricerca: Article

*Fundamenta Informaticae*, vol. 74(4), pagg. 435-446.

}

TY - JOUR

T1 - Highmann's Theorem on Discrete Sets

AU - Restivo, Antonio

AU - Burderi, Fabio

AU - Castiglione, Giuseppa

PY - 2006

Y1 - 2006

N2 - In this paper we investigate properties of different classes of discrete sets with respect to the partial-order of subpicture. In particular we take in consideration the classes of convex polyominoes and L-convex polyominoes. In the first part of the paper we study closure properties of these classes with respect the order and we give a new characterization of L-convex polyominoes. In the second part we pose the question to extend Higman’s theoremto discrete sets. We give a negative answer in the general case and we prove that the set of L-convex polyominoes is well-partially-ordered by using a representation of L-convex polyominoes in terms of words of a regular language.

AB - In this paper we investigate properties of different classes of discrete sets with respect to the partial-order of subpicture. In particular we take in consideration the classes of convex polyominoes and L-convex polyominoes. In the first part of the paper we study closure properties of these classes with respect the order and we give a new characterization of L-convex polyominoes. In the second part we pose the question to extend Higman’s theoremto discrete sets. We give a negative answer in the general case and we prove that the set of L-convex polyominoes is well-partially-ordered by using a representation of L-convex polyominoes in terms of words of a regular language.

KW - Discrete sets, polyominoes and L-convex polyominoes; subpicture order and wellpartial-ordering.

UR - http://hdl.handle.net/10447/40019

M3 - Article

VL - 74(4)

SP - 435

EP - 446

JO - Fundamenta Informaticae

JF - Fundamenta Informaticae

SN - 0169-2968

ER -