Search results for "Matematica"

showing 10 items of 1637 documents

Quasi Conjunction and Inclusion Relation in Probabilistic Default Reasoning

2011

We study the quasi conjunction and the Goodman & Nguyen inclusion relation for conditional events, in the setting of probabilistic default reasoning under coherence. We deepen two recent results given in (Gilio and Sanfilippo, 2010): the first result concerns p-entailment from a family F of conditional events to the quasi conjunction C(S) associated with each nonempty subset S of F; the second result, among other aspects, analyzes the equivalence between p-entailment from F and p-entailment from C(S), where S is some nonempty subset of F. We also characterize p-entailment by some alternative theorems. Finally, we deepen the connections between p-entailment and the Goodman & Nguyen inclusion…

Discrete mathematicsClass (set theory)goodman & nguyen inclusion relationSettore MAT/06 - Probabilita' E Statistica MatematicaSettore INF/01 - Informaticap-entailment.; quasi conjunction; goodman & nguyen inclusion relation; qand rule; coherence; probabilistic default reasoning; p-entailmentProbabilistic logicqand ruleprobabilistic default reasoningConsistency (knowledge bases)Coherence (philosophical gambling strategy)p-entailmentCoherence probabilistic default reasoning quasi conjunction Goodman & Nguyen inclusion relation QAND rule p-entailment.coherenceConjunction (grammar)Default reasoningquasi conjunctionGreatest elementAlgorithmEquivalence (measure theory)Mathematics
researchProduct

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

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

Absolutely Convergent Extensions of Nonclosable Positive Linear Functionals

2010

The existence of extensions of a positive linear functional ω defined on a dense *-subalgebra \({\mathfrak{A}_0}\) of a topological *-algebra \({\mathfrak{A}}\), satisfying certain regularity conditions, is examined. The main interest is focused on the case where ω is nonclosable and sufficient conditions for the existence of an absolutely convergent extension of ω are given.

Discrete mathematicsExtensions Positive linear functionalsSettore MAT/05 - Analisi MatematicaPositive linear functionalGeneral MathematicsSubalgebraExtension (predicate logic)Algebra over a fieldMathematics::Representation TheoryAbsolute convergenceMathematicsMediterranean Journal of Mathematics
researchProduct

A reduction theorem for a conjecture on products of two π -decomposable groups

2013

[EN] For a set of primes pi, a group X is said to be pi-decomposable if X = X-pi x X-pi' is the direct product of a pi-subgroup X-pi and a pi'-subgroup X-pi', where pi' is the complementary of pi in the set of all prime numbers. The main result of this paper is a reduction theorem for the following conjecture: "Let pi be a set of odd primes. If the finite group G = AB is a product of two pi-decomposable subgroups A = A(pi) x A(pi') and B = B-pi x B-pi', then A(pi)B(pi) = B(pi)A(pi) and this is a Hall pi-subgroup of G." We establish that a minimal counterexample to this conjecture is an almost simple group. The conjecture is then achieved in a forthcoming paper. (C) 2013 Elsevier Inc. All ri…

Discrete mathematicsFinite groupConjectureAlgebra and Number TheoryGroup (mathematics)Prime numberProducts of subgroupsFinite groupsHall subgroupsCombinatoricsLocally finite groupSimple grouppi-structureMATEMATICA APLICADAMinimal counterexampleDirect productpi-decomposable groupsMathematicsJournal of Algebra
researchProduct

A note on a result of Guo and Isaacs about p-supersolubility of finite groups

2016

In this note, global information about a finite group is obtained by assuming that certain subgroups of some given order are S-semipermutable. Recall that a subgroup H of a finite group G is said to be S-semipermutable if H permutes with all Sylow subgroups of G of order coprime to . We prove that for a fixed prime p, a given Sylow p-subgroup P of a finite group G, and a power d of p dividing such that , if is S-semipermutable in for all normal subgroups H of P with , then either G is p-supersoluble or else . This extends the main result of Guo and Isaacs in (Arch. Math. 105:215-222 2015). We derive some theorems that extend some known results concerning S-semipermutable subgroups.

Discrete mathematicsFinite groupCoprime integersP-supersoluble groupGeneral MathematicsS-semipermutable subgroup010102 general mathematicsSylow theoremsGrups Teoria deOrder (ring theory)01 natural sciencesPrime (order theory)CombinatoricsGlobal informationLocally finite group0103 physical sciences010307 mathematical physicsFinite group0101 mathematicsMATEMATICA APLICADAMatemàticaMathematicsArchiv der Mathematik
researchProduct

On the supersoluble hypercentre of a finite group

2016

[EN] We give some sufficient conditions for a normal p-subgroup P of a finite group G to have every G-chief factor below it cyclic. The S-permutability of some p-subgroups of O^p(G)plays an important role. Some known results can be reproved and some others appear as corollaries of our main theorems.

Discrete mathematicsFinite groupP-supersoluble groupGeneral MathematicsS-semipermutable subgroup010102 general mathematicsGrups Teoria de01 natural sciencesMathematics::Group Theory0103 physical sciences010307 mathematical physicsFinite group0101 mathematicsMATEMATICA APLICADAMatemàticaMathematicsMonatshefte für Mathematik
researchProduct

On self-normalising subgroups of finite groups

2010

[EN] The aim of this paper is to characterise the classes of groups in which every subnormal subgroup is normal, permutable, or S-permutable by the embedding of the subgroups (respectively, subgroups of prime power order) in their normal, permutable, or S-permutable closure, respectively.

Discrete mathematicsFinite groupPst-groupAlgebra and Number TheoryMathematics::CombinatoricsGrups Teoria deAlgebraMathematics::Group TheoryT-groupPt-groupT-groupPermutabilitySylow permutabilityÀlgebraAlgebra over a fieldFinite groupPermutable closureSubnormal closureMATEMATICA APLICADAGroup theoryMathematics
researchProduct

On a graph related to permutability in finite groups

2010

For a finite group G we define the graph $\Gamma(G)$ to be the graph whose vertices are the conjugacy classes of cyclic subgroups of G and two conjugacy classes $\{\mathcal {A}, \mathcal {B}\}$ are joined by an edge if for some $\{A \in \mathcal {A},\, B \in \mathcal {B}\, A\}$ and B permute. We characterise those groups G for which $\Gamma(G)$ is complete.

Discrete mathematicsFinite groupSoluble groupApplied MathematicsGrups Teoria deGraphGraphCombinatoricsMathematics::Group TheoryConjugacy classPermutabilityÀlgebraFinite groupMATEMATICA APLICADAMathematics
researchProduct