Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2011.10700

Some Open Problems Regarding the Number of Lines and Slopes in Arrangements that Determine Shapes

Alexandros Haridis
View original source ↗Read source document ↗Export metadata ↓

Abstract

A set $L$ of straight lines and a set $P$ of points in the Euclidean plane define an arrangement $\mathcal{A}$ = ($L$, $P$) of construction lines and registration marks, if and only if: (1) any point in $P$ is a point of intersection of at least two lines in $L$, and (2) any two nonparallel lines in $L$ have a unique point of intersection in $P$. This expository article discusses the following open problems regarding such point-line arrangements. Suppose $k \geq 0$ number of points are given in the plane. How many construction lines $k$ points must determine? How many distinct slopes, or directions, are defined by construction lines that $k$ points determine? How many distinct sets of construction lines partition the plane, such that the lines meet at exactly $k$ points? Empirical evidence is reported for small numbers of $k$, offering partial answers to the three problems. A conjecture is also stated for the first problem, on the number of construction lines, after examining a related problem about finite linear spaces from incidence geometry. This paper contributes to the body of work related to the mathematics of shapes in the area of shape grammar theory.

Explore related subjects

math.GM

Keep this discovery

BibTeXRIS

Alexandros Haridis. 2020-11-21. Some Open Problems Regarding the Number of Lines and Slopes in Arrangements that Determine Shapes. https://arxiv.org/abs/2011.10700

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

KEEP EXPLORING

Related papers

arXiv2026

Average Chord Lengths in a Triangle

Let $P$ be a point inside a triangle $T$. We consider the average length of the chords of $T$ through $P$, where the direction of the chord is chosen uniformly. An elementary formula is obtained in terms of the distances from $P$ to the sides and vertices of the triangle. Several classical triangle centers give especially simple specializations. For example, if $I$ is the incenter, then \[ M_T(I)=\frac{2r}{\pi} \log\left(\cot\frac A4\cot\frac B4\cot\frac C4\right). \] Our main result is the sharp inequality \[ M_T(P)\le \frac{p}{\pi\sqrt3}\log(2+\sqrt3), \] valid simultaneously for every triangle of perimeter $p$ and every interior point $P$. Thus, among all such pairs $(T,P)$, the largest possible average chord length occurs only when $T$ is equilateral and $P$ is its center. The proof is an elementary symmetrization argument. We close with brief remarks relating the problem to the radial center of a convex body, the electrostatic potential center of a triangle, and dual quermassintegrals.

math.GM↗
arXiv2026

A Proof of Liu's Conjecture on the Fundamental Triangle Inequality

Let $a,b,c$ be the side lengths of a triangle, and let $R$ and $r$ denote its circumradius and inradius, respectively. We prove a conjecture of Liu stating that \[\sum_{\mathrm{cyc}} \left(\frac{a(b+c-a)}{bc}\right)^k \geq 2+\left(\frac{2r}{R}\right)^k,~~k>1, \] with the reverse inequality for $0<k<1$. The proof reduces the problem to three positive variables with fixed sum and product. We also determine the equality cases.

math.GM↗