Related papers: The Steiner distance problem for large vertex subs…
We revisit the problem of determining the independent domination number in hypercubes for which the known upper bound is still not tight for general dimensions. We present here a constructive method to build an independent dominating set…
A pair of probability distributions over $\{0,1\}^n$ is said to be $(k,\delta)$-wise indistinguishable if all of the size $k$ marginals are within statistical distance at most $\delta$. Previous works introduced this concept and study when…
We derive the theory of open quantum system dynamics intervened by a series of nonselective measurements. We analyze the cases of time independent and time dependent Hamiltonian dynamics in between the measurements and find the approximate…
A procedure to solve few-body problems which is based on an expansion over a small parameter is developed. The parameter is the ratio of potential energy to kinetic energy in the subspace of states having not small hyperspherical quantum…
We prove upper bounds on the graph diameters of polytopes in two settings. The first is a worst-case bound for polytopes defined by integer constraints in terms of the height of the integers and certain subdeterminants of the constraint…
Consider N equally-spaced points on a circle of circumference N. Choose at random n points out of $N$ on this circle and append clockwise an arc of integral length k to each such point. The resulting random set is made of a random number of…
We consider the problem of lower bounding a generalized Minkowski measure of subsets of a convex body with a log-concave probability measure, conditioned on the set size. A bound is given in terms of diameter and set size, which is sharp…
A rigorous lower bound is obtained for the average resolution of any estimate of a shift parameter, such as an optical phase shift or a spatial translation. The bound has the asymptotic form k_I/<2|G|> where G is the generator of the shift…
We present a new and relatively elementary method for studying the solution of the initial-value problem for dispersive linear and integrable equations in the large-$t$ limit, based on a generalization of steepest descent techniques for…
We study the set of visible lattice points in multidimensional hypercubes. The problems we investigate mix together geometric, probabilistic and number theoretic tones. For example, we prove that almost all self-visible triangles with…
We provide a general bound on the Wasserstein distance between two arbitrary distributions of sequences of Bernoulli random variables. The bound is in terms of a mixing quantity for the Glauber dynamics of one of the sequences, and a simple…
We present an exactly solvable random-subcube model inspired by the structure of hard constraint satisfaction and optimization problems. Our model reproduces the structure of the solution space of the random k-satisfiability and k-coloring…
We give a new proof of the isoperimetric inequality in the plane, based on Steiner's formula for the area of a convex neighborhood. This proof establishes the isoperimetric inequality directly, without requiring that we separately establish…
We establish inequalities for assessing the distance between the distribution of errors of partially observed high-frequency statistics of multidimensional L\'evy processes and that of a mixed Gaussian random variable. Furthermore, we…
The analysis of strong-stability-preserving (SSP) linear multistep methods is extended to semi-discretized problems for which different terms on the right-hand side satisfy different forward Euler (or circle) conditions. Optimal additive…
The Stein's method is a popular method used to derive upper-bounds of distances between probability distributions. It can be viewed, in certain of its formulations, as an avatar of the semi-group or of the smart-path method used commonly in…
We present a theoretical analysis of stochastic optimization methods in terms of their sensitivity with respect to the step size. We identify a key quantity that, for each method, describes how the performance degrades as the step size…
The effective and efficient numerical solution of Riemann-Hilbert problems has been demonstrated in recent work. With the aid of ideas from the method of nonlinear steepest descent for Riemann-Hilbert problems, the resulting numerical…
The Steiner ratio characterizes the greatest possible deviation of the length of a minimal spanning tree from the length of the minimal Steiner tree. In this paper, estimates of the Steiner ratio on Riemannian manifolds are obtained. As a…
We derive a multidimensional Stein's method for asymptotic independence in the case of a general target $\mu$ with a density, being invariant measure of a diffusion process. It allows us to give a general bound in Wasserstein distance…