Related papers: Vector spaces as unions of proper subspaces
We introduce and explore a new concept of evasive subspace with respect to a collection of subspaces sharing a common dimension, most notably partial spreads. We show that this concept generalises known notions of subspace scatteredness and…
Compact sets in constructive mathematics capture our intuition of what computable subsets of the plane (or any other complete metric space) ought to be. A good representation of compact sets provides an efficient means of creating and…
In a complete metric space that is equipped with a doubling measure and supports a Poincar\'e inequality, we study strict subsets, i.e. sets whose variational capacity with respect to a larger reference set is finite, in the case $p=1$.…
All rational parametric curves with prescribed polynomial tangent direction form a vector space. Via tangent directions with rational norm, this includes the important case of rational Pythagorean hodograph curves. We study vector subspaces…
Answering connectivity queries in real algebraic sets is a fundamental problem in effective real algebraic geometry that finds many applications in e.g. robotics where motion planning issues are topical. This computational problem is…
We show that every orbispace satisfying certain mild hypotheses has 'enough' vector bundles. It follows that the K-theory of finite rank vector bundles on such orbispaces is a cohomology theory. Global presentation results for smooth…
In this paper, we investigate the problem of covering the vertices of a graph associated to a finite vector space as introduced by Das \cite{Das}, such that we can uniquely identify any vertex by examining the vertices that cover it. We use…
Scalarization method is an important tool in the study of vector optimization as corresponding solutions of vector optimization problems can be found by solving scalar optimization problems. This is applied by Du (2010) [A note on cone…
Subspace varieties are algebraic varieties whose elements are tensors with bounded multilinear rank. In this paper, we compute their degrees by computing their volumes.
We give necessary and sufficient conditions for the sum of n subspaces of a Hilbert space to be closed. We also present various properties of n-tuples of subspaces with closed sum.
In this paper we describe an approach to construct large extendable collections of vectors in predefined spaces of given dimensions. These collections are useful for neural network latent space configuration and training. For classification…
This paper studies approximate solutions of a linear fractional vector optimization problem without requiring boundedness of the constraint set. We establish necessary and sufficient conditions for approximating weakly efficient points of…
Let $k$ be a perfect field and let $X\subset {\mathbb P}^N$ be a hypersurface of degree $d$ defined over $k$ and containing a linear subspace $L$ defined over an algebraic closure $\overline{k}$ with $\mathrm{codim}_{{\mathbb P}^N}L=r$. We…
This article emphasizes an extension of the study of metric and par- tition dimension to hypergraphs. We give a sharp lower bounds for the metric and partition dimension of hypergraphs in general and give exact values under specified…
We provide a sufficient condition for a finite number of closed subspaces of a Hilbert space to be linearly independent and their sum to be closed. Under this condition a formula for the orthogonal projection onto the sum is given. We also…
Mapping spaces of supermanifolds are usually thought as exclusively in functorial terms (i.e. trough the Grothendieck functor of points). In this work we provide a geometric description of such mapping spaces in terms of…
The first half of this dissertation reviews the basic notion of vector-valued modular forms and its connection to differential equations. The main purpose of the dissertation is to classify spaces of vector-valued modular forms associated…
A vector-circulant matrix is a natural generalization of the classical circulant matrix and has applications in constructing additive codes. This article formulates the concept of a vector-circulant matrix over finite fields and gives an…
A matching in a graph is uniquely restricted if no other matching covers exactly the same set of vertices. We establish tight lower bounds on the maximum size of a uniquely restricted matching in terms of order, size, and maximum degree.
We consider the covering of a ball in certain normed spaces by its congruent subsets and show that if the finite number of sets is not greater than the dimensionality of the space, then the centre of the ball either belongs to the interior…