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

For a graph $G$, let $Z(G,\lambda)$ be the partition function of the monomer-dimer system defined by $\sum_k m_k(G)\lambda^k$, where $m_k(G)$ is the number of matchings of size $k$ in $G$. We consider graphs of bounded degree and develop a…

We prove quasi-polynomiality for monotone and strictly monotone orbifold Hurwitz numbers. The second enumerative problem is also known as enumeration of a special kind of Grothendieck's dessins d'enfants or $r$-hypermaps. These statements…

We consider the problem of approximating an analytic function on a compact interval from its values at $M+1$ distinct points. When the points are equispaced, a recent result (the so-called impossibility theorem) has shown that the best…

Let $\mu$ be a positive measure on the real line with locally finite support $\Lambda$ and integer masses such that its Fourier transform in the sense of distributions is a purely point measure. An explicit form is found for an entire…

The Lov\'{a}sz Local Lemma is a very powerful tool in probabilistic combinatorics, that is often used to prove existence of combinatorial objects satisfying certain constraints. Moser and Tardos have shown that the LLL gives more than just…

The Lattice String Approximation algorithm (or LSA algorithm) of M. L. Lapidus and M. van Frankenhuijsen is a procedure that approximates the complex dimensions of a nonlattice self-similar fractal string by the complex dimensions of a…

We give a Markov chain based algorithm for sampling almost uniform solutions of constraint satisfaction problems (CSPs). Assuming a canonical setting for the Lov\'asz local lemma, where each constraint is violated by a small number of…

We provide a numerical scheme to approximate as closely as desired the Gaussian or exponential measure $\mu(\om)$ of (not necessarily compact) basic semi-algebraic sets$\om\subset\R^n$. We obtain two monotone (non increasing and non…

We extend two well-known results in additive number theory, S\'ark\"ozy's theorem on square differences in dense sets and a theorem of Green on long arithmetic progressions in sumsets, to subsets of random sets of asymptotic density 0. Our…

For a large class of expanding maps of the interval, we prove that partial sums of Lipschitz observables satisfy an almost sure central limit theorem (ASCLT). In fact, we provide a speed of convergence in the Kantorovich metric. Maxima of…

The algorithm and complexity of approximating the permanent of a matrix is an extensively studied topic. Recently, its connection with quantum supremacy and more specifically BosonSampling draws special attention to the average-case…

We prove the existence of quasi-periodic solutions for Schroedinger equations with a multiplicative potential on T^d, d \geq 1, merely differentiable nonlinearities, and tangential frequencies constrained along a pre-assigned direction. The…

We prove several results related to a Logvinenko-Sereda type theorem on dominating sets for generalized doubling Fock spaces. In particular, we give a precise polynomial dependence of the sampling constant on the relative density parameter…

This short note is devoted to establishing the almost sure central limit theorem for the parabolic/hyperbolic Anderson models driven by colored-in-time Gaussian noises, completing recent results on quantitative central limit theorems for…

We introduce a randomized iterative fragmentation procedure for finite metric spaces, which is guaranteed to result in a polynomially large subset that is $D$-equivalent to an ultrametric, where $D\in (2,\infty)$ is a prescribed target…

We prove the full equivalence between Assembly Theory (AT) and Shannon Entropy via a method based upon the principles of statistical compression renamed `assembly index' that belongs to the LZ family of popular compression algorithms (ZIP,…

Let $S_\lambda F(x)$ be the spherical partial sums of the multiple Fourier series of function $F\in L_2(\mathbb{T}^N)$. We prove almost-everywhere convergence $S_\lambda F(x)\rightarrow F(x)$ for functions in Sobolev spaces…

Let $g: \{-1,1\}^k \to \{-1,1\}$ be any Boolean function and $q_1,\dots,q_k$ be any degree-2 polynomials over $\{-1,1\}^n.$ We give a \emph{deterministic} algorithm which, given as input explicit descriptions of $g,q_1,\dots,q_k$ and an…

A recent trend in Bayesian research has been revisiting generalizations of the likelihood that enable Bayesian inference without requiring the specification of a model for the data generating mechanism. This paper focuses on a Bayesian…

We introduce a new notion of sparsification, called \emph{strong sparsification}, in which constraints are not removed but variables can be merged. As our main result, we present a strong sparsification algorithm for 1-in-3-SAT. The…