1 December 2010 in Information Processing Letters
28 February 2012 in Mathematical Structures in Computer Science
The concurrency theory literature offers a wealth of examples of characteristic-formula constructions for various behavioural relations over finite labelled transition systems and Kripke structures that are defined in terms of fixed points of suitable functions. Such constructions and their proofs of correctness have been developed independently, but have a common underlying structure. This paper provides a general view of characteristic formulae that are expressed in terms of logics that have a facility for the recursive definition of formulae. We show how several examples of characteristic-formula constructions in the literature can be recovered as instances of the proposed general framework, and how the framework can be used to yield novel constructions. The paper also offers general results pertaining to the definition of co-characteristic formulae and of characteristic formulae expressed in terms of infinitary modal logics.
22 November 2007 in Journal of Logic, Language and Information
27 January 2012 in The Electronic Journal of Combinatorics
We introduce and study new refinements of inversion statistics for permutations, such as $k$-step inversions, (the number of inversions with fixed position differences) and non-inversion sums (the sum of the differences of positions of the non-inversions of a permutation). We also provide a distribution function for non-inversion sums, a distribution function for $k$-step inversions that relates to the Eulerian polynomials, and special cases of distribution functions for other statistics we introduce, such as $(\le\!\!k)$-step inversions and $(k_1,k_2)$-step inversions (that fix the value separation as well as the position). We connect our refinements to other work, such as inversion tops that are $0$ modulo a fixed integer $d$, left boundary sums of paths, and marked meshed patterns. Finally, we use non-inversion sums to show that for every number $n>34$, there is a permutation such that the dot product of that permutation and the identity permutation (of the same length) is $n$.
21 April 2009 in Synthese