Related papers: Characterization of vector spaces by isomorphisms
Theories of classification distinguish classes with some good structure theorem from those for which none is possible. Some classes (dense linear orders, for instance) are non-classifiable in general, but are classifiable when we consider…
We study the relationship between many natural conditions that one can put on a diffeological vector space: being fine or projective, having enough smooth (or smooth linear) functionals to separate points, having a diffeology determined by…
We propose a neural embedding algorithm called Network Vector, which learns distributed representations of nodes and the entire networks simultaneously. By embedding networks in a low-dimensional space, the algorithm allows us to compare…
Distributed word vector spaces are considered hard to interpret which hinders the understanding of natural language processing (NLP) models. In this work, we introduce a new method to interpret arbitrary samples from a word vector space. To…
On the one hand the algebras of linear operators here act on finite-dimensional vector spaces, and on the other hand the point of view is generally an analysts'. Also, one might think of algebras as being used to add more data to basic…
We expand the basic geometric elements of the simplex method to linear programs in locally convex topological vector spaces and provide conditions under which the method converges in value to optimality. This setting generalizes many…
In the high-energy quantum-physics literature one finds statements such as "matrix algebras converge to the sphere". Earlier I provided a general precise setting for understanding such statements, in which the matrix algebras are viewed as…
We prove identities generating higher dimensional vector partitions. We derive theorems for integer lattice points in the 2D first quadrant, then generalize the approach to find 3D and $n$-space lattice point vector region extensions. We…
We define linear and semilinear isometry for general subspace codes, used for random network coding. Furthermore, some results on isometry classes and automorphism groups of known constant dimension code constructions are derived.
Distributed representations of words and paragraphs as semantic embeddings in high dimensional data are used across a number of Natural Language Understanding tasks such as retrieval, translation, and classification. In this work, we…
We propose the extension of the complex numbers to be the new domain where new concepts, like negative and imaginary probabilities, can be defined. The unit of the new space is defined as the solution of the unsolvable equation in the…
We classify all isomorphisms between moduli stacks of vector bundles of fixed determinant on a smooth complex projective of genus at least 4. It is shown that each isomorphism between two different moduli stacks can be described as a…
Motivated by some recent developments in abstract theories of quadratic forms, we start to develop in this work an expansion of Linear Algebra to multivalued structures (a multialgebraic structure is essentially an algebraic structure but…
Modules over a vertex operator algebra V give rise to sheaves of coinvariants on moduli of stable pointed curves. If V satisfies finiteness and semi-simplicity conditions, these sheaves are vector bundles. This relies on factorization, an…
Given a geometrically irreducible smooth projective curve of genus 1 defined over the field of real numbers, and a pair of integers r and d, we determine the isomorphism class of the moduli space of semi-stable vector bundles of rank r and…
In this book the authors introduce the notion of DSm vector spaces of refined labels. They also realize the refined labels as a plane and a n-dimensional space. Further, using these refined labels, several algebraic structures are defined.…
In this paper, we will establish a general method of studying finite-dimensional normed spaces, and apply this method to classifying $3$-dimensional and $4$-dimensional normed spaces over a non-spherically complete field. For this purpose,…
This paper establishes that every positive-definite matrix can be written as a positive linear combination of outer products of integer-valued vectors whose entries are bounded by the geometric mean of the condition number and the dimension…
The study of graphs associated with of various algebraic structures is an emerging topic in algebraic graph theory. Recently, the concept of nonzero component graph of a finite dimensional vector space $\Gamma(\mathbb{V})$ was put forward…
Gaussian elimination answers any question about a finitely presented vector space. However, a "uniform family" of such presentations--given as generic relations among an unspecified number of generators--is susceptible to elimination only…