English
Related papers

Related papers: A Result About the Density of Iterated Line Inters…

200 papers

For a nontrivial measurable set on the real line, there are always exceptional points, where the lower and upper densities of the set are neither zero nor one. We quantify this statement, following work by V. Kolyada, and obtain the…

Classical Analysis and ODEs · Mathematics 2007-05-23 Andras Szenes

Let $Q$ be a finite set of points in the plane. For any set $P$ of points in the plane, $S_{Q}(P)$ denotes the number of similar copies of $Q$ contained in $P$. For a fixed $n$, Erd\H{o}s and Purdy asked to determine the maximum possible…

Combinatorics · Mathematics 2011-03-01 Bernardo M. Ábrego , Silvia Fernández-Merchant , David B. Roberts

Let P be a set of n points in the plane, not all on a line. We show that if n is large then there are at least n/2 ordinary lines, that is to say lines passing through exactly two points of P. This confirms, for large n, a conjecture of…

Combinatorics · Mathematics 2015-03-20 Ben Green , Terence Tao

We investigate iterated function systems (IFS) that randomly alternate between two non-identical one-dimensional maps. Our primary focus is on finite invariant sets exhibiting ``toss-and-catch'' dynamics, in which trajectories alternate…

Dynamical Systems · Mathematics 2026-04-16 Hibiki Kato , Tamotsu Onozaki , Yoshitaka Saiki , Yasumasa Sugita

We study relations between transitivity, mixing and periodic points on dendrites. We prove that when there is a point with dense orbit which is not an endpoint, then periodic points are dense and there is a terminal periodic decomposition…

Dynamical Systems · Mathematics 2018-09-20 Gerardo Acosta , Rodrigo Hernández-Gutiérrez , Issam Naghmouchi , Piotr Oprocha

Given a point set, mostly a grid in our case, we seek upper and lower bounds on the number of curves that are needed to cover the point set. We say a curve covers a point if the curve passes through the point. We consider such coverings by…

Combinatorics · Mathematics 2025-11-05 Arijit Bishnu , Mathew Francis , Pritam Majumder

Inspired by the work of Newhouse in one real variable, we introduce a relevant notion of thickness for dynamical Cantor sets of the plane associated to a holomorphic IFS. Our main result is a complex version of Newhouse's Gap Lemma : we…

Dynamical Systems · Mathematics 2018-10-08 Sébastien Biebler

Let A be a pre-defined set of rational numbers. We say a set of natural numbers S is an A-quotient-free set if no ratio of two elements in S belongs to A. We find the maximal asymptotic density and the maximal upper asymptotic density of…

Combinatorics · Mathematics 2013-06-25 Tanya Khovanova , Sergei Konyagin

In this paper, we characterise ovoidal cones by their intersection numbers. We first show that a set of points of $\mathrm{PG}(4,q)$ which intersects planes in $1$, $q+1$ or $2q+1$ points is either an ovoidal cone or a parabolic quadric,…

Combinatorics · Mathematics 2024-02-27 Bart De Bruyn , Geertrui Van de Voorde

Given a smooth subscheme of a projective space over a finite field, we compute the probability that its intersection with a fixed number of hypersurface sections of large degree is smooth of the expected dimension. This generalizes the case…

Number Theory · Mathematics 2015-03-13 Alina Bucur , Kiran S. Kedlaya

Random arrangements of points in the plane, interacting only through a simple hard core exclusion, are considered. An intensity parameter controls the average density of arrangements, in analogy with the Poisson point process. It is proved…

Mathematical Physics · Physics 2014-08-18 David Aristoff

Exponential of exponential of almost every line in the complex plane is dense in the plane. On the other hand, for lines through any point, for a set of angles of Hausdorff dimension one, exponential of exponential of a line with angle from…

Classical Analysis and ODEs · Mathematics 2019-02-14 Neil Dobbs

Let $S$ be a set of $r$ red points and $b=r+2d$ blue points in general position in the plane, with $d\geq 0$. A line $\ell$ determined by them is said to be balanced if in each open half-plane bounded by $\ell$ the difference between the…

Combinatorics · Mathematics 2020-07-21 David Orden , Pedro Ramos , Gelasio Salazar

We study the "generic" degenerations of curves with two singular points when the points merge. First, the notion of generic degeneration is defined precisely. Then a method to classify the possible results of generic degenerations is…

Algebraic Geometry · Mathematics 2009-04-21 Dmitry Kerner

Let $S$ be a set of $n$ sites in the plane, so that every site $s \in S$ has an associated radius $r_s > 0$. Let $\mathcal{D}(S)$ be the disk intersection graph defined by $S$, i.e., the graph with vertex set $S$ and an edge between two…

Computational Geometry · Computer Science 2024-05-02 Alexander Baumann , Haim Kaplan , Katharina Klost , Kristin Knorr , Wolfgang Mulzer , Liam Roditty , Paul Seiferth

We determine sets of elements which, under certain conditions, generate an intersection of ideals up to radical.

Commutative Algebra · Mathematics 2007-05-23 Margherita Barile

Given a point set $S$ in a projective plane $\Pi_q$ of order $q$, each line $\ell$ determines a secant size $|S\cap \ell|$. We study how balanced the secant-size distribution can be for the line set $\mathcal{L}$ of the plane, in other…

Combinatorics · Mathematics 2026-05-25 Zoltán Lóránt Nagy , Zsuzsa Weiner

Let $\mathbb{F}$ be a field, let $P \subseteq \mathbb{F}^d$ be a finite set of points, and let $\alpha,\beta \in \mathbb{F} \setminus \{0\}$. We study the quantity \[|\Pi_{\alpha, \beta}| = \{(p,q,r) \in P \times P \times P \mid p \cdot q =…

Combinatorics · Mathematics 2015-09-08 Ben Lund

The order in which plane-filling curves visit points in the plane can be exploited to design efficient algorithms. Typically, the curves are useful because they preserve locality: points that are close to each other along the curve tend to…

Computational Geometry · Computer Science 2020-03-31 Herman Haverkort

Motivated by a path planning problem we consider the following procedure. Assume that we have two points $s$ and $t$ in the plane and take $\mathcal{K}=\emptyset$. At each step we add to $\mathcal{K}$ a compact convex set that does not…

Computational Geometry · Computer Science 2015-02-13 Sergio Cabello , Michael Kerber
‹ Prev 1 3 4 5 6 7 10 Next ›