English
Related papers

Related papers: A note on linear approximately orthogonality prese…

200 papers

We introduce the concept of orthogonal structure on complex Grassmannians. Based on this structure, we define the notion of orthogonal mappings. This class of maps generalizes holomorphic maps between the Shilov boundaries of type-I bounded…

Complex Variables · Mathematics 2025-08-25 Yun Gao

In order to generalize the results of Mazur-Ulam and Vogt, we shall prove that any map T which preserves equality of distance with T(0)=0 between two F-spaces without surjective condition is linear. Then, as a special case linear isometries…

Functional Analysis · Mathematics 2007-09-25 Dongni Tan

Understanding the structure of minor-free metrics, namely shortest path metrics obtained over a weighted graph excluding a fixed minor, has been an important research direction since the fundamental work of Robertson and Seymour. A…

Data Structures and Algorithms · Computer Science 2020-09-11 Vincent Cohen-Addad , Arnold Filtser , Philip N. Klein , Hung Le

A new Hardy space Hardy space approach of Dirichlet type problem based on Tikhonov regularization and Reproducing Hilbert kernel space is discussed in this paper, which turns out to be a typical extremal problem located on the upper…

Numerical Analysis · Mathematics 2017-05-31 Zhulin Liu , C. L. Philip Chen

The purpose of this paper is to show stability of order preserving/reversing transforms on the class of non-negative convex functions in ${\mathbb R}^n$, and its subclass, the class of non-negative convex functions attaining $0$ at the…

Functional Analysis · Mathematics 2015-10-15 D. I. Florentin , A. Segal

We consider the standard quantum logic ${\mathcal L}(H)$ associated to a complex Hilbert space $H$, i.e. the lattice of closed subspaces of $H$ together with the orthogonal complementation. The orthogonality and compatibility relations are…

Functional Analysis · Mathematics 2017-02-13 Mark Pankov

Let $X$ be a set of $n$ points of norm at most $1$ in the Euclidean space $R^k$, and suppose $\varepsilon>0$. An $\varepsilon$-distance sketch for $X$ is a data structure that, given any two points of $X$ enables one to recover the square…

Metric Geometry · Mathematics 2017-04-04 Noga Alon , Bo'az Klartag

We prove homological stability for sequences of "oriented configuration spaces" as the number of points in the configuration goes to infinity. These are spaces of configurations of n points in a connected manifold M of dimension at least 2…

Algebraic Topology · Mathematics 2014-07-18 Martin Palmer

The aim of this paper is to characterize those linear maps from a von Neumann factor $\A$ into itself which preserve the extreme points of the unit ball of $\A$. For example, we show that if $\A$ is infinite, then every such linear…

Functional Analysis · Mathematics 2016-09-07 Vania Mascioni , Lajos Molnar

A theorem of Lawson and Simons states that the only stable minimal submanifolds in complex projective spaces are complex submanifolds. We generalize their result to the cases of quaternionic and octonionic projective spaces. Our approach…

Differential Geometry · Mathematics 2010-09-28 Siu-Cheong Lau , Naichung Conan Leung

We introduce Orthogonal M\"obius Inversion $\mathsf{OI}$, a concept analogous to M\"obius inversion on finite posets, which is applicable to order-preservings functions from a finite poset to the Grassmannian $\mathsf{Gr}(V)$ of an inner…

Combinatorics · Mathematics 2025-04-29 Aziz Burak Gülen , Facundo Mémoli , Zhengchao Wan

Making sense of Wasserstein distances between discrete measures in high-dimensional settings remains a challenge. Recent work has advocated a two-step approach to improve robustness and facilitate the computation of optimal transport, using…

Machine Learning · Computer Science 2019-09-04 François-Pierre Paty , Marco Cuturi

Orthogonality constraints naturally appear in many machine learning problems, from principal component analysis to robust neural network training. They are usually solved using Riemannian optimization algorithms, which minimize the…

Machine Learning · Statistics 2025-08-08 Pierre Ablin , Simon Vary , Bin Gao , P. -A. Absil

Our goal is to compare two planar point sets by finding subsets of a given size such that a minimum-weight matching between them has the smallest weight. This can be done by a translation of one set that minimizes the weight of the…

Computational Geometry · Computer Science 2018-10-25 Pankaj K. Agarwal , Haim Kaplan , Geva Kipper , Wolfgang Mulzer , Günter Rote , Micha Sharir , Allen Xiao

This paper discusses a general and useful stability principle which, roughly speaking, says that given a uniformly continuous function defined on an arbitrary metric space, if the function is bounded on the constraint set and we slightly…

Optimization and Control · Mathematics 2020-09-04 Daniel Reem , Simeon Reich , Alvaro De Pierro

In this extended abstract, we present a PTAS for guarding the vertices of a weakly-visible polygon $P$ from a subset of its vertices, or in other words, a PTAS for computing a minimum dominating set of the visibility graph of the vertices…

Computational Geometry · Computer Science 2018-10-02 Matthew J. Katz

We study the optimal rectangular-discrepancy approximation of permutons by finite permutations. We transfer bounds from discrepancy theory to this more restricted setup. Moreover, we show that superlinear approximation can occur only for…

Combinatorics · Mathematics 2026-05-05 Balázs Maga

We analyse hadronically quiet trilepton signatures in the T-parity conserving Littlest Higgs model and in R-parity conserving supersymmetry at the Large Hadron Collider. We identify the regions of the parameter space where such signals can…

High Energy Physics - Phenomenology · Physics 2008-11-26 AseshKrishna Datta , Paramita Dey , Sudhir Kumar Gupta , Biswarup Mukhopadhyaya , Andreas Nyffeler

In this work, we present a generalization of extended persistent homology to filtrations of graded sub-groups by defining relative homology in this setting. Our work provides a more comprehensive and flexible approach to get an algebraic…

Algebraic Topology · Mathematics 2023-11-01 Fang Sun , Shengwen Xie , Xuezhi Zhao

\v{C}ech Persistence diagrams (PDs) are topological descriptors routinely used to capture the geometry of complex datasets. They are commonly compared using the Wasserstein distances $OT_{p}$; however, the extent to which PDs are stable…

Computational Geometry · Computer Science 2024-07-15 Charles Arnal , David Cohen-Steiner , Vincent Divol
‹ Prev 1 8 9 10 Next ›