Preprint
Article

The Disprove of the Komlos Conjecture

Altmetrics

Downloads

1204

Views

1808

Comments

0

This version is not peer-reviewed

Submitted:

26 June 2019

Posted:

09 July 2019

Read the latest preprint version here

Alerts
Abstract
Komlos conjecture is about the existing of a universal constant K such that for all dimension n and any collection of vectors V 1 ,, V n n with V . 2 1 , there are weights ε i { 1,1 } in such that i=1 n ε i V i K( n )K. In this paper, the constant K( n ) is evaluated for n5 to be K( 2 )= 2 , K( 3 )= 2 + 11 3 , K( 4 )= 3 , and K( 5 )= 4+ 142 9 . For higher dimension, the function f( n )= n lo g 2 ( 2 n1 /n ) is found to be the lower bound for the constant K( n ), from where it can be concluded that the Komlos conjecture is false i.e., the universal constant K does not exist because of lim n K( n ) lim n log( n )1 =+.
Keywords: 
Subject: Computer Science and Mathematics  -   Computational Mathematics
Copyright: This open access article is published under a Creative Commons CC BY 4.0 license, which permit the free download, distribution, and reuse, provided that the author and preprint are cited in any reuse.
Prerpints.org logo

Preprints.org is a free preprint server supported by MDPI in Basel, Switzerland.

Subscribe

© 2024 MDPI (Basel, Switzerland) unless otherwise stated