Pith. sign in

REVIEW 1 cited by

Computing the poset of layers of a toric arrangement

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 1708.06646 v2 pith:KOOAYQ2I submitted 2017-08-22 math.CO

Matthias Lenz This is my paper · ORCID
classification math.CO
keywords arrangementposetlayerssubtoritoricalgorithmcasecentral
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

A toric arrangement is an arrangement of subtori of codimension one in a real or complex torus. The poset of layers is the set of connected components of non-empty intersections of these subtori, partially ordered by reverse inclusion. In this note we present an algorithm that computes this poset in the central case.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Representations of torsion-free arithmetic matroids

    math.CO 2019-08 conditional novelty 7.0 of 10

    A new reduction and signed Hermite normal form let every representation of a torsion-free arithmetic matroid be computed up to equivalence, yielding a sharpened upper bound and counterexamples to two shellability conjectures.

Pith tools