Mod 2 cohomology of combinatorial Grassmannians

Matroid bundles, introduced by MacPherson, are combinatorial analogues of real vector bundles. This paper sets up the foundations of matroid bundles. It defines a natural transformation from isomorphism classes of real vector bundles to isomorphism classes of matroid bundles. It then gives a transformation from matroid bundles to spherical quasifibrations, by showing that the geometric realization of a matroid bundle is a spherical quasifibration. The poset of oriented matroids of a fixed rank classifies matroid bundles, and the above transformations give a splitting from topology to combinatorics back to topology. A consequence is that the mod 2 cohomology of the poset of rank k oriented matroids (this poset classifies matroid bundles) contains the free polynomial ring on the first k Stiefel-Whitney classes.     

障碍拟阵图

Let G be a simple graph and T={S :S is extreme in G}. If M(V(G), T) is a matroid, then G is called an extreme matroid graph. In this paper, we study the properties of extreme matroid graph.     

Conjugacy relationship between M-convex and L-convex functions in continuous variables

By extracting combinatorial structures in well-solved nonlinear combinatorial optimization problems, Murota (1996,1998) introduced the concepts of M-convexity and L-convexity to functions defined over the integer lattice. Recently, Murota–Shioura (2000, 2001) extended these concepts to polyhedral convex functions and quadratic functions in continuous variables. In this paper, we consider a further extension to more general convex functions defined over the real space, and provide a proof for the conjugacy relationship between general M-convex and L-convex functions.Mathematics Subject Classification (1991): 90C10, 90C25, 90C27, 90C35This work is supported by Grant-in-Aid of the Ministry of Education, Culture, Sports, Science and Technology of Japan     

拟阵与概念格的关系

本文以构造的方式建立起拟阵与概念格的联系,得到在同构意义下每个拟阵是一个概念格,但反之不然的结论;该结论使得利用概念格的性质研究拟阵成为现实,特别为将建造概念格的算法尤其是已计算机化的算法应用于求取拟阵奠定了基础,也为拟阵论成为研究概念格性质的辅助工具打下基础．     

On Tutte polynomial expansion formulas in perspectives of matroids and oriented matroids

We introduce the active partition of the ground set of an oriented matroid perspective (or morphism, or quotient, or strong map) on a linearly ordered ground set. The reorientations obtained by arbitrarily reorienting parts of the active partition share the same active partition. This yields an equivalence relation for the set of reorientations of an oriented matroid perspective, whose classes are enumerated by coefficients of the Tutte polynomial, and a remarkable partition of the set of reorientations into Boolean lattices, from which we get a short direct proof of a 4-variable expansion formula for the Tutte polynomial in terms of orientation activities. This formula was given in the last unpublished preprint by Michel Las Vergnas; the above equivalence relation and notion of active partition generalize a former construction in oriented matroids by Michel Las Vergnas and the author; and the possibility of such a proof technique in perspectives was announced in the aforementioned preprint. We also briefly highlight how the 5-variable expansion of the Tutte polynomial in terms of subset activities in matroid perspectives comes in a similar way from the known partition of the power set of the ground set into Boolean lattices related to subset activities (and we complete the proof with a property which was missing in the literature). In particular, the paper applies to matroids and oriented matroids on a linearly ordered ground set, and applies to graph and directed graph homomorphisms on a linearly ordered edge-set.     

Matroid Shellability, β-Systems,and Affine Hyperplane Arrangements

The broken-circuit complex is fundamental to the shellability and homology of matroids, geometric lattices, and linear hyperplane arrangements. This paper introduces and studies the -system of a matroid, nbc(M), whose cardinality is Crapo's -invariant. In studying the shellability and homology of base-pointed matroids, geometric semilattices, and afflne hyperplane arrangements, it is found that the -system acts as the afflne counterpart to the broken-circuit complex. In particular, it is shown that the -system indexes the homology facets for the lexicographic shelling of the reduced broken-circuit complex , and the basic cycles are explicitly constructed. Similarly, an EL-shelling for the geometric semilattice associated with M is produced,_and it is shown that the -system labels its decreasing chains.Basic cycles can be carried over from The intersection poset of any (real or complex) afflnehyperplane arrangement is a geometric semilattice. Thus the construction yields a set of basic cycles, indexed by nbc(M), for the union of such an arrangement.     

双圈拟阵

Sim■es Pereira于1992年提出双圈拟阵.本文讨论了(i)双圈拟阵及其秩函数;(ii)次模函数在双圈拟阵中的应用;(iii)双圈拟阵B(G)的横贯拟阵.主要结果:1°由圈矩阵Bf=[I,Bf12]和圈秩的概念,推出M(f0)为双圈拟阵;2°证明了双圈拟阵B(G)等于由子集族{Av∶v∈V(G)},e与v在G中相关联}所确定的横贯拟阵;3°用不同于Matthews(1977)的方法证明了(iii).     

On the evaluation at (<Emphasis Type="Italic">j</Emphasis>, <Emphasis Type="Italic">j</Emphasis><Superscript>2</Superscript>) of the Tutte polynomial of a ternary matroid

F. Jaeger has shown that up to a ± sign the evaluation at (j, j ²) of the Tutte polynomial of a ternary matroid can be expressed in terms of the dimension of the bicycle space of a representation over GF(3). We give a short algebraic proof of this result, which moreover yields the exact value of ±, a problem left open in Jaeger's paper. It follows that the computation of t(j, j ²) is of polynomial complexity for a ternary matroid.E. Gioan: C.N.R.S., MontpellierM. Las Vergnas: C.N.R.S., Paris     

Non-stretchable pseudo-visibility graphs

We exhibit a family of graphs which can be realized as pseudo-visibility graphs of pseudo-polygons, but not of straight-line polygons. The example is based on the characterization of vertex-edge pseudo-visibility graphs of O'Rourke and Streinu [Proc. ACM Symp. Comput. Geometry, Nice, France, 1997, pp. 119–128] and extends a recent result of the author [Proc. ACM Symp. Comput. Geometry, Miami Beach, 1999, pp. 274–280] on non-stretchable vertex-edge visibility graphs. We construct a pseudo-visibility graph for which there exists a unique compatible vertex-edge visibility graph, which is then shown to be non-stretchable. The construction is then extended to an infinite family.