Search results for "Crete"
showing 10 items of 2495 documents
A note on the Banach space of preregular maps
2011
The aim of this paper is to give simple proofs for Jeurnink's characterizations of preregular maps in terms of Θ-maps acting between Banach lattices. For Banach lattices E and F, we achieve our goal by considering the space Lβ(E, F) of all those linear maps T: E → F for which there exists a constant K such that {double pipe}Vn i=1 {pipe}Txi{pipe} ≤ K {double pipe}Vn i=1{pipe}xi for all finite sequences x1, ..., xn e{open}E. We show that, if Lβ(E; F), and the spaces L Θ (E; F) of Θ -map and Lpr(E; F) of preregular maps are respectively endowed with their canonical norms, then they are identical Banach spaces
An integral for a banach valued function
2009
Abstract Using partitions of the unity ((PU)-partition), a new definition of an integral is given for a function f : [a, b] → X, where X is a Banach space, and it is proved that this integral is equivalent to the Bochner integral.
On a linear diophantine problem of Frobenius
1993
Abstract In this paper, linear diophantine problem of Frobenius is discussed. A theorem concerning the largest integer g m (a1,a2) and the smallest integer G m (a1,a2) with m different representations with a1,a2 as basis is proved.
On certain extension theorems in the mixed Borel setting
2004
Abstract Given two sequences M 1 and M 2 of positive numbers, we give necessary and sufficient conditions under which the inclusions Λ { M 1 } ⊂ f (j) (0) j∈ N 0 : f∈ D { M 2 } [−1,1] , Λ ( M 1 ) ⊂ f (j) (0) j∈ N 0 : f∈ D ( M 2 ) [−1,1] hold, by means of explicit constructions. This answers a question raised by Chaumat and Chollet (Math. Ann. 298 (1994) 7–40). We also consider the case when [−1,1] is replaced by [−1,1]m as well as the possibility to get ultraholomorphic extensions.
On the listing and random generation of hybrid binary trees
1994
We consider in this paper binary trees whose internal nodes are either associative or non-associative. Hybrid binary trees are equivalence classes with respect to the associative property. We count, list and generate randomly hybrid binary trees using Fibonacci numbers.
Capabilities of Ultrametric Automata with One, Two, and Three States
2016
Ultrametric automata use p-adic numbers to describe the random branching of the process of computation. Previous research has shown that ultrametric automata can have a significant decrease in computing complexity. In this paper we consider the languages that can be recognized by one-way ultrametric automata with one, two, and three states. We also show an example of a promise problem that can be solved by ultrametric integral automaton with three states.
Coding Binary Trees by Words over an Alphabet with Four Letters
1992
Abstract We propose a new encoding scheme to represent binary trees with n leaves by words of length n over an alphabet with four letters. We give a characterization of these codewords.
Root-restricted Kleenean rotations
2010
We generalize the Kleene theorem to the case where nonassociative products are used. For this purpose, we apply rotations restricted to the root of binary trees.
Generation of Valid Labeled Binary Trees
2003
International audience; Generating binary trees is a well-known problem. In this paper, we add some constraints to leaves of these trees. Such trees are used in the morphing of polygons, where a polygon P is represented by a binary tree T and each angle of P is a weight on a leaf of T. In the following, we give two algorithms to generate all binary trees, without repetitions, having the same weight distribution to their leaves and representing all parallel polygons to P.
Computational Aspects in Spaces of Bivariate Polynomial of w-Degree n
2005
Multivariate ideal interpolation schemes are deeply connected with H-bases. Both the definition of a H-basis and of an ideal interpolation space depend of the notion of degree used in the grading decomposition of the polynomial spaces. We studied, in the case of bivariate polynomials, a generalized degree, introduced by T. Sauer and named w-degree. This article give some theoretical results that allow us to construct algorithms for calculus of the dimension of the homogeneous spaces of bivariate polynomials of w – degree n. We implemented these algorithms in C++ language. The analysis of the results obtained, leads us to another theoretical conjecture which we proved in the end.