Author

Anass NIFA

1 paper indexed here

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

#edge computing Open access Sep 2026

Homocyclic Jacobians of planar biconnected graphs

For every r ≥ 1, we construct a simple planar biconnected graph with 2r + 2 vertices, 4r + 1 edges, maximum degree at most four, and Jacobian (ℤ/8ℤ)^r. This disproves the bounded-multiplicity conjecture of Gaudet, Jensen, Ranganathan, Wawrykow and Weisman. We give explicit generators and compute the monodromy pairing:...

Anass NIFA · 0 citations