MétaCan
Menu
Back to cohort
Record W2395375684

Basis Enumeration of Hyperplane Arrangements Up to Symmetries.

2012· article· en· W2395375684 on OpenAlex

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

VenueCanadian Conference on Computational Geometry · 2012
Typearticle
Languageen
FieldMathematics
TopicAdvanced Combinatorial Mathematics
Canadian institutionsUniversity of New Brunswick
Fundersnot available
KeywordsPolyhedronHyperplaneInvariant (physics)Symmetry groupEnumerationHomogeneous spaceSymmetry (geometry)Basis (linear algebra)SpeedupGroup (periodic table)MathematicsComputer scienceAlgebra over a fieldCombinatoricsPure mathematicsParallel computingPhysicsGeometry
DOInot available

Abstract

fetched live from OpenAlex

Given a symmetry group acting on the hyperplanes of an arrangement, our goal is to report a single basis from each orbit of bases induced by this group. In this paper we extend previous techniques for finding the (feasible) bases of polyhedra up to symmetry, and for computing the symmetry groups of polyhedra, to the setting of hyperplane arrangements. We present some preliminary experiments with a C++ implementation of these techniques called Basil. These results show substantial speedups compared to a previous polyhedra only system using the computer algebra system GAP. We also measure the speedup due to a Gram matrix invariant, and show that the overhead of symmetry testing, while substantial, is dominated by the savings in reduced pivoting.

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.002
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: Theoretical or conceptual
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.098
Threshold uncertainty score0.774

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.002
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0010.001
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.000

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.089
GPT teacher head0.333
Teacher spread0.244 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it