Search results for "Discrete set"

showing 2 items of 12 documents

Highmann's Theorem on Discrete Sets

2006

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.

subpicture order and wellpartial-ordering.Discrete sets polyominoes and L-convex polyominoe
researchProduct

Openness and Discreteness

2013

The aim of this chapter is to study conditions under which a mapping of finite distortion is open (maps open sets to open sets) and discrete (preimage of each point is a discrete set).

symbols.namesakeDirac measureDistortionMathematical analysisOpen setsymbolsOpenness to experiencePoint (geometry)Conformal mapDiscrete setNonlinear elasticityMathematics
researchProduct