English
Related papers

Related papers: On the supremal $p$-negative type of a finite metr…

200 papers

A marked metric measure space (mmm-space) is a triple (X,r,mu), where (X,r) is a complete and separable metric space and mu is a probability measure on XxI for some Polish space I of possible marks. We study the space of all (equivalence…

Probability · Mathematics 2011-01-24 Andrej Depperschmidt , Andreas Greven , Peter Pfaffelhuber

Let $(X,d)$ be a finite metric space with $|X|=n$. For a positive integer $k$ we define $A_k(X)$ to be the quotient set of all $k$-subsets of $X$ by isometry, and we denote $|A_k(X)|$ by $a_k$. The sequence $(a_1,a_2,\ldots,a_{n})$ is…

Combinatorics · Mathematics 2018-02-22 Mitsugu Hirasaka , Masashi Shinohara

Given a positive integer $p$, we consider $W^{1,p}$-maps from a Euclidean domain of dimension $p+1$ into a closed Riemannian manifold $\mathcal{N}$. The target manifold is required to satisfy suitable topological conditions; in particular,…

Functional Analysis · Mathematics 2026-05-28 Giacomo Canevari , Giandomenico Orlandi

We define two classes of topological infinite degree covering maps modeled on two families of transcendental holomorphic maps. The first, which we call exponential maps of type $(p,q)$, are branched covers and is modeled on transcendental…

Dynamical Systems · Mathematics 2016-03-01 Tao Chen , Yunping Jiang , Linda Keen

Finite dimensional linear spaces (both complex and real) with indefinite scalar product [.,.] are considered. Upper and lower bounds are given for the size of an indecomposable matrix that is normal with respect to this scalar product in…

Functional Analysis · Mathematics 2007-05-23 Olga Holtz

We construct a category that classifies compact Hausdorff spaces by their shape and finite topological spaces by their weak homotopy type.

Category Theory · Mathematics 2021-10-07 Pedro J. Chocano , Manuel A. Morón , Francisco R. Ruiz del Portal

Signed graphs have their edges labeled either as positive or negative. Here we introduce two types of signed distance matrix for signed graphs. We characterize balance in signed graphs using these matrices and we obtain explicit formulae…

Combinatorics · Mathematics 2021-06-21 Shahul Hameed K , Shijin T , Soorya P , Germina K A , Thomas Zaslavsky

We describe the canonical correspondence between set of all finite metric spaces and set of special symmetric convex polytopes, and formulate the problem about classification of the metric spaces in terms of combinatorial structure of those…

Metric Geometry · Mathematics 2015-04-15 A. M. Vershik

Let $S_{g,n}$ be an orientable surface of genus $g$ with $n$ punctures. We identify a finite rigid subgraph $X_{g,n}$ of the pants graph $\mathcal P (S_{g,n})$, that is, a subgraph with the property that any simplicial embedding of…

Geometric Topology · Mathematics 2020-08-10 Jesús Hernández Hernández , Christopher J. Leininger , Rasimate Maungchang

An infinite-type surface $\Sigma$ is of type $\mathcal{S}$ if it has an isolated puncture $p$ and admits shift maps. This includes all infinite-type surfaces with an isolated puncture outside of two sporadic classes. Given such a surface,…

Geometric Topology · Mathematics 2025-04-02 Carolyn R. Abbott , Nicholas Miller , Priyam Patel

By a finite type-graph we mean a graph whose set of vertices is the set of all $k$-subsets of $[n]=\{1,2,\ldots, n\}$ for some integers $n\ge k\ge 1$, and in which two such sets are adjacent if and only if they realise a certain order type…

Combinatorics · Mathematics 2017-09-12 Christian Avart , Bill Kay , Christian Reiher , Vojtěch Rödl

It is known that the space of boundedly finite integer-valued measures on a complete separable metric space becomes itself a complete separable metric space when endowed with the weak-hash metric. It is also known that convergence under…

Probability · Mathematics 2018-10-16 Maxime Morariu-Patrichi

For a self--adjoint Laplace operator on a finite, not necessarily compact, metric graph lower and upper bounds on each of the negative eigenvalues are derived. For compact finite metric graphs Poincar\'{e} type inequalities are given.

Spectral Theory · Mathematics 2021-03-29 Amru Hussein

For a graph $G$ with $p$ vertices the closed convex cone $\mathbb{S}^p_{\succeq0}(G)$ consists of all real positive semidefinite $p\times p$ matrices with zeros in the off-diagonal entries corresponding to nonedges of $G$. The extremal rays…

Combinatorics · Mathematics 2015-09-22 Liam Solus , Caroline Uhler , Ruriko Yoshida

Let $(X, d)$ be a compact metric space and let $\mathcal{M}(X)$ denote the space of all finite signed Borel measures on $X$. Define $I \colon \mathcal{M}(X) \to \R$ by $I(mu) = \int_X \int_X d(x,y) d\mu(x) d\mu(y)$, and set $M(X) = \sup…

Metric Geometry · Mathematics 2009-02-27 Peter Nickolas , Reinhard Wolf

A generic method for combinatorial constructions of intrinsic geometrical spaces is presented. It is based on the well known inverse sequences of finite graphs that determine (in the limit) topological spaces. If a pattern of the…

Computational Geometry · Computer Science 2020-10-09 Stanislaw Ambroszkiewicz

Let $\Gamma=(V,E)$ be a finite simple graph. A matching $M \subseteq E$ is positive if there exists a weight function on $V$ such that the matching $M$ is characterized by those edges with positive weights. A positive matching decomposition…

Combinatorics · Mathematics 2025-02-06 Mohammad Farrokhi Derakhshandeh Ghouchan , Ali Akbar Yazdan Pour

Non-positive at infinity valuations are a class of real plane valuations which have a nice geometrical behavior. They are divided in three types. We study the dual graphs of non-positive at infinity valuations and give an algorithm for…

Algebraic Geometry · Mathematics 2024-05-07 Carlos Galindo , Francisco Monserrat , Carlos-Jesús Moreno-Ávila

For a separable rearrangement invariant space $X$ on $[0,1]$ of fundamental type we identify the set of all $p\in [1,\infty]$ such that $\ell^p$ is finitely represented in $X$ in such a way that the unit basis vectors of $\ell^p$ ($c_0$ if…

Functional Analysis · Mathematics 2022-05-02 Sergey V. Astashkin , Guillermo P. Curbera

A vertex set $U \subseteq V$ of an undirected graph $G=(V,E)$ is a $\textit{resolving set}$ for $G$, if for every two distinct vertices $u,v \in V$ there is a vertex $w \in U$ such that the distances between $u$ and $w$ and the distance…

Computational Complexity · Computer Science 2018-06-28 Duygu Vietz , Stefan Hoffmann , Egon Wanke
‹ Prev 1 3 4 5 6 7 10 Next ›