Three-divisible families of skew lines on a smooth projective quintic

We give an example of a family of 15 skew lines on a quintic such that its class is divisible by 3. We study properties of the codes given by arrangements of disjoint lines on quintics.

     

Cover and Bounded Parallel Faces

We use the cover or the closure of the cover in order to determine when two disjoint closed convex sets have parallel faces, one of them being bounded. Moreover, we show that the study of the closure of the cover gives interesting results about the cover itself.     

Partitioning series-parallel multigraphs intoν*-excluding edge covers

We prove that, for any given vertexν* in a series-parallel graph G, its edge set can be partitioned into k= min{k′(G) 1,δ(G)} subsets such that each subset covers all the vertices of G possibly except forν*, whereδ(G) is the minimum degree of G and k′(G) is the edge-connectivity of G. In addition, we show that the results in this paper are best possible and a polynomial time algorithm can be obtained for actually finding such a partition by our proof.     

弱拉回平坦序S-系对序幺半群的刻画

设S是序幺半群,借助环模理论以及半群S-系理论方法,在序S-系范畴中研究了弱拉回平坦性质。刻画了弱拉回平坦序S-系关于直积封闭的序幺半群类以及弱拉回平坦性质与其他性质一致的序幺半群类,讨论了循环序S-系具有拉回平坦覆盖的条件,进而推广了S-系的一些重要结果。     

Worm Problem的一个新上界

1966年,Leo Moser提出了一个基本的几何问题,即Worm Problem．该问题是指:在平面上寻找一个面积最小的(凸)区域,使得任何一条长为1的平面曲线都能够通过旋转和平移完全放入该(凸)区域之中．对于要寻找的区域是凸的情形,本文将把目前所知道的最小的上界由0．2738086降低至0．270911861．在最后一部分,我们推广了Worm Problem,并初步给出了一些相应的结果．     

An exact algorithm for solving the bilevel facility interdiction and fortification problem

We present an exact approach for solving the $r$-interdiction median problem with fortification. Our approach consists of solving a greedy heuristic and a set cover problem iteratively that guarantees to find an optimal solution upon termination. The greedy heuristic obtains a feasible solution to the problem, and the set cover problem is solved to verify optimality of the solution and to provide a direction for improvement if not optimal. We demonstrate the performance of the algorithm in a computational study.     

Graphs vertex-partitionable into strong cliques

A clique in a graph is strong if it intersects all maximal independent sets. A graph is localizable if it has a partition of the vertex set into strong cliques. Localizable graphs were introduced by Yamashita and Kameda in 1999 and form a rich class of well-covered graphs that coincides with the class of well-covered graphs within the class of perfect graphs. In this paper, we give several equivalent formulations of the property of localizability and develop polynomially testable characterizations of localizable graphs within three non-perfect graph classes: triangle-free graphs, $C_4$-free graphs, and line graphs. Furthermore, we use localizable graphs to construct an infinite family of counterexamples to a conjecture due to Zaare-Nahandi about $k$-partite well-covered graphs having all maximal cliques of size $k$.     

Rings whose cyclic modules are lifting and ⊕-supplemented

It is proved that a semiperfect module is lifting if and only if it has a projective cover preserving direct summands. Three corollaries are obtained: (1) every cyclic module over a ring R is lifting if and only if every cyclic R-module has a projective cover preserving direct summands; (2) a ring R is artinian serial with Jacobson radical square-zero if and only if every (2-generated) R-module has a projective cover preserving direct summands; (3) a ring R is a right (semi-)perfect ring if and only if (cyclic) lifting R-module has a projective cover preserving direct summands, if and only if every (cyclic) R-module having a projective cover preserving direct summands is lifting. It is also proved that every cyclic module over a ring R is ⊕-supplemented if and only if every cyclic R-module is a direct sum of local modules. Consequently, a ring R is artinian serial if and only if every left and right R-module is a direct sum of local modules.     

Between clique-width and linear clique-width of bipartite graphs

We consider hereditary classes of bipartite graphs where clique-width is bounded, but linear clique-width is not. Our goal is identifying classes that are critical with respect to linear clique-width. We discover four such classes and conjecture that this list is complete, i.e. a hereditary class of bipartite graphs of bounded clique-width that excludes a graph from each of the four critical classes has bounded linear clique-width.