Rigidity, Graphs and Hausdorff Dimension

DOI10.1007/978-3-030-67996-5_5OpenAlexW3195589162MaRDI QIDQ5051817FDOQ5051817

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

Publication date: 18 November 2022

Published in: Springer Proceedings in Mathematics & Statistics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1708.05919

Recommendations

• \(K\)-distance sets, Falconer conjecture, and discrete analogs
• On Falconer's distance set problem in the plane
• A Mattila-Sjölin theorem for triangles
• An improved result for Falconer's distance set problem in even dimensions
• An \(L^2\)-identity and pinned distance problem
• Theory of Dimension for Large Discrete Sets and Applications
• On the Mattila–Sjölin distance theorem for product sets
• scientific article; zbMATH DE number 7629503
• Dimensional lower bounds for Falconer type incidence theorems
• The density of sets containing large similar copies of finite sets

zbMATH Keywords

rigidity of graphsFalconer distance conjecture

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) Erd?s problems and related topics of discrete geometry (52C10) Rigidity and flexibility of structures (aspects of discrete geometry) (52C25)

Cites Work

• On graphs and rigidity of plane skeletal structures
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the Betti Numbers of Real Varieties
• Group actions and geometric combinatorics in \(\mathbb{F}_{q}^{d}\)
• Three-point configurations determined by subsets of \({\mathbb{F}_q}^2\) via the Elekes-Sharir paradigm
• The Rigidity of Graphs
• A group-theoretic viewpoint on Erdös-Falconer problems and the Mattila integral
• Ubiquity of simplices in subsets of vector spaces over finite fields
• A Szemerédi type theorem for sets of positive density in \(\mathbb R^k\)
• Finite configurations in sparse sets
• On necklaces inside thin subsets of \(\mathbb{R}^d\)
• Finite chains inside thin subsets of \(\mathbb{R}^d\)
• Nilfactors of \(\mathbb R^m\) and configurations in sets of positive upper density in \(\mathbb R^m\)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Rigid and Flexible Frameworks
• The number of embeddings of minimally rigid graphs
• On polynomial configurations in fractal sets
• Estimates of spherial averages of Fourier transforms and dimensions of sets
• Title not available (Why is that?)
• Falconer distance problem, additive energy and Cartesian products

Cited In (8)

• Rigidity theorems of spacelike entire self-shrinking graphs in the pseudo-Euclidean space
• Graph rigidity via Euclidean distance matrices
• Algebraic Distance Graphs and Rigidity
• A rigidity theorem for a space-like graph of higher codimension
• Rigidity theorem of graph-directed fractals
• Embedding distance graphs in finite field vector spaces
• Finite point configurations in the plane, rigidity and Erdős problems
• Global Rigidity of Unit Ball Graphs

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 Q5051817)