Related papers: Double Successive Rough Set Approximations
We study the family of intersection graphs of low density objects in low dimensional Euclidean space. This family is quite general, and includes planar graphs. We prove that such graphs have small separators. Next, we present efficient…
In this paper we propose and study a new complexity model for approximation algorithms. The main motivation are practical problems over large data sets that need to be solved many times for different scenarios, e.g., many multicast trees…
A survey of direct and inverse type results for row sequences of Pad\'e and Hermite-Pad\'e approximation is given. A conjecture is posed on an inverse type result for type II Hermite-Pad\'e approximation when it is known that the sequence…
We study the problem of modeling a binary operation that satisfies some algebraic requirements. We first construct a neural network architecture for Abelian group operations and derive a universal approximation property. Then, we extend it…
We define the syntax and reduction relation of a recursively typed lambda calculus with a parallel case-function (a parallel conditional). The reduction is shown to be confluent. We interpret the recursive types as information systems in a…
Using gauge transformations on electron bond operators, we derive exact duality relations between various order parameters for correlated electron systems. Applying these transformations, we find two duality relations in the generalized…
Many uncertainty sets encountered in control systems analysis and design can be expressed in terms of semialgebraic sets, that is as the intersection of sets described by means of polynomial inequalities. Important examples are for instance…
In this note, we present a characterization of semistable unitary operators on $L^2(\mathbb{R})$, under the assumption that the operator is (i) translation-invariant, (ii) symmetric, and (iii) locally uniformly continuous (LUC) under…
We first establish some general results connecting real and complex Lie algebras of first-order differential operators. These are applied to completely classify all finite-dimensional real Lie algebras of first-order differential operators…
The paper is devoted to the study of the twice epi-differentiablity of extended-real-valued functions, with an emphasis on functions satisfying a certain composite representation. This will be conducted under the parabolic regularity, a…
This paper establishes the exact comparison complexity of finding an element repeated $n$ times in a $2n$-element array containing $n+1$ distinct values, under the equality-comparison model with $O(1)$ extra space. We present a simple…
Several questions of approximation theory are discussed: 1) can one approximate stably in $L^\infty$ norm $f^\prime$ given approximation $f_\delta, \parallel f_\delta - f \parallel_{L^\infty} < \delta$, of an unknown smooth function $f(x)$,…
Relational program verification is a variant of program verification where one can reason about two programs and as a special case about two executions of a single program on different inputs. Relational program verification can be used for…
While quantum circuits built from two-particle dual-unitary (maximally entangled) operators serve as minimal models of typically nonintegrable many-body systems, the construction and characterization of dual-unitary operators themselves are…
In this paper we consider the Sturm-Liuoville operator in the Hilbert space $L_2$ with the singular complex potential of $W^{-1}_2$ and two-point boundary conditions. For this operator we give sufficient conditions for norm resolvent…
It is known that the $\Theta$-correspondence for a finite reductive dual pair is not one-to-one in general. In this paper, we propose two maximal one-to-one sub-relations $\underline\theta,\overline\theta$ of the $\Theta$-correspondences…
In this paper we introduce the notion of the $P$-sequences and apply their properties in studying representability of real numbers. Another application of $P$-sequences we find in generating the Prouhet-Tarry-Escott pairs.
Incorporating a non-Euclidean variable metric to first-order algorithms is known to bring enhancement. However, due to the lack of an optimal choice, such an enhancement appears significantly underestimated. In this work, we establish a…
Derivative-matching approximations are constructed as power series built from functions. The method assumes the knowledge of special values of the Bell polynomials of the second kind, for which we refer to the literature. The presented…
For operators on Hilbert spaces of any dimension, we show that equivalence after extension coincides with equivalence after one-sided extension, thus obtaining a proof of their coincidence with Schur coupling. We also provide a concrete…