Zobrazeno 1 - 7
of 7
pro vyhledávání: '"Montessinos, Mickaël"'
Autor:
Montessinos, Mickaël
We represent vector bundles over a regular algebraic curve as pairs of lattices over the maximal orders of its function field and we give polynomial time algorithms for several tasks: computing determinants of vector bundles, kernels and images of gl
Externí odkaz:
http://arxiv.org/abs/2403.09449
Autor:
Kutas, Péter, Montessinos, Mickaël
We present an efficient computational representation of central simple algebras using Brauer factor sets. Using this representation and polynomial quantum algorithms for number theoretical tasks such as factoring and $S$-unit group computation, we gi
Externí odkaz:
http://arxiv.org/abs/2307.00261
Autor:
Kutas, Péter, Montessinos, Mickaël
Publikováno v:
In Journal of Algebra 1 March 2025 665:255-281
We propose polynomial-time algorithms for finding nontrivial zeros of quadratic forms with four variables over rational function fields of characteristic 2. We apply these results to find prescribed quadratic subfields of quaternion division division
Externí odkaz:
http://arxiv.org/abs/2203.04068
Let $L$ be a separable quadratic extension of either $\mathbb{Q}$ or $\mathbb{F}_q(t)$. We propose efficient algorithms for finding isomorphisms between quaternion algebras over $L$. Our techniques are based on computing maximal one-sided ideals of t
Externí odkaz:
http://arxiv.org/abs/2007.06981
Autor:
Kutas, Péter, Montessinos, Mickaël
We present an efficient computational representation of central simple algebras using Brauer factor sets. Using this representation and polynomial quantum algorithms for number theoretical tasks such as factoring and $S$-unit group computation, we gi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d16b9da96308e5584df1b60b688a7b26
http://arxiv.org/abs/2307.00261
http://arxiv.org/abs/2307.00261
Publikováno v:
Research in Number Theory; 10/1/2022, Vol. 8 Issue 4, p1-24, 24p