On arithmetic and asymptotic properties of up-down numbers

Let $\sigma=(\sigma_1,..., \sigma_N)$, where $\sigma_i =\pm 1$, and let $C(\sigma)$ denote the number of permutations $\pi$ of $1,2,..., N+1,$ whose up-down signature $\mathrm{sign}(\pi(i+1)-\pi(i))=\sigma_i$, for $i=1,...,N$. We prove that the set of all up-down numbers $C(\sigma)$ can be expressed by a single universal polynomial $\Phi$, whose coefficients are products of numbers from the Taylor series of the hyperbolic tangent function. We prove that $\Phi$ is a modified exponential, and deduce some remarkable congruence properties for the set of all numbers $C(\sigma)$, for fixed $N$. We prove a concise upper-bound for $C(\sigma)$, which describes the asymptotic behaviour of the up-down function $C(\sigma)$ in the limit $C(\sigma) \ll (N+1)!$.Comment: Recommended for publication in Discrete Mathematics subject to revision

Using Canonical Forms for Isomorphism Reduction in Graph-based Model Checking

Graph isomorphism checking can be used in graph-based model checking to achieve symmetry reduction. Instead of one-to-one comparing the graph representations of states, canonical forms of state graphs can be computed. These canonical forms can be used to store and compare states. However, computing a canonical form for a graph is computationally expensive. Whether computing a canonical representation for states and reducing the state space is more efficient than using canonical hashcodes for states and comparing states one-to-one is not a priori clear. In this paper these approaches to isomorphism reduction are described and a preliminary comparison is presented for checking isomorphism of pairs of graphs. An existing algorithm that does not compute a canonical form performs better that tools that do for graphs that are used in graph-based model checking. Computing canonical forms seems to scale better for larger graphs