We discuss the question whether the limit form of a sequence of closed, sectorial forms is closed itself. In particular, we prove a convergence theorem from below which assures the limiting form to be closed. As an application of this theorem, we show a different approach to show the closedness of elliptic forms with measurable coefficients. We also give an example of a densely defined, closed,...

In this paper, it is shown that the category of stratified $L$-generalized convergence spaces is monoidal closed if the underlying truth-value table $L$ is a complete residuated lattice. In particular, if the underlying truth-value table $L$ is a complete Heyting Algebra, the Cartesian closedness of the category is recaptured by our result.

The aim of this paper is to obtain common fixed point theorems by employing the recently introduced notion of g -reciprocal continuity and pseudocompatible mappings in Intuitionistics fuzzy metric spaces. Results proved in this paper do not require the conditions of continuity of maps and closedness of any range.

In this paper, we further develop the coordination control scheme for discrete-event systems based on the Ramadge-Wonham framework. The notions of conditional decomposability, conditional controllability, and conditional closedness are revised and simplified, supremal conditionally controllable sublanguages of general non-prefix-closed languages are discussed, and a procedure for the computatio...

Let φ(z) = (φ1(z), · · · , φn(z)) be a holomorphic self-map of Bn and ψ(z) a holomorphic function on Bn, and H(Bn) the class of all holomorphic functions on Bn, where Bn is the unit ball of C , the weight composition operator Wψ,φ is defined by Wψ,φ = ψf(φ) for f ∈ H(Bn). In this paper we estimate the essential norm for the weighted composition operator Wψ,φ acting from the Hardy space H to H (...

Under a mild condition we show that a composition operator Cφ is compact on the Bergman space Aα of the open unit ball in C if and only if (1− |z|)/(1− |φ(z)|) → 0 as |z| → 1−.

We revisit a divide-and-conquer algorithm, originally described by Brent and Kung for composition of power series, showing that it can be applied practically to composition of polynomials in Z[x] given in the standard monomial basis. We offer a complexity analysis, showing that it is asymptotically fast, avoiding coefficient explosion in Z[x]. The algorithm is straightforward to implement and p...

In concurrency theory, there are several examples where the interleaved model of concurrency can distinguish between execution sequences which are not signiicantly diierent. One such example is sequences that diier from each other by stuttering, i. e., the number of times a state can adjacently repeat. Another example is executions that diier only by the ordering of independently executed event...