Related papers: Crescent configurations in normed spaces

Given two points $p,q$ in the real plane, the signed area of the rectangle with the diagonal $[pq]$ equals the square of the Minkowski distance between the points $p,q$. We prove that $N>1$ points in the Minkowski plane $\R^{1,1}$ generate…

In this paper, we first introduce and study the notion of random Chebyshev centers. Further, based on the recently developed theory of stable sets, we introduce the notion of random complete normal structure so that we can prove the two…

An ordinary circle of a set $P$ of $n$ points in the plane is defined as a circle that contains exactly three points of $P$. We show that if $P$ is not contained in a line or a circle, then $P$ spans at least $\frac{1}{4}n^2 - O(n)$…

We used the N-body code of Hernquist and Ostriker (1992) to build a dozen cuspy ({\gamma}\approx 1) triaxial models of stellar systems through dissipationless collapses of initially spherical distributions of 10^6 particles. We chose four…

A previous work introduced pair space, which is spanned by the center of mass of a system and the relative positions (pair positions) of its constituent bodies. Here, I show that in the $N$-body Newtonian problem, a configuration that does…

A two-dimensional grid with dots is called a \emph{configuration with distinct differences} if any two lines which connect two dots are distinct either in their length or in their slope. These configurations are known to have many…

Packing problems, which ask how to arrange a collection of objects in space to meet certain criteria, are important in a great many physical and biological systems, where geometrical arrangements at small scales control behaviour at larger…

A Euclidean noncrossing Steiner $(1+\epsilon)$-spanner for a point set $P\subset\mathbb{R}^2$ is a planar straight-line graph that, for any two points $a, b \in P$, contains a path whose length is at most $1+\epsilon$ times the Euclidean…

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…

An O'Nan configuration in a unital is a set of four lines forming a quadrilateral, where the six intersections of pairs of lines are points of the unital. In 2019 Feng and Li elegantly construct O'Nan configurations in Buekenhout-Metz…

Disordered systems like liquids, gels, glasses, or granular materials are not only ubiquitous in daily life and in industrial applications but they are also crucial for the mechanical stability of cells or the transport of chemical and…

We consider the problem of embedding a symmetric configuration with block size 3 in an orientable surface in such a way that the blocks of the configuration form triangular faces and there is only one extra large face. We develop a…

Let $S$ be a set of $n$ points in $\mathbb{R}^3$, no three collinear and not all coplanar. If at most $n-k$ are coplanar and $n$ is sufficiently large, the total number of planes determined is at least $1 + k…

We propose an unexpected twist to description of the geometry and topology of configurations of n straight lines considered as a whole 3D entity (because the lines are inseparably linked pairwise while having linking numbers 1/2 or -1/2)…

A result of Erd\"os and R\'enyi shows that for a fixed integer n almost all graphs satisfy the n-e.c. adjacency property. However, there are few explicit constructions of n e.c. graphs for n > 2, and almost all known families of n-e.c.…

Fix integers $n \ge r \ge 2$. A clique partition of ${[n] \choose r}$ is a collection of proper subsets $A_1, A_2, ..., A_t \subset [n]$ such that $\bigcup_i{A_i \choose r}$ is a partition of ${[n] \choose r}$. Clique partitions are related…

This research investigates centered co-circular central configurations in the general power-law potential $n$-body problem. Firstly, there are no such configurations when all masses are equal, except for two; secondly, unless all masses are…

In this paper we show that every sufficiently large family of convex bodies in the plane has a large subfamily in convex position provided that the number of common tangents of each pair of bodies is bounded and every subfamily of size five…

We study three different poset structures on the set of all compositions. In the first case, the covering relation consists of inserting a part of size one to the left or to the right, or increasing the size of some part by one. The…

A special case of a combinatorial theorem of De Bruijn and Erdos asserts that every noncollinear set of n points in the plane determines at least n distinct lines. Chen and Chvatal suggested a possible generalization of this assertion in…