中文
相关论文

相关论文: A Result About the Density of Iterated Line Inters…

200 篇论文

In this paper we introduce the concept of infinite pointwise dense lineability (spaceability), and provide a criterion to obtain density from mere lineability. As an application, we study the linear and topological structures within the set…

泛函分析 · 数学 2023-11-14 M. C. Calderón-Moreno , P. J. Gerlach-Mena , J. A. Prado-Bassas

We show that the points that converge to infinity under iteration of the exponential map form a connected subset of the complex plane.

动力系统 · 数学 2010-04-08 Lasse Rempe

The purpose of this note is to study configurations of lines in projective planes over arbitrary fields having the maximal number of intersection points where three lines meet. We give precise conditions on ground fields F over which such…

We study plane curves over finite fields whose tangent lines at smooth $\mathbb{F}_q$-points together cover all the points of $\mathbb{P}^2(\mathbb{F}_q)$.

代数几何 · 数学 2023-04-05 Shamil Asgarli , Dragos Ghioca

We study the rationality of the intersection points of certain lines and smooth plane quartics C defined over F_q. For q \geq 127, we prove the existence of a line such that the intersection points with C are all rational. Using another…

数论 · 数学 2010-07-07 Roger Oyono , Christophe Ritzenthaler

We use three different methods to count the number of lines in the plane whose intersection with a fixed general quintic has fixed cross-ratios. We compare and contrast these methods, shedding light on some classical ideas which underly…

代数几何 · 数学 2011-09-28 Charles Cadman , Radu Laza

For a given shape $S$ in the plane, one can ask what is the lowest possible density of a point set $P$ that pierces ("intersects", "hits") all translates of $S$. This is equivalent to determining the covering density of $S$ and as such is…

计算几何 · 计算机科学 2021-08-27 Adrian Dumitrescu , Josef Tkadlec

We investigate the maximum number of intersections between two polygons with p and q vertices, respectively, in the plane. The cases where p or q is even or the polygons do not have to be simple are quite easy and already known, but when p…

组合数学 · 数学 2015-02-11 Felix Günther

The Szemer\'edi-Trotter theorem gives a bound on the maximum number of incidences between points and lines on the Euclidean plane. In particular it says that $n$ lines and $n$ points determine $O(n^{4/3})$ incidences. Let us suppose that an…

组合数学 · 数学 2007-05-23 Jozsef Solymosi

Periodic point sets model all solid crystalline materials whose structures are determined in a rigid form and should be studied up to rigid motion or isometry preserving inter-point distances. In 2021 H.Edelsbrunner et al. introduced an…

计算几何 · 计算机科学 2022-05-05 Olga Anosova , Vitaliy Kurlin

We present some elementary ideas to prove the following Sylvester-Gallai type theorems involving incidences between points and lines in the planes over the complex numbers and quaternions. (1) Let A and B be finite sets of at least two…

组合数学 · 数学 2009-03-12 Jozsef Solymosi , Konrad J. Swanepoel

We study the probability for a random line to intersect a given plane curve, defined over a finite field, in a given number of points defined over the same field. In particular, we focus on the limits of these probabilities under successive…

组合数学 · 数学 2021-04-30 Mehdi Makhul , Josef Schicho , Matteo Gallet

The aim of this paper is to investigate the intersection problem between two linear sets in the projective line over a finite field. In particular, we analyze the intersection between two clubs with eventually different maximum fields of…

组合数学 · 数学 2020-04-21 Giovanni Zini , Ferdinando Zullo

This paper attacks the following problem. We are given a large number $N$ of rectangles in the plane, each with horizontal and vertical sides, and also a number $r<N$. The given list of $N$ rectangles may contain duplicates. The problem is…

数据结构与算法 · 计算机科学 2017-03-28 David B. A. Epstein , Mike Paterson

The point process of vertices of an iteration infinitely divisible or more specifically of an iteration stable random tessellation in the Euclidean plane is considered. We explicitly determine its covariance measure and its pair-correlation…

概率论 · 数学 2011-04-05 Tomasz Schreiber , Christoph Thaele

Let $D$ be a non-pseudoconvex open set in $\C^3$ and $S$ be the union of all two-dimensional planes with non-empty and non-pseudoconvex intersection with $D.$ Sufficient conditions are given for $\C^3\setminus S$ to belong to a complex…

复变函数 · 数学 2012-11-19 Nikolai Nikolov , Peter Pflug

Let $S$ be a finitely generated abelian semigroup of invertible linear operators on a finite dimensional real or complex vector space $V$. We show that every coarsely dense orbit of $S$ is actually dense in $V$. More generally, if the orbit…

泛函分析 · 数学 2013-02-20 Herbert Abels , Antonios Manoussos

We count the number of conics through two general points in complete intersections when this number is finite and give an application in terms of quasi-lines.

代数几何 · 数学 2018-01-15 Laurent Bonavero , Andreas Höring

Dobbs proved that the second iterate of almost every line in the complex plane under the exponential function is dense in the plane. In this paper, we prove an analogous result for the second iterate of the Zorich map in $\mathbb{R}^3$.

复变函数 · 数学 2026-05-28 Atakora Agoro , Alastair N. Fletcher

Nested parentheses are forms in an algebra which define orders of evaluations. A class of well-formed sets of associated opening and closing parentheses is well studied in conjunction with Dyck paths and Catalan numbers. Nested parentheses…

组合数学 · 数学 2016-09-20 Richard J. Mathar