The Structure of Homometric Sets
From MaRDI portal
Cited in
(19)- Phase retrieval
- A partial digest approach to restriction site mapping
- Twin subgraphs and core-semiperiphery-periphery structures
- The restriction mapping problem revisited.
- Phase retrieval for probability measures on Abelian groups
- Recovering a tree from the lengths of subtrees spanned by a randomly chosen sequence of leaves
- A point set puzzle revisited
- A Brunn-Minkowski inequality for the integer lattice
- On homometric sets in graphs
- Homometry and direct-sum decompositions of lattice-convex sets
- Discrete phase retrieval in musical structures
- Covariogram of non-convex sets
- On the reconstruction of planar lattice-convex sets from the covariogram
- Benchmark problems for phase retrieval
- String reconstruction from substring compositions
- Taking music seriously: on the dynamics of `mathemusical' research with a focus on hexachordal theorems
- Finite alphabet phase retrieval
- Computational geometric aspects of rhythm, melody, and voice-leading
- Partial digest is hard to solve for erroneous input data
This page was built for publication: The Structure of Homometric Sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4739919)