Random Latin squares and Sudoku designs generation

Uniform random generation of Latin squares is a classical problem. In this paper we prove that both Latin squares and Sudoku designs are maximum cliques of properly defined graphs. We have developed a simple algorithm for uniform random sampling of Latin squares and Sudoku designs. It makes use of recent tools for graph analysis. The corresponding SAS code is annexed

Generation of Fractional Factorial Designs

The joint use of counting functions, Hilbert basis and Markov basis allows to define a procedure to generate all the fractions that satisfy a given set of constraints in terms of orthogonality. The general case of mixed level designs, without restrictions on the number of levels of each factor (like primes or power of primes) is studied. This new methodology has been experimented on some significant classes of fractional factorial designs, including mixed level orthogonal arrays.Comment: 27 page

Incentives and uncertainty: an empirical analysis of the impact of demand on innovation

demand, product innovation, process innovation