相关论文: Convexity and AFPP in the Digital Plane

There is a growing interest in the use of reduced-precision arithmetic, exacerbated by the recent interest in artificial intelligence, especially with deep learning. Most architectures already provide reduced-precision capabilities (e.g.,…

In this paper, we introduce the concept of nearly convex set-valued mappings and investigate fundamental properties of these mappings. Additionally, we establish a geometric approach for generalized differentiation of nearly convex…

Several recent papers in digital topology have sought to obtain fixed point results by mimicking the use of tools from classical topology, such as complete metric spaces and homotopy invariant fixed point theory. We show that in many cases,…

Extending classical results on polytopal approximation of convex bodies, we derive asymptotic formulas for the weighted approximation of smooth convex functions by piecewise affine convex functions as the number of their facets tends to…

For $0<p<+\infty$, we prove a global $W^{2,p}$-estimate for potentials of optimal transport maps between convex domains in the plane. Among the tools developed for that purpose are obliqueness in general convex domains and estimates for the…

We consider the discrepancy of the integer lattice with respect to the collection of all translated copies of a dilated convex body having a finite number of flat, possibly non-smooth, points in its boundary. We estimate the $L^{p}$ norm of…

We investigate methods to calibrate the non-common path aberrations at an adaptive optics system having a wavefront-correcting device working at an extremely high resolution (larger than 150x150). We use focal-plane images collected…

This article investigates the numerical approximation of shape optimization problems with PDE constraint on classes of convex domains. The convexity constraint provides a compactness property which implies well posedness of the problem.…

As a new type of series expansion, the so-called one-dimensional adaptive Fourier decomposition (AFD) and its variations (1D-AFDs) have effective applications in signal analysis and system identification. The 1D-AFDs have considerable…

This paper is devoted to the $L^p(\mathbb R)$ theory of the fractional Fourier transform (FRFT) for $1\le p < 2$. In view of the special structure of the FRFT, we study FRFT properties of $L^1$ functions, via the introduction of a suitable…

Several recent papers in digital topology have sought to obtain fixed point results by mimicking the use of tools from classical topology, such as complete metric spaces. We show that in many cases, researchers using these tools have…

This investigation seeks to establish the practicality of numerical frame approximations. Specifically, it develops a new method to approximate the inverse frame operator and analyzes its convergence properties. It is established that…

A natural model for the approximation of a convex body $K$ in $\mathbb{R}^d$ by random polytopes is obtained as follows. Take a stationary Poisson hyperplane process in the space, and consider the random polytope $Z_K$ defined as the…

This work studies the Fourier transform of the characteristic function of planar convex bodies averaged over affine transformations. We establish lower and upper bounds on the latter quantities in terms of the geometric properties of the…

We discuss published assertions concerning fixed points in digital metric spaces that are incorrect or incorrectly proven, or reduce to triviality.

The convex feasibility problem (CFP) is to find a feasible point in the intersection of finitely many convex and closed sets. If the intersection is empty then the CFP is inconsistent and a feasible point does not exist. However,…

Some properties of generalized convexity for sets and for functions are identified in case of the reliability polynomials of two dual minimal networks. A method of approximating the reliability polynomials of two dual minimal network is…

The concept of a visible point of a convex set relative to a given point is introduced. A number of basic properties of such visible point sets is developed. In particular, it is shown that this concept is useful in the study of best…

In a spherically complete ultrametric space, a strictly contracting mapping has a fixed point. We indicate in this paper how this fixed point can either be reached or approximated.

We prove sharp inequalities for the average number of affine diameters through the points of a convex body $K$ in ${\mathbb R}^n$. These inequalities hold if $K$ is either a polytope or of dimension two. An example shows that the proof…