Search arXivSearch

arXiv · 2405.19208

Quasimetric spaces with few lines

Abstract

Chen and Chvátal conjectured in 2008 that in any finite metric space either there is a line containing all the points - a universal line -, or the number of lines is at least the number of points. This is a generalization of a classical result due to Erdős that says that a set of $n$ non-collinear points in the Euclidean plane defines at least $n$ different lines. A line of a metric space with metric $ρ$ is defined in terms of a notion called the betweenness of the space which is the set of all triples $(x,z,y)$ such that $ρ(x,y)=ρ(x,z)+ρ(z,y)$. In this work we prove that for each $n\geq 4$ there are $p_3(n)$ non isomorphic betweennesses arising from \emph{quasimetric} spaces with $n$ points, without universal lines and with exactly 3 lines, where $p_3(n)$ is the number of partitions of an integer $n$ into three parts. We also prove that for $n\geq 5$, there are $2p_3(n-1)$ non isomorphic betweennesses arising from quasimetric spaces on $n$ points, without universal lines and with exactly 4 lines. Here two betweennesses are isomorphic if they are isomorphic as relational structures. None of the betweennesses mentioned above is metric which implies that Chen and Chvátal's conjecture is valid for metric spaces with at most five points.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Guillermo Gamboa Quintero, Martín Matamala, Juan Pablo Peña. 2024-05-29. Quasimetric spaces with few lines. https://arxiv.org/abs/2405.19208

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO