What is the Largest Sparsity Pattern That Can Be Recovered by 1-Norm Minimization?

Mustafa Devrim Kaba, Mengnan Zhao, René Vidal, Daniel P. Robinson, Enrique Mallada. What is the Largest Sparsity Pattern That Can Be Recovered by 1-Norm Minimization?. IEEE Transactions on Information Theory, 67(5):3060-3074, 2021. [doi]

@article{KabaZVRM21,
  title = {What is the Largest Sparsity Pattern That Can Be Recovered by 1-Norm Minimization?},
  author = {Mustafa Devrim Kaba and Mengnan Zhao and René Vidal and Daniel P. Robinson and Enrique Mallada},
  year = {2021},
  doi = {10.1109/TIT.2021.3067280},
  url = {https://doi.org/10.1109/TIT.2021.3067280},
  researchr = {https://researchr.org/publication/KabaZVRM21},
  cites = {0},
  citedby = {0},
  journal = {IEEE Transactions on Information Theory},
  volume = {67},
  number = {5},
  pages = {3060-3074},
}