Search arXivSearch

arXiv · 2408.09203

When Grünbaum meets Poncelet -- Infinite Classes of Movable $n_4$ Configurations

Abstract

We study relations between $(n_4)$ incidence configurations and the classical Poncelet Porism. Poncelet's result studies two conics and a sequence of points and lines that inscribes one conic and circumscribes the other. Poncelet's Porism states that whether this sequence closes up after $m$ steps only depends on the conics and not on the initial point of the sequence. In other words: Poncelet polygons are movable. We transfer this motion into a flexibility statement about a large class of $(n_4)$ configurations, which are configurations where 4 (straight) lines pass through each point and four points lie on each line. A first instance of such configurations in real geometry had been given by Grünbaum and Rigby in their classical 1990 paper where they constructed the first known real geometric realisation of a well known combinatorial $(21_4)$ configuration (which had been studied by Felix Klein), now called the Grünbaum-Rigby configuration. Since then, there has been an intensive search for movable $(n_4)$ configurations, but it is very surprising that the Grünbaum-Rigby $(21_4)$ configuration admits nontrivial motions. It is well-known that the Grünbaum-Rigby configuration is the smallest example of an infinite class of $(n_4)$ configurations, the trivial celestial configurations. A major result of this paper is that we show that all trivial celestial configurations are movable via Poncelet's Porism and results about properties of Poncelet grids. Alternative approaches via geometry of billiards, in-circle nets, and pentagram maps that relate the subject to discrete integrable systems are given as well.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Leah Wrenn Berman, Gábor Gévay, Jürgen Richter-Gebert, Serge Tabachnikov. 2024-08-17. When Grünbaum meets Poncelet -- Infinite Classes of Movable $n_4$ Configurations. https://arxiv.org/abs/2408.09203

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

KEEP EXPLORING

Related papers

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO