Search results for "Crete"

FORMAL CONCEPTION OF ROUGH SETS

1996

In the paper we present a formal description of rough sets within the framework of the generalized set theory, which is interpreted in the set approximation theory. The rough sets are interpreted as approximations, which are defined by means of the Pawlak's rough sets.

Extension of analytic functional calculus mappings and duality by $$\bar \partial $$ -Closed forms with growth

1982

Chief Series and Right Regular Representations of Finite p-Groups

1988

AbstractWe study the embeddings of a finite p-group U into Sylow p-subgroups of Sym (U) induced by the right regular representation p: U→ Sym(U). It turns out that there is a one-to-one correspondence between the chief series in U and the Sylow p-subgroups of Sym (U) containing Up. Here, the Sylow p-subgroup Pσ of Sym (U) correspoding to the chief series σ in U is characterized by the property that the intersections of Up with the terms of any chief series in Pσ form σp. Moreover, we see that p: U→ Pσ are precisely the kinds of embeddings used in a previous paper to construct the non-trivial countable algebraically closed locally finite p-groups as direct limits of finite p-groups.

Proving convexity preserving properties of interpolatory subdivision schemes through reconstruction operators

2013

We introduce a new approach towards proving convexity preserving properties for interpolatory subdivision schemes. Our approach is based on the relation between subdivision schemes and prediction operators within Harten's framework for multiresolution, and hinges on certain convexity properties of the reconstruction operator associated to prediction. Our results allow us to recover certain known results [10,8,1,7]. In addition, we are able to determine the necessary conditions for convexity preservation of the family of subdivision schemes based on the Hermite interpolation considered in [4].

Multi-letter reversible and quantum finite automata

2007

The regular language (a+b)*a (the words in alphabet {a, b} having a as the last letter) is at the moment a classical example of a language not recognizable by a one-way quantum finite automaton (QFA). Up to now, there have been introduced many different models of QFAs, with increasing capabilities, but none of them can cope with this language. We introduce a new, quite simple modification of the QFA model (actually even a deterministic reversible FA model) which is able to recognize this language. We also completely characterise the set of languages recognizable by the new model FAs, by finding a "forbidden construction" whose presence or absence in the minimal deterministic (not necessaril…

Extension maps in ultradifferentiable and ultraholomorphic function spaces

2000

Upper and lower generalized factoraggregations based on fuzzy equivalence relation

2014

We develop the concept of a general factoraggre-gation operator introduced by the authors on the basis of an equivalence relation and applied in two recent papers for analysis of bilevel linear programming solving parameters. In the paper this concept is generalized by using a fuzzy equivalence relation instead of the crisp one. By using a left-continuous t-norm and its residuum we define and investigate two modifications of such generalized construction: upper and lower generalized factoraggregations. These generalized factoraggregations can be used for construction of extensional fuzzy sets.

On trifactorized soluble minimax groups

1988

The Fubini and Tonelli Theorems for Product Local Systems

2010

The notion of product local system and of the Kurzweil-Henstock type integral related to a product local system is introduced. The main result is a version of the Fubini and Tonelli theorems for product local systems.

(p,q)-Summing Sequences of Operators

2003

Abstract unavailable at this time... Mathematics Subject Classification (2000): 47B10. Key words: Summing operators, vector-valued multipliers. Quaestiones Mathematicae 26(2003), 441–452