Pith. sign in

REVIEW 3 cited by

A combinatorial non-positive curvature I: weak systolicity

Not yet reviewed by Pith; the record is open.

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 1305.4661 v1 pith:LO6WLN63 submitted 2013-05-20 math.GR

A combinatorial non-positive curvature I: weak systolicity

classification math.GR
keywords groupssystoliccomplexesweaklycombinatorialsimplicialthemacting
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

We introduce the notion of weakly systolic complexes and groups, and initiate regular studies of them. Those are simplicial complexes with nonpositive-curvature-like properties and groups acting on them geometrically. We characterize weakly systolic complexes as simply connected simplicial complexes satisfying some local combinatorial conditions. We provide several classes of examples --- in particular systolic groups and CAT(-1) cubical groups are weakly systolic. We present applications of the theory, concerning Gromov hyperbolic groups, Coxeter groups and systolic groups.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 3 Pith papers

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

  1. Solving Approximate Agreement on continuous and discrete spaces

    cs.DC 2026-06 unverdicted novelty 8.0

    ε-agreement is solvable in every CUB space, and simplex agreement on a simplicial complex C is solvable for n+1 processes iff C is (n-1)-connected.

  2. Weak rank rigidity for groups with a navigable path system

    math.GR 2026-05 unverdicted novelty 8.0

    Groups with navigable path systems satisfy weak rank rigidity and the Morse local-to-global property, proved uniformly via a new generalised contraction space.

  3. Halfspace separation in geodesic convexity

    cs.DM 2026-04 unverdicted novelty 5.0

    Geodesic halfspace separation is polynomial-time solvable on weakly bridged graphs, pseudo-modular graphs, and matroid basis graphs.