Related papers: Concept of a veritable osp(1$|$2) super-triangle s…
The computational cost of counting the number of solutions satisfying a Boolean formula, which is a problem instance of #SAT, has proven subtle to quantify. Even when finding individual satisfying solutions is computationally easy (e.g.…
One specific subset of quantum algorithms is Grovers Ordered Search Problem (OSP), the quantum counterpart of the classical binary search algorithm, which utilizes oracle functions to produce a specified value within an ordered database.…
A sum rule is an identity connecting the entropy of a measure with coefficients involved in the construction of its orthogonal polynomials (Jacobi coefficients). Our paper is an extension of Gamboa, Nagel and Rouault (2016), where we have…
The problem of immersing a simply connected surface with a prescribed shape operator is discussed. From classical and more recent work, it is known that, aside from some special degenerate cases, such as when the shape operator can be…
We show the first unconditional pseudo-determinism result for all of search-BPP. Specifically, we show that every BPP search problem can be computed pseudo-deterministically on average for infinitely many input lengths. In other words, for…
By considering a discrete tape where each cell corresponds to an integer, thus to a possible sum, a pseudo-polynomial solution can be given to subset sum problem, which is an NP-complete problem and a cornerstone application for this study,…
This work is in a stream initiated by a paper of Killip and Simon [Ann. of Math. (2003)]. Using methods of Functional Analysis and the classical Szeg\"o Theorem we prove sum rule identities in a very general form. Then, we apply the result…
In an earlier article [3], we presented an algorithm that can be used to rigorously check whether a specific cosine or sine polynomial is nonnegative in a given interval or not. The algorithm proves to be an indispensable tool in…
The problem of optimizing over the cone of nonnegative polynomials is a fundamental problem in computational mathematics, with applications to polynomial optimization, control, machine learning, game theory, and combinatorics, among others.…
We establish conceptually important properties of the operator product expansion (OPE) in the context of perturbative, Euclidean $\varphi^{4}$-quantum field theory. First, we demonstrate, generalizing earlier results and techniques of…
We present a practical algorithm to test whether a 3-manifold given by a triangulation or an ideal triangulation contains a closed essential surface. This property has important theoretical and algorithmic consequences. As a testament to…
This paper introduces a novel approach for learning polynomial representations of physical objects. Given a point cloud data set associated with a physical object, we solve a one-class classification problem to bound the data points by a…
We give a direct algebraic proof of the necessity direction in the single-point higher-order Szeg\H{o} sum rules on the unit circle for $m=1,2,3$. More precisely, for $H_m(e^{i\theta})=(1-\cos\theta)^m$, we show that…
We revisit the standard ``telescoping sum'' argument ubiquitous in the final steps of analyzing evaluation complexity of algorithms for smooth nonconvex optimization, and obtain a refined formulation of the resulting bound as a function of…
We advance the Cohn-Umans framework for developing fast matrix multiplication algorithms. We introduce, analyze, and search for a new subclass of strong uniquely solvable puzzles (SUSP), which we call simplifiable SUSPs. We show that these…
We present a new algorithm for recovering paths from their third-order signature tensors, an inverse problem in rough analysis. Our algorithm provides the exact solution to this learning problem and improves upon current approaches by an…
We prove that the multiple summing norm of multilinear operators defined on some $n$-dimensional real or complex vector spaces with the $p$-norm may be written as an integral with respect to stables measures. As an application we show…
In this work, we are concerned with inverse problems involving poly-fractional operators, where the poly-fractional operator is of the form \[P( (-\Delta_g)^s)u := \sum_{i=1}^M \alpha_i(-\Delta_{g_i})^{s_i}u\] for $s=(s_1,\dots,s_M)$,…
Exponential integrators based on contour integral representations lead to powerful numerical solvers for a variety of ODEs, PDEs, and other time-evolution equations. They are embarrassingly parallelizable and lead to global-in-time…
We obtain the most general type B 3-fold supersymmetry by solving directly the intertwining relation. We then show that it is a necessary and sufficient condition for a second-order linear differential operator to have three linearly…