Lines in the plane with the $L_1$ metric

Ida Kantor

英文摘要：

A well-known theorem in plane geometry states that any set of $n$ non-collinear points in the plane determines at least $n$ lines. Chen and Chvátal asked whether an analogous statement holds within the framework of finite metric spaces, with lines defined using the notion of {\em betweenness}. In this paper, we prove that in the plane with the $L_1$ (also called Manhattan) metric, a non-collinear set of $n$ points induces at least $\lceil n/2\rceil$ lines. This is an improvement of the previous lower bound of $n/37$, with substantially different proof. As a consequence, we also get the same lower bound for non-collinear point sets in the plane with the $L_{\infty}$ metric.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

On the metric dimension of incidence graph of Möbius planes

We study the metric dimension and optimal split-resolving sets of the point-circle incidence graph of a Möbius plane. We prove that the metric dimension of a Möbius plane of order $q$ is around $2q$, and that an optimal split-resolving set has cardinality between approximately $5q$ and $2.5q\log q$. We also prove that a smallest blocking set of a Möbius plane of order $q$ has at most $2q(1 + \log(q + 1))$ points.

2020-12-14math.CO

On the metric dimension of affine planes, biaffine planes and generalized quadrangles

In this paper the metric dimension of (the incidence graphs of) particular partial linear spaces is considered. We prove that the metric dimension of an affine plane of order $q\geq13$ is $3q-4$ and describe all resolving sets of that size if $q\geq 23$. The metric dimension of a biaffine plane (also called a flag-type elliptic semiplane) of order $q\geq 4$ is shown to fall between $2q-2$ and $3q-6$, while for Desarguesian biaffine planes the lower bound is improved to $8q/3-7$ under $q\geq 7$, and to $3q-9\sqrt{q}$ under certain stronger restrictions on $q$. We determine the metric dimension …

2017-06-20math.CO

Falconer conjecture in the plane for random metrics

We prove the following variant of the Falconer conjecture in the plane. If the dimension of a compact planar set is greater than one, then the distance set with respect to almost every ellipse has positive Lebesgue measure.

2003-05-09math.CAmath.CO

Bruck nets and partial Sherk planes

In Bachmann's Aufbau der Geometrie aus dem Spiegelungsbegriff (1959), it was shown that a finite metric plane is a Desarguesian affine plane of odd order equipped with a perpendicularity relation on lines, and conversely. Sherk (1967) generalised this result to characterise the finite affine planes of odd order by removing the 'three reflections axioms' from a metric plane. We show that one can obtain a larger class of natural finite geometries, the so-called Bruck nets of even degree, by weakening Sherk's axioms to allow non-collinear points.

2017-01-22math.CO

Towards a de Bruijn-Erd\H os theorem in the $L_1$-metric

A well-known theorem of de Bruijn and Erdős states that any set of $n$ non-collinear points in the plane determines at least $n$ lines. Chen and Chvátal asked whether an analogous statement holds within the framework of finite metric spaces, with lines defined using the notion of {\em betweenness}. In this paper, we prove that the answer is affirmative for sets of $n$ points in the plane with the $L_1$ metric, provided that no two points share their $x$- or $y$-coordinate. In this case, either there is a line that contains all $n$ points, or $X$ induces at least $n$ distinct lines. If points o…

2012-07-16math.CO

Unbounded Mixed Resolvability of Web Graph and Prism Related Graph

Let $\mathbb{E}(H)$ and $\mathbb{V}(H)$ denote the edge set and the vertex set of the simple connected graph $H$, respectively. The mixed metric dimension of the graph $H$ is the graph invariant, which is the mixture of two important graph parameters, the edge metric dimension and the metric dimension. In this article, we compute the mixed metric dimension for the two families of the plane graphs viz., the Web graph $\mathbb{W}_{n}$ and the Prism allied graph $\mathbb{D}_{n}^{t}$. We show that the mixed metric dimension is non-constant unbounded for these two families of the plane graph. Moreo…

2021-08-19math.CO

更多相关论文收起更多论文

Tropical hyperelliptic curves in the plane

Abstractly, tropical hyperelliptic curves are metric graphs that admit a two-to-one harmonic morphism to a tree. They also appear as embedded tropical curves in the plane arising from triangulations of polygons with all interior lattice points collinear. We prove that hyperelliptic graphs can only arise from such polygons. Along the way we will prove certain graphs do not embed tropically in the plane due to entirely combinatorial obstructions, regardless of whether their metric is actually hyperelliptic.

2019-12-16math.AGmath.CO

Geometric Ruzsa triangle inequality in metric spaces with dilations

The Appendix of the article arXiv:1212.5056 [math.CO] "On growth in an abstract plane" by Nick Gill, H. A. Helfgott, Misha Rudnev, contains a general "geometric Ruzsa triangle inequality" in a Desarguesian projective plane. The purpose of this note is to give a similar inequality for metric spaces with dilations, that is in the absence of an algebraic or incidence structure.

2016-09-21math.COmath.MG

Scaling limit of the uniform infinite half-plane quadrangulation in the Gromov-Hausdorff-Prokhorov-uniform topology

We prove that the uniform infinite half-plane quadrangulation (UIHPQ), with either general or simple boundary, equipped with its graph distance, its natural area measure, and the curve which traces its boundary, converges in the scaling limit to the Brownian half-plane. The topology of convergence is given by the so-called Gromov-Hausdorff-Prokhorov-uniform (GHPU) metric on curve-decorated metric measure spaces, which is a generalization of the Gromov-Hausdorff metric whereby two such spaces $(X_1, d_1 , μ_1,η_1)$ and $(X_2, d_2 , μ_2,η_2)$ are close if they can be isometrically embedded into …

2017-09-04math-phmath.COmath.MG

A de Bruijn - Erdős theorem and metric spaces

De Bruijn and Erdős proved that every noncollinear set of n points in the plane determines at least n distinct lines. Chen and Chvátal suggested a possible generalization of this theorem in the framework of metric spaces. We provide partial results in this direction.

2009-05-31math.COmath.MG