In this paper we prove a single exponential upper bound on the number of possible homotopy types of the fibres of a Pfaffian map in terms of the format of its graph. In particular, we show that if a semi-algebraic set S ⊂ Rm+n, where R is a real closed field, is defined by a Boolean formula with s polynomials of degree less than d, and π : Rm+n → Rn is the projection on a subspace, then the num...

the concept of the bipartite divisor graph for integer subsets has been considered in [‎graph combinator., ‎ 26 (2010) 95--105‎.]. ‎in this paper‎, ‎we will consider this graph for the set of character degrees of a finite group $g$ and obtain some properties of this graph‎. ‎we show that if $g$ is a solvable group‎, ‎then the number of connected components of this graph is at most $2$ and if $g...

We derive simple explicit formula for the character of a cycle in the Connes’ (b, B)-bicomplex of cyclic cohomology and apply it to write formulas for the equivariant Chern character and characters of finitely-summable bounded Fredholm modules.

a definition of two jointly asymptotically nonexpansive mappings s and t on uniformly convex banach space e is studied to approximate common fixed points of two such mappings through weak and strong convergence of an ishikawa type iteration scheme generated by s and t on a bounded closed and convex subset of e. as a consequence of the notion of two jointly asymptotically nonexpansive maps, we c...

There are many emerging database applications that require accurate selectivity estimation of approximate string matching queries. Edit distance is one of the most commonly used string similarity measures. In this paper, we study the problem of estimating selectivity of string matching with low edit distance. Our framework is based on extending q-grams with wildcards. Based on the concepts of r...

Searching of old document images is a relevant issue today. In this paper, we tackle the problem of old Arabic document images retrieval which form a good part of our heritage and possess an inestimable scientific and cultural richness. We propose an approach for indexing and searching degraded document images without recognizing the textual patterns in order to avoid the high cost and the diff...

For a fixed graph H, let H-CON denote the problem of determining whether a given graph is contractible to H. The complexity of H-CON is studied for H belonging to certain classes of graphs, together covering all connected graphs of order at most 4. In particular, H-CON is NP-complete if H is a connected triangle-free graph other than a star. For each connected graph H of order a t most 4 other ...

Human services, such as social supports and health care, have low contractibility; services are difficult to specify measure, manage when delivered by a third party. Services can do fail, resulting in the inefficient use of public resources potential harm clients. This article develops conceptual framing using transaction cost economics (TCE) theory understand why human contract, management con...