Related papers: Good weights for the Erd\H{o}s discrepancy problem
We provide a combinatorial construction for linear codes attaining the maximum possible number of distinct weights. We then introduce the related problem of determining the existence of linear codes with an arbitrary number of distinct…
We consider a linear ill-posed equation in the Hilbert space setting. Multiple independent unbiased measurements of the right hand side are available. A natural approach is to take the average of the measurements as an approximation of the…
This paper develops a new framework, \emph{simultaneous saturation}, designed to quantify the size of sets whose elements are simultaneously large. The framework establishes a correspondence between the magnitude of such sets and a system…
We develop a new method that enables us to solve the open problem of characterizing discrete inequalities for kernel operators involving suprema. More precisely, we establish necessary and sufficient conditions under which there exists a…
Shepard method is a fast algorithm that has been classically used to interpolate scattered data in several dimensions. This is an important and well-known technique in numerical analysis founded in the main idea that data that is far away…
We consider Bayesian inverse problems wherein the unknown state is assumed to be a function with discontinuous structure a priori. A class of prior distributions based on the output of neural networks with heavy-tailed weights is…
We develop a new approach to recurrence and the existence of non-constant harmonic functions on infinite weighted graphs. The approach is based on the capacity of subsets of metric boundaries with respect to intrinsic metrics. The main tool…
We analyze the existence and multiplicity of positive solutions to a nonlocal elliptic problem involving the spectral fractional Laplace operator endowed with homogeneous mixed Dirichlet-Neumann boundary conditions and weighted critical…
The entropic way of formulating Heisenberg's uncertainty principle not only plays a fundamental role in applications of quantum information theory but also is essential for manifesting genuine nonclassical features of quantum systems. In…
We revisit the range sampling problem: the input is a set of points where each point is associated with a real-valued weight. The goal is to store them in a structure such that given a query range and an integer $k$, we can extract $k$…
This paper studies the weighted Hardy inequalities on the discrete intervals with four different kinds of boundary conditions. The main result is the uniform expression of the basic estimate of the optimal constant with the corresponding…
The concept of weighted entropy takes into account values of different outcomes, i.e., makes entropy context-dependent, through the weight function. In this paper, we establish a number of simple inequalities for the weighted entropies…
In this work, we consider the problem of bounding the values of a covariance function corresponding to a continuous-time stationary stochastic process or signal. Specifically, for two signals whose covariance functions agree on a finite…
We prove sharp homogeneous improvements to $L^1$ weighted Hardy inequalities involving distance from the boundary. In the case of a smooth domain, we obtain lower and upper estimates for the best constant of the remainder term. These…
We extend the Erd\H os-R\' enyi law of large numbers to the averaging setup both in discrete and continuous time cases. We consider both stochastic processes and dynamical systems as fast motions whenever they are fast mixing and satisfy…
We study bounded remainder sets with respect to an irrational rotation of the $d$-dimensional torus. The subject goes back to Hecke, Ostrowski and Kesten who characterized the intervals with bounded remainder in dimension one. First we…
Let \(d_k(p)\) denote the natural density of positive integers whose \(k\)-th smallest prime divisor is \(p\). Erd\H{o}s asked whether, for each fixed \(k\), the sequence \(p\mapsto d_k(p)\) is unimodal as \(p\) ranges over the primes.…
The basic theme of this paper is the fact that if $A$ is a finite set of integers, then the sum and product sets cannot both be small. A precise formulation of this fact is Conjecture 1 below due to Erd\H os-Szemer\'edi [E-S]. (see also…
This paper introduces the \emph{$d$-distance matching problem}, in which we are given a bipartite graph $G=(S,T;E)$ with $S=\{s_1,\dots,s_n\}$, a weight function on the edges and an integer $d\in\mathbb Z_+$. The goal is to find a maximum…
Motivated by recent interests in predictive inference under distribution shift, we study the problem of approximating finite weighted exchangeable sequences by a mixture of finite sequences with independent terms. Various bounds are derived…