Volume of hypercubes clipped by hyperplanes and combinatorial identities
zbMATH Open1444.52003arXiv1512.07768MaRDI QIDQ3299334FDOQ3299334
Authors: Yunhi Cho, Seonhwa Kim
Publication date: 22 July 2020
Full work available at URL: https://arxiv.org/abs/1512.07768
File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)
Recommendations
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Length, area, volume and convex sets (aspects of convex geometry) (52A38) Arrangements of points, flats, hyperplanes (aspects of discrete geometry) (52C35)
Cites Work
- An analytical expression and an algorithm for the volume of a convex polyhedron in \(R^ n\).
- Slices, slabs, and sections of the unit hypercube
- Title not available (Why is that?)
- Polytope Volume Computation
- On the Complexity of Computing the Volume of a Polyhedron
- The volume of duals and sections of polytopes
- Title not available (Why is that?)
- The volume of simplices clipped by a half space
- What is known about unit cubes
- The problem of calculating the volume of a polyhedron is enumerably hard
- Spline Notation Applied to a Volume Problem
Cited In (6)
- The volume of simplices clipped by a half space
- Patchworking real algebraic hypersurfaces with asymptotically large Betti numbers
- Bounds for the Hilbert-Kunz multiplicity of singular rings
- Slices, slabs, and sections of the unit hypercube
- The volume of relaxed Boolean-quadric and cut polytopes
- \(\varepsilon\)-pertubation method for volume of hypercubes clipped by two or three hyperplanes
This page was built for publication: Volume of hypercubes clipped by hyperplanes and combinatorial identities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3299334)