In the paper we prove a factorization theorem for representations of fundamental groups of compact Kähler manifolds (Kähler groups) into solvable matrix groups. We apply this result to prove that the universal covering of a compact Kähler manifold with a residually solvable fundamental group is holomorphically convex.

We consider the indirect covering subtree problem (Kim et al., 1996). The input is an edge weighted tree graph along with customers located at the nodes. Each customer is associated with a radius and a penalty. The goal is to locate a tree-shaped facility such that the sum of setup and penalty cost is minimized. The setup cost equals the sum of edge lengths taken by the facility and the penalty...

The notion of strong arcs in a fuzzy graph was introduced byBhutani and Rosenfeld in [1] and fuzzy end nodes in the subsequent paper[2] using the concept of strong arcs. In Mordeson and Yao [7], the notion of“degrees” for concepts fuzzified from graph theory were defined and studied.In this note, we discuss degrees for fuzzy end nodes and study further someproperties of fuzzy end nodes and fuzz...

One important way to extend the lifetime of wireless sensor networks is to deploy the sensors in a dense manner. The redundancy among the sensed data demonstrates that it is not efficient to collect raw data from all nodes in the network if we further consider that the data is generally spatial-correlated. The node scheduling strategy aims at selecting a set of representative nodes to provide t...

We point out that there are compact 4-manifolds which do not admit metrics of positive scalar curvature, but nonetheless have finite covering spaces which do carry such metrics. Moreover, passing from a 4-manifold to a covering space sometimes actually changes the sign of the Yamabe invariant. As was first pointed out by Bérard Bergery [1], there exist, in dimensions ≡ 1 or 2 mod 8, n ≥ 9, cert...

In this article we focus on constructing an algorithm that automatizes the generation of LPN solving algorithms from the considered parameters. When searching for an algorithm to solve an LPN instance, we make use of the existing techniques and optimize their use. We formalize an LPN algorithm as a path in a graph G and our algorithm is searching for the optimal paths in this graph. The results...

Spaces with radially symmetric curvature at base point p are shown to be diffeomorphic to space forms. Furthermore, they are either isometric to Rn or Sn under a radially symmetric metric, to RPn with Riemannian universal covering of Sn equipped with a radially symmetric metric, or else have constant curvature outside a metric ball of radius equal to the injectivity