An Analogue of Distributivity for Ungraded Lattices

In this paper, we study lattices that posess both the properties of being extremal (in the sense of Markowsky) and of being left modular (in the sense of Blass and Sagan). We call such lattices trim and show that they posess some additional appealing properties, analogous to those of a distributive lattice. For example, trimness is preserved under taking intervals and suitable sublattices. Trim lattices satisfy a weakened form of modularity. The order complex of a trim lattice is contractible or homotopic to a sphere; the latter holds exactly if the maximum element of the lattice is a join of atoms. Any distributive lattice is trim, but trim lattices need not be graded. The main example of ungraded trim lattices are the Tamari lattices and generalizations of them. We show that the Cambrian lattices in types A and B defined by Reading are trim; we conjecture that all Cambrian lattices are trim.     

A possible counterexample to well posedness of entropy solutions and to Godunov scheme convergence

A particular case of initial data for the two-dimensional Euler equations is studied numerically. The results show that the Godunov method does not always converge to the physical solution, at least not on feasible grids. Moreover, they suggest that entropy solutions (in the weak entropy inequality sense) are not well posed.

     

Reference values for drag and lift of a two‐dimensional time‐dependent flow around a cylinder

This paper presents a numerical study of a two‐dimensional time‐dependent flow around a cylinder. Its main objective is to provide accurate reference values for the maximal drag and lift coefficient at the cylinder and for the pressure difference between the front and the back of the cylinder at the final time. In addition, the accuracy of these values obtained with different time stepping schemes and different finite element methods is studied. Copyright © 2004 John Wiley & Sons, Ltd.     

New Combinatorial Descriptions of the Triangulations of Cyclic Polytopes and the Second Higher Stasheff–Tamari Posets

This paper is concerned with the d-dimensional cyclic polytope with n vertices, C(n,d), and the set of its triangulations, S(n,d). We show that there is a bijection between S(n,d) and certain partitions of the set of increasing d-tuples on the integers 1 to n–1. We give a combinatorial characterization of the second higher Stasheff–Tamari poset, which is a partial ordering of S(n,d), and we determine its 2-dimension. There is a well-known representation of triangulations of an n-gon by right bracket vectors. We generalize this to cyclic polytopes of higher dimensions.     

Mesophase behaviour of 2,5-dibenzoyloxy-p-benzoquinone derivatives and tetrahydrobenzene tetraesters

The synthesis of 2,5-dibenzoyloxy-p-benzoquinone derivatives, their products after reduction and tetraesters from tetrahydroxybenzene prepared from those products is described. Their phase behaviour was investigated by differential scanning calorimetry and polarizing microscopy and is discussed in terms of their detailed structure.     

Local solution for the Kadomtsev-Petviashvili equation with periodic conditions

In this article we prove a local existence and uniqueness theorem for the Kadomtsev-Petviashvili Equation (u _t +u _xxx +uu _x ) _x −u _yy =0) in the Sobolev spaces of orders≥3, with initial values in the same spaces, and periodic boundary conditions. This theorem improves previous results based upon the application of singular perturbation techniques.     

Simultaneous Pseudo-Timestepping for PDE-Model Based Optimization Problems

In this paper we present a new method for the solution of optimization problems with PDE constraints. It is based on simultaneous pseudo-time stepping for evolution equations. The new method can be viewed as a continuous reduced SQP method in the sense that it uses a preconditioner derived from that method. The reduced Hessian in the preconditioner is approximated by a pseudo-differential operator, whose symbol can be investigated analytically. We apply our method to a boundary control model problem. The new optimization method needs 3.2-times the overall computational effort of the solution of simulation problem alone.