Pith. sign in

REVIEW

Computing characteristic polynomials of hyperplane arrangements with symmetries

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2105.14542 v3 pith:DNQAHFM3 submitted 2021-05-30 math.CO

Taylor Brysiewicz , Holger Eble , Lukas Kühne This is my paper · ORCID
classification math.CO
keywords arrangementscharacteristiccomputinghyperplanealgorithmpolynomialsapplicationsarrangement
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

We introduce a new algorithm computing the characteristic polynomials of hyperplane arrangements which exploits their underlying symmetry groups. Our algorithm counts the chambers of an arrangement as a byproduct of computing its characteristic polynomial. We showcase our julia implementation, based on OSCAR, on examples coming from hyperplane arrangements with applications to physics and computer science.

Discussion (0). Continue with ORCID to comment.

Pith tools