Related papers: GR decompositions and their relations to Cholesky-…
Smolyak's method, also known as hyperbolic cross approximation or sparse grid method, is a powerful tool to tackle multivariate tensor product problems solely with the help of efficient algorithms for the corresponding univariate problem.…
The choice of geometric space for knowledge graph (KG) embeddings can have significant effects on the performance of KG completion tasks. The hyperbolic geometry has been shown to capture the hierarchical patterns due to its tree-like…
Tile low rank representations of dense matrices partition them into blocks of roughly uniform size, where each off-diagonal tile is compressed and stored as its own low rank factorization. They offer an attractive representation for many…
We consider the factorization of a rectangular matrix $X $ into a positive linear combination of rank-one factors of the form $u v^\top$, where $u$ and $v$ belongs to certain sets $\mathcal{U}$ and $\mathcal{V}$, that may encode specific…
Suppose a finitely generated group $G$ is hyperbolic relative to $\mathcal P$ a set of proper finitely generated subgroups of $G$. Established results in the literature imply that a "visual" metric on $\partial (G,\mathcal P)$ is "linearly…
Hyperbolic structures on link complements (equivalently, representations of the fundamental group into $\operatorname{SL}_2(\mathbb{C})$) can be described algebraically by using the octahedral decomposition determined by a link diagram. The…
Recent work has explored solver strategies for the linear system of equations arising from a spectral Galerkin approximation of the solution of PDEs with parameterized (or stochastic) inputs. We consider the related problem of a matrix…
Capturing associations for knowledge graphs (KGs) through entity alignment, entity type inference and other related tasks benefits NLP applications with comprehensive knowledge representations. Recent related methods built on Euclidean…
We investigate non-commutative differential calculus on the supersymmetric version of quantum space where the non-commuting super-coordinates consist of bosonic as well as fermionic (Grassmann) coordinates. Multi-parametric quantum…
We propose a unified description for the constants of motion for superintegrable deformations of the oscillator and Coulomb systems on N-dimensional Euclidean space, sphere and hyperboloid. We also consider the duality between these…
The $k$-core decomposition is a widely studied summary statistic that describes a graph's global connectivity structure. In this paper, we move beyond using $k$-core decomposition as a tool to summarize a graph and propose using $k$-core…
The correspondence between linear codes and representable matroids is well known. But a similar correspondence between quantum codes and matroids is not known. We show that representable symplectic matroids over a finite field…
We present a renormalization group (RG) procedure which works naturally on a wide class of interacting one-dimension models based on perturbed (possibly strongly) continuum conformal and integrable models. This procedure integrates Kenneth…
In the Graph Reconstruction (GR) problem, the goal is to recover a hidden graph by utilizing some oracle that provides limited access to the structure of the graph. The interest is in characterizing how strong different oracles are when the…
We investigate hexatic membranes embedded in Euclidean D-dimensional space using a reparametrization invariant formulation combined with exact renormalization group (RG) equations. An XY-model coupled to a fluid membrane, when integrated…
The Discontinuous Galerkin (DG) method applied to hyperbolic differential equations outputs weakly-linked polynomial pieces. Post-processing these pieces by Smoothness-Increasing Accuracy-Conserving (SIAC) convolution with B-splines can…
Let $E/\mathbb{Q}$ be an elliptic curve and let $\rho_E \colon \operatorname{Gal}(\overline{\mathbb{Q}}/\mathbb{Q}) \to \operatorname{GL}(2, \widehat{\mathbb{Z}})$ be the adelic Galois representation attached to $E$. We describe and…
The manuscript describes efficient algorithms for the computation of the CUR and ID decompositions. The methods used are based on simple modifications to the classical truncated pivoted QR decomposition, which means that highly optimized…
Geometric methods have useful application for solving problems in a range of quantum information disciplines, including the synthesis of time-optimal unitaries in quantum control. In particular, the use of Cartan decompositions to solve…
Efficient task scheduling is paramount in parallel programming on multi-core architectures, where tasks are fundamental computational units. QR factorization is a critical sub-routine in Sequential Least Squares Quadratic Programming…