Pith. sign in

REVIEW 1 cited by

Uniform boundedness for Brauer groups of forms in positive characteristic

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 1903.01929 v1 pith:EVBT5UZW submitted 2019-03-05 math.NT math.AG

classification math.NTmath.AG
keywords characteristiceveryoverlinebrauerfieldfiniteformspositive
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
abstract

Let $k$ be a finitely generated field of characteristic $p>0$ and $X$ a smooth and proper scheme over $k$. Recent works of Cadoret, Hui and Tamagawa show that, if $X$ satisfies the $\ell$-adic Tate conjecture for divisors for every prime $\ell\neq p$, the Galois invariant subgroup $Br(X_{\overline k})[p']^{\pi_1(k)}$ of the prime-to-$p$ torsion of the geometric Brauer group of $X$ is finite. The main result of this note is that, for every integer $d\geq 1$, there exists a constant $C:=C(X,d)$ such that for every finite field extension $k \subseteq k'$ with $[k':k]\leq d$ and every $(\overline k/k')$-form $Y$ of $X$ one has $|(Br(Y\times_{k'}\overline k)[p']^{\pi_1(k')}|\leq C$. The theorem is a consequence of general results on forms of compatible systems of $\pi_1(k)$-representations and it extends to positive characteristic a recent result of Orr and Skorobogatov in characteristic zero.

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. Graph Neural Network for Product Recommendation on the Amazon Co-purchase Graph

    cs.IR 2025-08 unverdicted novelty 2.0 of 10

    A benchmark of four GNN architectures (LightGCN, GraphSAGE, GAT, PinSAGE) for link prediction on the Amazon co-purchase graph, reporting trade-offs between accuracy, training cost, and scalability.

Pith tools