Automated symmetric constructions in discrete geometry

DOI10.1007/978-3-032-07021-0_3MaRDI QIDQ6856428zbMATH OpenFDO

Authors Bernardo Subercaseaux, Ethan Mackey, Long Qian, Marijn J. H. Heule

Publication date 19 February 2026

Full work available at URL https://doi.org/10.1007/978-3-032-07021-0_3

zbMATH Keywords

computational geometryrealizabilityrotational symmetrySAT

Mathematics Subject Classification ID

Computer science support for mathematical research and practice (68Vxx)

Cites work

• A SAT attack on Erdős-Szekeres numbers in \(\mathbb{R}^d\) and the empty hexagon theorem
• Automated mathematical discovery and verification: minimizing pentagons in the plane
• Avoiding triples in arithmetic progression
• Axioms and hulls
• Complexity of some geometric and topological problems
• Computer solution to the 17-point Erdős-Szekeres problem
• Enumerating order types for small point sets with applications
• Everywhere unbalanced configurations
• Formal verification of the empty hexagon number
• From summetria to symmetry. The making of a revolutionary scientific concept
• scientific article; zbMATH DE number 3643294 (Why is no real title available?)
• scientific article; zbMATH DE number 6776481 (Why is no real title available?)
• Lines and many points on both sides
• Research problems
• Sweeps, arrangements and signotopes
• Symmetry
• The Erdos-Szekeres problem on points in convex position – a survey
• Tools and Algorithms for the Construction and Analysis of Systems
• Towards an Optimal CNF Encoding of Boolean Cardinality Constraints
• Two disjoint 5-holes in point sets

Cited in

(1)

• North-east lattice paths avoiding k collinear points via satisfiability

This page was built for publication: Automated symmetric constructions in discrete geometry

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6856428)