Nowhere zero 4‐flow in regular matroids

Jensen and Toft 8 conjectured that every 2‐edge‐connected graph without a K₅‐minor has a nowhere zero 4‐flow. Walton and Welsh 19 proved that if a coloopless regular matroid M does not have a minor in {M(K_3,3), M*(K₅)}, then M admits a nowhere zero 4‐flow. In this note, we prove that if a coloopless regular matroid M does not have a minor in {M(K₅), M*(K₅)}, then M admits a nowhere zero 4‐flow. Our result implies the Jensen and Toft conjecture. © 2005 Wiley Periodicals, Inc. J Graph Theory     

Peeling phylogenetic ‘oranges’

We investigate the combinatorics of a topological space that is generated by the set of edge-weighted finite trees. This space arises by multiplying the weights of edges on paths in trees and is closely connected to tree reconstruction problems involving finite state Markov processes. We show that this space is a contractible finite CW-complex whose face poset can be described via a partial order on semilabelled forests. We then describe some combinatorial properties of this poset, showing that, for example, it is pure, thin and contractible.     

A Representation of a Family of Secret Sharing Matroids

Deciding whether a matroid is secret sharing or not is a well-known open problem. In Ng and Walker [6] it was shown that a matroid decomposes into uniform matroids under strong connectivity. The question then becomes as follows: when is a matroid m with N uniform components secret sharing? When N = 1, m corresponds to a uniform matroid and hence is secret sharing. In this paper we show, by constructing a representation using projective geometry, that all connected matroids with two uniform components are secret sharing     

Representations of a pair of posets

In this article we determine the pairs of posets which are finitely represented.Supported by State Education Commission.     

The Gold Partition Conjecture for 6-Thin Posets

We consider the Gold Partition Conjecture (GPC) that implies the 1/3–2/3 Conjecture. We prove the GPC in the case where every element of the poset is incomparable with at most six others. The proof involves the extensive use of computers. This paper contains results obtained using computer resources of the Interdisciplinary Centre for Mathematical and Computational Modelling (ICM), University of Warsaw.     

Retractions onto series-parallel posets

The poset retraction problem for a poset P is whether a given poset Q containing P as a subposet admits a retraction onto P, that is, whether there is a homomorphism from Q onto P which fixes every element of P. We study this problem for finite series-parallel posets P. We present equivalent combinatorial, algebraic, and topological charaterisations of posets for which the problem is tractable, and, for such a poset P, we describe posets admitting a retraction onto P.     

Cohomology of the Orlik–Solomon Algebras and Local Systems

The paper provides a combinatorial method to decide when the space of local systems with nonvanishing first cohomology on the complement to an arrangement of lines in a complex projective plane has as an irreducible component a subgroup of positive dimension. Partial classification of arrangements having such a component of positive dimension and a comparison theorem for cohomology of Orlik–Solomon algebra and cohomology of local systems are given. The methods are based on Vinberg–Kac classification of generalized Cartan matrices and study of pencils of algebraic curves defined by mentioned positive dimensional components.     

极小圈模对与二元域拟阵的特征

研究极小圈模对与二元域拟阵的特征.首先给出拟阵M的极小圈模对,模对的并的秩与相应的超平面的交的秩三者的等价关系.在两个极小圈不等的条件下,证明了满足极小圈消去公理的极小圈是唯一的并且极小圈模对的对称差包含在其中,结合极小圈的对称差的表示,证明了极小圈与基的差的绝对值大于等于2.后面两个证明都把原来的必要条件推广为充要条件.最后,用M上不相同的极小圈,极小圈模对,极小圈的对称差表示,M上不相等的超平面,超平面的并不等于E及满足的秩等式极简单地刻划了二元域拟阵M的特征.