SearcharxivSearch

arXiv subjects

Nathan Lawless

Publications and source records attributed to Nathan Lawless.

2 recordsLinked to original sources

A Comparison of Overconvergent Witt de-Rham Cohomology and Rigid Cohomology on Smooth Schemes

We generalize the functorial quasi-isomorphism in \cite{Davis2011} from overconvergent Witt de-Rham cohomology to rigid cohomology on smooth varieties over a finite field $k$, dropping the quasi-projectiveness condition. We do so by constructing an \et ale hypercover for any smooth scheme $X$, refined at each level to be a disjoint union of open standard smooth subschemes of $X$. We then find, for large $N$, an $N$-truncated closed embedding into a simplicial smooth scheme over $W(k)$, which allows us to use the results of \textit{loc. cit} at the simplicial level, and use cohomological descent to prove the comparison.

math.NT

Generating all finite modular lattices of a given size

Modular lattices, introduced by R. Dedekind, are an important subvariety of lattices that includes all distributive lattices. Heitzig and Reinhold developed an algorithm to enumerate, up to isomorphism, all finite lattices up to size 18. Here we adapt and improve this algorithm to construct and count modular lattices up to size 24, semimodular lattices up to size 22, and lattices of size 19. We also show that $2^{n-3}$ is a lower bound for the number of nonisomorphic modular lattices of size $n$.

math.CO