Entity usage

From MaRDI portal

This page lists pages that use the given entity (e.g. Q42). The list is sorted by descending page ID, so that newer pages are listed first.

List of pages that use a given entity

Showing below up to 50 results in range #1 to #50.

View (previous 50 | ) (20 | 50 | 100 | 250 | 500)

  1. On a problem about covering lines by squares: Label: en
  2. The classification of quasi-regular polyhedra of genus 2: Label: en
  3. Corrigendum to: ``Countable decompositions of \({\mathbb{R}}^2\) and \({\mathbb{R}}^3\): Label: en
  4. Bottleneck profiles and discrete Prokhorov metrics for persistence diagrams: Label: en
  5. Topological art in simple galleries: Label: en
  6. van Kampen-Flores theorem for cell complexes: Label: en
  7. The convergence of discrete uniformizations for genus zero surfaces: Label: en
  8. Gorenstein braid cones and crepant resolutions: Label: en
  9. Capturing polytopal symmetries by coloring the edge-graph: Label: en
  10. Distortion reversal in aperiodic tilings: Label: en
  11. Embeddings of \(k\)-complexes into \(2k\)-manifolds: Label: en
  12. A sparse colorful polytopal KKM theorem: Label: en
  13. The cone of \(5 \times 5\) completely positive matrices: Label: en
  14. Trilateration using unlabeled path or loop lengths: Label: en
  15. The parameterized complexity of guarding almost convex polygons: Label: en
  16. Furstenberg sets in finite fields: explaining and improving the Ellenberg-Erman proof: Label: en
  17. A positive fraction Erdős-Szekeres theorem and its applications: Label: en
  18. An optimal deterministic algorithm for geodesic farthest-point Voronoi diagrams in simple polygons: Label: en
  19. Convergence of Gibbs sampling: coordinate hit-and-run mixes fast: Label: en
  20. Computing the multicover bifiltration: Label: en
  21. Faster algorithms for largest empty rectangles and boxes: Label: en
  22. Algorithms for contractibility of compressed curves on 3-manifold boundaries: Label: en
  23. Complexity of maximum cut on interval graphs: Label: en
  24. Guest editors' foreword: Label: en
  25. A uniform lower bound on the norms of hyperplane projections of spherical polytopes: Label: en
  26. On the extension complexity of polytopes separating subsets of the Boolean cube: Label: en
  27. Efficient algorithms for the dense packing of congruent circles inside a square: Label: en
  28. Tight bounds on the maximal area of small polygons: improved Mossinghoff polygons: Label: en
  29. PQ-type adjacency polytopes of join graphs: Label: en
  30. Search of fractal space-filling curves with minimal dilation: Label: en
  31. Completeness for the complexity class \(\forall \exists \mathbb{R}\) and area-universality: Label: en
  32. Discrete Yamabe problem for polyhedral surfaces: Label: en
  33. Combinatorial generation via permutation languages. III: Rectangulations: Label: en
  34. Delaunay and regular triangulations as lexicographic optimal chains: Label: en
  35. Open, closed, and non-degenerate embedding dimensions of neural codes: Label: en
  36. Transversals and colorings of simplicial spheres: Label: en
  37. Discrete Morse theory for computing zigzag persistence: Label: en
  38. Discrete \(\ell^1\) double bubble solution is at most ceiling plus two of the continuous solution: Label: en
  39. The complex plank problem, revisited: Label: en
  40. The number of configurations of radii that can occur in compact packings of the plane with discs of \(n\) sizes is finite: Label: en
  41. A structural Szemerédi-Trotter theorem for Cartesian products: Label: en
  42. Non-existence of annular separators in geometric graphs: Label: en
  43. On the Ehrhart polynomial of Schubert matroids: Label: en
  44. Geometric and functional inequalities for log-concave probability sequences: Label: en
  45. On fast Johnson-Lindenstrauss embeddings of compact submanifolds of \(\mathbb{R}^N\) with boundary: Label: en
  46. Intersecting diametral balls induced by a geometric graph: Label: en
  47. On the chromatic number of 2-dimensional spheres: Label: en
  48. The complexity of the Hausdorff distance: Label: en
  49. \( \varepsilon \)-isometric dimension reduction for incompressible subsets of \(\ell_p\): Label: en
  50. Computing a link diagram from its exterior: Label: en

View (previous 50 | ) (20 | 50 | 100 | 250 | 500)