Related papers: Crescent configurations in normed spaces

One way to characterize configurations of points up to congruence is by considering the distribution of all mutual distances between points. This paper deals with the question if point configurations are uniquely determined by this…

In this paper, we propose a class of elementary plane geometry problems closely related to the title of this paper. Here, a circle is the 1-dimensional curve bounding a disk. For any nonnegative integer, a circle is called $n$-enclosing if…

The parameter space of $n$ ordered points in projective $d$-space that lie on a rational normal curve admits a natural compactification by taking the Zariski closure in $(\mathbb{P}^d)^n$. The resulting variety was used to study the…

We study extensions of the classic \emph{Line Cover} problem, which asks whether a set of $n$ points in the plane can be covered using $k$ lines. Line Cover is known to be NP-hard, and we focus on two natural generalizations. The first is…

A continuous map C^d -> C^N is a complex k-regular embedding if any k pairwise distinct points in C^d are mapped by f into k complex linearly independent vectors in C^N. Our central result on complex k-regular embeddings extends results of…

We investigate the enumerative geometry of point configurations in projective space. We define "projective configuration counts": these enumerate configurations of points in projective space such that certain specified subsets are in fixed…

We examine the crescent singularity of a developable cone in a setting similar to that studied by Cerda et al [Nature 401, 46 (1999)]. Stretching is localized in a core region near the pushing tip and bending dominates the outer region. Two…

In this article we prove two main results. Firstly, we show that any six-line arrangement, consisting of three pairs of mutually perpendicular lines, does not give rise to a "very generic or sufficiently general" discriminantal arrangement…

Given a set of points in the plane, a \emph{crossing family} is a collection of segments, each joining two of the points, such that every two segments intersect internally. Aronov et al. [Combinatorica,~14(2):127-134,~1994] proved that any…

We present constructions and results about GDDs with two groups and block size 6. We study those GDDs in which each block has configuration (s,t), that is in which each block has exactly s points from one of the two groups and t points from…

Erdos, Herzog and Piranian asked whether, for $n$ points in the plane with fixed diameter (maximum distance between points), an arrangement of a regular $n$-gon maximizes their product of all pairs of distances. Recently, it was discovered…

The celebrated Szemer\'edi--Trotter theorem states that the maximum number of incidences between $n$ points and $n$ lines in the plane is $O(n^{4/3})$, which is asymptotically tight. Solymosi (2005) conjectured that for any set of points…

A set of n non-collinear points in the Euclidean plane defines at least n different lines. Chen and Chv\'atal in 2008 conjectured that the same results is true in metric spaces for an adequate definition of line. More recently, this…

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…

In 1982, Ungar proved that the connecting lines of a set of $n$ noncollinear points in the plane determine at least $2\lfloor n/2 \rfloor$ directions (slopes). Sets achieving this minimum for $n$ odd (even) are called…

Central configurations play an important role in the dynamics of the $n$-body problem: they occur as relative equilibria and as asymptotic configurations in colliding trajectories. We illustrate how they can be found as projective fixed…

We study well-posedness, stabilization and control problems involving freely vibrating beams that may undergo motions of large magnitude -- i.e. large displacements of the reference line and large rotations of the cross sections. Such…

Given a finite set satisfying condition $\mathcal{A}$, the subset selection problem asks, how large of a subset satisfying condition $\mathcal{B}$ can we find? We make progress on three instances of subset selection problems in planar point…

We study the problems of bounding the number weak and strong independent sets in $r$-uniform, $d$-regular, $n$-vertex linear hypergraphs with no cross-edges. In the case of weak independent sets, we provide an upper bound that is tight up…

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…