A regular decomposition of the edge-product space of phylogenetic trees

We investigate the topology and combinatorics of a topological space called the edge-product space that is generated by the set of edge-weighted finite labelled trees. This space arises by multiplying the weights of edges on paths in trees, and is closely connected to tree-indexed Markov processes in molecular evolutionary biology. In particular, by considering combinatorial properties of the Tuffley poset of labelled forests, we show that the edge-product space has a regular cell decomposition with face poset equal to the Tuffley poset.     

Homotopy Type of Intervals of the Second Higher Bruhat Orders

The higher Bruhat order is a poset generalizing the weak order on permutations. Another special case of this poset is an ordering on simple wiring diagrams. For this case, we prove that every interval is either contractible or homotopy equivalent to a sphere. This partially proves a conjecture due to Reiner. Our proof uses some tools developed by Felsner and Weil to study wiring diagrams.     

Two-dimensional quotients of C<Superscript>n</Superscript> are isomorphic to C<Superscript>2</Superscript>/Γ

We will prove that any two-dimensional quotient of an affine space modulo a reductive algebraic group is isomorphic to a quotient of C² modulo a finite group. The proof uses some new results due to Koras and Russell on contractible surfaces with at most quotient singularities and also several results about reductive group actions on affine varieties.     

The lumpability property for a family of Markov chains on poset block structures

We construct different classes of lumpings for a family of Markov chain products which reflect the structure of a given finite poset. We essentially use combinatorial methods. We prove that, for such a product, every lumping can be obtained from the action of a suitable subgroup of the generalized wreath product of symmetric groups, acting on the underlying poset block structure, if and only if the poset defining the Markov process is totally ordered, and one takes the uniform Markov operator in each factor state space. Finally we show that, when the state space is a homogeneous space associated with a Gelfand pair, the spectral analysis of the corresponding lumped Markov chain is completely determined by the decomposition of the group action into irreducible submodules.     

Combinatorics of Thin Posets: Application to Monotone Covering Properties

A class of posets, called thin posets, is introduced, and it is shown that every thin poset can be covered by a finite family of trees. This fact is used to show that (within ZFC) every separable monotonically Menger space is first countable. This contrasts with the previously known fact that under CH there are countable monotonically Lindelöf spaces which are not first countable.     

The rank-generating functions of upho posets

Upper homogeneous finite type (upho) posets are a large class of partially ordered sets with the property that the principal order filter at every vertex is isomorphic to the whole poset. Well-known examples include k-ary trees, the grid graphs, and the Stern poset. Very little is known about upho posets in general. In this paper, we construct upho posets with Schur-positive Ehrenborg quasisymmetric functions, whose rank-generating functions have rational poles and zeros. We also categorize the rank-generating functions of all planar upho posets. Finally, we prove the existence of an upho poset with an uncomputable rank-generating function.     

偏序集的零调性与可缩性

本文将给出偏序集零调与可缩的几个充分条件，它们包含和深化了文［１］和［２］中的一些结果，把［２］中的一些结果推广到无限偏序集的情形．     

Every finite complex is the classifying space for proper bundles of a virtual Poincaré duality group

We prove that every finite connected simplicial complex is homotopy equivalent to the quotient of a contractible manifold by proper actions of a virtually torsion-free group. As a corollary, we obtain that every finite connected simplicial complex is homotopy equivalent to the classifying space for proper bundles of some virtual Poincaré duality group.     

Homotopy type of the boolean complex of a Coxeter system

In any Coxeter group, the set of elements whose principal order ideals are boolean forms a simplicial poset under the Bruhat order. This simplicial poset defines a cell complex, called the boolean complex. In this paper it is shown that, for any Coxeter system of rank n, the boolean complex is homotopy equivalent to a wedge of (n−1)-dimensional spheres. The number of such spheres can be computed recursively from the unlabeled Coxeter graph, and defines a new graph invariant called the boolean number. Specific calculations of the boolean number are given for all finite and affine irreducible Coxeter systems, as well as for systems with graphs that are disconnected, complete, or stars. One implication of these results is that the boolean complex is contractible if and only if a generator of the Coxeter system is in the center of the group.     

The orbit space of the p-subgroup complex is contractible

We show that the quotient space of the p-subgroup complex of a finite group by the action of the group is contractible. This was conjectured by Webb. Received: June 28, 1996     

Stratifications on the Ran Space

We describe a partial order on finite simplicial complexes. This partial order provides a poset stratification of the product of the Ran space of a metric space and the nonnegative real numbers, through the ?ech simplicial complex. We show that paths in this product space respecting its stratification induce simplicial maps between the endpoints of the path.

     

Hyperplane arrangements with a lattice of regions

A hyperplane arrangement is a finite set of hyperplanes through the origin in a finite-dimensional real vector space. Such an arrangement divides the vector space into a finite set of regions. Every such region determines a partial order on the set of all regions in which these are ordered according to their combinatorial distance from the fixed base region.We show that the base region is simplicial whenever the poset of regions is a lattice and that conversely this condition is sufficient for the lattice property for three-dimensional arrangements, but not in higher dimensions. For simplicial arrangements, the poset of regions is always a lattice.In the case of supersolvable arrangements (arrangements for which the lattice of intersections of hyperplanes is supersolvable), the poset of regions is a lattice if the base region is suitably chosen. We describe the geometric structure of such arrangements and derive an expression for the rank-generating function similar to a known one for Coxeter arrangements. For arrangements with a lattice of regions we give a geometric interpretation of the lattice property in terms of a closure operator defined on the set of hyperplanes.The results generalize to oriented matroids. We show that the adjacency graph (and poset of regions) of an arrangement determines the associated oriented matroid and hence in particular the lattice of intersections.The work of Anders Björner was supported in part by a grant from the NSF. Paul Edelman's work was supported in part by NSF Grants DMS-8612446 and DMS-8700995. The work of Günter Ziegler was done while he held a Norman Levinson Graduate Fellowship at MIT.     

On a Subposet of the Tamari Lattice

We explore some of the properties of a subposet of the Tamari lattice introduced by Pallo, which we call the comb poset. We show that a number of binary functions that are not well-behaved in the Tamari lattice are remarkably well-behaved within an interval of the comb poset: rotation distance, meets and joins, and the common parse words function for a pair of trees. We relate this poset to a partial order on the symmetric group studied by Edelman.     

Groups acting on finite dimensional spaces with finite stabilizers

It is shown that every H -group G of type admits a finite dimensional G-CW-complex X with finite stabilizers and with the additional property that for each finite subgroup H, the fixed point subspace X ^H is contractible. This establishes conjecture (5.1.2) of [9]. The construction of X involves joining a family of spaces parametrized by the poset of non-trivial finite subgroups of G and ultimately relies on the theorem of Cornick and Kropholler that if M is a -module which is projective as a -module for all finite then M has finite projective dimension. Received: April 30, 1997     

關於Borsuk的絕對同倫擴充性質的討論

<正> 序言.在同倫論中,常常需要考慮滿足這種性質的拓撲空間X設Y為任意的一個正規空間,B為Y的任何一個非空閉集,任何一個由B×(0,1)+Y×(0)到X的映像都可以扩充為一個由Y×(0,1)到X的映像,我們稱這種性質為絕對同倫扩充性質,具有這種性質的空間以及用AHE表示.Borsuk曾經介紹這樣一個重要的定理:     

Sémantique de type Kripke d'un système logique basé sur un ensemble ordonné fini

In order to modelize the reasoning of intelligent agents represented by a poset T, H. Rasiowa introduced logic systems called “Approximation Logics”. In these systems the use of a set of constants constitutes a fundamental tool. We have introduced in [8] a logic system called without this kind of constants but limited to the case that T is a finite poset. We have proved a completeness result for this system w.r.t. an algebraic semantics. We introduce in this paper a Kripke‐style semantics for a subsystem of for which there existes a deduction theorem. The set of “possible worldsr is enriched by a family of functions indexed by the elements of T and satisfying some conditions. We prove a completeness result for system with respect to this Kripke semantics and define a finite Kripke structure that characterizes the propositional fragment of logic . We introduce a reational semantics (found by E. Orlowska) which has the advantage to allow an interpretation of the propositionnal logic using only binary relations. We treat also the computational complexity of the satisfiability problem of the propositional fragment of logic .     

Abel群的一些分解定理的推广(Ⅱ)

本文讨论了2类具体的主理想整环上的拟循环模,研究了A-宽有限的向量空间,刻画了该类向量空间的结构,阐述了A-宽有限的向量空间的A-不变子空间构成的偏序集必满足极小条件,并给出了带有线性变换的向量空间作为F[λ]-模构成拟循环模的一个充要条件.     

Cutsets and anti-chains in linear lattices

Consider the poset, ordered by inclusion, of subspaces of a four-dimensional vector space over a field with 2 elements. We prove that, for this poset, any cutset (i.e., a collection of elements that intersects every maximal chain) contains a maximal anti-chain of the poset. In analogy with the same result by Duffus, Sands, and Winkler [D. Duffus, B. Sands, P. Winkler, Maximal chains and anti-chains in Boolean lattices, SIAM J. Discrete Math. 3 (2) (1990) 197-205] for the subset lattice, we conjecture that the above statement holds in any dimension and for any finite base field, and we prove some special cases to support the conjecture.     

The dimension of planar posets

A partially ordered set (poset) is planar if it has a planar Hasse diagram. The dimension of a bounded planar poset is at most two. We show that the dimension of a planar poset having a greatest lower bound is at most three. We also construct four-dimensional planar posets, but no planar poset with dimension larger than four is known. A poset is called a tree if its Hasse diagram is a tree in the graph-theoretic sense. We show that the dimension of a tree is at most three and give a forbidden subposet characterization of two-dimensional trees.     

Prime, irreducible elements and coatoms in posets

In this paper, some properties of prime elements, pseudoprime elements, irreducible elements and coatoms in posets are investigated. We show that the four kinds of elements are equivalent to each other in finite Boolean posets. Furthermore, we demonstrate that every element of a finite Boolean poset can be represented by one kind of them. The example presented in this paper indicates that this result may not hold in every finite poset, but all the irreducible elements are proved to be contained in each order generating set. Finally, the multiplicative auxiliary relation on posets and the notion of arithmetic poset are introduced, and some properties about them are generalized to posets.