Search arXivSearch

arXiv · 2210.12465

Direction-Critical Configurations in Noncentral General Position

Abstract

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 \emph{direction-(near)-critical} and their full classification is still open. To date, there are four known infinite families and over 100 sporadic critical configurations. Jamison conjectured that any direction-critical configuration with at least 50 points belongs to those four infinite families. Interestingly, except for a handful of sporadic configurations, all these configurations are centrally symmetric. We prove Jamison's conjecture, and extend it to the near-critical case, for centrally symmetric configurations in \emph{noncentral general position}, where only the connecting lines through the center of symmetry may pass through more than two points. As in Ungar's proof, our results are proved in the more general setting of \emph{allowable sequences}. We show that, up to equivalence, the \emph{central signature} of a set uniquely determines a centrally symmetric direction-(near)-critical allowable sequence in noncentral general position, and classify such allowable sequences that are geometrically realizable.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Silvia Fernández-Merchant, Rimma Hämäläinen. 2022-10-22. Direction-Critical Configurations in Noncentral General Position. https://arxiv.org/abs/2210.12465

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO