The bondage number $b(G)$ of a graph $G$ is the smallest number of edges
whose removal from $G$ results in a graph with larger domination number.
Recently Gagarin and Zverovich [ArXiv: 1012.4117] showed that, for a graph $G$
with maximum degree $\Delta(G)$ and embeddable on an orientable surface of
genus $h$ and a non-orientable surface of genus $k$,
$b(G)\leq\min\{\Delta(G)+h+2,\Delta+k+1\}$.
In this paper we prove instances of the cyclic sieving phenomenon for finite
Grassmannians and partial flag varieties, which carry the action of various
tori in the finite general linear group GL_n(F_q). The polynomials involved are
sums of certain weights of the minimal length parabolic coset representatives
of the symmetric group S_n, where the weight of a coset representative can be
written as a product over its inversions.
We report on a transformation from Sequential Function Charts of the IEC
61131-3 standard to BIP. Our presentation features a description of formal
syntax and semantics representation of the involved languages and
transformation rules. Furthermore, we present a formalism for describing
invariants of IEC 61131-3 systems and establish a notion of invariant
preservation between the two languages. For a subset of our transformation
rules we sketch a proof showing invariant preservation during the
transformation of IEC 61131-3 to BIP and vice versa.