The LP Relaxation Orthogonal Array Polytope and Its Permutation Symmetries

Authors

Andrew J. Geyer, Air Force Institute of Technology
Dursun A. Bulutoglu, Air Force Institute of TechnologyFollow
Steven J. Rosenberg, University of Wisconsin - Superior

Document Type

Article

Publication Date

11-2014

Abstract

Symmetry plays a fundamental role in design of experiments. In particular, symmetries of factorial designs that preserve their statistical properties are exploited to find designs with the best statistical properties. By using a result proved by Rosenberg [6], the concept of the LP relaxation orthogonal array polytope is developed and studied. A complete characterization of the permutation symmetry group of this polytope is made. Also, this characterization is verified computationally for many cases. Finally, a proof is provided.

Comments

The "Link to Full Text" button on this page loads the open access e-print version of the article at the arXiv.org e-print repository [Combinatorics collection].

The published version of record appeared in the Journal of Combinatorial Mathematics and Combinatorial Computing : JCMCC, as cited below. The journal may not have a digital edition published at this time.

DOI

arxiv:1503.03910

Source Publication

Journal of Combinatorial Mathematics and Combinatorial Computing : JCMCC (ISSN 0835-3026)

Recommended Citation

Linked version: arXiv:1503.03910 [math.CO]

Version of Record: Geyer, A. J., Bulutoglu, D. A., & Rosenberg, S. J. (2014). The LP relaxation orthogonal array polytope and its permutation symmetries. Journal of Combinatorial Mathematics and Combinatorial Computing : JCMCC, 91, 165–176.