覆盖数不超过3的图上渡河问题

1000多年前,英国著名学者Alcuin曾提出一个古老的渡河问题,即狼、羊和卷心菜的渡河问题。2006年,Prisner把该问题推广到任意的冲突图上,考虑了一类情况更一般的渡河运输问题。所谓冲突图是指一个图G=(V,E),这里V代表某些物品的集合,V中的两个点有边连结当且仅当这两个点是冲突的,即在无人监管的情况下不允许留在一起的点。图G=(V,E)的一个可行运输方案是指在保证不发生任何冲突的前提下,把V的点所代表的物品全部摆渡到河对岸的一个运输方案。图G的Alcuin数定义为它存在可行运输方案时所需船的最小容量。本文讨论了覆盖数不超过3的连通图的Alcuin数,给出了该类图Alcuin数的完全刻画。     

Strong embeddings of minimum genus

A “folklore conjecture, probably due to Tutte” (as described in [P.D. Seymour, Sums of circuits, in: Graph Theory and Related Topics (Proc. Conf., Univ. Waterloo, 1977), Academic Press, 1979, pp. 341-355]) asserts that every bridgeless cubic graph can be embedded on a surface of its own genus in such a way that the face boundaries are cycles of the graph. Sporadic counterexamples to this conjecture have been known since the late 1970s. In this paper we consider closed 2-cell embeddings of graphs and show that certain (cubic) graphs (of any fixed genus) have closed 2-cell embedding only in surfaces whose genus is very large (proportional to the order of these graphs), thus providing a plethora of strong counterexamples to the above conjecture. The main result yielding such counterexamples may be of independent interest.     

9中心化子群的结构

记#Cent（G）为群G的所有互不相同的元素的中心化子个数．如果#Cent（G）=礼,则称G为n中心化子群．本文给出了9中心化子群的结构．     

推出-拉回图上的覆盖性同态

In a pushout-pullback diagram,which consists of four morphisms f : A → B,g : A → C,α : C → D and β : B → D,we give some relations among the covers of these four modules.If kerf ∈ I(L ),then g : A → C is L -covering if and only if β : B → D is L -covering.If every module has an L -precover and kerf ∈ I(L ),then A and C have isomorphic L -precovers if and only if B and D have isomorphic L -precovers.     

Regular path decompositions of odd regular graphs

Kotzig asked in 1979 what are necessary and sufficient conditions for a d‐regular simple graph to admit a decomposition into paths of length d for odd d>3. For cubic graphs, the existence of a 1‐factor is both necessary and sufficient. Even more, each 1‐factor is extendable to a decomposition of the graph into paths of length 3 where the middle edges of the paths coincide with the 1‐factor. We conjecture that existence of a 1‐factor is indeed a sufficient condition for Kotzig's problem. For general odd regular graphs, most 1‐factors appear to be extendable and we show that for the family of simple 5‐regular graphs with no cycles of length 4, all 1‐factors are extendable. However, for d>3 we found infinite families of d‐regular simple graphs with non‐extendable 1‐factors. Few authors have studied the decompositions of general regular graphs. We present examples and open problems; in particular, we conjecture that in planar 5‐regular graphs all 1‐factors are extendable. © 2009 Wiley Periodicals, Inc. J Graph Theory 63: 114–128, 2010     

Land cover change using an energy transition paradigm in a statistical mechanics approach

This paper explores a statistical mechanics approach as a means to better understand specific land cover changes on a continental scale. Integrated assessment models are used to calculate the impact of anthropogenic emissions via the coupling of technoeconomic and earth/atmospheric system models and they have often overlooked or oversimplified the evolution of land cover change. Different time scales and the uncertainties inherent in long term projections of land cover make their coupling to integrated assessment models difficult. The mainstream approach to land cover modelling is rule-based methodology and this necessarily implies that decision mechanisms are often removed from the physical geospatial realities, therefore a number of questions remain: How much of the predictive power of land cover change can be linked to the physical situation as opposed to social and policy realities? Can land cover change be understood using a statistical approach that includes only economic drivers and the availability of resources? In this paper, we use an energy transition paradigm as a means to predict this change. A cost function is applied to developed land covers for urban and agricultural areas. The counting of area is addressed using specific examples of a Pólya process involving Maxwell–Boltzmann and Bose–Einstein statistics. We apply an iterative counting method and compare the simulated statistics with fractional land cover data with a multi-national database. An energy level paradigm is used as a basis in a flow model for land cover change. The model is compared with tabulated land cover change in Europe for the period 1990–2000. The model post-predicts changes for each nation. When strong extraneous factors are absent, the model shows promise in reproducing data and can provide a means to test hypothesis for the standard rules-based algorithms.     

Strongly Flat and Condition (P) Covers of Acts Over Monoids

In this article we characterize monoids over which every right S-act has a strongly flat (condition (P)) cover. Similar to the perfect monoids, such monoids are characterized by condition (A) and having strongly flat (condition (P)) cover for each cyclic right S-act. We also give a new characterization for perfect monoids as monoids over which every strongly flat right S-act has a projective cover.     

Powers of the Vertex Cover Ideal of a Chordal Graph

In this article, Cohen–Macaulay chordal graphs and generalized star graphs are studied to show that all powers of the vertex cover ideal of such graphs have linear quotients. Moreover, it is shown that the Alexander dual of the clique complex of any chordal graph is vertex decomposable.     

The Projective Cover of the Trivial Module Over a Group Algebra of a Finite Group

We determine all finite groups G such that the Loewy length (socle length) of the projective cover P(k _G ) of the trivial kG-module k _G is four, where k is a field of characteristic p > 0 and kG is the group algebra of G over k, by using previous results and also the classification of finite simple groups. As a by-product we prove also that if p = 2 then all finite groups G such that the Loewy lengths of the principal block algebras of kG are four, are determined.