相关论文: On Perles' configuration

Let $P$ be a set of $n$ points in the plane that determines at most $n/5$ distinct distances. We show that no line can contain more than $O(n^{43/52}{\rm polylog}(n))$ points of $P$. We also show a similar result for rectangular distances,…

Geometrical objects with integral sides have attracted mathematicians for ages. For example, the problem to prove or to disprove the existence of a perfect box, that is, a rectangular parallelepiped with all edges, face diagonals and space…

We prove that every minimal brick on n vertices has at least n/9 vertices of degree at most 4.

In 1972, Branko Gr\"unbaum conjectured that any arrangement of $n>2$ pairwise crossing pseudocircles in the plane can have at most $2n-2$ digons (regions enclosed by exactly two pseudoarcs), with the bound being tight. While this conjecture…

A crystallographic arrangement is a set of linear hyperplanes satisfying a certain integrality property and decomposing the space into simplicial cones. Crystallographic arrangements were completely classified in a series of papers by…

We show that among any $n$ points in the unit cube one can find a triangle of area at most $n^{-2/3-c}$ for some absolute constant $c >0$. This gives the first non-trivial upper bound for the three-dimensional version of Heilbronn's…

We show that there are only finitely many combinatorial types of free real line arrangements with only double, triple and quadruple intersection points, and we enlist all admissible weak-combinatorics of them. Then we classify all real…

In this work, we carry out structural and algorithmic studies of a problem of barrier forming: selecting theminimum number of straight line segments (barriers) that separate several sets of mutually disjoint objects in the plane. The…

Let $P$ be a set of $n$ points in real projective $d$-space, not all contained in a hyperplane, such that any $d$ points span a hyperplane. An ordinary hyperplane of $P$ is a hyperplane containing exactly $d$ points of $P$. We show that if…

We provide a complete classification, in the language of weak-combinatorics, of minimal plus-one generated line arrangements in the complex projective plane with double and triple intersection points.

In \cite{F} J.F. Feinstein constructed a compact plane set $X$ such that $R(X)$ has no non-zero, bounded point derivations but is not weakly amenable. In the same paper he gave an example of a separable uniform algebra $A$ such that every…

We prove the existence of subspace designs with any given parameters, provided that the dimension of the underlying space is sufficiently large in terms of the other parameters of the design and satisfies the obvious necessary divisibility…

Let $P$ be a set of $n$ points in general position in the plane. Let $R$ be a set of points disjoint from $P$ such that for every $x,y \in P$ the line through $x$ and $y$ contains a point in $R$. We show that if $|R| < \frac{3}{2}n$ and $P…

We present a program for enumerating all pseudoline arrangements with a small number of pseudolines and abstract order types of small point sets. This program supports computer experiments with these structures, and it complements the…

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…

We show that the strategy of point counting in o-minimal structures can be applied to various problems on unlikely intersections that go beyond the conjectures of Manin-Mumford and Andr\'e-Oort. We verify the so-called Zilber-Pink…

A classic theorem of Euclidean geometry asserts that any noncollinear set of $n$ points in the plane determines at least $n$ distinct lines. Chen and Chv\'atal conjectured that this holds for an arbitrary finite metric space, with a certain…

There are many papers studying properties of point sets in the Euclidean space $\mathbb{E}^m$ or on integer grids $\mathbb{Z}^m$, with pairwise integral or rational distances. In this article we consider the distances or coordinates of the…

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…

In the present article, we consider Algebraic Geometry codes on some rational surfaces. The estimate of the minimum distance is translated into a point counting problem on plane curves. This problem is solved by applying the upper bound…