English
Related papers

Related papers: Maximal Equidistant Spacings

200 papers

Given a set of vectors $\F=\{f_1,\dots,f_m\}$ in a Hilbert space $\HH$, and given a family $\CC$ of closed subspaces of $\HH$, the {\it subspace clustering problem} consists in finding a union of subspaces in $\CC$ that best approximates…

Functional Analysis · Mathematics 2010-08-31 Akram Aldroubi , Romain Tessera

We investigate a relations of almost isometric embedding and almost isometry between metric spaces and prove that with respect to these relations: (1) There is a countable universal metric space. (2) There may exist fewer than continuum…

Logic · Mathematics 2007-05-23 Menachem Kojman , Saharon Shelah

Let M and N be even-dimensional oriented real manifolds, and $u:M \to N$ be a smooth mapping. A pair of complex structures at M and N is called u-compatible if the mapping u is holomorphic with respect to these structures. The quotient of…

Differential Geometry · Mathematics 2007-05-23 Yurii M. Burman

A maximal matching $M$ that consists of independent edges is a subgraph of a simple and undirected graph $G$ for which $G-M$ forms an independent set. A graph $G$ is called equimatchable if all maximal matchings have the same number of…

Combinatorics · Mathematics 2019-11-12 Mehmet Akif Yıldız

In a separably connected space any two points are contained in a separable connected subset. We show a mechanism that takes a connected bounded metric space and produces a complete connected metric space whose separablewise components form…

General Topology · Mathematics 2009-03-30 T. Banakh , M. Vovk , M. R. Wójcik

We define a new class of binary matrices by maximizing the peak-sidelobe distances in the aperiodic autocorrelations. These matrices can be used as robust position marks for in-plane spatial alignment. The optimal square matrices of…

Computer Vision and Pattern Recognition · Computer Science 2023-05-03 Scott A. Skirlo , Ling Lu , Marin Soljačić

This paper considers metric spaces where distances between a pair of nodes are represented by distance intervals. The goal is to study methods for the determination of hierarchical clusters, i.e., a family of nested partitions indexed by a…

Social and Information Networks · Computer Science 2016-10-17 Weiyu Huang , Alejandro Ribeiro

Let $G=(V,E)$ be a finite, connected graph. We consider a greedy selection of vertices: given a list of vertices $x_1, \dots, x_k$, take $x_{k+1}$ to be any vertex maximizing the sum of distances to the existing vertices and iterate: we…

Combinatorics · Mathematics 2022-05-06 Stefan Steinerberger

We introduce a generalization of the b-metric we call a (b,c)-metric. We show that if $X$ is a $(b,c)$-metric space and $\psi: X \longrightarrow Y$ is a quasi-isometry then $Y$ is $(b,c)$-metrizable. We also define a particular kind of…

Metric Geometry · Mathematics 2022-02-15 Josh Thompson , Davin Hemmila

Recent literature has shown that symbolic data, such as text and graphs, is often better represented by points on a curved manifold, rather than in Euclidean space. However, geometrical operations on manifolds are generally more complicated…

Machine Learning · Computer Science 2019-02-06 Max Aalto , Nakul Verma

We consider the universality of the nearest neighbour eigenvalue spacing distribution in invariant random matrix ensembles. Focussing on orthogonal and symplectic invariant ensembles, we show that the empirical spacing distribution…

Probability · Mathematics 2015-01-23 Kristina Schubert

Maximal mediated sets (MMS), introduced by Reznick, are distinguished subsets of lattice points in integral polytopes with even vertices. MMS of Newton polytopes of AGI-forms and nonnegative circuit polynomials determine whether these…

Combinatorics · Mathematics 2020-07-14 Jacob Hartzer , Olivia Röhrig , Timo de Wolff , Oğuzhan Yürük

Finding an exact maximum distance of two points in the given set is a fundamental computational problem which is solved in many applications. This paper presents a fast, simple to implement and robust algorithm for finding this maximum…

Data Structures and Algorithms · Computer Science 2017-08-10 Vaclav Skala , Zuzana Majdisova

A graph is called (generically) rigid in $\mathbb{R}^d$ if, for any choice of sufficiently generic edge lengths, it can be embedded in $\mathbb{R}^d$ in a finite number of distinct ways, modulo rigid transformations. Here we deal with the…

Computational Geometry · Computer Science 2017-01-26 Ioannis Z. Emiris , Ioannis Psarros

We study shortest paths and their distances on a subset of a Euclidean space, and their approximation by their equivalents in a neighborhood graph defined on a sample from that subset. In particular, we recover and extend the results of…

Computational Geometry · Computer Science 2018-10-26 Ery Arias-Castro , Thibaut Le Gouic

A labeled metric space is intuitively speaking a metric space together with a special set of points to be understood as the geometric boundary of the space. We study basic properties of a recently introduced labeled Gromov-Hausdorff…

Metric Geometry · Mathematics 2022-10-04 Reijo Jaakkola , Antti Kykkänen

Given a pair of number fields with isomorphic rings of adeles, we construct bijections between objects associated to the pair. For instance we construct an isomorphism of Brauer groups that commutes with restriction. We additionally…

Group Theory · Mathematics 2018-11-14 Benjamin Linowitz , D. B. McReynolds , Nicholas Miller

Let ${\mathcal M}_g$ be the moduli space of compact connected Riemann surfaces of genus $g\geq 2$ and let $\widehat{{\mathcal M}_g}$ be its Deligne-Mumford compactification, which is stratified by the topological type of the stable Riemann…

Algebraic Geometry · Mathematics 2024-11-18 Raquel Díaz , Víctor González-Aguilera

A space is called minimal if it admits a minimal continuous selfmap. We give examples of metrizable continua $X$ admitting both minimal homeomorphisms and minimal noninvertible maps, whose squares $X\times X$ are not minimal, i.e., they…

Dynamical Systems · Mathematics 2020-05-15 Matúš Dirbák , Ľubomír Snoha , Vladimír Špitalský

Optimal higher-order Sobolev type embeddings are shown to follow via isoperimetric inequalities. This establishes a higher-order analogue of a well-known link between first-order Sobolev embeddings and isoperimetric inequalities. Sobolev…

Functional Analysis · Mathematics 2013-11-04 Andrea Cianchi , Luboš Pick , Lenka Slavíková
‹ Prev 1 8 9 10 Next ›