Related papers: Sampling-based proofs of almost-periodicity result…

We study quasi-stationary distributions and quasi-limiting behavior of Markov chains in general reducible state spaces with absorption. We propose a set of assumptions dealing with particular situations where the state space can be…

We introduce a novel random integration algorithm that boasts both high convergence order and polynomial tractability for functions characterized by sparse frequencies or rapidly decaying Fourier coefficients. Specifically, for integration…

This paper discusses some regularity of almost periodic solutions of the Poisson's equation $-\Delta u = f$ in $\mathbb{R}^n$, where $f$ is an almost periodic function. It has been proved by Sibuya [Almost periodic solutions of Poisson's…

Composite minimization is a powerful framework in large-scale convex optimization, based on decoupling of the objective function into terms with structurally different properties and allowing for more flexible algorithmic design. We…

We give a simple combinatorial algorithm to deterministically approximately count the number of satisfying assignments of general constraint satisfaction problems (CSPs). Suppose that the CSP has domain size $q=O(1)$, each constraint…

In this paper we introduce an equivalence relation on the classes of almost periodic functions of a real or complex variable which is used to refine Bochner's result that characterizes these spaces of functions. In fact, with respect to the…

We give improved bounds for the equidistribution of (multiparameter) nilsequences subject to any degree filtration. The bounds we obtain are single exponential in dimension, improving on double exponential bounds of Green and Tao. To obtain…

We show that the ratio of the number of near perfect matchings to the number of perfect matchings in $d$-regular strong expander (non-bipartite) graphs, with $2n$ vertices, is a polynomial in $n$, thus the Jerrum and Sinclair Markov chain…

This paper establishes an abstract Korovkin-type approximation theorem in general spaces, extending the framework of approximation theory to accommodate broader contexts. A critical result supporting this theorem is the proof that any…

In this paper, we establish a general semilocal convergence theorem (with computationally verifiable initial conditions and error estimates) for iterative methods for simultaneous approximation of polynomial zeros. As application of this…

We develop a version of Freiman's theorem for a class of non-abelian groups, which includes finite nilpotent, supersolvable and solvable A-groups. To do this we have to replace the small doubling hypothesis with a stronger relative…

We establish the following uniformization result for metric spaces $X$ of finite Hausdorff 2-measure. If $X$ is homeomorphic to a smooth 2-manifold $M$ with non-empty boundary, then we show that $X$ admits a quasiconformal almost…

This paper studies the quintic nonlinear Schr\"odinger equation on $\mathbb{R}^d$ with randomized initial data below the critical regularity $H^{\frac{d-1}{2}}$. The main result is a proof of almost sure local well-posedness given a Wiener…

Using the methodology of (rigorous) {\it experimental mathematics}, we give a simple and motivated solution to Zudilin's question concerning a $q$-analog of a problem posed by Asmus Schmidt about a certain binomial coefficients sum. Our…

We present a method to approximate Gaussian process regression models for large datasets by considering only a subset of the data. Our approach is novel in that the size of the subset is selected on the fly during exact inference with…

We give improved separations for the query complexity analogue of the log-approximate-rank conjecture i.e. we show that there are a plethora of total Boolean functions on $n$ input bits, each of which has approximate Fourier sparsity at…

We study global reflection symmetries of almost periodic functions. In the non-limit periodic case, we establish an upper bound on the Haar measure of the set of those elements in the hull which are almost symmetric about the origin. As an…

We introduce a simple sieve-theoretic approach to studying partial sums of multiplicative functions which are close to their mean value. This enables us to obtain various new results as well as strengthen existing results with new proofs.…

Random subsampling of edges is a commonly employed technique in graph algorithms, underlying a vast array of modern algorithmic breakthroughs. Unfortunately, using this technique often leads to randomized algorithms with no clear path to…

We consider additive Schwarz methods for boundary value problems involving the $p$-Laplacian. While existing theoretical estimates suggest a sublinear convergence rate for these methods, empirical evidence from numerical experiments…