Enumerating regular mixed-cell configurations
From MaRDI portal
Publication:1293676
DOI10.1007/PL00009439zbMATH Open0951.52012MaRDI QIDQ1293676FDOQ1293676
Authors: T. Michiels, J. Verschelde
Publication date: 13 September 1999
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Recommendations
- On the number of regular configurations
- Cell patterns in integer partitions
- Classification of arrangements by the number of their cells
- Permutation patterns and cell decompositions
- Output-sensitive cell enumeration in hyperplane arrangements
- scientific article; zbMATH DE number 1383707
- Existence and enumeration of configurations
- Cell complexities in hyperplane arrangements
- Enumerating split-pair arrangements
Computational aspects related to convexity (52B55) Polyhedral manifolds (52B70) Enumerative problems (combinatorial problems) in algebraic geometry (14N10)
Cited In (6)
- Computing the Newton polygon of the implicit equation
- Balancing the lifting values to improve the numerical stability of polyhedral homotopy continuation methods
- Title not available (Why is that?)
- Classification of arrangements by the number of their cells
- Unmixing the mixed volume computation
- An oracle-based, output-sensitive algorithm for projections of resultant polytopes
This page was built for publication: Enumerating regular mixed-cell configurations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1293676)