Computational topology of equipartitions by hyperplanes
From MaRDI portal
(Redirected from Computational topology of equipartitions by hyperplanes)
Other problems of combinatorial convexity (52A37) Length, area, volume and convex sets (aspects of convex geometry) (52A38) Arrangements of points, flats, hyperplanes (aspects of discrete geometry) (52C35) Finite groups of transformations in algebraic topology (including Smith theory) (55M35) Obstruction theory in algebraic topology (55S35) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Abstract: We compute a primary cohomological obstruction to the existence of an equipartition for j mass distributions in R^d by two hyperplanes in the case 2d-3j = 1. The central new result is that such an equipartition always exists if d=6 2^k +2 and j=4 2^k+1 which for k=0 reduces to the main result of the paper P. Mani-Levitska et al., Topology and combinatorics of partitions of masses by hyperplanes, Adv. Math. 207 (2006), 266-296. This is an example of a genuine combinatorial geometric result which involves Z_4-torsion in an essential way and cannot be obtained by the application of either Stiefel-Whitney classes or cohomological index theories with Z_2 coefficients. The method opens a possibility of developing an "effective primary obstruction theory" based on -manifold complexes, with applications in geometric combinatorics, discrete and computational geometry, and computational algebraic topology.
Recommendations
- Topology and combinatorics of partitions of masses by hyperplanes
- Equipartitions of a mass in boxes
- Hyperplane mass partitions via relative equivariant obstruction theory
- Hyperplane equipartitions plus constraints
- Computational topology of equivariant maps from spheres to complements of arrangements
Cited in
(10)- Equipartitions of a mass in boxes
- Hyperplane equipartitions plus constraints
- On algebraic problems behind the Brouwer degree of equivariant maps
- User's guide to equivariant methods in combinatorics. II
- Topology of the Grünbaum–Hadwiger–Ramos hyperplane mass partition problem
- Splitting necklaces, with constraints
- Measure partitions via Fourier analysis. II: Center transversality in the \({{L}^{2}}\)-norm for complex hyperplanes
- The generalized Makeev problem revisited
- Topology and combinatorics of partitions of masses by hyperplanes
- Measure equipartitions via finite Fourier analysis
This page was built for publication: Computational topology of equipartitions by hyperplanes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q519435)