Search results for "PROPERTY"

showing 10 items of 955 documents

Extensions and Imbeddings

1998

AbstractWe establish a connection between the Sobolev imbedding theorem and the extendability of Sobolev functions. As applications we give geometric criteria for extendability and give a result on the dependence of the extension property on the exponentp.

Discrete mathematicsSobolev spacePure mathematicsMathematics::Functional AnalysisProperty (philosophy)Mathematics::Analysis of PDEsExtension (predicate logic)AnalysisConnection (mathematics)Sobolev inequalityMathematicsJournal of Functional Analysis
researchProduct

Classes of operators satisfying a-Weyl's theorem

2005

In this article Weyl's theorem and a-Weyl's theorem on Banach spaces are related to an important property which has a leading role in local spectral theory: the single-valued extension theory. We show that if T has SVEP then Weyl's theorem and a-Weyl's theorem for T are equivalent, and analogously, if T has SVEP then Weyl's theorem and a-Weyl's theorem for T are equivalent. From this result we deduce that a-Weyl's theorem holds for classes of operators for which the quasi-nilpotent part H0(I T ) is equal to ker (I T ) p for some p2N and every 2C, and for algebraically paranormal operators on Hilbert spaces. We also improve recent results established by Curto and Han, Han and Lee, and Oudghi…

Discrete mathematicsSpectral theoryGeneral MathematicsHilbert spaceBanach spacePropertySpectral theoremFredholm theorysymbols.namesakeKernel (algebra)Bounded functionsymbolsOperatorBounded inverse theoremtheorem holdsMathematics
researchProduct

Some dissenting views on the transitivity of individual preference

1990

(1) The transitivity property is not a necessary condition for the rationality of all individual preference relations. (2) A weakened definition of the transitivity is not necessarily relevant. (3) The non-transitivity of fuzzy preference relations is not inconsistent with a fuzzy total preorder structure on the set of alternatives.

Discrete mathematicsStructure (mathematical logic)Transitive relationProperty (philosophy)PreorderGeneral Decision SciencesRationalityManagement Science and Operations ResearchEuclidean relationMathematical economicsFuzzy logicPreferenceMathematicsAnnals of Operations Research
researchProduct

Impact of common property (E.A.) on fixed point theorems in fuzzy metric spaces

2011

We observe that the notion of common property (E.A.) relaxes the required containment of range of one mapping into the range of other which is utilized to construct the sequence of joint iterates. As a consequence, a multitude of recent fixed point theorems of the existing literature are sharpened and enriched.

Discrete mathematicsT57-57.97QA299.6-433Containment (computer programming)Pure mathematicsSequenceApplied mathematics. Quantitative methodsApplied MathematicsFixed-point theoremConstruct (python library)Fuzzy metric space property (E.A.) common property (E.A.) common fixed point generalized fuzzy contractionRange (mathematics)Differential geometryIterated functionSettore MAT/05 - Analisi MatematicaCommon propertyGeometry and TopologyAnalysisMathematics
researchProduct

Relations between structure and estimators in networks of dynamical systems

2011

The article main focus is on the identification of a graphical model from time series data associated with different interconnected entities. The time series are modeled as realizations of stochastic processes (representing nodes of a graph) linked together via transfer functions (representing the edges of the graph). Both the cases of non-causal and causal links are considered. By using only the measurements of the node outputs and without assuming any prior knowledge of the network topology, a method is provided to estimate the graph connectivity. In particular, it is proven that the method determines links to be present only between a node and its “kins”, where kins of a node consist of …

Discrete mathematicsTheoretical computer scienceDirected graphStrength of a graphSettore ING-INF/04 - AutomaticaLeast squares approximation Network topology Random variables Stochastic processes TopologyGraph (abstract data type)Graph propertyNull graphRandom geometric graphComplement graphConnectivityMathematicsIEEE Conference on Decision and Control and European Control Conference
researchProduct

On Finite Satisfiability of the Guarded Fragment with Equivalence or Transitive Guards

2007

The guarded fragment of first-order logic, GF, enjoys the finite model property, so the satisfiability and the finite satisfiability problems coincide. We are concerned with two extensions of the two-variable guarded fragment that do not possess the finite model property, namely, GF2 with equivalence and GF2 with transitive guards. We prove that in both cases every finitely satisfiable formula has a model of at most double exponential size w.r.t. its length. To obtain the result we invent a strategy of building finite models that are formed from a number of multidimensional grids placed over a cylindrical surface. The construction yields a 2NEXPTIME-upper bound on the complexity of the fini…

Discrete mathematicsTransitive relationFinite model propertyDouble exponential functionEquivalence (formal languages)AlgorithmSatisfiabilityFinite satisfiabilityMathematics
researchProduct

Common fixed point theorems for mappings satisfying common property (E.A.) in symmetric spaces

2011

In this paper, common fixed point theorems for mappings satisfying a generalized contractive condition are obtained in symmetric spaces by using the notion of common property (E.A.). In the process, a host of previously known results are improved and generalized. We also derive results on common fixed point in probabilistic symmetric spaces.

Discrete mathematicsTriple systemSettore MAT/05 - Analisi MatematicaGeneral MathematicsSymmetric spaceProbabilistic logicCommon fixed pointSymmetric space common property (E.A.) common fixed point.Common propertyPoint (geometry)Mathematics
researchProduct

Weyl type theorems for bounded linear operators on Banach spaces

2011

In 1909 H. Weyl [59] studied the spectra of all compact linear perturbations of a self-adjoint operator defined on a Hilbert space and found that their intersection consisted precisely of those points of the spectrum where are not isolated eigenvalues of nite multiplicity. Later, the property established by Weyl for self-adjoint operators has been observed for several other classes of operators, for instance hyponormal operators on Hilbert spaces, Toeplitz operators,convolution operators on group algebras, and many other classes of operators ned on Banach spaces . In the literature, a bounded linear operator defined on a Banach space which satisfies this property is said to satisfy Weyl's t…

Discrete mathematicsUnbounded operatorWeyl type theoremsSettore MAT/05 - Analisi MatematicaApproximation propertyFinite-rank operatorBanach manifoldOperator theoryInfinite-dimensional holomorphyBounded inverse theoremMathematicsBounded operatorAdvanced Courses of Mathematical Analysis IV
researchProduct

Fixed points of weakly compatible mappings satisfying generalized $\varphi$-weak contractions

2014

In this paper, utilizing the notion of the common limit range property, we prove some new integral type common fixed point theorems for weakly compatible mappings satisfying a \(\varphi \)-weak contractive condition in metric spaces. Moreover, we extend our results to four finite families of self mappings, and furnish an illustrative example and an application to support our main theorem. Our results improve, extend, and generalize well-known results on the topic in the literature.

Discrete mathematicsWeakly compatibleProperty (philosophy)(CLR_{ST}) property(CLR_S) propertyGeneral Mathematicsmetric spaceFixed pointType (model theory)weakly compatible mappingRange (mathematics)Metric spacefixed pointSettore MAT/05 - Analisi MatematicaCommon fixed pointLimit (mathematics)Mathematics
researchProduct

Timed Sets, Functional Complexity, and Computability

2012

AbstractThe construction of various categories of “timed sets” is described in which the timing of maps is considered modulo a “complexity order”. The properties of these categories are developed: under appropriate conditions they form discrete, distributive restriction categories with an iteration. They provide a categorical basis for modeling functional complexity classes and allow the development of computability within these settings. Indeed, by considering “program objects” and the functions they compute, one can obtain models of computability – i.e. Turing categories – in which the total maps belong to specific complexity classes. Two examples of this are introduced in some detail whi…

Discrete mathematicscomplexity measurescomputabilityTheoretical computer scienceGeneral Computer ScienceBasis (linear algebra)Restriction categoriesComputabilityModuloTuring categoriesfunctional complexityTheoretical Computer ScienceDistributive propertyMathematics::Category TheoryComplexity classCategorical variableTuringcomputerPMathematicscomputer.programming_languageComputer Science(all)Electronic Notes in Theoretical Computer Science
researchProduct