On torsionfree classes which are not precover classes

In the class of all exact torsion theories the torsionfree classes are cover (pre-cover) classes if and only if the classes of torsionfree relatively injective modules or relatively exact modules are cover (precover) classes, and this happens exactly if and only if the torsion theory is of finite type. Using the transfinite induction in the second half of the paper a new construction of a torsionfree relatively injective cover of an arbitrary module with respect to Goldie’s torsion theory of finite type is presented. This research has been partially supported by the Grant Agency of the Czech Republic, grant #GAČR 201/06/0510 and also by the institutional grant MSM 0021620839.     

具有有限多有限复迭和有限循环复迭的3维流形

本文给出基本群为剩余有限的紧致３维流形何时有有限多有限复迭，何时有有限多有限循环复迭的充要条件。     

Finding a minimum path cover of a distance-hereditary graph in polynomial time

A path cover of a graph G=(V,E) is a set of pairwise vertex-disjoint paths such that the disjoint union of the vertices of these paths equals the vertex set V of G. The path cover problem is, given a graph, to find a path cover having the minimum number of paths. The path cover problem contains the Hamiltonian path problem as a special case since finding a path cover, consisting of a single path, corresponds directly to the Hamiltonian path problem. A graph is a distance-hereditary graph if each pair of vertices is equidistant in every connected induced subgraph containing them. The complexity of the path cover problem on distance-hereditary graphs has remained unknown. In this paper, we propose the first polynomial-time algorithm, which runs in O(|V|⁹) time, to solve the path cover problem on distance-hereditary graphs.     

最小1-因子覆盖集的若干结果

假设G是一个1-可扩图．G的1-因子覆盖是G的某些1-因子的集合M使得∪M∈M M=F（G）．1-因子数目最小的1．因子覆盖称为excessive factorization．一个excessive factorization中的1．因子数目称为图G的excessive index，记为x：（G）．本文我们基于G的耳朵分解和E（C）的依赖关系给出了X＇e（G）的上界．对任意正整数k≥3，我们构造出一个图G使得A（G）=3而X＇e（G）=k．进而，我们考虑了乘积图的excessive index．     

Line graphs of complete multipartite graphs have small cycle double covers

It has been shown by MacGillivray and Seyffarth (Austral. J. Combin. 24 (2001) 91) that bridgeless line graphs of complete graphs, complete bipartite graphs, and planar graphs have small cycle double covers. In this paper, we extend the result for complete bipartite graphs, and show that the line graph of any complete multipartite graph (other than K_1,2) has a small cycle double cover.     

Hausdorff measures, dimensions and mutual singularity

Let be a metric space. For a probability measure on a subset of and a Vitali cover of , we introduce the notion of a -Vitali subcover , and compare the Hausdorff measures of with respect to these two collections. As an application, we consider graph directed self-similar measures and in satisfying the open set condition. Using the notion of pointwise local dimension of with respect to , we show how the Hausdorff dimension of some general multifractal sets may be computed using an appropriate stochastic process. As another application, we show that Olsen's multifractal Hausdorff measures are mutually singular.

     

Flat covers and cotorsion envelopes of sheaves

In this paper we prove that any sheaf of modules over any topological space (in fact, any -module where is a sheaf of rings on the topological space) has a flat cover and a cotorsion envelope. This result is very useful, as we shall explain later in the introduction, in order to compute cohomology, due to the fact that the category of sheaves ( -modules) does not have in general enough projectives.

     

Closed 2-cell embeddings of graphs with no V8-minors

A closed 2-cell embedding of a graph embedded in some surface is an embedding such that each face is bounded by a cycle in the graph. The strong embedding conjecture says that every 2-connected graph has a closed 2-cell embedding in some surface. In this paper, we prove that any 2-connected graph without V₈ (the Möbius 4-ladder) as a minor has a closed 2-cell embedding in some surface. As a corollary, such a graph has a cycle double cover. The proof uses a classification of internally-4-connected graphs with no V₈-minor (due to Kelmans and independently Robertson), and the proof depends heavily on such a characterization.