Related papers: Epsilon-Distortion Complexity for Cantor Sets
A measure for the complexity of a differentiable function f(x) on an interval is introduced. It is based on approximations of the function by piecewise constant functions. The measure takes into account the quality of the approximation and…
We consider the Ghosh-Peres number rigidity of translation-invariant determinantal point processes on the real line $\mathbb{R}$, whose correlation kernels are induced by the Fourier transform of the indicators of generalized Cantor sets in…
Cantor sets in \(\mathbb{R}\) are common examples of sets for which Hausdorff measures can be positive and finite. However, there exist Cantor sets for which no Hausdorff measure is supported and finite. The purpose of this paper is to try…
We prove that the algorithm of [13] for approximating the Hausdorff dimension of dynamically defined Cantor sets, using periodic points of the underlying dynamical system, can be used to establish completely rigorous high accuracy bounds on…
In this paper we show that a methodology based on a sampling with the Gaussian function of kind $h\,{e^{ - {{\left( {t/c} \right)}^2}}}/\left( {{c}\sqrt \pi } \right)$, where ${c}$ and $h$ are some constants, leads to the Fourier transform…
As we collect additional samples from a data population for which a known density function estimate may have been previously obtained by a black box method, the increased complexity of the data set may result in the true density being…
Computing the rate-distortion function for continuous sources is commonly regarded as a standard continuous optimization problem. When numerically addressing this problem, a typical approach involves discretizing the source space and…
We study the compression of data in the case where the useful information is contained in a set rather than a vector, i.e., the ordering of the data points is irrelevant and the number of data points is unknown. Our analysis is based on…
The most studied and accepted pseudometric for probabilistic processes is one based on the Kantorovich distance between distributions. It comes with many theoretical and motivating results, in particular it is the fixpoint of a given…
The Favard length of a subset of the plane is defined as the average of its orthogonal projections. This quantity is related to the probabilistic Buffon needle problem; that is, the Favard length of a set is proportional to the probability…
Suppose that $\mathcal{C}$ is the space of all middle Cantor sets. We characterize all triples $(\alpha,~\beta,~\lambda)\in \mathcal{C}\times\mathcal{C}\times \mathbb{R}^*$ that satisfy $C_\alpha- \lambda C_\beta=[-\lambda,~1]. $ Also all…
Difference constraints have been used for termination analysis in the literature, where they denote relational inequalities of the form x' <= y + c, and describe that the value of x in the current state is at most the value of y in the…
The dimension spectrum of a conformal iterated function system (CIFS) is the set of all Hausdorff dimensions of its various subsystem limit sets. This brief note provides two constructions -- (i) a compact perfect set that cannot be…
Faraday complexity describes whether a spectropolarimetric observation has simple or complex magnetic structure. Quickly determining the Faraday complexity of a spectropolarimetric observation is important for processing large, polarised…
The distortion-rate performance of certain randomly-designed scalar quantizers is determined. The central results are the mean-squared error distortion and output entropy for quantizing a uniform random variable with thresholds drawn…
Multiplicative invariance is a well-studied property of subsets of the unit interval. The theory in the complex plane is less developed. This paper introduces an analogous definition for multiplicative invariance in the complex plane…
We give an algorithm for finding an $\epsilon$-fixed point of a contraction map $f:[0,1]^k\mapsto[0,1]^k$ under the $\ell_\infty$-norm with query complexity $O (k\log (1/\epsilon ) )$.
In this paper we study a class of random Cantor sets. We determine their almost sure Hausdorff, packing, box, and Assouad dimensions. From a topological point of view, we also compute their typical dimensions in the sense of Baire category.…
Many images and videos are primarily processed by computer vision algorithms, involving only occasional human inspection. When this content requires compression before processing, e.g., in distributed applications, coding methods must…
The computational complexity of a Delta 2 set will be calibrated by the amount of changes needed for any of its computable approximations. Firstly, we study Martin-Loef random sets, where we quantify the changes of initial segments.…