Search results for "FUNCTIONAL"

showing 10 items of 4822 documents

Unconditionally convergent multipliers and Bessel sequences

2016

Abstract We prove that every unconditionally summable sequence in a Hilbert space can be factorized as the product of a square summable scalar sequence and a Bessel sequence. Some consequences on the representation of unconditionally convergent multipliers are obtained, thus providing positive answers to a conjecture by Balazs and Stoeva in some particular cases.

Discrete mathematicsConjectureApplied Mathematics010102 general mathematicsScalar (mathematics)Mathematics::Classical Analysis and ODEsHilbert space01 natural sciencesFunctional Analysis (math.FA)Mathematics - Functional AnalysisMultiplier (Fourier analysis)030507 speech-language pathology & audiology03 medical and health sciencessymbols.namesakeBessel polynomialsFOS: MathematicssymbolsUnconditional convergence0101 mathematics0305 other medical scienceAnalysisBessel functionMathematicsJournal of Mathematical Analysis and Applications
researchProduct

On the Power of Tree-Walking Automata

2000

Tree-walking automata (TWAs) recently received new attention in the fields of formal languages and databases. Towards a better understanding of their expressiveness, we characterize them in terms of transitive closure logic formulas in normal form. It is conjectured by Engelfriet and Hoogeboom that TWAs cannot define all regular tree languages, or equivalently, all of monadic second-order logic. We prove this conjecture for a restricted, but powerful, class of TWAs. In particular, we show that 1-bounded TWAs, that is TWAs that are only allowed to traverse every edge of the input tree at most once in every direction, cannot define all regular languages. We then extend this result to a class …

Discrete mathematicsConjectureRegular languageComputer scienceDeterministic automatonFormal languageTransitive closureTree (set theory)Query languageMonad (functional programming)Path expressionFirst-order logicAutomaton
researchProduct

Factorization of homomorphisms through H∞(D)

2003

AbstractWeakly compact homomorphisms between (URM) algebras with connected maximal ideal space are shown to factor through H∞(D) by means of composition operators and to be strongly nuclear. The spectrum of such homomorphisms is also described. Strongly nuclear composition operators between algebras of bounded analytic functions are characterized. The path connected components of the space of endomorphisms on H∞(D) in the uniform operator topology are determined.

Discrete mathematicsConnected spacePure mathematicsEndomorphismCompact spaceComposition operatorBounded functionApplied MathematicsSpectrum (functional analysis)Maximal idealOperator theoryAnalysisMathematicsJournal of Mathematical Analysis and Applications
researchProduct

Some Questions of Heinrich on Ultrapowers of Locally Convex Spaces

1993

In this note we treat some open problems of Heinrich on ultrapowers of locally convex spaces. In section 1 we investigate the localization of bounded sets in the full ultrapower of a locally convex space, in particular the coincidence of the full and the bounded ultrapower, mainly concentrating in the case of (DF)-spaces. In section 2 we provide a partial answer to a question of Heinrich on commutativity of strict inductive limits and ultrapowers. In section 3 we analyze the relation between some natural candidates for the notion of superreflexivity in the setting of Frechet spaces. We give an example of a Frechet-Schwartz space which is not the projective limit of a sequence of superreflex…

Discrete mathematicsConvex analysisMathematics::Functional AnalysisPure mathematicsSequenceGeneral MathematicsBanach spaceConvex setUltraproductSpace (mathematics)Mathematics::LogicBounded functionLocally convex topological vector spaceMathematicsMathematische Nachrichten
researchProduct

Toward computability of trace distance discord

2014

It is known that a reliable geometric quantifier of discord-like correlations can be built by employing the so-called trace distance. This is used to measure how far the state under investigation is from the closest "classical-quantum" one. To date, the explicit calculation of this indicator for two qubits was accomplished only for states such that the reduced density matrix of the measured party is maximally mixed, a class that includes Bell-diagonal states. Here, we first reduce the required optimization for a general two-qubit state to the minimization of an explicit two-variable function. Using this framework, we show next that the minimum can be analytically worked out in a number of r…

Discrete mathematicsDYNAMICSBell-diagonal statesquantum statesQuantum Physicse trace distance discordComputabilityPhysicsGeneral Physics and AstronomyFOS: Physical sciencesClass (philosophy)Function (mathematics)State (functional analysis)Expression (computer science)Measure (mathematics)X-STATESX-STATES; QUANTUM; ENTANGLEMENT; DYNAMICSQubitquantum information quantum correlationsTrace distanceQuantum Physics (quant-ph)QUANTUMENTANGLEMENTtrace distanceMathematics
researchProduct

Functional calculi for convolution operators on a discrete, periodic, solvable group

2009

Suppose T is a bounded self-adjoint operator on the Hilbert space L2(X,μ) and let T=∫SpL2TλdE(λ) be its spectral resolution. Let F be a Borel bounded function on [−a,a], SpL2T⊂[−a,a]. We say that F is a spectral Lp-multiplier for T, if F(T)=∫SpL2TF(λ)dE(λ) is a bounded operator on Lp(X,μ). The paper deals with l1-multipliers, where X=G is a discrete (countable) solvable group with ∀x∈G, x4=1, μ is the counting measure and TΦ:l2(G)∋ξ↦ξ∗Φ∈l2(G), where Φ=Φ∗ is a l1(G) function, suppΦ generates G. The main result of the paper states that there exists a Ψ on G such that all l1-multipliers for TΨ are real analytic at every interior point of Spl2(G)TΨ. We also exhibit self-adjoint Φ′s in l1(G) suc…

Discrete mathematicsDiscrete groupDiscrete groupHilbert spacel1-multipliersFunction (mathematics)ConvolutionBounded operatorFunctional calculiCombinatoricssymbols.namesakeCounting measureSolvable groupBounded functionsymbolsConvolution operatorAnalysisMathematicsJournal of Functional Analysis
researchProduct

Generalized Lebesgue points for Sobolev functions

2017

In this article, we show that a function $f\in M^{s,p}(X),$ $0<s\leq 1,$ $0<p<1,$ where $X$ is a doubling metric measure space, has generalized Lebesgue points outside a set of $\mathcal{H}^h$-Hausdorff measure zero for a suitable gauge function $h.$

Discrete mathematicsDominated convergence theoremmedian010102 general mathematicsLebesgue's number lemmaRiemann integralSobolev spaceLebesgue integration01 natural sciencesLebesgue–Stieltjes integrationFunctional Analysis (math.FA)Mathematics - Functional Analysis010101 applied mathematicssymbols.namesakemetric measure spaceDifferentiation of integralsSquare-integrable function46E35 28A78FOS: MathematicssymbolsLocally integrable function0101 mathematicsgeneralized Lebesgue pointMathematicsCzechoslovak Mathematical Journal
researchProduct

Absolutely Convergent Extensions of Nonclosable Positive Linear Functionals

2010

The existence of extensions of a positive linear functional ω defined on a dense *-subalgebra \({\mathfrak{A}_0}\) of a topological *-algebra \({\mathfrak{A}}\), satisfying certain regularity conditions, is examined. The main interest is focused on the case where ω is nonclosable and sufficient conditions for the existence of an absolutely convergent extension of ω are given.

Discrete mathematicsExtensions Positive linear functionalsSettore MAT/05 - Analisi MatematicaPositive linear functionalGeneral MathematicsSubalgebraExtension (predicate logic)Algebra over a fieldMathematics::Representation TheoryAbsolute convergenceMathematicsMediterranean Journal of Mathematics
researchProduct

Lipschitz conditions,b-arcwise connectedness and conformal mappings

1982

Discrete mathematicsExtremal lengthPartial differential equationLipschitz domainFunctional analysisSocial connectednessGeneral MathematicsConformal mapLipschitz continuityAnalysisMathematicsJournal d'Analyse Mathématique
researchProduct

Nondeterministic operations on finite relational structures

1998

Abstract This article builds on a tutorial introduction to universal algebra for language theory (Courcelle, Theoret. Comput. Sci. 163 (1996) 1–54) and extends it in two directions. First, nondeterministic operations are considered, i.e., operations which give a set of results instead of a single one. Most of their properties concerning recognizability and equational definability carry over from the ordinary case with minor modifications. Second, inductive sets of evaluations are studied in greater detail. It seems that they are handled most naturally in the framework presented here. We consider the analogues of top-down and bottom-up tree transducers. Again, most of their closure propertie…

Discrete mathematicsFinite-state machineGeneral Computer ScienceComputer scienceLogicFormal languages (recognizable and context-free sets transducers)Unbounded nondeterminismMonad (functional programming)Symbolic computationHypergraphsFirst-order logicLogical theoryDecidabilityTheoretical Computer ScienceNondeterministic algorithmAlgebraDeterministic automatonFormal languageUniversal algebraEquivalence relationTree transducersRewritingComputer Science(all)Theoretical Computer Science
researchProduct