Javascript must be enabled to continue!
The Disprove of the Komlos Conjecture
View through CrossRef
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 n≤5 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 n−1 /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 =+∞.
Title: The Disprove of the Komlos Conjecture
Description:
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 n≤5 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 n−1 /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 =+∞.
Related Results
The Disprove of the Komlos Conjecture
The Disprove of the Komlos Conjecture
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 ) ⃗ ∈R^n with ‖(V...
The Galois Brumer–Stark conjecture for SL2(????3)-extensions
The Galois Brumer–Stark conjecture for SL2(????3)-extensions
In a previous work, we stated a conjecture, called the Galois Brumer–Stark conjecture, that generalizes the (abelian) Brumer–Stark conjecture to Galois extensions. We also proved t...
The Complexity of Mathematics
The Complexity of Mathematics
The strong Goldbach's conjecture states that every even integer greater than 2 can be written as the sum of two primes. The conjecture that all odd numbers greater than 7 are the s...
On aspherical presentations of groups
On aspherical presentations of groups
The Whitehead asphericity conjecture claims that if
⟨
A
‖
R
⟩
\langle \...
Critical Exponents, Colines, and Projective Geometries
Critical Exponents, Colines, and Projective Geometries
In [9, p. 469], Oxley made the following conjecture, which is a geometric analogue of a
conjecture of Lovász (see [1, p. 290]) about complete graphs.Conjecture 1.1.Let G be a rank...
C*-algebraic Bieberbach, Robertson, Lebedev-Milin, Zalcman, Krzyz and Corona Conjectures
C*-algebraic Bieberbach, Robertson, Lebedev-Milin, Zalcman, Krzyz and Corona Conjectures
We study C*-algebraic versions of following conjectures/theorems: (1) Bieberbach conjecture (de Branges theorem) (2) Robertson conjecture (3) Lebedev-Milin conjecture (4) Zalcman c...
DICKSON CONJECTURE PROOF
DICKSON CONJECTURE PROOF
In 1904, Dickson [6] stated a very important conjecture. Now people call it Dickson’s conjecture. In 1958, Schinzel and Sierpinski [3]generalized Dickson’s conjecture to the higher...
Revisiting the refined Distance Conjecture
Revisiting the refined Distance Conjecture
Abstract
The Distance Conjecture of Ooguri and Vafa holds that any infinite-distance limit in the moduli space of a quantum gravity theory must be accompanied ...

