We describe a general framework for covering concepts using terminologies and briefly present the already investigated instances of this framework. Then, we formalize the best covering problem in the context of the ALN language, in which the difference operation is not semantically unique, and sketches the technique to solve the underlying computation problems.

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.

A continuous function p : S̃ → S between two surfaces S̃ and S is called a branched covering if there exists a finite set B in S such that the restriction of p to S̃ − p−1(B), p | S̃−p−1(B) : S̃− p −1(B)→ S− B, is a covering projection in the usual sense. The smallest set B of S which has this property is called the branch set. A branched covering p : S̃ → S is regular if there exists a (finite) grou...

We shall give, in an optimal form, a sufficient numerical condition for the finiteness of the fundamental group of the smooth locus of a normal K3 surface. We shall moreover prove that, if the normal K3 surface is elliptic and the above fundamental group is not finite, then there is a finite covering which is a complex torus.

in this paper, we develop a capacitated location-covering model considering interval values for demand and service parameters. we also consider flexibility on distance standard for covering demand nodes by the servers. we use the satisfaction degree to represent the constraint of service capacity. the proposed model belongs to the class of mixed integer programming models. our model can be redu...

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...