Search results for "Names"
showing 10 items of 6843 documents
Geometric properties of involutive distributions on graded manifolds
1997
AbstractA proof of the relative version of Frobenius theorem for a graded submersion, which includes a very short proof of the standard graded Frobenius theorem is given. Involutive distributions are then used to characterize split graded manifolds over an orientable base, and split graded manifolds whose Batchelor bundle has a trivial direct summand. Applications to graded Lie groups are given.
Spectral invariance, ellipticity, and the Fredholm property for pseudodifferential operators on weighted Sobolev spaces
1992
The pseudodifferential operators with symbols in the Grushin classes \~S inf0 supρ,δ , 0 ≤ δ < ρ ≤ 1, of slowly varying symbols are shown to form spectrally invariant unital Frecher-*-algebras (Ψ*-algebras) in L(L 2(R n )) and in L(H γ st ) for weighted Sobolev spaces H infγ sup defined via a weight d function γ. In all cases, the Fredholm property of an operator can be characterized by uniform ellipticity of the symbol. This gives a converse to theorems of Grushin and Kumano-Ta-Taniguchi. Both, the spectrum and the Fredholm spectrum of an operator turn out to be independent of the choices of s, t and γ. The characterization of the Fredholm property by uniform ellipticity leads to an index …
On Composition Ideals of Multilinear Mappings and Homogeneous Polynomials
2007
Given an operator ideal I, we study the multi-ideal I ο L and the polynomial ideal I ο P). The connection with the linearizations of these mappings on projective symmetric tensor products is investigated in detail. Applications to the ideals of strictly singular and absolutely summing linear operators are obtained.
A general concept of fuzzy connectives, negations and implications based on t-norms and t-conorms
1983
All known connectives 'and'/'or' for fuzzy sets or some classes can be introduced as t-norms/t-conorms, where Ling's representation theorem is used as a basic tool, and which is illustrated by various known and new examples (Section 2). Given a strict negation function and one connective, the other can be constructed, so that the corresponding De Morgan law is valid. In case of given Archimedean connectives, there can be constructed negation functions (Section 3). Given a non-strict Archimedean connective, a negation function and the other connective can be constructed, so that in addition to the De Morgan laws, the excluded middle law and the law of non-contradiction are valid, i.e. the ne…
Operators in Rigged Hilbert spaces: some spectral properties
2014
A notion of resolvent set for an operator acting in a rigged Hilbert space $\D \subset \H\subset \D^\times$ is proposed. This set depends on a family of intermediate locally convex spaces living between $\D$ and $\D^\times$, called interspaces. Some properties of the resolvent set and of the corresponding multivalued resolvent function are derived and some examples are discussed.
Modulus of continuity with respect to semigroups of analytic functions and applications
2016
Abstract Given a complex Banach space E , a semigroup of analytic functions ( φ t ) and an analytic function F : D → E we introduce the modulus w φ ( F , t ) = sup | z | 1 ‖ F ( φ t ( z ) ) − F ( z ) ‖ . We show that if 0 α ≤ 1 and F belongs to the vector-valued disc algebra A ( D , E ) , the Lipschitz condition M ∞ ( F ′ , r ) = O ( ( 1 − r ) 1 − α ) as r → 1 is equivalent to w φ ( F , t ) = O ( t α ) as t → 0 for any semigroup of analytic functions ( φ t ) , with φ t ( 0 ) = 0 and infinitesimal generator G , satisfying that φ t ′ and G belong to H ∞ ( D ) with sup 0 ≤ t ≤ 1 ‖ φ ′ ‖ ∞ ∞ , and in particular is equivalent to the condition ‖ F − F r ‖ A ( D , E ) = O ( ( 1 − r ) α ) as r …
Partial *-algebras of closable operators: A review
1996
This paper reviews the theory of partial *-algebras of closable operators in Hilbert space (partial O*-algebras), with some emphasis on partial GW*-algebras. First we discuss the general properties and the various types of partial *-algebras and partial O*-algebras. Then we summarize the representation theory of partial *-algebras, including a generalized Gel’fand-Naimark-Segal construction; the main tool here is the notion of positive sesquilinear form, that we study in some detail (extendability, normality, order structure, …). Finally we turn to automorphisms and derivations of partial O*-algebras, and their mutual relationship. The central theme here is to find conditions that guarante…
Context Trees, Variable Length Markov Chains and Dynamical Sources
2012
Infinite random sequences of letters can be viewed as stochastic chains or as strings produced by a source, in the sense of information theory. The relationship between Variable Length Markov Chains (VLMC) and probabilistic dynamical sources is studied. We establish a probabilistic frame for context trees and VLMC and we prove that any VLMC is a dynamical source for which we explicitly build the mapping. On two examples, the "comb" and the "bamboo blossom", we find a necessary and sufficient condition for the existence and the uniqueness of a stationary probability measure for the VLMC. These two examples are detailed in order to provide the associated Dirichlet series as well as the genera…
An example concerning the zero set of the Jacobian
2006
AbstractLet f∈W1,1(Ω,Rn) be a homeomorphism of finite distortion K. It is known that if K1/(n−1)∈L1(Ω), then the Jacobian Jf of f is positive almost everywhere in Ω. We will show that this integrability assumption on K is sharp in any Orlicz-scale: if α is increasing function (satisfying minor technical assumptions) such that limt→∞α(t)=∞, then there exists f such that K1/(n−1)/α(K)∈L1(Ω) and Jf vanishes in a set of positive measure.
An Exact Algorithm for the Quadratic Assignment Problem on a Tree
1989
The Tree QAP is a special case of the Quadratic Assignment Problem (QAP) where the nonzero flows form a tree. No condition is required for the distance matrix. This problem is NP-complete and is also a generalization of the Traveling Salesman Problem. In this paper, we present a branch-and-bound algorithm for the exact solution of the Tree QAP based on an integer programming formulation of the problem. The bounds are computed using a Lagrangian relaxation of this formulation. To solve the relaxed problem, we present a Dynamic Programming algorithm which is polynomially bounded. The obtained lower bound is very sharp and equals the optimum in many cases. This fact allows us to employ a redu…