Search results for " Opera"

showing 10 items of 3606 documents

The support localization property of the strongly embedded subspaces of banach function spaces

2015

[EN] Motivated by the well known Kadec-Pelczynski disjointifcation theorem, we undertake an analysis of the supports of non-zero functions in strongly embedded subspaces of Banach functions spaces. The main aim is to isolate those properties that bring additional information on strongly embedded subspaces. This is the case of the support localization property, which is a necessary condition fulflled by all strongly embedded subspaces. Several examples that involve Rademacher functions, the Volterra operator, Lorentz spaces or Orlicz spaces are provided.

Discrete mathematicsMathematics::Functional AnalysisPure mathematicsVolterra operatorFunctional analysisDisjoint sequenceStrongly embedded subspaceFunction spaceGeneral MathematicsLorentz transformationVector measure integrationBanach function spaceLinear subspacesymbols.namesakesymbolsInterpolation spaceBirnbaum–Orlicz spaceLp spaceMATEMATICA APLICADAMathematics
researchProduct

Existence theorems for m-accretive operators in Banach spaces

2005

Abstract In 1985, the second author proved a surjective result for m -accretive and ϕ -expansive mappings for uniformly smooth Banach spaces. However, in this case, we have been able to remove the uniform smoothness of the Banach space, without any additional assumption.

Discrete mathematicsMathematics::Functional AnalysisZeros for m-accretive operatorsApproximation propertySurjectivityApplied MathematicsEberlein–Šmulian theoremAccretivityUniformly convex spaceBanach manifoldFinite-rank operatorInterpolation spaceOpen mapping theorem (functional analysis)Lp spaceAnalysisMathematicsJournal of Mathematical Analysis and Applications
researchProduct

Compactness of time-frequency localization operators on L2(Rd)

2006

Abstract In this paper, we consider localization operators on L 2 ( R d ) defined by symbols in a subclass of the modulation space M ∞ ( R 2 d ) . We show that these operators are compact and that this subclass is “optimal” for compactness.

Discrete mathematicsModulation spaceCompact operatorApproximation propertyShort-time Fourier transformModulation spaceLocalization operatorOperator theoryCompact operatorCompact operator on Hilbert spaceSubclassCompact spaceTheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGESShort-time Fourier transformAnalysisComputer Science::Formal Languages and Automata TheoryMathematicsJournal of Functional Analysis
researchProduct

Domination spaces and factorization of linear and multilinear summing operators

2015

[EN] It is well known that not every summability property for multilinear operators leads to a factorization theorem. In this paper we undertake a detailed study of factorization schemes for summing linear and nonlinear operators. Our aim is to integrate under the same theory a wide family of classes of mappings for which a Pietsch type factorization theorem holds. Our construction includes the cases of absolutely p-summing linear operators, (p, sigma)-absolutely continuous linear operators, factorable strongly p-summing multilinear operators, (p(1), ... , p(n))-dominated multilinear operators and dominated (p(1), ... , p(n); sigma)-continuous multilinear operators.

Discrete mathematicsMultilinear mapPietsch's domination theoremMultilinear summing operators010102 general mathematicsMathematics::Classical Analysis and ODEs010103 numerical & computational mathematicsPietsch's domination theorem factorization of operators multilinear summing operators.Factorization of operators01 natural sciencesFunctional Analysis (math.FA)Mathematics - Functional AnalysisMathematics (miscellaneous)FactorizationFOS: Mathematics0101 mathematicsMATEMATICA APLICADAMathematics
researchProduct

A Logical Characterisation of Linear Time on Nondeterministic Turing Machines

1999

The paper gives a logical characterisation of the class NTIME(n) of problems that can be solved on a nondeterministic Turing machine in linear time. It is shown that a set L of strings is in this class if and only if there is a formula of the form ∃f1..∃fk∃R1..∃Rm∀xφv; that is true exactly for all strings in L. In this formula the fi are unary function symbols, the Ri are unary relation symbols and φv; is a quantifierfree formula. Furthermore, the quantification of functions is restricted to non-crossing, decreasing functions and in φv; no equations in which different functions occur are allowed. There are a number of variations of this statement, e.g., it holds also for k = 3. From these r…

Discrete mathematicsNTIMEComputational complexity theoryUnary operationCombinatoricsNondeterministic algorithmTuring machinesymbols.namesakeNon-deterministic Turing machinesymbolsUnary functionTime complexityComputer Science::Formal Languages and Automata TheoryMathematics
researchProduct

TIGHT BOUNDS FOR THE SPACE COMPLEXITY OF NONREGULAR LANGUAGE RECOGNITION BY REAL-TIME MACHINES

2013

We examine the minimum amount of memory for real-time, as opposed to one-way, computation accepting nonregular languages. We consider deterministic, nondeterministic and alternating machines working within strong, middle and weak space, and processing general or unary inputs. In most cases, we are able to show that the lower bounds for one-way machines remain tight in the real-time case. Memory lower bounds for nonregular acceptance on other devices are also addressed. It is shown that increasing the number of stacks of real-time pushdown automata can result in exponential improvement in the total amount of space usage for nonregular language recognition.

Discrete mathematicsNondeterministic algorithmTheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGESUnary operationComputationTheory of computationComputer Science (miscellaneous)Pushdown automatonSpace (mathematics)MathematicsLanguage recognitionExponential functionInternational Journal of Foundations of Computer Science
researchProduct

The fixed point property for mappings admitting a center

2007

Abstract We introduce a class of nonlinear continuous mappings in Banach spaces which allow us to characterize the Banach spaces without noncompact flat parts in their spheres as those that have the fixed point property for this type of mapping. Later on, we give an application to the existence of zeroes for certain kinds of accretive operators.

Discrete mathematicsNonlinear systemClass (set theory)Applied MathematicsBanach spaceCenter (group theory)Fixed pointType (model theory)Fixed-point propertyAnalysisNonlinear operatorsMathematicsNonlinear Analysis: Theory, Methods & Applications
researchProduct

Some Classes of Operators on Partial Inner Product Spaces

2012

Many families of function spaces, such as $L^{p}$ spaces, Besov spaces, amalgam spaces or modulation spaces, exhibit the common feature of being indexed by one parameter (or more) which measures the behavior (regularity, decay properties) of particular functions. All these families of spaces are, or contain, scales or lattices of Banach spaces and constitute special cases of the so-called \emph{partial inner product spaces (\pip s)} that play a central role in analysis, in mathematical physics and in signal processing (e.g. wavelet or Gabor analysis). The basic idea for this structure is that such families should be taken as a whole and operators, bases, frames on them should be defined glo…

Discrete mathematicsNuclear operatorTopological tensor productHilbert spaceoperatorsOperator theoryCompact operator on Hilbert spacesymbols.namesakeSettore MAT/05 - Analisi MatematicasymbolsInterpolation spacePip-spaceBirnbaum–Orlicz spaceLp spaceMathematics
researchProduct

The Rotation χ-Lattice of Ternary Trees

2001

This paper generalizes to k-ary trees the well-known rotation transformation on binary trees. For brevity, only the ternary case is developped. The rotation on ternary trees is characterized using some codings of trees. Although the corresponding poset is not a lattice, we show that it is a χ-lattice in the sense of Leutola–Nieminen. Efficient algorithms are exhibited to compute meets and joins choosen in a particular way.

Discrete mathematicsNumerical AnalysisBinary treeTernary treeWeight-balanced treeComputer Science ApplicationsTheoretical Computer ScienceCombinatoricsComputational MathematicsComputational Theory and MathematicsTernary search treeTernary operationTamari latticePartially ordered setRotation (mathematics)SoftwareMathematicsComputing
researchProduct

Property (gab) through localized SVEP

2015

In this article we study the property (gab) for a bounded linear operator T 2 L(X) on a Banach space X which is a stronger variant of Browder's theorem. We shall give several characterizations of property (gab). These characterizations are obtained by using typical tools from local spectral theory. We also show that property (gab) holds for large classes of operators and prove the stability of property (gab) under some commuting perturbations. 2010 Mathematics Subject Classication. Primary 47A10, 47A11; Secondary 47A53, 47A55.

Discrete mathematicsNumerical AnalysisPure mathematicsControl and OptimizationSpectral theoryProperty (philosophy)Property (gab) local spectral subspaces Browder type theorems.Applied Mathematics010102 general mathematicsBanach space010103 numerical & computational mathematics01 natural sciencesStability (probability)Bounded operatorSettore MAT/05 - Analisi Matematica0101 mathematicsAnalysisMathematics
researchProduct