Related papers: Concept of a veritable osp(1$|$2) super-triangle s…
Infinite series of Bessel function of the first kind, $\sum_\nu^{\pm\infty} J_{N\nu+p}(x)$, $\sum_\nu^{\pm\infty} (-1)^\nu J_{N\nu+p}(x)$, are summed in closed form. These expressions are evaluated by engineering a Dirac comb that selects…
The benefits of exploiting the presence of symmetries in tensor network algorithms have been extensively demonstrated in the context of matrix product states (MPSs). These include the ability to select a specific symmetry sector (e.g. with…
Summation-by-parts (SBP) operators allow us to systematically develop energy-stable and high-order accurate numerical methods for time-dependent differential equations. Until recently, the main idea behind existing SBP operators was that…
We propose a constructive algorithm that decomposes an arbitrary real tensor into a finite sum of orthonormal rank-1 outer products. The algorithm, named TTr1SVD, works by converting the tensor into a tensor-train rank-1 (TTr1) series via…
We consider a class of tridiagonal operators induced by not necessary pseudoergodic biinfinite sequences. Using only elementary techniques we prove that the numerical range of such operators is contained in the convex hull of the union of…
The $3$SUM hypothesis, the APSP hypothesis and SETH are the three main hypotheses in fine-grained complexity. So far, within the area, the first two hypotheses have mainly been about integer inputs in the Word RAM model of computation. The…
When a computer algebra system fails to solve an Ordinary Differential Equation, is this a limitation of its implementation, or a genuine computational barrier? Three traditions bear on the question. Modern computer algebra algorithms can…
We initiate the study of fine-grained completeness theorems for exact and approximate optimization in the polynomial-time regime. Inspired by the first completeness results for decision problems in P (Gao, Impagliazzo, Kolokolova, Williams,…
As is well known absolute convergence and unconditional convergence for series are equivalent only in finite dimensional Banach spaces. Replacing the classical notion of absolutely summing operators by the notion of 1 summing operators \[…
The paper provides a coherent presentation of an operator scheme, which is used in an approach to inverse problems of mathematical physics (the boundary control method). The scheme is based on the triangular factorization of operators. It…
One of the main hypotheses in fine-grained complexity is that All-Pairs Shortest Paths (APSP) for $n$-node graphs requires $n^{3-o(1)}$ time. Another famous hypothesis is that the $3$SUM problem for $n$ integers requires $n^{2-o(1)}$ time.…
In this paper, a family of radial deformations of the realization of the Lie superalgebra osp(1|2) in the theory of Dunkl operators is obtained. This leads to a Dirac operator depending on 3 parameters. Several function theoretical aspects…
This paper presents a novel algorithm for constructing a sum-of-squares (SOS) decomposition for positive semi-definite polynomials with rational coefficients. Unlike previous methods that typically yield SOS decompositions with…
Inference in expressive probabilistic models is generally intractable, which makes them difficult to learn and limits their applicability. Sum-product networks are a class of deep models where, surprisingly, inference remains tractable even…
In the field of algorithmic analysis, one of the more well-known exercises is the subset sum problem. That is, given a set of integers, determine whether one or more integers in the set can sum to a target value. Aside from the brute-force…
A (control) network over a finite ring is proposed. Using semi-tensor product (STP) of matrices, a set of algebraic equations are provided to verify whether a finite set with two binary operators is a ring. It is then shown that the…
Let $P\subset\mathbb{R}^{2}$ be a set of $n$ points. In this paper we show two new algorithms, one to compute the number of triangulations of $P$, and one to compute the number of pseudo-triangulations of $P$. We show that our algorithms…
The subset sum problem (SSP) can be briefly stated as: given a target integer $E$ and a set $A$ containing $n$ positive integer $a_j$, find a subset of $A$ summing to $E$. The \textit{density} $d$ of an SSP instance is defined by the ratio…
Quantum signal processing (QSP) represents a real scalar polynomial of degree $d$ using a product of unitary matrices of size $2\times 2$, parameterized by $(d+1)$ real numbers called the phase factors. This innovative representation of…
On solving a convex-concave bilinear saddle-point problem (SPP), there have been many works studying the complexity results of first-order methods. These results are all about upper complexity bounds, which can determine at most how many…