Large Sets of Nearly Orthogonal Vectors
نویسندگان
چکیده
It is shown that there is an absolute positive constant δ > 0, so that for all positive integers k and d, there are sets of at least d log2(k+2)/ log2 log2(k+2) nonzero vectors in R, in which any k+ 1 members contain an orthogonal pair. This settles a problem of Füredi and Stanley.
منابع مشابه
Sets with many pairs of orthogonal vectors over finite fields
Let n be a positive integer and B be a non-degenerate symmetric bilinear form over Fq , where q is an odd prime power and Fq is the finite field with q elements. We determine the largest possible size of a subset S of Fq such that |{B(x,y) |x,y ∈ S and x 6= y}| = 1. We also pose some conjectures concerning nearly orthogonal subsets of Fq where a nearly orthogonal subset T of Fq is a set of vect...
متن کاملOn Nearly Orthogonal Lattice Bases and Random Lattices
We study lattice bases where the angle between any basis vector and the linear subspace spanned by the other basis vectors is at least π 3 radians; we denote such bases as “nearly orthogonal.” We show that a nearly orthogonal lattice basis always contains a shortest lattice vector. Moreover, we prove that if the basis vector lengths are “nearly equal,” then the basis is the unique nearly orthog...
متن کاملOn Nearly Orthogonal Lattice Bases
We study ”nearly orthogonal” lattice bases, or bases where the angle between any basis vector and the linear subspace spanned by the other basis vectors is greater than π 3 radians. We show that a nearly orthogonal lattice basis always contains a shortest lattice vector. Moreover, if the lengths of the basis vectors are “nearly equal”, then the basis is the unique nearly orthogonal lattice basi...
متن کاملIncremental Learning of Locally Orthogonal Subspaces for Set-based Object Recognition
Orthogonal subspaces are effective models to represent object image sets (generally any high-dimensional vector sets). Canonical correlation analysis of the orthogonal subspaces provides a good solution to discriminate objects with sets of images. In such a recognition task involving image sets, an efficient learning over a large volume of image sets, which may be increasing over time, is impor...
متن کاملMinkowski and KZ reduction of nearly orthogonal lattice bases
We prove that if a lattice basis is nearly orthogonal (the angle between any basis vector and the linear subspace spanned by the other basis vectors is at least π3 radians), then a KZ-reduced basis can be obtained from it in polynomial time. We also show that if a nearly orthogonal lattice basis has nearly equal vector lengths (within a certain constant factor of one another), then the basis is...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Graphs and Combinatorics
دوره 15 شماره
صفحات -
تاریخ انتشار 1999