Hilbert Bases for Orthogonal Arrays

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

In this paper, we relate the problem of generating all 2-level orthogonal arrays of given dimension and force, i.e. elements in OA$(n,m)$, where $n$ is the number of factors and $m$ the force, to the solution of an Integer Programming problem involving rational convex cones. We do not restrict the number of points in the array, i.e. we admit any number of replications. This problem can be theoretically solved by means of Hilbert bases which form a finite generating set for all the elements in in the infinite set OA$(n,m)$. We discuss some examples which are explicitly solved with a software performing Hilbert bases computation.

Keywords

Statistics Theory, Combinatorics

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/131245

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/math/0611276
 http://arxiv.org/abs/math/0611276

Collections

arXiv