In [3], Bautista and Salmeron explained how, given a finite quiver Z without double arrows or oriented cycles, certain sets of subsets of ZZ (called (P)-generating systems) may, under appropriate conditions, generate algebras whose preprojective components can be embedded in ZZ in a nice way, and which are (P)-algebras [2] whenever they are representation-finite. Here, we define numerical funct...

Labelled Markov processes are continuous-state fully probabilistic labelled transition systems. They can be seen as co-algebras of a suitable monad on the category of measurable space. The theory as developed so far included a treatment of bisimulation, logical characterization of bisimulation, weak bisimulation, metrics, universal domains for LMPs and approximations. Much of the theory involve...

A labelled Markov process (LMP) consists of a measurable space S together with an indexed family of Markov kernels from S to itself. This structure has been used to model probabilistic computations in Computer Science, and one of the main problems in the area is to define and decide whether two LMP S and S′ “behave the same”. There are two natural categorical definitions of sameness of behavior...

A procedure for Stable Isotope Dilution Analysis in molecular Mass Spectrometry which does not require a methodological calibration graph and can be applied in combination with minimal labelling has been evaluated. This alternative approach is based on the determination of the molar fractions for each pure isotope pattern (natural abundance or labelled) contributing to the isotope pattern obser...

We obtain explicit formulas for the enumeration of labelled parallelogram polyominoes. These are the polyominoes that are bounded, above and below, by northeast lattice paths going from the origin to a point (k, n). The numbers from 1 to n (the labels) are bijectively attached to the n north steps of the above-bounding path, with the condition that they appear in increasing values along consecu...