English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

Let $k,p\in \mathbb{N}$ with $p$ prime and let $f\in\mathbb{Z}[x_1,x_2]$ be abivariate polynomial with degree $d$ and all coefficients of absolute value atmost $p^k$. Suppose also that $f$ is variable separated, i.e., $f=g_1+g_2$ for$g_i\in\mathbb{Z}[x_i]$. We give the first algorithm, with complexitysub-linear in $p$, to count the number of roots of $f$ over $\mathbb{Z}$ mod$p^k$ for arbitrary $k$: Our Las Vegas randomized algorithm works in time$(dk\log p)^{O(1)}\sqrt{p}$, and admits a quantum version for smooth curvesworking in time $(d\log p)^{O(1)}k$. Save for some subtleties concerningnon-isolated singularities, our techniques generalize to counting roots ofpolynomials in $\mathbb{Z}[x_1,\ldots,x_n]$ over $\mathbb{Z}$ mod $p^k$.  Our techniques are a first step toward efficient point counting for varietiesover Galois rings (which is relevant to error correcting codes overhigher-dimensional varieties), and also imply new speed-ups for computing Igusazeta functions of curves. The latter zeta functions are fundamental inarithmetic geometry.

Sub-Linear Point Counting for Variable Separated Curves over Prime Power Rings