相关论文: A short survey on almost orthogonal vectors in a f…

In this paper, we will discuss the notion of almost orthogonality in a functional sequence.Especially, we will define a few sequences of almost orthogonal polynomials which can be used successfully for modeling of electronic systems which…

The convex closure of entropy vectors for quasi-uniform random vectors is the same as the closure of the entropy region. Thus, quasi-uniform random vectors constitute an important class of random vectors for characterizing the entropy…

In this paper we explore the "vector semantics" problem from the perspective of "almost orthogonal" property of high-dimensional random vectors. We show that this intriguing property can be used to "memorize" random vectors by simply adding…

We prove various results on the size and structure of subsets of vector spaces over finite fields which, in some sense, have too many mutually orthogonal pairs of vectors. In particular, we obtain sharp finite field variants of a theorem of…

Orthogonal arrays play a fundamental role in many applications. However, constructing orthogonal arrays with the required parameters for an application usually is extremely difficult and, sometimes, even impossible. Hence there is an…

This work aims to numerically construct exactly commuting matrices close to given almost commuting ones, which is equivalent to the joint approximate diagonalization problem. We first prove that almost commuting matrices generically have…

Computing many eigenpairs of the Schr{\"o}dinger operator presents a computational bottleneck in large-scale quantum simulations due to the global communication overhead of explicit orthogonalization. To address this issue, we propose a…

In this paper, we consider low-degree polynomials of inner products between a collection of random vectors. We give an almost orthogonal basis for this vector space of polynomials when the random vectors are Gaussian, spherical, or Boolean.…

We study the problem of compression for the purpose of similarity identification, where similarity is measured by the mean square Euclidean distance between vectors. While the asymptotical fundamental limits of the problem - the minimal…

We bound the number of nearly orthogonal vectors with fixed VC-dimension over $\setpm^n$. Our bounds are of interest in machine learning and empirical process theory and improve previous bounds by Haussler. The bounds are based on a simple…

We consider a similarity measure between two sets $A$ and $B$ of vectors, that balances the average and maximum cosine distance between pairs of vectors, one from set $A$ and one from set $B$. As a motivation for this measure, we present…

We introduce $\varepsilon$-approximate versions of the notion of Euclidean vector bundle for $\varepsilon \geq 0$, which recover the classical notion of Euclidean vector bundle when $\varepsilon = 0$. In particular, we study \v{C}ech…

We consider a 3-dimensional Riemannian manifold V with a metric g and an affinor structure q. The local coordinates of these tensors are circulant matrices. In V we define an almost conformal transformation. Using that definition we…

This article investigates the interplay of rounding objective coefficients in binary programs and almost symmetries. Empirically, reducing the number of significant bits through rounding often leads to instances that are easier to solve.…

Motivated by a model in quantum computation we study orthogonal sets of integral vectors of the same norm that can be extended with new vectors keeping the norm and the orthogonality. Our approach involves some arithmetic properties of the…

We introduce a rotation-invariant representation of planar shapes. In particular, this representation encodes shapes as vectors such that the Euclidean distance between them serves as a valid shape distance. For standardized, star-shaped…

Nearly orthogonal lattices were formally defined in [4], where their applications to image compression were also discussed. The idea of ``near orthogonality" in $2$-dimensions goes back to the work of Gauss. In this paper, we focus on…

We introduce the notion of quasi-orthogonal cocycle. This is motivated in part by the maximal determinant problem for square $\{\pm 1\}$-matrices of size congruent to $2$ modulo $4$. Quasi-orthogonal cocycles are analogous to the orthogonal…

We fully characterize orthogonal projections of infinite right circular (round) cones in real Hilbert spaces. Another interpretation is that, given two vectors in a real Hilbert space, we establish the optimal estimate on the angle between…

In this paper, we define vector bundles within the framework of almost mathematics (referred to as almost vector bundles) and establish the $v$-descent theorem together with a structure theorem for these bundles over perfectoid spaces. The…