Related papers: Concept of a veritable osp(1$|$2) super-triangle s…
Form factors of composite operators in the SL(2) sector of N=4 SYM theory are studied up to two loops via the on-shell unitarity method. The non-compactness of this subsector implies the novel feature and technical challenge of an unlimited…
The Hidden Subset Sum Problem (HSSP) is a significant NP-complete problem in number theory and combinatorics, with applications in cryptography and AI privacy. For the $(n,k)$-complete HSSP, where a target multiset must be recovered from…
We give two results concerning the power of the Sum-of-Squares(SoS)/Lasserre hierarchy. For binary polynomial optimization problems of degree $2d$ and an odd number of variables $n$, we prove that $\frac{n+2d-1}{2}$ levels of the…
By employing non-equispaced grid points near boundaries, boundary-optimized upwind finite-difference operators of orders up to nine are developed. The boundary closures are constructed within a diagonal-norm summation-by-parts (SBP)…
Consider an algorithm computing in a differential field with several commuting derivations such that the only operations it performs with the elements of the field are arithmetic operations, differentiation, and zero testing. We show that,…
Summation-By-Parts (SBP) methods provide a systematic way of constructing provably stable numerical schemes. However, many proofs of convergence and accuracy rely on the assumption that the SBP operator possesses a particular eigenvalue…
Summation-by-parts (SBP) operators are popular building blocks for systematically developing stable and high-order accurate numerical methods for time-dependent differential equations. The main idea behind existing SBP operators is that the…
A recursion operator is an integro-differential operator which maps a generalized symmetry of a nonlinear PDE to a new symmetry. Therefore, the existence of a recursion operator guarantees that the PDE has infinitely many higher-order…
By examining asymptotic behavior of certain infinite basic ($q$-) hypergeometric sums at roots of unity (that is, at a "$q$-microscopic" level) we prove polynomial congruences for their truncations. The latter reduce to non-trivial…
Subset sum is a very old and fundamental problem in theoretical computer science. In this problem, $n$ items with weights $w_1, w_2, w_3, \ldots, w_n$ are given as input and the goal is to find out if there is a subset of them whose weights…
A model of the Bannai-Ito algebra in a superspace is introduced. It is obtained from the three-fold tensor product of the basic realization of the Lie superalgebra $osp(1|2)$ in terms of operators in one continuous and one Grassmanian…
The s-ordered form of any product of single-mode boson creation and annihilation operators, containing only a single annihilator, is computed explicitly. The s-ordering concept originated in quantum optics, but subsumes normal, symmetric…
We present an approach to construct efficient sparse summation-by-parts (SBP) operators on triangles and tetrahedra with a tensor-product structure. The operators are constructed by splitting the simplices into quadrilateral or hexahedral…
We obtain new bounds of exponential sums modulo a prime $p$ with sparse polynomials $a_0x^{n_0} + \cdots + a_{\nu}x^{n_\nu}$. The bounds depend on various greatest common divisors of exponents $n_0, \ldots, n_\nu$ and their differences. In…
In this study, we present a tensor--train framework for nonintrusive operator inference aimed at learning discrete operators and using them to predict solutions of physical governing equations. Our framework comprises three approaches:…
An operator system $\cl S$ with unit $e$, can be viewed as an Archimedean order unit space $(\cl S,\cl S^+,e)$. Using this Archimedean order unit space, for a fixed $k\in \bb N$ we construct a super k-minimal operator system OMIN$_k(\cl S)$…
Finite-sum optimization problems are ubiquitous in machine learning, and are commonly solved using first-order methods which rely on gradient computations. Recently, there has been growing interest in \emph{second-order} methods, which rely…
We propose a general method for optimization with semi-infinite constraints that involve a linear combination of functions, focusing on the case of the exponential function. Each function is lower and upper bounded on sub-intervals by…
We study the convergence of a family of numerical integration methods where the numerical integral is formulated as a finite matrix approximation to a multiplication operator. For bounded functions, the convergence has already been…
Symbolic Mathematical tasks such as integration often require multiple well-defined steps and understanding of sub-tasks to reach a solution. To understand Transformers' abilities in such tasks in a fine-grained manner, we deviate from…