中文
相关论文

相关论文: On the Density of Iterated Line Segment Intersecti…

200 篇论文

Let $S$ be a finite set of points in the plane and let $\mathcal{T}(S)$ be the set of intersection points between pairs of lines passing through any two points in $S$. We characterize all configurations of points $S$ such that iteration of…

度量几何 · 数学 2007-05-23 Christopher J. Hillar , Darren L. Rhea

Say that a subset S of the plane is a "circle-center set" if S is not a subset of a line, and whenever we choose three noncollinear points from S, the center of the unique circle through those three points is also an element of S. A problem…

度量几何 · 数学 2007-05-23 Greg Martin

Consider a plane graph G, drawn with straight lines. For every pair a,b of vertices of G, we compare the shortest-path distance between a and b in G (with Euclidean edge lengths) to their actual distance in the plane. The worst-case ratio…

计算几何 · 计算机科学 2007-05-23 Rolf Klein , Martin Kutz

Let $\Pi_q$ be an arbitrary finite projective plane of order $q$. A subset $S$ of its points is called saturating if any point outside $S$ is collinear with a pair of points from $S$. Applying probabilistic tools we improve the upper bound…

组合数学 · 数学 2017-11-28 Zoltán Lóránt Nagy

We consider the non-crossing connectors problem, which is stated as follows: Given n simply connected regions R_1,...,R_n in the plane and finite point sets P_i subset of R_i for i=1,...,n, are there non-crossing connectors y_i for…

计算几何 · 计算机科学 2012-01-05 Jan Kratochvíl , Torsten Ueckerdt

There are many examples for point sets in finite geometry, which behave "almost regularly" in some (well-defined) sense, for instance they have "almost regular" line-intersection numbers. In this paper we investigate point sets of a…

组合数学 · 数学 2023-09-11 Bence Csajbók , Peter Sziklai , Zsuzsa Weiner

We investigate dense lineability and spaceability of subsets of $\ell_\infty$ with a prescribed number of accumulation points. We prove that the set of all bounded sequences with exactly countably many accumulation points is densely…

泛函分析 · 数学 2023-05-18 Paolo Leonetti , Tommaso Russo , Jacopo Somaglia

For each vector $x\in \ell^{\infty}$, we can define the non-empty compact set $L_x$ of accumulation points of $x$. Given an infinite subset $A$ of $\mathbb{N}\backslash\{1\}$, we can therefore investigate under which conditions on $A$, the…

泛函分析 · 数学 2023-03-08 Quentin Menet , Dimitris Papathanasiou

We give sufficient conditions under which the set of eventually periodic points in the intersection of immediate attracting basins boundaries is non-empty. We give other conditions under which this set is dense in the intersection.

动力系统 · 数学 2014-05-21 Bastien Rossetti

Let $S$ be a finite set of geometric objects partitioned into classes or \emph{colors}. A subset $S'\subseteq S$ is said to be \emph{balanced} if $S'$ contains the same amount of elements of $S$ from each of the colors. We study several…

A planar point set of $n$ points is called {\em $\gamma$-dense} if the ratio of the largest and smallest distances among the points is at most $\gamma\sqrt{n}$. We construct a dense set of $n$ points in the plane with…

组合数学 · 数学 2019-04-01 István Kovács , Géza Tóth

We study the S-integral points on the complement of a union of hyperplanes in projective space, where S is a finite set of places of a number field k. In the classical case where S consists of the set of archimedean places of k, we…

数论 · 数学 2007-05-23 Aaron Levin

We consider an incidence problem in $\mathbb{R}^4$ which asks, for a set of $L$ lines and a set of $S$ planes in general position, what the maximum number of line-plane incidences is. A line-plane incidence is defined as a point where a…

组合数学 · 数学 2023-12-27 Chao Cheng

A family of sets in the plane is simple if the intersection of its any subfamily is arc-connected, and it is pierced by a line $L$ if the intersection of its any member with $L$ is a nonempty segment. It is proved that the intersection…

组合数学 · 数学 2014-08-27 Michał Lasoń , Piotr Micek , Arkadiusz Pawlik , Bartosz Walczak

Begin with a set of four points in the real plane in general position. Add to this collection the intersection of all lines through pairs of these points. Iterate. Ismailescu and Radoi\v{c}i\'{c} (2003) showed that the limiting set is dense…

组合数学 · 数学 2008-07-11 Joshua Cooper , Mark Walters

Let $\mathcal A=\{A_1,\ldots,A_n\}$ be a family of sets in the plane. For $0 \leq i < n$, denote by $f_i$ the number of subsets $\sigma$ of $\{1,\ldots,n\}$ of cardinality $i+1$ that satisfy $\bigcap_{i \in \sigma} A_i \neq \emptyset$. Let…

组合数学 · 数学 2019-12-17 Gil Kalai , Zuzana Patáková

We consider the following problem: Given a set $S$ of $n$ distinct points in the plane, how many edge-disjoint plane straight-line spanning paths can be drawn on $S$? Each spanning path must be crossing-free, but edges from different paths…

计算几何 · 计算机科学 2025-06-10 Philipp Kindermann , Jan Kratochvíl , Giuseppe Liotta , Pavel Valtr

We call $(a_1, \dots, a_n)$ an \emph{$r$-partial sequence} if exactly $r$ of its entries are positive integers and the rest are all zero. For ${\bf c} = (c_1, \dots, c_n)$ with $1 \leq c_1 \leq \dots \leq c_n$, let $S_{\bf c}^{(r)}$ be the…

组合数学 · 数学 2014-01-20 Peter Borg

Several authors have recently attempted to show that the intersection of three simply connected subcontinua of the plane is simply connected provided it is non-empty and the intersection of each two of the continua is path connected. In…

一般拓扑 · 数学 2007-05-23 E. D. Tymchatyn , V. Valov

For a set of points in the plane, a \emph{crossing family} is a set of line segments, each joining two of the points, such that any two line segments cross. We investigate the following generalization of crossing families: a \emph{spoke…

计算几何 · 计算机科学 2017-02-27 Patrick Schnider
‹ 上一页 1 2 3 10 下一页 ›