Search results for "Regular polygon"

Combinatorial aspects of L-convex polyominoes

2007

We consider the class of L-convex polyominoes, i.e. those polyominoes in which any two cells can be connected with an ''L'' shaped path in one of its four cyclic orientations. The paper proves bijectively that the number f"n of L-convex polyominoes with perimeter 2(n+2) satisfies the linear recurrence relation f"n"+"2=4f"n"+"1-2f"n, by first establishing a recurrence of the same form for the cardinality of the ''2-compositions'' of a natural number n, a simple generalization of the ordinary compositions of n. Then, such 2-compositions are studied and bijectively related to certain words of a regular language over four letters which is in turn bijectively related to L-convex polyominoes. In …

Mixed intersections of non quasi-analytic classes

2008

Given two semi-regular matrices M and M' and two open subsets O and O' [resp. two compact subsets K and K'] of Rr and Rs respectively, we introduce the spaces E(M×M')(O × O') and D(M×M')(O × O') [resp. D(M×M')(K × K')]. In this paper we study their locally convex properties and the structure of their elements. This leads in [10] to tensor product representations of these spaces and to some kernel theorems.

Vector-valued meromorphic functions

2002

A locally complete locally convex space E satisfies that every weakly meromorphic function defined on an open subset of \( \mathbb{C} \) with values in E is meromorphic if and only if E does not contain a countable product of copies of \( \mathbb{C} \). A characterization of locally complete spaces in the spirit of known characterizations of the (metric) convex compactness property is also given.

Invariant measures for piecewise convex transformations of an interval

2002

Characterizing extreme points of polyhedra an extension of a result by Wolfgang Bühler

1982

This paper reconsiders the characterization given by Buhler admitting convex polyhedra of probability distributions on a finite or countable set which are given by systems of linear inequalities more complex than those considered before.

Some Nonlinear Methods in Fréchet Operator Rings and Ψ*-Algebras

1995

Two different inverse function theorems, one of Nash-Moser type, the other due to H. Omori, are extended to obtain special surjectivity results in locally convex and locally pseudo-convex Frechet algebras generated by group actions and derivations. In particular, the following factorization problem is discussed. Let Ψ be a locally pseudo-convex Frechet algebra with unit e and T+ : Ψ Ψ a continuous linear operator. Does there exist a neighborhood U of 0 such that the equation where T- = IΨ- T, has a solution x ∈ Ψ for every y ∈ U?

On some parameters related to weak noncompactness in L1(μ,E)

2009

Abstract A weak measure of noncompactness γU is defined in a Banach space in terms of convex compactness. We obtain relationships between the measure γU (A) of a bounded set A in the Bochner space L1 (μ,E) and two parameters Π(A) and Δ1(A). Then the criterion for relative weak compactness due to Ulger [19] and Diestel-Ruess-Schachermayer [11] is recovered.

Ordering and Convex Polyominoes

2005

We introduce a partial order on pictures (matrices), denoted by ≼ that extends to two dimensions the subword ordering on words. We investigate properties of special families of discrete sets (corresponding to {0,1}-matrices) with respect to this partial order. In particular we consider the families of polyominoes and convex polyominoes and the family, recently introduced by the authors, of L-convex polyominoes. In the first part of the paper we study the closure properties of such families with respect to the order. In particular we obtain a new characterization of L-convex polyominoes: a discrete set P is a L-convex polyomino if and only if all the elements Q≼P are polyominoes. In the seco…

Reconstruction of L-convex Polyominoes.

2003

Abstract We introduce the family of L-convex polyominoes, a subset of convex polyominoes whose elements satisfy a special convexity property. We develop an algorithm that reconstructs an L-convex polyomino from the set of its maximal L-polyominoes.

Tangency conditions for multivalued mappings

1996

We prove that interiority conditions imply tangency conditions for two multivalued mappings from a topological space into a normed vector space. As a consequence, we obtain the lower semicontinuity of the intersection of two multivalued mappings. An application to the epi-upper semicontinuity of the sum of convex vector-valued mappings is given.