Related papers: Bounds for discrete tomography solutions

This expository essay discusses a finite dimensional approach to dilation theory. How much of dilation theory can be worked out within the realm of linear algebra? It turns out that some interesting and simple results can be obtained. These…

We show that large subsets of vector spaces over finite fields determine certain point configurations with prescribed distance structure. More specifically, we consider the complete graph with vertices as the points of $A \subseteq…

We consider discrete best approximation problems in the setting of tropical algebra, which is concerned with the theory and application of algebraic systems with idempotent operations. Given a set of input--output pairs of an unknown…

Motivated by questions arising in the study of the spectral theory of models of aperiodic order, we investigate sums of functions of semibounded closed subsets of the real line. We show that under suitable thickness assumptions on the sets…

We derive normal approximation bounds in the Kolmogorov distance for sums of discrete multiple integrals and $U$-statistics made of independent Bernoulli random variables. Such bounds are applied to normal approximation for the renormalized…

In this paper we analyze the local and global boundary rigidity problem for general Riemannian manifolds with boundary $(M,g)$. We show that the boundary distance function, i.e., $d_g|_{\partial M\times\partial M}$, known near a point $p\in…

The aim of this paper is to find an optimal matching between manifold-valued curves, and thereby adequately compare their shapes, seen as equivalent classes with respect to the action of reparameterization. Using a canonical decomposition…

We study the distribution modulo one of linear recurrent sequences of real numbers. We prove criteria for the finiteness of the set of limit values of the fractional parts of such a sequence and give lower bounds for the maximal distance…

In algorithms for finite metric spaces, it is common to assume that the distance between two points can be computed in constant time, and complexity bounds are expressed only in terms of the number of points of the metric space. We…

We establish the existence of weak solutions of a nonlinear radiation-type boundary value problem for elliptic equation on divergence form with discontinuous leading coefficient. Quantitative estimates play a crucial role on the real…

We present a novel convex relaxation and a corresponding inference algorithm for the non-binary discrete tomography problem, that is, reconstructing discrete-valued images from few linear measurements. In contrast to state of the art…

We study a boundary-value quasilinear elliptic problem on a generic time scale. Making use of the fixed-point index theory, sufficient conditions are given to obtain existence, multiplicity, and infinite solvability of positive solutions.

We provide a simple algorithm for finding the optimal upper bound for sums of products of matrix entries of the form S_pi(N) := sum_{j_1, ..., j_2m = 1}^N t^1_{j_1 j_2} t^2_{j_3 j_4} ... t^m_{j_2m-1 j_2m} where some of the summation indices…

We define weighted projective Reed-Muller codes over a subset of weighted projective space over a finite field. We focus on the case when the set X is a projective weighted torus. We show that the vanishing ideal of X is a lattice ideal and…

Manifolds discovered by machine learning models provide a compact representation of the underlying data. Geodesics on these manifolds define locally length-minimising curves and provide a notion of distance, which are key for reduced-order…

Lower and upper bounds are explored for the uniform (Kolmogorov) and $L^2$-distances between the distributions of weighted sums of dependent summands and the normal law. The results are illustrated for several classes of random variables…

Consider a set $P$ of $n$ points in $\mathbb{R}^d$. In the discrete median line segment problem, the objective is to find a line segment bounded by a pair of points in $P$ such that the sum of the Euclidean distances from $P$ to the line…

In this short note we observe that the higher topological complexity of an iterated connected sum of real projective spaces is maximal possible. Unlike the case of regular TC, the result is accessible through easy mod 2 zero-divisor…

Multi-level numerical methods that obtain the exact solution of a linear system are presented. The methods are devised by combining ideas from the full multi-grid algorithm and perfect reconstruction filters. The problem is stated as…

In motion planning problems for autonomous robots, such as self-driving cars, the robot must ensure that its planned path is not in close proximity to obstacles in the environment. However, the problem of evaluating the proximity is…