中文
相关论文

相关论文: Approximately angle preserving mappings

200 篇论文

Balakrishnan and Mi [1] considered order preserving property of maximum likelihood estimators. In this paper there are given conditions under which the moment estimators have the property of preserving stochastic orders. There is considered…

统计理论 · 数学 2011-10-26 Piotr Nowak

In this paper, the proximal point algorithm for quasi-convex minimization problem in nonpositive curvature metric spaces is studied. We prove $\Delta$-convergence of the generated sequence to a critical point (which is defined in the text)…

泛函分析 · 数学 2016-11-08 Hadi Khatibzadeh , Vahid Mohebbi

We prove that a bounded linear Hilbert space operator has the unit circle in its essential approximate point spectrum if and only if it admits an orbit satisfying certain orthogonality and almost-orthogonality relations. This result is…

泛函分析 · 数学 2017-11-21 Vladimir Muller , Yuri Tomilov

Symmetries and conservation laws are studied for a generalized Westervelt equation which is a nonlinear partial differential equation modelling the propagation of sound waves in a compressible medium. This nonlinear wave equation is widely…

数学物理 · 物理学 2026-03-30 Almudena del Pilar Márquez , Elena Recio , María Luz Gandarias

We present improved upper bounds for the size of relative (p,Epsilon)-approximation for range spaces with the following property: For any (finite) range space projected onto (that is, restricted to) a ground set of size n and for any…

计算几何 · 计算机科学 2012-12-12 Esther Ezra

We propose the concepts of vicinal mappings and firmly vicinal mappings in metric spaces. We obtain fixed point and convergence theorems for these mappings in complete geodesic spaces with curvature bounded above by one and apply our…

泛函分析 · 数学 2018-05-01 Fumiaki Kohsaka

We present a new heuristic point-to-point routing algorithm based on contraction hierarchies (CH). Given an epsilon >= 0, we can prove that the length of the path computed by our algorithm is at most (1+epsilon) times the length of the…

数据结构与算法 · 计算机科学 2010-02-05 Robert Geisberger

We give a characterization of distance--preserving subgraphs of Johnson graphs, i.e. of graphs which are isometrically embeddable into Johnson graphs (the Johnson graph $J(m,\Lambda)$ has the subsets of cardinality $m$ of a set $\Lambda$ as…

组合数学 · 数学 2015-11-03 Victor Chepoi

Dimensionality reduction is an integral part of data visualization. It is a process that obtains a structure preserving low-dimensional representation of the high-dimensional data. Two common criteria can be used to achieve a dimensionality…

计算几何 · 计算机科学 2018-06-25 Lin Yan , Yaodong Zhao , Paul Rosen , Carlos Scheidegger , Bei Wang

We give conditions in order to approximate locally uniformly holomorphic covering mappings of the unit ball of $\mathbb{C}^n$ with respect to an arbitrary norm, with entire holomorphic covering mappings. The results rely on a generalization…

复变函数 · 数学 2023-06-16 Matteo Fiacchi

This article presents a systematic study of a class of maps between quasi-metric spaces that preserve left K-Cauchy sequences. We call such maps left K-Cauchy regular maps. Several characterizations of these maps have been given in terms of…

一般拓扑 · 数学 2025-09-30 Om Dev Singh , Anubha Jindal

We study some known approximation properties and introduce and investigate several new approximation properties, closely connected with different quasi-normed tensor products. These are the properties like the $AP_s$ or $AP_{(s,w)}$ for…

泛函分析 · 数学 2014-03-20 Oleg Reinov

A permutation may be represented by a collection of paths in the plane. We consider a natural class of such representations, which we call tangles, in which the paths consist of straight segments at 45 degree angles, and the permutation is…

离散数学 · 计算机科学 2013-06-19 Sergey Bereg , Alexander E. Holroyd , Lev Nachmanson , Sergey Pupyrev

Quasiconformal maps in the plane are orientation preserving homeomorphisms that satisfy certain distortion inequalities; infinitesimally, they map circles to ellipses of bounded eccentricity. Such maps have many useful geometric distortion…

复变函数 · 数学 2024-09-12 Rosemarie Bongers

We study two popular ways to sketch the shortest path distances of an input graph. The first is distance preservers, which are sparse subgraphs that agree with the distances of the original graph on a given set of demand pairs. Prior work…

数据结构与算法 · 计算机科学 2021-08-17 Greg Bodwin , Virginia Vassilevska Williams

This article consists in two independent parts. In the first one, we investigate the geometric properties of almost periodicity of model sets (or cut-and-project sets, defined under the weakest hypotheses); in particular we show that they…

动力系统 · 数学 2015-12-03 Pierre-Antoine Guihéneuf

Counting the number of triangles in a graph has many important applications in network analysis. Several frequently computed metrics like the clustering coefficient and the transitivity ratio need to count the number of triangles in the…

数据结构与算法 · 计算机科学 2013-04-24 Mostafa Haghir Chehreghani

Given any $\epsilon >0$ and any planar region $\Omega$ bounded by a simple n-gon $P$ we construct a ($1 + \epsilon)$-quasiconformal map between $\Omega$ and the unit disk in time $C(\epsilon)n$. One can take $ C(\epsilon) = C + C \log…

复变函数 · 数学 2020-07-15 Christopher J. Bishop

BV functions cannot be approximated well by piecewise constant functions, but this work will show that a good approximation is still possible with (countably) piecewise affine functions. In particular, this approximation is area-strictly…

偏微分方程分析 · 数学 2015-07-23 Jan Kristensen , Filip Rindler

We show that for any quasimeromorphic mapping with an essential singularity at infinity, there exist points whose iterates tend to infinity arbitrarily slowly. This extends a result by Nicks for quasiregular mappings, and Rippon and…

动力系统 · 数学 2021-07-01 Luke Warren