Rigidity, graphs and Hausdorff dimension

DOI10.1007/978-3-030-67996-5_5MaRDI QIDQ6290282arXivFDO

Authors Nikolaos Chatzikonstantinou, Alex Iosevich, Sevak Mkrtchyan, Jonathan Pakianathan

Publication date 19 August 2017

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Distance in graphs (05C12) Hausdorff and packing measures (28A78) Fourier series in special orthogonal functions (Legendre polynomials, Walsh functions, etc.) (42C10) Rigidity and flexibility of structures (aspects of discrete geometry) (52C25)

Abstract: For a compact set $Esubsetmathbb{R}^d$ and a connected graph $G$ on $k+1$ vertices, we define a $G$-framework to be a collection of $k+1$ points in $E$ such that the distance between a pair of points is specified if the corresponding vertices of $G$ are connected by an edge. We regard two such frameworks as equivalent if the specified distances are the same. We show that in a suitable sense the set of equivalences of such frameworks naturally embeds in ${mathbbR}^m$ where $m$ is the number of "essential" edges of $G$. We prove that there exists a threshold $s_k<d$ such that if the Hausdorff dimension of $E$ is greater than $s_k$, then the $m$-dimensional Hausdorff measure of the set of equivalences of $G$-frameworks is positive. The proof relies on combinatorial, topological and analytic considerations.

This page was built for publication: Rigidity, graphs and Hausdorff dimension

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6290282)