Search results for "FIX"

showing 10 items of 1335 documents

Common fixed points in generalized metric spaces

2012

Abstract We establish some common fixed point theorems for mappings satisfying a ( ψ , φ ) -weakly contractive condition in generalized metric spaces. Presented theorems extend and generalize many existing results in the literature.

Discrete mathematicsComputational MathematicsMetric spaceFixed-point iterationSettore MAT/05 - Analisi MatematicaApplied MathematicsGeneralized metric weakly contractive condition contraction of integral type fixed point common fixed points.Common fixed pointProduct metricFixed pointIntrinsic metricMathematicsConvex metric space
researchProduct

Fixed point theory for 1-set contractive and pseudocontractive mappings

2013

The purpose of this paper is to study the existence and uniqueness of fixed point for a class of nonlinear mappings defined on a real Banach space, which, among others, contains the class of separate contractive mappings, as well as to see that an important class of 1-set contractions and of pseudocontractions falls into this type of nonlinear mappings. As a particular case, we give an iterative method to approach the fixed point of a nonexpansive mapping. Later on, we establish some fixed point results of Krasnoselskii type for the sum of two nonlinear mappings where one of them is either a 1-set contraction or a pseudocontraction and the another one is completely continuous, which extend …

Discrete mathematicsComputational MathematicsNonlinear systemIterative methodApplied MathematicsBanach spaceFixed-point theoremUniquenessFixed pointFixed-point propertyCoincidence pointMathematicsApplied Mathematics and Computation
researchProduct

Combinatorics of Finite Words and Suffix Automata

2009

The suffix automaton of a finite word is the minimal deterministic automaton accepting the language of its suffixes. The states of the suffix automaton are the classes of an equivalence relation defined on the set of factors. We explore the relationship between the combinatorial properties of a finite word and the structural properties of its suffix automaton. We give formulas for expressing the total number of states and the total number of edges of the suffix automaton in terms of special factors of the word.

Discrete mathematicsComputer Science::Computation and Language (Computational Linguistics and Natural Language and Speech Processing)special factorNonlinear Sciences::Cellular Automata and Lattice GasesCombinatorics on WordAutomatonCombinatoricsCombinatorics on wordsDeterministic automatonSuffix automatonEquivalence relationQuantum finite automataSuffix automatonSuffixComputer Science::Data Structures and AlgorithmsComputer Science::Formal Languages and Automata TheoryWord (computer architecture)Mathematics
researchProduct

Sturmian Graphs and a conjecture of Moser

2004

In this paper we define Sturmian graphs and we prove that all of them have a “counting” property. We show deep connections between this counting property and two conjectures, by Moser and by Zaremba, on the continued fraction expansion of real numbers. These graphs turn out to be the underlying graphs of CDAWGs of central Sturmian words. We show also that, analogously to the case of Sturmian words, these graphs converge to infinite ones.

Discrete mathematicsConjectureProperty (philosophy)Data structuresData structureCombinatoricsPhilosophy of languagecompressed suffixComputer Science::Discrete MathematicsContinued fractionComputer Science::Formal Languages and Automata TheoryAlgorithmsReal numberMathematics
researchProduct

Coupled fixed point, F-invariant set and fixed point of N-order

2010

‎In this paper‎, ‎we establish some new coupled fixed point theorems in complete metric spaces‎, ‎using a new concept of $F$-invariant set‎. ‎We introduce the notion of fixed point of $N$-order as natural extension of that of coupled fixed point‎. ‎As applications‎, ‎we discuss and adapt the presented results to the setting of partially ordered cone metric spaces‎. ‎The presented results extend and complement some known existence results from the literature‎.

Discrete mathematicsCoupled fixed point F-invariant set fixed point of N-order partially ordered set cone metric spaceControl and OptimizationAlgebra and Number Theory47H10‎Fixed-point theoremFixed pointFixed-point propertyCoupled fixed point‎partially ordered setLeast fixed point‎$F$-invariant set54H25Schauder fixed point theoremFixed-point iterationSettore MAT/05 - Analisi Matematica‎34B15‎cone metric space‎fixed point of $N$-orderKakutani fixed-point theoremAnalysisHyperbolic equilibrium pointMathematics
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

Universal Lyndon Words

2014

A word w over an alphabet Σ is a Lyndon word if there exists an order defined on Σ for which w is lexicographically smaller than all of its conjugates (other than itself). We introduce and study universal Lyndon words, which are words over an n-letter alphabet that have length n! and such that all the conjugates are Lyndon words. We show that universal Lyndon words exist for every n and exhibit combinatorial and structural properties of these words. We then define particular prefix codes, which we call Hamiltonian lex-codes, and show that every Hamiltonian lex-code is in bijection with the set of the shortest unrepeated prefixes of the conjugates of a universal Lyndon word. This allows us t…

Discrete mathematicsExistential quantificationLyndon word Universal cycle Universal Lyndon wordComputer Science::Computation and Language (Computational Linguistics and Natural Language and Speech Processing)Lyndon word Universal cycle Universal Lyndon word Lex-codeLexicographical orderLyndon wordUniversal Lyndon wordLyndon wordsPrefixCombinatoricsMathematics::Group TheoryCombinatorics on wordsComputer Science::Discrete MathematicsUniversal cycleBijectionAlphabetMathematics::Representation TheoryComputer Science::Formal Languages and Automata TheoryMathematics
researchProduct

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

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