相关论文: On One Problem of Optimization of Approximate Inte…

Closed formulae for all Gaussian or optimal, 1-parameter quadrature rules in a compact interval [a, b] with non uniform, asymmetric subintervals, arbitrary number of nodes per subinterval for the spline classes $S_{2N, 0}$ and $S_{2N+1,…

Imaginary-time evolution has been shown to be a promising framework for tackling combinatorial optimization problems on quantum hardware. In this work, we propose a classical quantum-inspired strategy for solving combinatorial optimization…

An optimal algorithm is described for solving the deconvolution problem of the form ${\bf k}u:=\int_0^tk(t-s)u(s)ds=f(t)$ given the noisy data $f_\delta$, $||f-f_\delta||\leq \delta.$ The idea of the method consists of the representation…

Both the function and its normal derivative on the element boundary are $Q_k$ polynomials for the Bogner-Fox-Schmit $C^1$-$Q_k$ finite element functions. Mathematically, to keep the optimal order of approximation, their spaces are required…

We give a simple and natural method for computing approximately optimal solutions for minimizing a convex function $f$ over a convex set $K$ given by a separation oracle. Our method utilizes the Frank--Wolfe algorithm over the cone of valid…

The classical Heawood inequality states that if the complete graph $K_n$ on $n$ vertices is embeddable in the sphere with $g$ handles, then $g \ge\dfrac{(n-3)(n-4)}{12}$. A higher-dimensional analogue of the Heawood inequality is the…

We study the computational phase transition in a multi-frequency group synchronization problem, where pairwise relative measurements of group elements are observed across multiple frequency channels and corrupted by Gaussian noise. Using…

We study numerical integration on the unit sphere $\mathbb{S}^2 \subset \mathbb{R}^3$ using equal weight quadrature rules, where the weights are such that constant functions are integrated exactly. The quadrature points are constructed by…

We present an efficient implementation of hypergeometric functions in arbitrary-precision interval arithmetic. The functions ${}_0F_1$, ${}_1F_1$, ${}_2F_1$ and ${}_2F_0$ (or the Kummer $U$-function) are supported for unrestricted complex…

Let ${\mbox{$\mbox{\boldmath $f$}$}}$ be a square-integrable, zero-mean, random vector with observable realizations in a Hilbert space $H$, and let ${\mbox{$\mbox{\boldmath $g$}$}}$ be an associated square-integrable, zero-mean, random…

The quadratic embedding constant (QEC) of a connected graph is defined to be the maximum of the quadratic function associated with its distance matrix on a certain unit sphere of codimension two. In this paper we derive a formula for the…

In numerical integration, cubature methods are effective, especially when the integrands can be well-approximated by known test functions, such as polynomials. However, the construction of cubature formulas has not generally been known, and…

A convex function $f:[a,b]\to\mathbb{R}$ satisfies the so-called Hermite-Hadamard inequality $$ f\left(\frac{a+b}{2}\right)\leq \frac{1}{b-a}\int_a^{b}f(t)dt\leq \frac{f(a)+f(b)}{2}. $$ Motivated by the above estimates, in this paper we…

We study deformations of 2D Integrable Quantum Field Theories (IQFT) which preserve integrability (the existence of infinitely many local integrals of motion). The IQFT are understood as "effective field theories", with finite ultraviolet…

We present recent results based on the IR-improvement of unintegrable singularities in the infrared regime via amplitude-based resummation in $QED \times QCD \subset SU(2)_L \times U_1 \times SU(3)_c$. In the context of precision LHC$/$FCC…

A min-max formula is proved for the minimum of an integer-valued separable discrete convex function where the minimum is taken over the set of integral elements of a box total dual integral (box-TDI) polyhedron. One variant of the theorem…

The approximation properties of a quadratic iso-parametric finite element method for a typical cavitation problem in nonlinear elasticity are analyzed. More precisely, (1) the finite element interpolation errors are established in terms of…

We propose a new simple and natural algorithm for learning the optimal Q-value function of a discounted-cost Markov Decision Process (MDP) when the transition kernels are unknown. Unlike the classical learning algorithms for MDPs, such as…

In the Euclidean $k$-Means problem we are given a collection of $n$ points $D$ in an Euclidean space and a positive integer $k$. Our goal is to identify a collection of $k$ points in the same space (centers) so as to minimize the sum of the…

The 2-Forrelation problem provides an optimal separation between classical and quantum query complexity and is also the problem used for separating $\mathsf{BQP}$ and $\mathsf{PH}$ relative to an oracle. A natural question is therefore to…