Related papers: Crescent configurations in normed spaces

In this paper we study the concept of characteristic numbers and Chern slopes in the context of curve configurations in the real and complex projective plane. We show that some extremal line configurations inherit the same asymptotic…

Given a collection of $l$ general lines $\ell_1,\ldots,\ell_{l}$ in $\pr^2$, the star configuration $\XX(l)$ is the set of points constructed from all pairwise intersections of these lines. For each non-negative integer $d$, we compute the…

For a set $P$ of $n$ points in the plane in general position, a non-crossing spanning tree is a spanning tree of the points where every edge is a straight-line segment between a pair of points and no two edges intersect except at a common…

Point configurations have been widely used as model systems in condensed matter physics, materials science and biology. Statistical descriptors such as the $n$-body distribution function $g_n$ is usually employed to characterize the point…

In 2001, K\'arolyi, Pach and T\'oth introduced a family of point sets to solve an Erd\H{o}s-Szekeres type problem; which have been used to solve several other Ed\H{o}s-Szekeres type problems. In this paper we refer to these sets as nested…

Let $V_1, V_2, V_3, \dots $ be a sequence of $\mathbb{Q}$-vector spaces where $V_n$ carries an action of $\mathfrak{S}_n$ for each $n$. {\em Representation stability} and {\em multiplicity stability} are two related notions of when the…

We show that for $m$ points and $n$ lines in the real plane, the number of distinct distances between the points and the lines is $\Omega(m^{1/5}n^{3/5})$, as long as $m^{1/2}\le n\le m^2$. We also prove that for any $m$ points in the…

This study focuses on defining normal and strictly convex structures within Menger cone PM-space. It also presents a shared fixed point theorem for the existence of two self-mappings constructed on a strictly convex probabilistic cone…

The degree of a point configuration is defined as the maximal codimension of its interior faces. This concept is motivated from a corresponding Ehrhart-theoretic notion for lattice polytopes and is related to neighborly polytopes and the…

In this paper, we prove that a set of $N$ points in ${\bf R}^2$ has at least $c{N \over \log N}$ distinct distances, thus obtaining the sharp exponent in a problem of Erd\"os. We follow the set-up of Elekes and Sharir which, in the spirit…

New bounds on the number of similar or directly similar copies of a pattern within a finite subset of the line or the plane are proved. The number of equilateral triangles whose vertices all lie within an $n$-point subset of the plane is…

We define a triangle design as a partition of the set of lines of a projective space into triangles, where a triangle consists of three pairwise intersecting lines with no common point. A triangle design is balanced if all points are…

We consider the space $F_n$ of configurations of $n$ points in $P^2$ satisfying the condition that no three of the points lie on a line. For $n = 4, 5, 6$, we compute $H^*(F_n; \mathbb{Q})$ as an $S_n$-representation. The cases $n = 5, 6$…

The Erd\H os unit distance conjecture in the plane says that the number of pairs of points from a point set of size $n$ separated by a fixed (Euclidean) distance is $\leq C_{\epsilon} n^{1+\epsilon}$ for any $\epsilon>0$. The best known…

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 study the stability of the O(N) fixed point in three dimensions under perturbations of the cubic type. We address this problem in the three cases $N=2,3,4$ by using finite size scaling techniques and high precision Monte Carlo…

In this paper, we deal with the question; under what conditions the points $P_i(xi,yi)$ $(i = 1,\cdots, n)$ form a convex polygon provided $x_1 < \cdots < x_n$ holds. One of the main findings of the paper can be stated as follows: "Let…

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…

Nonexpansive mappings play a central role in modern optimization and monotone operator theory because their fixed points can describe solutions to optimization or critical point problems. It is known that when the mappings are sufficiently…

We investigate which planar point sets allow simultaneous straight-line embeddings of all planar graphs on a fixed number of vertices. We first show that $(1.293-o(1))n$ points are required to find a straight-line drawing of each $n$-vertex…