Search results for "rete"

Fixed point results on metric and partial metric spaces via simulation functions

2015

We prove existence and uniqueness of fixed point, by using a simulation function and a lower semi-continuous function in the setting of metric space. As consequences of this study, we deduce several related fixed point results, in metric and partial metric spaces. An example is given to support the new theory.

On fixed points for a–n–f-contractive multi-valued mappings in partial metric spaces

2015

Recently, Samet et al. introduced the notion of α-ψ-contractive type mappings and established some fixed point theorems in complete metric spaces. Successively, Asl et al. introduced the notion of αӿ-ψ-contractive multi-valued mappings and gave a fixed point result for these multivalued mappings. In this paper, we establish results of fixed point for αӿ-admissible mixed multivalued mappings with respect to a function η and common fixed point for a pair (S; T) of mixed multi-valued mappings, that is, αӿ-admissible with respect to a function η in partial metric spaces. An example is given to illustrate our result.

Common fixed point theorems for multi-valued maps

2012

Abstract We establish some results on coincidence and common fixed points for a two-pair of multi-valued and single-valued maps in complete metric spaces. Presented theorems generalize recent results of Gordji et al [4] and several results existing in the literature.

Meir-Keeler Type Contractions for Tripled Fixed Points

2012

Abstract In 2011, Berinde and Borcut [6] introduced the notion of tripled fixed point in partially ordered metric spaces. In our paper, we give some new tripled fixed point theorems by using a generalization of Meir-Keeler contraction.

Metric or partial metric spaces endowed with a finite number of graphs: a tool to obtain fixed point results

2014

Abstract We give some fixed point theorems in the setting of metric spaces or partial metric spaces endowed with a finite number of graphs. The presented results extend and improve several well-known results in the literature. In particular, we discuss a Caristi type fixed point theorem in the setting of partial metric spaces, which has a close relation to Ekelandʼs principle.

Shadow trees of Mandelbrot sets

2003

Optimal paths in weighted timed automata

2004

AbstractWe consider the optimal-reachability problem for a timed automaton with respect to a linear cost function which results in a weighted timed automaton. Our solution to this optimization problem consists of reducing it to computing (parametric) shortest paths in a finite weighted directed graph. We call this graph a parametric sub-region graph. It refines the region graph, a standard tool for the analysis of timed automata, by adding the information which is relevant to solving the optimal-reachability problem. We present an algorithm to solve the optimal-reachability problem for weighted timed automata that takes time exponential in O(n(|δ(A)|+|wmax|)), where n is the number of clock…

Brauer characters and coprime action

2016

Abstract It is an open problem to show that under a coprime action, the number of invariant Brauer characters of a finite group is the number of the Brauer characters of the fixed point subgroup. We prove that this is true if the non-abelian simple groups satisfy a stronger condition.

Compactness of time-frequency localization operators on L2(Rd)

2006

Abstract In this paper, we consider localization operators on L 2 ( R d ) defined by symbols in a subclass of the modulation space M ∞ ( R 2 d ) . We show that these operators are compact and that this subclass is “optimal” for compactness.

Complete, exact, and efficient computations with cubic curves

2004

The Bentley-Ottmann sweep-line method can be used to compute thearrangement of planar curves provided a number of geometricprimitives operating on the curves are available. We discuss themathematics of the primitives for planar algebraic curves of degreethree or less and derive efficient realizations. As a result, weobtain a complete, exact, and efficient algorithm for computingarrangements of cubic curves. Conics and cubic splines are specialcases of cubic curves. The algorithm is complete in that it handles all possibledegeneracies including singularities. It is exact in that itprovides the mathematically correct result. It is efficient in thatit can handle hundreds of curves with a quart…