Search results for "PROPERTY"

showing 10 items of 955 documents

SUBGROUPS OF FINITE GROUPS WITH A STRONG COVER-AVOIDANCE PROPERTY

2009

AbstractA subgroup A of a group G has the strong cover-avoidance property in G, or A is a strong CAP-subgroup of G, if A either covers or avoids every chief factor of every subgroup of G containing A. The main aim of the present paper is to analyse the impact of the strong cover and avoidance property of the members of some relevant families of subgroups on the structure of a group.

Discrete mathematicsCombinatoricsFinite groupProperty (philosophy)Group (mathematics)General MathematicsStructure (category theory)Cover (algebra)MathematicsBulletin of the Australian Mathematical Society
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

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

Termination of a set of rules modulo a set of equations

2006

The problem of termination of a set R of rules modulo a set E of equations, called E-termination problem, arises when trying to complete the set of rules in order to get a Church-Rosser property for the rules modulo the equations. We first show here that termination of the rewriting relation and E-termination are the same whenever the used rewriting relation is E-commuting, a property inspired from Peterson and Stickel’s E-compatibility property. More precisely, their results can be obtained by requiring termination of the rewriting relation instead of E-termination if E-commutation is used instead of E-compatibility. When the rewriting relation is not E-commuting, we show how to reduce E-t…

Discrete mathematicsCritical pairSet (abstract data type)Infinite setProperty (philosophy)Relation (database)ModuloSolution setRewritingMathematics
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

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