Related papers: Topological Recursion, explicit ABCD tensors and i…
We present an algorithm for computing curves and families of curves of prescribed degree and geometric genus on real rational surfaces.
We introduce the notion of irregular vertex (operator) algebras. The irregular versions of fundamental properties, such as Goddard uniqueness theorem, associativity and operator product expansions are formulated and proved. We also give…
We show that 2D periodic operators with local and perpendicular defects form an algebra. We provide an algorithm of finding spectrum for such operators. While the continuous spectral components can be computed by simple algebraic operations…
We present different methods for symbolic computer algebra computations in higher dimensional (\ge9) Clifford algebras using the \Clifford\ and \Bigebra\ packages for \Maple(R). This is achieved using graded tensor decompositions,…
We develop general foundations of topological algebra over a linearly topologized ring k in a format applicable to both formal schemes and analytic adic spaces. We are especially interested in determining exact closed tensor categories of…
We provide a recipe for building explicit representations of the real Clifford algebras once an explicit family is given in dimensions $1$ through $4$. We further give an explicit construction of spin coordinate systems for a given real…
We study a particular class of autonomous Differential-Algebraic Equations that are equivalent to Ordinary Differential Equations on manifolds. Under appropriate assumptions we determine an easy-to-use straightforward formula for the…
The notion of the genus of a quadratic form is generalized to vertex operator algebras. We define it as the modular braided tensor category associated to a suitable vertex operator algebra together with the central charge. Statements…
Several Krylov-type procedures are introduced that generalize matrix Krylov methods for tensor computations. They are denoted minimal Krylov recursion, maximal Krylov recursion, contracted tensor product Krylov recursion. It is proved that…
Computing the topology of an algebraic plane curve $\mathcal{C}$ means to compute a combinatorial graph that is isotopic to $\mathcal{C}$ and thus represents its topology in $\mathbb{R}^2$. We prove that, for a polynomial of degree $n$ with…
Explicit step-truncation tensor methods have recently proven successful in integrating initial value problems for high-dimensional partial differential equations (PDEs). However, the combination of non-linearity and stiffness may introduce…
In the literature various notions of nonlocal curvature can be found. Here we propose a notion of nonlocal curvature tensor. This we do by generalizing an appropriate representation of the classical curvature tensor and by exploiting some…
Tensors are multidimensional arrays of numerical values and therefore generalize matrices to multiple dimensions. While tensors first emerged in the psychometrics community in the $20^{\text{th}}$ century, they have since then spread to…
We consider the problem of computing the topology and describing the geometry of a parametric curve in $\mathbb{R}^n$. We present an algorithm, PTOPO, that constructs an abstract graph that is isotopic to the curve in the embedding space.…
Tensor completion is a natural higher-order generalization of matrix completion where the goal is to recover a low-rank tensor from sparse observations of its entries. Existing algorithms are either heuristic without provable guarantees,…
We study the rank one completion problem for tensors of arbitrary orders. The notion of rank one determinable tensors is introduced. We explore its properties and propose a recursive algorithm for computing rank one tensor completion. This…
Inferring topological and geometrical information from data can offer an alternative perspective on machine learning problems. Methods from topological data analysis, e.g., persistent homology, enable us to obtain such information,…
We use curvature decompositions to construct generating sets for the space of algebraic curvature tensors and for the space of tensors with the same symmetries as those of a torsion free, Ricci symmetric connection; the latter naturally…
We define two extensions of the typed linear lambda-calculus that yield minimal Turing-complete systems. The extensions are based on unbounded recursion in one case, and bounded recursion with minimisation in the other. We show that both…
This paper derives the CS decomposition for orthogonal tensors (T-CSD) and the generalized singular value decomposition for two tensors (T-GSVD) via the T-product. The structures of the two decompositions are analyzed in detail and are…