Related papers: A note on linear approximately orthogonality prese…
We study holomorphic maps between C$^*$-algebras $A$ and $B$. When $f:B_A (0,\varrho) \longrightarrow B$ is a holomorphic mapping whose Taylor series at zero is uniformly converging in some open unit ball $U=B_{A}(0,\delta)$ and we assume…
We introduce a linear dimensionality reduction technique preserving topological features via persistent homology. The method is designed to find linear projection $L$ which preserves the persistent diagram of a point cloud $\mathbb{X}$ via…
Guarding a polygon with few guards is an old and well-studied problem in computational geometry. Here we consider the following variant: We assume that the polygon is orthogonal and thin in some sense, and we consider a point $p$ to guard a…
A balanced V-shape is a polygonal region in the plane contained in the union of two crossing equal-width strips. It is delimited by two pairs of parallel rays that emanate from two points x, y, are contained in the strip boundaries, and are…
The bottom-left algorithm is a simple heuristic for the Strip Packing Problem. It places the rectangles in the given order at the lowest free position in the strip, using the left most position in case of ties. Despite its simplicity, the…
This paper considers the problem of nonlinear dimensionality reduction. Unlike existing methods, such as LLE, ISOMAP, which attempt to unfold the true manifold in the low dimensional space, our algorithm tries to preserve the nonlinear…
We provide an O(log log OPT)-approximation algorithm for the problem of guarding a simple polygon with guards on the perimeter. We first design a polynomial-time algorithm for building epsilon-nets of size O(1/epsilon log log 1/epsilon) for…
We consider mappings satisfying an upper bound for the distortion of families of curves. We establish lower bounds for the distortion of distances under such mappings. As applications, we obtain theorems on the discreteness of the limit…
We provide a spectrum of new theoretical insights and practical results for finding a Minimum Dilation Triangulation (MDT), a natural geometric optimization problem of considerable previous attention: Given a set $P$ of $n$ points in the…
We introduce the notion of approximate numerical radius (Birkhoff) orthogonality and investigate its significant properties. Let $T, S\in \mathbb{B}(\mathscr{H})$ and $\varepsilon \in [0, 1)$. We say that $T$ is approximate numerical radius…
This paper presents a structure-preserving model reduction framework for linear systems, in which the $\mathcal{H}_2$ optimization is incorporated with the Petrov-Galerkin projection to preserve structural features of interest, including…
We present a family of fast pseudo-approximation algorithms for the minimum balanced vertex separator problem in a graph. Given a graph $G=(V,E)$ with $n$ vertices and $m$ edges, and a (constant) balance parameter $c\in(0,1/2)$, where $G$…
Persistent homology is a popular method for computing topological features of (metric) data. Standard approaches based on the \v{C}ech or Rips filtration are stable under small perturbations of the data, but highly sensitive to outliers.…
We prove a homological stability theorem for the subgroup of the mapping class group acting as the identity on some fixed portion of the first homology group of the surface. We also prove a similar theorem for the subgroup of the mapping…
Let $\epsilon >0$. A continuous linear operator $T:C(X) \ra C(Y)$ is said to be {\em $\epsilon$-disjointness preserving} if $\vc (Tf)(Tg)\vd_{\infty} \le \epsilon$, whenever $f,g\in C(X)$ satisfy $\vc f\vd_{\infty} =\vc g\vd_{\infty} =1$…
We consider the problem of restoring linear conservation laws in data-driven linear dynamical models. Given a learned operator $\widehat{A}$ and a full-rank constraint matrix $C$ encoding one or more invariants, we show that the matrix…
In this paper, we find necessary and sufficient conditions to identify pairs of matrices $X$ and $Y$ for which there exists $\Delta \in \mathbb C^{n,n}$ such that $\Delta+\Delta^*$ is positive semidefinite and $\Delta X=Y$. Such a $\Delta$…
In topological data analysis persistence modules are used to distinguish the legitimate topological features of a finite data set from noise. Interleavings between persistence modules feature prominantly in the analysis. One can show that…
The present work extends our short communication Phys. Rev. Lett. 95, 111102 (2005). For smooth marginally outer trapped surfaces (MOTS) in a smooth spacetime we define stability with respect to variations along arbitrary vectors v normal…
Let $H_1,H_2$ be complex Hilbert spaces and $T$ be a densely defined closed linear operator (not necessarily bounded). It is proved that for each $\epsilon>0$, there exists a bounded operator $S$ with $\|S\|\leq \epsilon$ such that $T+S$ is…