Search arXivSearch

arXiv · 2512.18872

The Grünbaum--Rigby configuration as a special Kárteszi configuration

Abstract

In 1990, Branko Grünbaum and John Rigby presented a 4-configuration, known today as the \emph{Grünbaum--Rigby configuration}; it is denoted by $\mathrm{GR}(21_4)$. Independently and earlier, in 1986, Ferenc Kárteszi published a paper in which he proved a theorem in real geometry that gives rise to a series of 4-configurations $\mathrm{K}(n;\ell,m)$. In an even earlier paper from 1964, he presented a figure which is essentially the same as that given by Grünbaum and Rigby. In this paper, we explore some properties of the \emph{Kárteszi configurations} and in particular show that $\mathrm{GR}(21_4)$ is isomorphic to $\mathrm{K}(7;2,3)$. We present a theorem that gives necessary and sufficient conditions on parameters $n,\ell,m$ such that the corresponding configuration $\mathrm{K}(n;\ell,m)$ is realisable as a geometric polycyclic configuration with $n$-fold rotational symmetry and no extra incidences.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Gábor Gévay, György Kiss, Tomaž Pisanski. 2025-12-21. The Grünbaum--Rigby configuration as a special Kárteszi configuration. https://arxiv.org/abs/2512.18872

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