One-bit sensing, discrepancy and Stolarsky's principle
From MaRDI portal
Publication:5369384
DOI10.1070/SM8656zbMath1388.11052arXiv1511.08452OpenAlexW2963470297MaRDI QIDQ5369384
Dmitriy Bilyk, Michael T. Lacey
Publication date: 17 October 2017
Published in: Sbornik: Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1511.08452
Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Irregularities of distribution, discrepancy (11K38)
Related Items (12)
On the Fejes Tóth problem about the sum of angles between lines ⋮ Exponential sums and Riesz energies ⋮ The Stolarsky principle and energy optimization on the sphere ⋮ General and refined Montgomery lemmata ⋮ STOLARSKY'S INVARIANCE PRINCIPLE FOR FINITE METRIC SPACES ⋮ Bounds for the sum of distances of spherical sets of small size ⋮ Explicit Families of Functions on the Sphere with Exactly Known Sobolev Space Smoothness ⋮ Stolarsky's invariance principle for projective spaces ⋮ Bounds for discrepancies in the Hamming space ⋮ Faces in random great hypersphere tessellations ⋮ Geodesic distance Riesz energy on the sphere ⋮ Hyperuniform point sets on the sphere: deterministic aspects
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A mathematical introduction to compressive sensing
- Covering of spheres by spherical caps and worst-case error for equal weight cubature in Sobolev spaces
- Two observations regarding embedding subsets of Euclidean spaces in normed spaces
- Diameter bounds for equal area partitions of the unit sphere
- A partition of the unit sphere into regions of equal area and small diameter
- A simple proof of the restricted isometry property for random matrices
- Distribution of points on spheres and approximation by zonotopes
- Finite normalized tight frames
- Point sets on the sphere \(\mathbb{S}^{2}\) with small spherical cap discrepancy
- An introduction to the Ribe program
- Dimension reduction by random hyperplane tessellations
- A simple proof of Stolarsky’s invariance principle
- One-Bit Compressed Sensing by Linear Programming
- Robust 1-Bit Compressive Sensing via Binary Stable Embeddings of Sparse Vectors
- Robust 1-bit Compressed Sensing and Sparse Logistic Regression: A Convex Programming Approach
- Greedy Approximation
- Some upper bounds in the theory of irregularities of distribution
- Sums of distances between points on a sphere — an application of the theory of irregularities of distribution to discrete Geometry
- Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
- Slice discrepancy and irregularities of distribution on spheres
- On the optimality of the random hyperplane rounding technique for MAX CUT
- The Covering Radius of Randomly Distributed Points on a Manifold
- The Johnson-Lindenstrauss lemma is optimal for linear dimensionality reduction
- Sums of Distances Between Points on a Sphere. II
- Geometric discrepancy. An illustrated guide
- On the discrepancy of jittered sampling
This page was built for publication: One-bit sensing, discrepancy and Stolarsky's principle
