Related papers: Angles between subspaces and their tangents
Making sense of the physical world has always been at the core of mapping. Up until recently, this has always dependent on using the human eye. Using airborne lasers, it has become possible to quickly "see" more of the world in many more…
We use representation theory to construct spaces of matrices of constant rank. These spaces are parametrized by the natural representation of the general linear group or the symplectic group. We present variants of this idea, with more…
We define a superspace over a ring $R$ as a functor on a subcategory of the category of supercommutative $R$-algebras. As an application the notion of a $p$-adic superspace is introduced and used to give a transparent construction of the…
Data visualisation helps understanding data represented by multiple variables, also called features, stored in a large matrix where individuals are stored in lines and variable values in columns. These data structures are frequently called…
The Mat\'ern model has been a cornerstone of spatial statistics for more than half a century. More recently, the Mat\'ern model has been central to disciplines as diverse as numerical analysis, approximation theory, computational…
We develop the theory of arrangements of spheres. Consider a finite collection of codimension-$1$ subspheres in a positive-dimensional sphere. There are two posets associated with this collection: the poset of faces and the poset of…
In this paper we consider a family of algorithms for approximate implicitization of rational parametric curves and surfaces. The main approximation tool in all of the approaches is the singular value decomposition, and they are therefore…
The goal of the proposed method is to directly obtain a pose matrix of a known rectangular target, without estimation, using geometric techniques. This method is specifically tailored for real-time, extreme imaging setups exceeding…
Sphere-bases are constructed for the $\mathbb{Z}_2$ vector space formed by the $k$-dimensional subcomplexes, of $n$-simplex (or $n$-cube), for which every $(k{-}1)$-face is contained in a positive even number of $k$-cells; addition is…
Tensors are fundamental in mathematics, computer science, and physics. Their study through algebraic geometry and representation theory has proved very fruitful in the context of algebraic complexity theory and quantum information. In…
In this paper, we address two challenging problems in unsupervised subspace learning: 1) how to automatically identify the feature dimension of the learned subspace (i.e., automatic subspace learning), and 2) how to learn the underlying…
In this paper we study constant angle surfaces in Euclidean 3-space. Even that the result is a consequence of some classical results involving the Gauss map (of the surface), we give another approach to classify all surfaces for which the…
In many applications, the data lie on a type of cone, where there is a distinction between an overall scale variable and the remaining scale-free structure. For example, the joint size and shape of objects are points on a cone, where size…
Self-supervised learning algorithms, including BERT and SimCLR, have enabled significant strides in fields like natural language processing, computer vision, and speech processing. However, these algorithms are domain-specific, meaning that…
Permutation group algebras, and their generalizations called permutation centralizer algebras (PCAs), play a central role as hidden symmetries in the combinatorics of large $N$ gauge theories and matrix models with manifest continuous gauge…
Finite geometry is used to underpin finite, $d^2$, dimensional Hilbert space accommodating two particles, d dimensional each. d=prime $\ne2$. Central role is allotted to states with mutual unbiased bases (MUB) labelling underpinned with…
In this paper, tangent-, principal normal-, and binormal-wise associated curves are defined such that each of these vectors of any given curve lies on the osculating, normal, and rectifying plane of its mate, respectively. For each…
We review results of papers written on the topic of polynomial amoebas with an emphasis on computational aspects of the topic. The polynomial amoebas have a lot of applications in various domains of science. Computation of the amoeba for a…
Motivated by applications in robotics and computer vision, we study problems related to spatial reasoning of a 3D environment using sublevel sets of polynomials. These include: tightly containing a cloud of points (e.g., representing an…
Extracting shape information from object bound- aries is a well studied problem in vision, and has found tremen- dous use in applications like object recognition. Conversely, studying the space of shapes represented by curves satisfying…