Pith. sign in

REVIEW 1 cited by

Generalizations of Joints Problem

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 1606.08525 v1 pith:HDFN723D submitted 2016-06-28 math.CO

classification math.CO
keywords jointsnumberalmostboundmathbbplanesproblemsharp
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
abstract

We generalize the joints problem to sets of varieties and prove almost sharp bound on the number of joints. As a special case, given a set of $N$ $2$-planes in $\mathbb{R}^6$, the number of points at which three $2$-planes intersect and span $\mathbb{R}^6$ is at most $CN^{3/2+\epsilon}$. We also get almost sharp bound on the number of joints with multiplicities. The main tools are polynomial partitioning and induction on dimension.

Discussion (0). Sign in to comment.

Forward citations

Cited by 1 Pith paper

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

  1. Tubular Neighbourhoods of Pfaffian Sets and Applications to Neural Networks

    math.AG 2026-07 conditional novelty 7.0 of 10

    Tube-volume bounds for smooth Pfaffian hypersurfaces yield condition-number tails for Pfaffian neural classifiers, with polynomial-in-width control for single-layer rational-weight sigmoids.

Pith tools