Multiplically independent word systems
Abstract: Tressler's Theorem states that the long-standing Hadamard conjecture (concerning the existence of n by n orthogonal matrices with elements of the same absolute value, for n=4k, k=1,2,...) will be settled if we find n-2 pairwise orthogonal words in a hyperplane of words. In this paper we will prove the counterpart of Tressler's Theorem: the existence of n-2 multiplically independent words in a hyperplane of words.
Category 1: Combinatorial Optimization (Other )
Citation: Unpublished, Operations Research Report 2011-02, Eötvös Loránd University, Budapest, September 2011.
Entry Submitted: 11/01/2011
Modify/Update this entry
|Visitors||Authors||More about us||Links|
Search, Browse the Repository
Give us feedback
|Optimization Journals, Sites, Societies|