Isoperimetric Inequalities on Hexagonal Grids

Berit Gru{\ss}ien

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 1201.0697 v1 pith:GXV6ZFOW submitted 2012-01-03 math.CO math.MG

Isoperimetric Inequalities on Hexagonal Grids

Berit Gru{\ss}ien This is my paper

classification math.CO math.MG

keywords hexagonalnumberboundsgivengridgridsinfinitelower

verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved

0 comments

read the original abstract

We consider the edge- and vertex-isoperimetric probem on finite and infinite hexagonal grids: For a subset W of the hexagonal grid of given cardinality, we give a lower bound for the number of edges between W and its complement, and lower bounds for the number of vertices in the neighborhood of W and for the number of vertices in the boundary of W. For the infinite hexagonal grid the given bounds are tight.

discussion (0)

Forward citations

Cited by 1 Pith paper

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

Toward Covert Quantum Computing
quant-ph 2026-05 conditional novelty 6.0

The paper defines covert quantum computing via quantum strategies, proves O(sqrt(n)) border qubits suffice for detection in planar n-qubit circuits with nearest-neighbor crosstalk, and experimentally detects additiona...