Search results for " Property"

showing 10 items of 705 documents

Common fixed points for discontinuous mappings in fuzzy metric spaces

2008

In this paper we prove some common fixed point theorems for fuzzy contraction respect to a mapping, which satisfies a condition of weak compatibility. We deduce also fixed point results for fuzzy contractive mappings in the sense of Gregori and Sapena.

Discrete mathematicsFuzzy metric spaceGeneral MathematicsFixed pointFixed-point propertyFuzzy logicFuzzy metric spaceLeast fixed pointPoints of coincidenceCommon fixed pointSettore MAT/05 - Analisi MatematicaFixed-point iterationCommon fixed pointDiscontinuous mappingCoincidence pointMathematicsRendiconti del Circolo Matematico di Palermo
researchProduct

A common fixed point theorem for two weakly compatible pairs in G-metric spaces using the property E.A

2013

In view of the fact that the fixed point theory provides an efficient tool in many fields of pure and applied sciences, we use the notion of the property E.A to prove a common fixed point theorem for weakly compatible mappings. The presented results are applied to obtain the solution of an integral equation and the bounded solution of a functional equation arising in dynamic programming.

Discrete mathematicsG-metric spaceweak compatibilityproperty E.AApplied MathematicsFixed-point theoremcommon fixed pointFixed pointFixed-point propertyLeast fixed pointSettore MAT/05 - Analisi MatematicaFunctional equationGeometry and TopologyKakutani fixed-point theoremBrouwer fixed-point theoremCoincidence pointMathematicsFixed Point Theory and Applications
researchProduct

If P≠NP then some strongly noninvertible functions are invertible

2006

AbstractRabi, Rivest, and Sherman alter the standard notion of noninvertibility to a new notion they call strong noninvertibility, and show—via explicit cryptographic protocols for secret-key agreement (Rabi and Sherman attribute this protocol to Rivest and Sherman) and digital signatures (Rabi and Sherman)—that strongly noninvertible functions are very useful components in protocol design. Their definition of strong noninvertibility has a small twist (“respecting the argument given”) that is needed to ensure cryptographic usefulness. In this paper, we show that this small twist has a consequence: unless P=NP, some strongly noninvertible functions are invertible.

Discrete mathematicsGeneral Computer ScienceComputational complexity theorybusiness.industryP versus NP problemOne-way functionsCryptographyOne-way functionCryptographic protocolTheoretical Computer Sciencelaw.inventionComputational complexityInvertible matrixDigital signaturelawAssociativityCryptographyStrong noninvertibilitybusinessAssociative propertyMathematicsTheoretical Computer Science
researchProduct

Two-Variable First-Order Logic with Equivalence Closure

2012

We consider the satisfiability and finite satisfiability problems for extensions of the two-variable fragment of first-order logic in which an equivalence closure operator can be applied to a fixed number of binary predicates. We show that the satisfiability problem for two-variable, first-order logic with equivalence closure applied to two binary predicates is in 2-NExpTime, and we obtain a matching lower bound by showing that the satisfiability problem for two-variable first-order logic in the presence of two equivalence relations is 2-NExpTime-hard. The logics in question lack the finite model property; however, we show that the same complexity bounds hold for the corresponding finite sa…

Discrete mathematicsGeneral Computer ScienceLogical equivalenceFinite model propertyGeneral MathematicsDescriptive complexity theorySatisfiabilityDecidabilityFirst-order logicCombinatoricsTheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGESComputer Science::Logic in Computer ScienceMaximum satisfiability problemClosure operatorEquivalence relationBoolean satisfiability problemMathematics2012 27th Annual IEEE Symposium on Logic in Computer Science
researchProduct

A comparison of compatible, finite, and inductive graph properties

1993

Abstract In the theory of hyperedge-replacement grammars and languages, one encounters three types of graph properties that play an important role in proving decidability and structural results. The three types are called compatible, finite, and inductive graph properties. All three of them cover graph properties that are well-behaved with respect to certain operations on hypergraphs. In this paper, we show that the three notions are essentially equivalent. Consequently, three lines of investigation in the theory of hyperedge replacement - so far separated - merge into one.

Discrete mathematicsGeneral Computer ScienceVoltage graphDirected graphDecidabilityTheoretical Computer ScienceCombinatoricsVertex-transitive graphRule-based machine translationClique-widthGraph propertyNull graphMathematicsComputer Science(all)Theoretical Computer Science
researchProduct

Fixed point results for F-contractive mappings of Hardy-Rogers-type

2014

Recently, Wardowski introduced a new concept of contraction and proved a fixed point theorem which generalizes Banach contraction principle. Following this direction of research, in this paper, we will present some fixed point results of Hardy-Rogers-type for self-mappings on complete metric spaces or complete ordered metric spaces. Moreover, an example is given to illustrate the usability of the obtained results.

Discrete mathematicsGeneral MathematicsInjective metric spaceMetric spaces ordered metric spaces fixed points F-contractions of Hardy-Rogers-typeFixed-point theoremFixed pointFixed-point propertyConvex metric spaceUniform continuitySettore MAT/05 - Analisi MatematicaFréchet spaceContraction mappingMathematicsFilomat
researchProduct

Further generalization of fixed point theorems in Menger PM-spaces

2015

In this work, we establish some fixed point theorems by revisiting the notion of ψ-contractive mapping in Menger PM-spaces. One of our results (namely, Theorem 2.3) may be viewed as a possible answer to the problem of existence of a fixed point for generalized type contractive mappings in M-complete Menger PM-spaces under arbitrary t-norm. Some examples are furnished to demonstrate the validity of the obtained results.

Discrete mathematicsGeneralizationApplied MathematicsFixed-point theoremType (model theory)Fixed pointMenger PM-spaceFixed-point propertyMenger's theoremfixed pointψ-contractive mappingDifferential geometrySettore MAT/05 - Analisi MatematicaGeometry and TopologyCoincidence pointMathematicsFixed Point Theory and Applications
researchProduct

Fixed point and homotopy results for mixed multi-valued mappings in 0-complete partial metric spaces*

2015

We give sufficient conditions for the existence of common fixed points for a pair of mixed multi-valued mappings in the setting of 0-complete partial metric spaces. An example is given to demonstrate the usefulness of our results over the existing results in metric spaces. Finally, we prove a homotopy theorem via fixed point results.

Discrete mathematicsHomotopy categoryPartial metric spacefixed pointsApplied MathematicsInjective metric spacepartial metric spaceslcsh:QA299.6-433multi-valued mappingslcsh:AnalysisFixed pointFixed-point propertyIntrinsic metricConvex metric spacen-connectedMetric spaceSettore MAT/05 - Analisi Matematicamulti-valued mappingMetric (mathematics)AnalysisMathematics
researchProduct

Fixed point theory in partial metric spaces via φ-fixed point’s concept in metric spaces

2014

Abstract Let X be a non-empty set. We say that an element x ∈ X is a φ-fixed point of T, where φ : X → [ 0 , ∞ ) and T : X → X , if x is a fixed point of T and φ ( x ) = 0 . In this paper, we establish some existence results of φ-fixed points for various classes of operators in the case, where X is endowed with a metric d. The obtained results are used to deduce some fixed point theorems in the case where X is endowed with a partial metric p. MSC:54H25, 47H10.

Discrete mathematicsInjective metric spaceApplied Mathematicsmetric spacepartial metric spaceFixed-point theoremFixed pointFixed-point propertyIntrinsic metricConvex metric spaceIsolated pointMetric spacefixed pointSettore MAT/05 - Analisi MatematicaDiscrete Mathematics and Combinatorics$\varphi$-fixed pointAnalysisMathematicsJournal of Inequalities and Applications
researchProduct

A Suzuki type fixed point theorem for a generalized multivalued mapping on partial Hausdorff metric spaces

2013

Abstract In this paper, we obtain a Suzuki type fixed point theorem for a generalized multivalued mapping on a partial Hausdorff metric space. As a consequence of the presented results, we discuss the existence and uniqueness of the bounded solution of a functional equation arising in dynamic programming.

Discrete mathematicsInjective metric spacepartial metric spaceFixed-point theoremFixed-point propertyCommon fixed pointSchauder fixed point theoremHausdorff distanceSettore MAT/05 - Analisi Matematicamulti-valued mappingContraction mappingGeometry and TopologyBrouwer fixed-point theoremKakutani fixed-point theoremMathematicsTopology and its Applications
researchProduct