Pith. sign in

REVIEW 2 cited by

The $2$-torsion of determinantal hypertrees is not Cohen-Lenstra

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 2404.02308 v1 pith:QHKP4FHR submitted 2024-04-02 math.CO math.PR

classification math.COmath.PR
keywords mathbbcohen-lenstradeterminantalpositivetorsionasymptoticallyconjectureconjectured
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
abstract

Let $T_n$ be a $2$-dimensional determinantal hypertree on $n$ vertices. Kahle and Newman conjectured that the $p$-torsion of $H_1(T_n,\mathbb{Z})$ asymptotically follows the Cohen-Lenstra distribution. For $p=2$, we disprove this conjecture by showing that given a positive integer $h$, for all large enough $n$, we have \[\mathbb{P}(\dim H_1(T_n,\mathbb{F}_2)\ge h)\ge \frac{e^{-200h}}{(100h)^{5h}}.\] We also show that $T_n$ is a bad cosystolic expander with positive probability.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

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

  1. Local limits of determinantal processes

    math.PR 2025-10 conditional novelty 7.0 of 10

    The local limit of the determinantal process on a C4-free (d,k+1)-bi-regular bipartite graph, as d tends to infinity, is a multi-type Poisson(k) branching tree T_k.

  2. Using dense graph limit theory to count cocycles of random simplicial complexes

    math.CO 2025-09 conditional novelty 7.0 of 10

    For every prime p, the dimension of H_1(T_n, F_p) of a random 2-dimensional determinantal hypertree and of a random 1-out 2-complex is o(n^2) in probability.

Pith tools