We put recent results by Chen, Deng, Du, Stanley and Yan on crossings and nestings of matchings and set partitions in the larger context of the enumeration of fillings of Ferrers shape on which one imposes restrictions on their increasing and decreasing chains. While Chen et al. work with Robinson–Schensted-like insertion/deletion algorithms, we use the growth diagram construction of Fomin to o...

Even with decades of use, there is minimal understanding about the impact that the use of Health Information Technology has on nursing work and workarounds. Reliance on quantitative methods has to some degree constrained our understanding by viewing phenomena from only one perspective. This multimethods research used qualitative data to develop causal loop diagrams and inform a Health Informati...

Diagrams are frequently used to document various components of information systems, from the procedures established for user-system interaction, to the structure of the database at the system’s core. Past research has revealed that diagrams are not always used as effectively as their creators intend. This study proposes a theory of diagrammatic attention management to contribute to the explorat...

It is now nearly 30 years since Peter Chen’s watershed paper “The Entity-Relationship Model – towards a Unified View of Data”. [1] The entity relationship model and variations and extensions to it have been taught in colleges and universities for many years. In his original paper Peter Chen looked at converting his new ER model to the then existing data structure diagrams for the Network model....

We present comparisons of theoretical and simulation results for static and dynamical correlation functions for a very simple model of attractive colloidal systems, the short-ranged square-well potential. In the region of the phase diagram investigated, the system displays slow (glassy) dynamics. In particular, we compare the static structure factor calculated by Percus–Yevick closure versus th...

Using the structure of a KZ-monad we create a general categorical workspace in which diagrams can be formally constructed. In particular this abstract framework of category theory is shown to provide a precise semantics for constructing the speciications of complex systems from their component parts.

Walks on Young’s lattice of integer partitions encode many objects of algebraic and combinatorial interest. Chen et al. established connections between such walks and arc diagrams. We show that walks that start at ∅, end at a row shape, and only visit partitions of bounded height are in bijection with a new type of arc diagram – open diagrams. Remarkably two subclasses of open diagrams are equi...