Related papers: New proofs of Borwein-type algorithms for Pi

We prove various theorems on approximation using polynomials with integer coefficients in the Bernstein basis of any given order. In the extreme, we draw the coefficients from $\{ \pm 1\}$ only. A basic case of our results states that for…

Explicit formulae for the B\'ezier coefficients of the constrained dual Bernstein basis polynomials are derived in terms of the Hahn orthogonal polynomials. Using difference properties of the latter polynomials, efficient recursive scheme…

We develop new polynomial methods for studying systems of word equations. We use them to improve some earlier results and to analyze how sizes of systems of word equations satisfying certain independence properties depend on the lengths of…

This paper addresses the challenge of developing efficient algorithms for large-scale nonconvex multiobjective optimization problems (MOPs). While quasi-Newton methods are effective, their traditional application to MOPs is computationally…

This is a new version of our previous work. In this version, we fill a gap included in the original proof of Theorem 1.1 in our previous paper entitled "An iterative method for Kirchhoff type equations and its applications".

This work addresses a central challenge in the numerical analysis of the cutoff spatially homogeneous Boltzmann equation: the development of rigorously justified, accurate numerical schemes. We present (i) a novel Fourier spectral method…

We show that $b$-Hurwitz numbers with a rational weight are obtained by taking an explicit limit of a Whittaker vector for the $\mathcal{W}$-algebra of type $A$. Our result is a vast generalization of several previous results that treated…

We define and study the counterpart of the Wiener algebra in the quaternionic setting, both for the discrete and continuous case. We prove a Wiener-L\'evy type theorem and a factorization theorem. We give applications to Toeplitz and…

In the recent breakthrough paper by Barbulescu, Gaudry, Joux and Thom{\'e}, a quasi-polynomial time algorithm (QPA) is proposed for the discrete logarithm problem over finite fields of small characteristic. The time complexity analysis of…

We develop rigorous estimates and provably convergent approximations for the memory integral in the Mori-Zwanzig (MZ) formulation. The new theory is built upon rigorous mathematical foundations and is presented for both state-space and…

We revisit the central limit theorem for integrated periodograms, equivalently for Toeplitz quadratic forms of stationary Gaussian sequences. Under a regular-variation assumption allowing long-memory singularities and slowly varying…

Motivated by the well-known Papoulis-Gerchberg algorithm, an iterative thresholding algorithm for recovery of sparse signals from few observations is proposed. The sequence of iterates turns out to be similar to that of the thresholded…

We study a canonical quantization of the Wess--Zumino--Witten (WZW) model which depends on two integer parameters rather than one. The usual theory can be obtained as a contraction, in which our two parameters go to infinity keeping the…

We explore the Collatz conjecture and its variants through the lens of termination of string rewriting. We construct a rewriting system that simulates the iterated application of the Collatz function on strings corresponding to mixed…

Decomposition theorems in classical Fourier analysis enable us to express a bounded function in terms of few linear phases with large Fourier coefficients plus a part that is pseudorandom with respect to linear phases. The Goldreich-Levin…

We extend the classical Bernstein technique to the setting of integro-differential operators. As a consequence, we provide first and one-sided second derivative estimates for solutions to fractional equations, including some convex fully…

We looked into the algorithm for calculating Betti numbers presented by Lloyd, Garnerone, and Zanardi (LGZ). We present a new algorithm in the same spirit as LGZ with the intent of clarifying quantum algorithms for computing Betti numbers.…

Bayesian probabilistic numerical methods are a set of tools providing posterior distributions on the output of numerical methods. The use of these methods is usually motivated by the fact that they can represent our uncertainty due to…

We introduce the Z-polynomial of a matroid, which we define in terms of the Kazhdan-Lusztig polynomial. We then exploit a symmetry of the Z-polynomial to derive a new recursion for Kazhdan-Lusztig coefficients. We solve this recursion,…

In this work, we construct an explicit, theoretically rigorous deconvolution method that relies entirely on iterative forward convolutions, thus can be numerically implemented. We first prove that convolution with an even Schwartz kernel…