Related papers: On different definitions of numerical range
We define and study a numerical-range analogue of the notion of spectral set. Among the results obtained are a positivity criterion and a dilation theorem, analogous to those already known for spectral sets. An important difference from the…
This paper presents an algorithmic study of a class of covering mixed-integer linear programming problems which encompasses classic cover problems, including multidimensional knapsack, facility location and supplier selection problems. We…
This paper deals with approximation of smooth convex functions $f$ on an interval by convex algebraic polynomials which interpolate $f$ at the endpoints of this interval. We call such estimates "interpolatory". One important corollary of…
We study the variation space corresponding to a dictionary of functions in $L^2(\Omega)$ for a bounded domain $\Omega\subset \mathbb{R}^d$. Specifically, we compare the variation space, which is defined in terms of a convex hull with…
A spherical set is called convex if for every pair of its points there is at least one minimal geodesic segment that joins these points and lies in the set. We prove that for n >= 3 a complete locally-convex (topological) immersion of a…
This paper studies the convex hull of $d$-dimensional samples i.i.d. generated from spherically symmetric distributions. Specifically, we derive a complete integration formula for the expected facet number of the convex hull. This formula…
In this paper, we study the concept of Fibonacci statistical convergence on intuitionisitic fuzzy normed space. We define the Fibonacci statistically Cauchy sequences with respect to an intuitionisitic fuzzy normed space and introduce the…
We consider the problem of approximating the reachable set of a discrete-time polynomial system from a semialgebraic set of initial conditions under general semialgebraic set constraints. Assuming inclusion in a given simple set like a box…
We introduce the new concepts of pseu\-do numerical range for operator functions and families of sesquilinear forms as well as the pseu\-do block numerical range for $n \times n$ operator matrix functions. While these notions are new even…
We consider the question that the spectrum and arithmetic of locally symmetric spaces defined by congruent arithmetical lattices should mutually determine each other. We frame these questions in the context of automorphic representations.
We propose a novel measure of statistical depth, the metric spatial depth, for data residing in an arbitrary metric space. The measure assigns high (low) values for points located near (far away from) the bulk of the data distribution,…
The approximability of a convex body is a number which measures the difficulty to approximate that body by polytopes. We prove that twice the approximability is equal to the volume entropy for a Hilbert geometry in dimension two end three…
In this paper the problem of maximizing the distance to a given fixed point over an intersection of balls is considered. It is known that this problem is NP complete in the general case, since any subset sum problem can be solved upon…
In this article, we discuss quantitative Runge approximation properties for the acoustic Helmholtz equation and prove stability improvement results in the high frequency limit for an associated partial data inverse problem modelled on…
The paper presents a new and simple range characterization for the spherical mean transform of functions supported in the unit ball in even dimensions. It complements the previous work of the same authors, where they solved an analogous…
In this paper we study the notion of rough $\mathcal{I}$-statistical convergence of sequences in a partial metric space as an extension work of both the notions of rough statistical and rough ideal convergence. Here we define rough…
We introduce the notion of quadratic hull of a linear code, and give some of its properties. We then show that any symmetric bilinear multiplication algorithm for a finite-dimensional algebra over a field can be obtained by…
This paper addresses the question whether there are numerical schemes for constant-coefficient advection problems that can yield convergent solutions for an infinite time horizon. The motivation is that such methods may serve as building…
We consider random $n\times n$ matrices $X$ with independent and centered entries and a general variance profile. We show that the spectral radius of $X$ converges with very high probability to the square root of the spectral radius of the…
In this paper, we give an overview of some results concerning best and random approximation of convex bodies by polytopes. We explain how both are linked and see that random approximation is almost as good as best approximation.