Search results for "Partial"

Lipschitz conditions,b-arcwise connectedness and conformal mappings

1982

Understanding Quantum Algorithms via Query Complexity

2017

Query complexity is a model of computation in which we have to compute a function $f(x_1, \ldots, x_N)$ of variables $x_i$ which can be accessed via queries. The complexity of an algorithm is measured by the number of queries that it makes. Query complexity is widely used for studying quantum algorithms, for two reasons. First, it includes many of the known quantum algorithms (including Grover's quantum search and a key subroutine of Shor's factoring algorithm). Second, one can prove lower bounds on the query complexity, bounding the possible quantum advantage. In the last few years, there have been major advances on several longstanding problems in the query complexity. In this talk, we su…

A homotopy fixed point theorem in 0-complete partial metric space

2015

We generalize a result of Feng and Liu, on multi-valued contractive mappings, for studying the relationship between fixed point sets and homotopy fixed point sets. The presented results are discussed in the generalized setting of 0-complete partial metric spaces. An example and a nonlinear alternative of Leray-Schauder type are given to support our theorems.

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.

Very Narrow Quantum OBDDs and Width Hierarchies for Classical OBDDs

2014

In the paper we investigate a model for computing of Boolean functions – Ordered Binary Decision Diagrams (OBDDs), which is a restricted version of Branching Programs. We present several results on the comparative complexity for several variants of OBDD models. We present some results on the comparative complexity of classical and quantum OBDDs. We consider a partial function depending on a parameter k such that for any k > 0 this function is computed by an exact quantum OBDD of width 2, but any classical OBDD (deterministic or stable bounded-error probabilistic) needs width 2 k + 1. We consider quantum and classical nondeterminism. We show that quantum nondeterminism can be more efficient …

Common fixed points for self-mappings on partial metric spaces

2012

Abstract In this paper, we prove some results of a common fixed point for two self-mappings on partial metric spaces. Our results generalize some interesting results of Ilić et al. (Appl. Math. Lett. 24:1326-1330, 2011). We conclude with a result of the existence of a fixed point for set-valued mappings in the context of 0-complete partial metric spaces. MSC:54H25, 47H10.

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.

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.

Ordering and Convex Polyominoes

2005

We introduce a partial order on pictures (matrices), denoted by ≼ that extends to two dimensions the subword ordering on words. We investigate properties of special families of discrete sets (corresponding to {0,1}-matrices) with respect to this partial order. In particular we consider the families of polyominoes and convex polyominoes and the family, recently introduced by the authors, of L-convex polyominoes. In the first part of the paper we study the closure properties of such families with respect to the order. In particular we obtain a new characterization of L-convex polyominoes: a discrete set P is a L-convex polyomino if and only if all the elements Q≼P are polyominoes. In the seco…

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.