Rigidity, Graphs and Hausdorff Dimension
From MaRDI portal
Publication:5051817
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)
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
Cites work
- scientific article; zbMATH DE number 16111 (Why is no real title available?)
- scientific article; zbMATH DE number 1331721 (Why is no real title available?)
- scientific article; zbMATH DE number 718857 (Why is no real title available?)
- scientific article; zbMATH DE number 2001569 (Why is no real title available?)
- scientific article; zbMATH DE number 3223507 (Why is no real title available?)
- scientific article; zbMATH DE number 2211577 (Why is no real title available?)
- A Szemerédi type theorem for sets of positive density in \(\mathbb R^k\)
- A group-theoretic viewpoint on Erdös-Falconer problems and the Mattila integral
- Estimates of spherial averages of Fourier transforms and dimensions of sets
- Falconer distance problem, additive energy and Cartesian products
- Finite chains inside thin subsets of \(\mathbb{R}^d\)
- Finite configurations in sparse sets
- Group actions and geometric combinatorics in \(\mathbb{F}_{q}^{d}\)
- Nilfactors of \(\mathbb R^m\) and configurations in sets of positive upper density in \(\mathbb R^m\)
- On graphs and rigidity of plane skeletal structures
- On necklaces inside thin subsets of \(\mathbb{R}^d\)
- On polynomial configurations in fractal sets
- On the Betti Numbers of Real Varieties
- Rigid and Flexible Frameworks
- The Rigidity of Graphs
- The number of embeddings of minimally rigid graphs
- Three-point configurations determined by subsets of \({\mathbb{F}_q}^2\) via the Elekes-Sharir paradigm
- Ubiquity of simplices in subsets of vector spaces over finite fields
Cited in
(9)- Algebraic Distance Graphs and Rigidity
- Finite point configurations in the plane, rigidity and Erdős problems
- Graph rigidity via Euclidean distance matrices
- Embedding distance graphs in finite field vector spaces
- Rigidity theorem of graph-directed fractals
- Rigidity theorems of spacelike entire self-shrinking graphs in the pseudo-Euclidean space
- Global Rigidity of Unit Ball Graphs
- Rigidity, graphs and Hausdorff dimension
- A rigidity theorem for a space-like graph of higher codimension
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)