Lattices contained in planar orders are planar

The covering graph of a lattice which is contained in an ordered set with a planar covering graph is itself planar.Presented by R. W. Quackenbush.     

Diagrams,orientations, and varieties

One of the central problems in the theory of ordered sets is to describe the orientations of the covering graph of an ordered set. We show that the particular operation called inversion, together with the classical constructions of retraction and product, provide a context for the classification of all such orientations. AMS subject classifications (1980). 06A10, 05C75, 05C20.     

The endomorphism spectrum of an ordered set

Theendomorphism spectrum of an ordered setP, spec(P)={|f(P)|:f End(P)} andspectrum number, sp(P)=max(spec(P)\{|P|}) are introduced. It is shown that |P|>(1/2)n(n – 1) ^{n – 1} implies spec(P) = {1, 2, ...,n} and that if a projective plane of ordern exists, then there is an ordered setP of size 2n ²+2n+2 with spec(P)={1, 2, ..., 2n+2, 2n+4}. Lettingh(n)=max{|P|: sp(P)n}, it follows thatc ₁ n ²h(n)c ₂ n ⁿ⁺¹ for somec ₁ andc ₂. The lower bound disproves the conjecture thath(n)2n. It is shown that if |P| – 1 spec(P) thenP has a retract of size |P| – 1 but that for all there is a bipartite ordered set with spec(P) = {|P| – 2, |P| – 4, ...} which has no proper retract of size|P| – . The case of reflexive graphs is also treated.Partially supported by a grant from the NSERC.Partially supported by a grant from the NSERC.     

Every triangle-free planar graph has a planar upward drawing

A planar ordered set has a triangle-free, planar covering graph; on the other hand, there are nonplanar ordered sets whose covering graphs are planar. We show thatevery triangle-free planar graph has a planar upward drawing. This planar upward drawing can be constructed in time, polynomial in the number of vertices.Our results shed light on the apparently difficult problem, of long-standing, whether there is aneffective planarity-testing procedure for an ordered set.Supported in part by the Alexander von Humboldt Stiftung.Supported in part by the Deutsche Forschungsgemeinschaft.     

Antichain cutsets

A subset A of an ordered set P is a cutset if each maximal chain of P meets A; if, in addition, A is an antichain call it an antichain cutset. Our principal result is a characterization, by means of a forbidden configuration, of those finite ordered sets, which can be expressed as the union of antichain cutsets.     

Assessment of the derivative-moment transformation method for unsteady-load estimation

It is often difficult, if not impossible, to measure the aerodynamic or hydrodynamic forces on a moving body. For this reason, a classical control-volume technique is typically applied to extract the unsteady forces. However, measuring the acceleration term within the volume of interest using particle image velocimetry (PIV) can be limited by optical access, reflections, as well as shadows. Therefore, in this study, an alternative approach, termed the derivative-moment transformation (DMT) method, is introduced and tested on a synthetic data set produced using numerical simulations. The test case involves the unsteady loading of a flat plate in a two-dimensional, laminar periodic gust. The results suggest that the DMT method can accurately predict the acceleration term so long as appropriate spatial and temporal resolutions are maintained. The major deficiency, which is more dominant for the direction of drag, was found to be the determination of pressure and unsteady terms in the wake. The effect of control-volume size was investigated, suggesting that larger domains work best by minimizing the associated error in the determination of the pressure field. When decreasing the control-volume size, wake vortices, which produce high gradients across the control surfaces, are found to substantially increase the level of error. On the other hand, it was shown that for large control volumes, and with realistic spatial resolution, the accuracy of the DMT method would also suffer. Therefore, a delicate compromise is required when selecting control-volume size in future experiments.     

Fixed-edge theorem for graphs with loops

Let G be an undirected graph without multiple edges and with a loop at every vertex—the set of edges of G corresponds to a reflexive and symmetric binary relation on its set of vertices. Then every edge-preserving map of the set of vertices of G to itself fixes an edge [{f(a), f(b)} = {a, b} for some edge (a, b) of G] if and only if (i) G is connected, (ii) G contains no cycles, and (iii) G contains no infinte paths. The proof is conerned with those subgraphs H of a graph G for which there is an edge-preserving map f of the set of vertices of G onto the set of vertices of H and satisfying f(a) = a for each vertex a of H.     

Crooked diagrams with few slopes

A natural and practical criterion in the preparation of diagrams of ordered sets is to minimize the number of different slopes used for the edges. For any diagram this is at least the maximum number of upper covers and of lower covers of any element. While this maximum degree is not always enough we show that it is as long as any edge joining a covering pair may be bent, to produce a crooked diagram.     

Images of simple lattice polynomials

Although lattice polynomials, built from the two binary lattice operations and involving constants of the lattice, are mechanical devices to produce isotone self-maps, there is no order-theoretical property common to all lattice polynomial images. This contrasts with the current fact that little is known about isotone self-maps whose images are not, themselves, lattices. It also shuts out an obvious approach to the conjecture that every order polynomial complete lattice is finite.Presented by R. Freese.     

Order,genus, and diagram invariance

The genus of any ordered set equals the genus of its covering graph, and, therefore, the genus of an ordered set is a diagram invariant.