Search results for " Opera"

showing 10 items of 3606 documents

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

Admissible perturbations of alpha-psi-pseudocontractive operators: convergence theorems

2016

In the last decades, the study of convergence of fixed point iterative methods has received an increasing attention, due to their performance as tools for solving numerical problems. As a consequence of this fact, one can access to a wide literature on iterative schemes involving different types of operators; see [2, 4, 5]. We point out that fixed point iterative approximation methods have been largely applied in dealing with stability and convergence problems; see [1, 6]. In particular, we refer to various control and optimization questions arising in pure and applied sciences involving dynamical systems, where the problem in study can be easily arranged as a fixed point problem. Then, we …

Discrete mathematicsDynamical systems theoryIterative methodGeneral Mathematics010102 general mathematicsGeneral EngineeringHilbert spacePerturbation (astronomy)Krasnoselskij type fixed point iterative schemeFixed point01 natural sciences010101 applied mathematicssymbols.namesakeSettore MAT/08 - Analisi Numericaalpha-psi-pseudocontractive operatorFixed point problemSettore MAT/05 - Analisi Matematicaalpha-admissible mappingsymbolsApplied mathematicsIterative approximation0101 mathematicsApplied scienceMathematics
researchProduct

On the operators which are invertible modulo an operator ideal

2001

Atkinson [3] studied the operators which are left invertible $i(X, Y) or right invertible $T{X, Y) modulo /C, with K. the compact operators. He proved that an operator T € C(X, Y) belongs to <£/ or $ r if and only if the kernel and the range of T are complemented and additionally, the kernel is finite dimensional or the range is finite codimensional, respectively. Yood [19] obtained some perturbation results for these classes and Lebow and Schechter [12] proved that the inessential operators form the perturbation class for $,(A") and $r{X). Yang [18] extended some results of ^3, 19] to operators invertible modulo W, with W the weakly compact operators. His aim was to study a generalised Fre…

Discrete mathematicsElliptic operatorWeak operator topologyGeneral MathematicsFinite-rank operatorOperator theoryCompact operatorOperator normStrictly singular operatorMathematicsQuasinormal operatorBulletin of the Australian Mathematical Society
researchProduct

Sobolev embeddings, extensions and measure density condition

2008

AbstractThere are two main results in the paper. In the first one, Theorem 1, we prove that if the Sobolev embedding theorem holds in Ω, in any of all the possible cases, then Ω satisfies the measure density condition. The second main result, Theorem 5, provides several characterizations of the Wm,p-extension domains for 1<p<∞. As a corollary we prove that the property of being a W1,p-extension domain, 1<p⩽∞, is invariant under bi-Lipschitz mappings, Theorem 8.

Discrete mathematicsExtension operator010102 general mathematicsEberlein–Šmulian theoremMeasure density condition01 natural sciencesSobolev embeddingSobolev inequality010101 applied mathematicsSobolev spaceCorollarySobolev spaces0101 mathematicsInvariant (mathematics)AnalysisEdge-of-the-wedge theoremSobolev spaces for planar domainsMathematicsTrace operatorJournal of Functional Analysis
researchProduct

Polyhedral results for a vehicle routing problem

1991

Abstract The Vehicle Routing Problem is a well known, and hard, combinatorial problem, whose polyhedral structure has deserved little attention. In this paper we consider the particular case in which all the demands are equal (since in the general case the associated polytope may be empty). From a known formulation of the problem we obtain the dimension of the corresponding polytope and we study the facetial properties of every inequality in it.

Discrete mathematicsFacet (geometry)Information Systems and ManagementGeneral Computer ScienceDimension (graph theory)Structure (category theory)PolytopeManagement Science and Operations ResearchIndustrial and Manufacturing EngineeringCombinatoricsModeling and SimulationVehicle routing problemRouting (electronic design automation)Integer programmingVertex enumeration problemMathematicsEuropean Journal of Operational Research
researchProduct

On extremal cases of Hopcroft’s algorithm

2010

AbstractIn this paper we consider the problem of minimization of deterministic finite automata (DFA) with reference to Hopcroft’s algorithm. Hopcroft’s algorithm has several degrees of freedom, so there can exist different executions that can lead to different sequences of refinements of the set of the states up to the final partition. We find an infinite family of binary automata for which such a process is unique, whatever strategy is chosen. Some recent papers (cf. Berstel and Carton (2004) [3], Castiglione et al. (2008) [6] and Berstel et al. (2009) [1]) have been devoted to find families of automata for which Hopcroft’s algorithm has its worst execution time. They are unary automata as…

Discrete mathematicsFinite-state machineGeneral Computer ScienceUnary operationWord treesStandard treesAutomatonTheoretical Computer ScienceCombinatoricsDeterministic finite automatonDFA minimizationDeterministic automatonHopcroft’s minimization algorithmTree automatonDeterministic finite state automataTime complexityAlgorithmComputer Science::Formal Languages and Automata TheoryMathematicsComputer Science(all)Theoretical Computer Science
researchProduct

Affine Automata Verifiers

2021

We initiate the study of the verification power of Affine finite automata (AfA) as a part of Arthur-Merlin (AM) proof systems. We show that every unary language is verified by a real-valued AfA verifier. Then, we focus on the verifiers restricted to have only integer-valued or rational-valued transitions. We observe that rational-valued verifiers can be simulated by integer-valued verifiers, and their protocols can be simulated in nondeterministic polynomial time. We show that this upper bound is tight by presenting an AfA verifier for NP-complete problem SUBSETSUM. We also show that AfAs can verify certain non-affine and non-stochastic unary languages.

Discrete mathematicsFinite-state machineUnary operationComputer scienceUnary languageSubset sum problemAffine transformationUpper and lower boundsNPAutomaton
researchProduct

Single-valued extension property at the points of the approximate point spectrum

2003

Abstract A localized version of the single-valued extension property is studied at the points which are not limit points of the approximate point spectrum, as well as of the surjectivity spectrum. In particular, we shall characterize the single-valued extension property at a point λ o ∈ C in the case that λoI−T is of Kato type. From this characterizations we shall deduce several results on cluster points of some distinguished parts of the spectrum.

Discrete mathematicsFredholm theoryFredholm operatorApplied MathematicsSpectrum (functional analysis)Banach spaceExtension (predicate logic)Type (model theory)Fredholm theorySingle valued extension propertysymbols.namesakeLimit pointsymbolsPoint (geometry)AnalysisMathematicsJournal of Mathematical Analysis and Applications
researchProduct

Operators Which Do Not Have the Single Valued Extension Property

2000

Abstract In this paper we shall consider the relationships between a local version of the single valued extension property of a bounded operator T  ∈  L ( X ) on a Banach space X and some quantities associated with T which play an important role in Fredholm theory. In particular, we shall consider some conditions for which T does not have the single valued extension property at a point λ o  ∈  C .

Discrete mathematicsFredholm theoryProperty (philosophy)Applied MathematicsFredholm operatorBanach spaceExtension (predicate logic)Fredholm theoryBounded operatorLinear mapsymbols.namesakesingle valued extension propertysymbolsAnalysisMathematicsResolventJournal of Mathematical Analysis and Applications
researchProduct

Fuzzy functions: a fuzzy extension of the category SET and some related categories

2000

&lt;p&gt;In research Works where fuzzy sets are used, mostly certain usual functions are taken as morphisms. On the other hand, the aim of this paper is to fuzzify the concept of a function itself. Namely, a certain class of L-relations F : X x Y -&amp;gt; L is distinguished which could be considered as fuzzy functions from an L-valued set (X,Ex) to an L-valued set (Y,Ey). We study basic properties of these functions, consider some properties of the corresponding category of L-valued sets and fuzzy functions as well as briefly describe some categories related to algebra and topology with fuzzy functions in the role of morphisms.&lt;/p&gt;

Discrete mathematicsFuzzy classificationL-relationFuzzy topologylcsh:MathematicsFuzzy setlcsh:QA299.6-433Fuzzy subalgebralcsh:AnalysisFuzzy groupType-2 fuzzy sets and systemslcsh:QA1-939DefuzzificationAlgebraFuzzy mathematicsL-fuzzy functionFuzzy numberFuzzy set operationsGeometry and TopologyFuzzy categoryMathematics
researchProduct