Coverings of 3-manifolds by open balls and two open solid tori

Hempel and McMillan showed that a closed 3-manifold that can be covered by three open balls is a connected sum of S³- and S²-bundles over S¹. In this paper we obtain a classification of all closed 3-manifolds that can be covered by two open balls and one open solid torus or by one open ball and two open solid tori.     

Coverings by minimal transversals

In this paper, we give counterexamples to the conjecture: “Every nonempty regular simple graph contains two disjoint maximal independent sets” [2, 7]. For this, we generalize this problem to the following: covering the set of vertices of a graph by minimal transversals. An equivalence of this last problem is given.     

Coverings by classes of permutable equivalence relations

Supported by the Russian Foundation for Fundamental Research, grant No. 93-01-16011.     

Enlargements and Coverings by Rees Matrix Semigroups

 We formulate a general condition, called an enlargement, under which a semigroup T is covered by a Rees matrix semigroup over a subsemigroup. (Received 1 February 1999; in revised form 19 May 1999)     

Resolvable Coverings of 2-Paths by Cycles

 Let K _n be the complete graph on n vertices. A C(n,k,λ) design is a multiset of k-cycles in K _n in which each 2-path (path of length 2) of K _n occurs exactly λ times. A C(lk,k,1) design is resolvable if its k-cycles can be partitioned into classes so that every vertex appears exactly once in each class. A C(n,n,1) design gives a solution of Dudeney's round table problem. It is known that there exists a C(n,n,1) design when n is even and there exists a C(n,n,2) design when n is odd. In general the problem of constructing a C(n,n,1) design is still open when n is odd. Necessary and sufficient conditions for the existence of C(n,k,λ) designs and resolvable C(lk,k,1) designs are known when k=3,4. In this paper, we construct a resolvable C(n,k,1) design when n=p ^e +1 ( p is a prime number and e≥1) and k is any divisor of n with k≠1,2. Received: October, 2001 Final version received: September 4, 2002 RID="*" ID="*" This research was supported in part by Grant-in-Aid for Scientific Research (C) Japan     

On Perfect Matching Coverings and Even Subgraph Coverings

A perfect matching covering of a graph G is a set of perfect matchings of G such that every edge of G is contained in at least one member of it. Berge conjectured that every bridgeless cubic graph admits a perfect matching covering of order at most 5 (we call such a collection of perfect matchings a Berge covering of G). A cubic graph G is called a Kotzig graph if G has a 3‐edge‐coloring such that each pair of colors forms a hamiltonian circuit (introduced by R. Häggkvist, K. Markström, J Combin Theory Ser B 96 (2006), 183–206). In this article, we prove that if there is a vertex w of a cubic graph G such that , the graph obtained from by suppressing all degree two vertices is a Kotzig graph, then G has a Berge covering. We also obtain some results concerning the so‐called 5‐even subgraph double cover conjecture.     

Enlargements and Coverings by Rees Matrix Semigroups

 We formulate a general condition, called an enlargement, under which a semigroup T is covered by a Rees matrix semigroup over a subsemigroup.     

Coverings by convex bodies and inscribed balls

Let be a Hilbert space. For a closed convex body denote by the supremum of the radiuses of balls contained in . We prove that for every covering of a convex closed body by a sequence of convex closed bodies , . It looks like this fact is new even for triangles in a 2-dimensional space.

     

关于格点覆盖的一个注记

对于一个给定椭球,本文给出了它的任一全等椭球都包含一个整点的一个充分必要条件.     

Coverings and Ring-Groupoids

We prove that the set of homotopy classes of the paths in a topological ring is a ring object (called ring groupoid). Using this concept we show that the ring structure of a topological ring lifts to a simply connected covering space.     

Determining Knotsw and Links by Cyclic Branched Coverings

It is well known that different knots or links in the 3-sphere can have homeomorphic n-fold cyclic branched coverings. We consider the following problem: for which values of nis a knot of link determined by itsn-fold cyclic branched covering? We consider the class of hyperbolic resp.2π/n-hyperbolic links. The isometry or symmetry groups of such links are finite, and their n-fold branched coverings are hyperbolic 3-manifolds. Our main result states that if ndoes not divide the order of the finite symmetry group of such a link, then the link is determined by its n-fold branched covering. In a sense, the result is best possible; the key argument of its proof is algebraic using some basic result about finite p-groups. The main result applies, for example, to the cyclic branched coverings of the 2-bridge links; in particular, it gives a classification of the maximally symmetricD₆-manifolds which are exactly the 3-fold branched coverings of the 2-bridge links.     

Coverings of topological loops

In this paper, we show that in some cases, no proper covering of a locally compact group topologically generated by left translations of a topological loop can occur as the group topologically generated by left translations of a topological loop. __________ Translated from Sovremennaya Matematika i Ee Prilozheniya (Contemporary Mathematics and Its Applications), Vol. 22, Algebra and Geometry, 2004.     

Coverings of transfinite matrices

Subsets of a Cartesian product X × Y, where X and Y are arbitrary sets, are considered as a generalization of incidence matrices. Minimal cover, essential set etc. are introduced in a stronger sense and their properties discussed. The existence of a minimal cover for an arbitrary generalized incidence matrix is proved. As an application a previous result is extended.     

Coverings of the Vertices of a Graph by Small Cycles

Given a graph G with n vertices, we call c_k(G) the minimum number of elementary cycles of length at most k necessary to cover the vertices of G. We bound c_k(G) from the minimum degree and the order of the graph.     

On Projecting Symmetries by Unbranched Regular Coverings of Riemann Surfaces

A symmetry of a Riemann surface X of genus g is an antiholomorphic involution σ of X. It is a classical result of Harnack that the set of fixed points of σ consists of k closed Jordan curves, called ovals, for some k, 0 ≤ k ≤ g + 1; when k = g or k = g+1 we say, following Natanzon [8], that σ is an (M – 1)- or an M-symmetry, respectively. Given a Riemann surface X with an M-symmetry, a Riemann surface Y and a regular covering p: X → Y, we prove that Y admits either an M- or an (M – 1)-symmetry and whenever p is unbranched we describe the groups of covering transformations of p. In the case that X is hyperelliptic we calculate as well the number of unbranched regular coverings p: X → Y in which X has an M-symmetry. The first two authors are supported by MTM2005-01637, the third by SAB2005-0049.     

Finite Coverings by Cones and an Application in Multi-Objective Programming

This paper considers analogues of statements concerning compactness and finite coverings, in which the roles of spheres are replaced by cones. Furthermore, one of the finite covering results provides an application in Multi-Objective Programming; infinite sets of alternatives are reduced to finite sets.