Related papers: Effective Erd\H{o}s--Wintner for Cantor numeration…
This open problem, first posed by Erd{\omicron}s, was further explored by Terence Tao. Tao work shows that the series can converge conditionally, but only under a sufficiently strong form of the Hardy-Littlewood conjecture for k-primary…
In this paper we propose a novel square root sliding-window bundle adjustment suitable for real-time odometry applications. The square root formulation pervades three major aspects of our optimization-based sliding-window estimator: for…
We prove sufficient conditions, ensuring that a sequence of multiple Wiener-It\^{o} integrals (with respect to a general Gaussian process) converges stably to a mixture of normal distributions. Our key tool is an asymptotic decomposition of…
Achieving bound consistency for the no-overlap constraint is known to be NP-complete. Therefore, several polynomial-time tightening techniques, such as edge finding, not-first-not-last reasoning, and energetic reasoning, have been…
In this paper, we propose a numerical method to approximate the solution of the time-dependent Schr\"odinger equation with periodic boundary condition in a high-dimensional setting. We discretize space by using the Fourier pseudo-spectral…
We show that an algorithmic construction of sequences of recursive trees leads to a direct proof of the convergence of random recursive trees in an associated Doob-Martin compactification; it also gives a representation of the limit in…
We characterize the points that satisfy Birkhoff's ergodic theorem under certain computability conditions in terms of algorithmic randomness. First, we use the method of cutting and stacking to show that if an element x of the Cantor space…
We present a simple combinatorial framework for establishing approximate tensorization of variance and entropy in the setting of spin systems (a.k.a. undirected graphical models) based on balanced separators of the underlying graph. Such…
This work prepares new probability bounds for sums of random, independent, Hermitian tensors. These probability bounds characterize large-deviation behavior of the extreme eigenvalue of the sums of random tensors. We extend Lapalace…
We obtain the first polynomial-time algorithm for exact tensor completion that improves over the bound implied by reduction to matrix completion. The algorithm recovers an unknown 3-tensor with $r$ incoherent, orthogonal components in…
Additive combinatorics asks for lower bounds on sumsets and restricted sumsets over finite fields. Central examples are the Cauchy-Davenport theorem and the Erd\H{o}s-Heilbronn conjecture. In this note, we develop Das's linear algebraic…
We consider several critical wetting models. In the discrete case, these probability laws are known to converge, after an appropriate rescaling, to the law of a reflecting Brownian motion, or of the modulus of a Brownian bridge, according…
A mixed integer maximization problem involving several additional constraints defined with both a lower and an upper bound is considered. It is assumed that one of such constraints is more restrictive than the others. As it can be seen as a…
Tensor networks provide compact and scalable representations of high-dimensional data, enabling efficient computation in fields such as quantum physics, numerical partial differential equations (PDEs), and machine learning. This paper…
This paper proposes a new Helmholtz decomposition based windowed Green function (HD-WGF) method for solving the time-harmonic elastic scattering problems on a half-space with Dirichlet boundary conditions in both 2D and 3D. The Helmholtz…
Schr\"{o}dinger bridge is a stochastic optimal control problem to steer a given initial state density to another, subject to controlled diffusion and deadline constraints. A popular method to numerically solve the Schr\"{o}dinger bridge…
The oriented singular value decomposition (O-SVD) proposed by Zeng and Ng provides a hybrid approach to the t-product based third-order tensor singular value decomposition with the transform matrix being a factor matrix of the higher order…
One of the most accurate methods for solving the time-dependent Schr\"{o}dinger equation uses a combination of the dynamic Fourier method with the split-operator algorithm on a tensor-product grid. To reduce the number of required grid…
This article considers the problem of diffraction by a wedge consisting of two semi-infinite periodic arrays of point scatterers. The solution is obtained in terms of two coupled systems, each of which is solved using the discrete…
Recently Guth and Katz \cite{GK2} invented, as a step in their nearly complete solution of Erd\H{o}s's distinct distances problem, a new method for partitioning finite point sets in $\R^d$, based on the Stone--Tukey polynomial ham-sandwich…