In this paper, an efficient algorithm to implement loop partitioning is introduced and evaluated. We start from results of Agarwal et al. [1] whose aim is to minimize the number of...
Most efforts to combine formal methods and software testing go in the direction of exploiting formal methods to solve testing problems, most commonly test case generation. Here we ...
The notion of noncrossing linked partition arose from the study of certain transforms in free probability theory. It is known that the number of noncrossing linked partitions of [...
William Y. C. Chen, Susan Y. J. Wu, Catherine H. Y...
We introduce a statistic pmaj(P) for partitions of [n], and show that it is equidistributed with cr2, the number of 2-crossings, over all partitions of [n] with given sets of mini...
William Y. C. Chen, Ira M. Gessel, Catherine H. Ya...
We prove several results dealing with various counting functions for partitions of an integer into four squares of equal parity. Some are easy consequences of earlier work, but tw...