REVIEW 1 cited by
On separability in discrete geometry
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
Signed reviews
read the original abstract
A problem of Erd\H{o}s (Amer. Math. Monthly 52: 494-498, 1945) and a theorem of Fejes T\'oth and Fejes T\'oth (Acta Math. Acad. Sci. Hungar. 24: 229-232, 1973) initiated the study of non-separable arrangements of convex bodies and the investigation of totally separable packings of convex bodies with both topics analyzing the concept of separability from the point view of discrete geometry. This article surveys the progress made on these and some closely related problems and highlights the relevant questions that have been left open.
Forward citations
Cited by 1 Pith paper
-
Online Learning of Neural Networks
Online mistake bounds for sign-activation feedforward networks are governed by a totally-separable packing number of the first layer margin, with dimension-free bounds under multi-index or all-layer margin assumptions.
Discussion (0). Continue with ORCID to comment.