An Algorithm for Canonical Forms of Finite Subsets of $$\mathbb {Z}^d$$Zd up to Affinities

@article{Paolini2017AnAF,
  title={An Algorithm for Canonical Forms of Finite Subsets of \$\$\mathbb \{Z\}^d\$\$Zd up to Affinities},
  author={Giovanni Paolini},
  journal={Discrete & Computational Geometry},
  year={2017},
  volume={58},
  pages={293-312}
}
  • Giovanni Paolini
  • Published in Discret. Comput. Geom. 2017
  • Computer Science, Mathematics
  • Discrete & Computational Geometry
  • In this paper we describe an algorithm for the computation of canonical forms of finite subsets of $$\mathbb {Z}^d$$Zd, up to affinities over $$\mathbb {Z}$$Z. For fixed dimension d, this algorithm has worst-case asymptotic complexity $$O(n \log ^2 n \, s\,\mu (s))$$O(nlog2nsμ(s)), where n is the number of points in the given subset, s is an upper bound to the size of the binary representation of any of the n points, and $$\mu (s)$$μ(s) is an upper bound to the number of operations required to… CONTINUE READING

    Create an AI-powered research feed to stay up to date with new papers like this posted to ArXiv

    4
    Twitter Mentions

    Citations

    Publications citing this paper.

    References

    Publications referenced by this paper.
    SHOWING 1-7 OF 7 REFERENCES

    A course in computational algebraic number theory

    • Henri Cohen
    • Mathematics, Computer Science
    • Graduate texts in mathematics
    • 1993
    VIEW 1 EXCERPT

    Hafner and Kevin S . McCurley , Asymptotically fast triangularization of matrices over rings

    • L. James
    • SIAM Journal on Computing