Enumerating regular mixed-cell configurations
In his paper [J. Algebr. Comb. 3, 207-236 (1994; Zbl 0798.05074)] \textit{B. Sturmfels} introduced the notion of mixed subdivisions and extended a theorem of Viro [\textit{O. Y. Viro}, Lect. Notes Math. 1060, 187-200 (1984; Zbl 0576.14031)] on constructions of algebraic curves with a prescribed topology to complete intersections [\textit{B. Sturmfels}, Ann. Sc. Norm. Super. Pisa, Cl. Sci., IV. Ser. 21, 377-386 (1994; Zbl 0826.14032)]. In the present paper the authors introduce an algorithm which gives an explicit classification of all mixed-cell configurations for a given point configuration. As they point out this gives them a tool to investigate several properties such as symmetry relations and maximal and minimal numbers of mixed cells.
- 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
- Classification of arrangements by the number of their cells
- Counterexamples to the connectivity conjecture of the mixed cells
- Unmixing the mixed volume computation
- An oracle-based, output-sensitive algorithm for projections of resultant polytopes
- scientific article; zbMATH DE number 1383707 (Why is no real title available?)
- Balancing the lifting values to improve the numerical stability of polyhedral homotopy continuation methods
- Computing the Newton polygon of the implicit equation
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)