Related papers: Computing separable isogenies in quasi-optimal tim…

Let K be an algebraic number field of degree d and discriminant D over Q. Let A be an associative algebra over K given by structure constants such that A is isomorphic to the algebra M_n(K) of n by n matrices over K for some positive…

In this work, we design a nearly linear time discrete Morse theory based algorithm for computing homology groups of 2-manifolds, thereby establishing the fact that computing homology groups of 2-manifolds is remarkably easy. Unlike previous…

Let $K$ be a function field of characteristic $p\geq0$ or a number field over which the $abc$ conjecture holds, and let $\phi(x)=x^d+c \in K[x]$ be a unicritical polynomial of degree $d\geq2$ with $d \not\equiv 0,1\pmod{p}$. We completely…

This paper is an erratum to our paper, entitled "On an application of Guth-Katz theorem", Math. Res. Lett. 18 (2011), no. 4, 691-697. Let $F$ be the real or complex field and $\omega$ a non-degenerate skew-symmetric bilinear form in the…

Let $U$ be a smooth affine curve over a number field $K$ with a compactification $X$ and let $\mathbb L$ be a rank $2$, geometrically irreducible $\bar{\mathbb Q}_\ell$-local system on $U$ with cyclotomic determinant that extends to an…

We consider an iteration method for solving an elliptic type boundary value problem $\mathcal{A} u=f$, where a positive definite operator $\mathcal{A}$ is generated by a quasi--periodic structure with rapidly changing coefficients (typical…

We propose an algorithm that calculates isogenies between elliptic curves defined over an extension $K$ of $\mathbb{Q}_2$. It consists in efficiently solving with a logarithmic loss of $2$-adic precision the first order differential…

Let k be a field and f be a Siegel modular form of weight h \geq 0 and genus g>1 over k. Using f, we define an invariant of the k-isomorphism class of a principally polarized abelian variety (A,a)/k of dimension g. Moreover when (A,a) is…

Let $\mathbb{K}$ be a field of characteristic zero and $\mathbb{K}[x_1, \dots, x_n]$ the corresponding multivariate polynomial ring. Given a sequence of $s$ polynomials $\mathbf{f} = (f_1, \dots, f_s)$ and a polynomial $\phi$, all in…

In this paper we consider the problem of testing whether two finite groups are isomorphic. Whereas the case where both groups are abelian is well understood and can be solved efficiently, very little is known about the complexity of…

We study the isogenies of certain abelian varieties over finite fields with non-commutative endomorphism algebras with a view to potential use in isogeny-based cryptography. In particular, we show that any two such abelian varieties with…

For each Sophie Germain prime $g \geq 5,$ we construct an absolutely simple polarized abelian variety of dimension $g$ over a finite field, whose automorphism group is a cyclic group of order $4g+2$. We also provide a description on the…

We present an algorithm that, on input of a CM-field $K$, an integer $k\ge1$, and a prime $r \equiv 1 \bmod k$, constructs a $q$-Weil number $\pi \in \O_K$ corresponding to an ordinary, simple abelian variety $A$ over the field $\F$ of $q$…

Inspired by experimental data, this paper investigates which isogeny classes of abelian varieties defined over a finite field of odd characteristic contain the Jacobian of a hyperelliptic curve. We provide a necessary condition by…

We present a probabilistic algorithm to compute the product of two univariate sparse polynomials over a field with a number of bit operations that is quasi-linear in the size of the input and the output. Our algorithm works for any field of…

Let $K$ be a number field, $A/K$ be an absolutely simple abelian variety of CM type, and $\ell$ be a prime number. We give explicit bounds on the degree over $K$ of the division fields $K(A[\ell^n])$, and when $A$ is an elliptic curve we…

A new algorithm is presented for computing the largest degree invariant factor of the Sylvester matrix (with respect either to $x$ or $y$) associated to two polynomials $a$ and $b$ in $\mathbb F_q[x,y]$ which have no non-trivial common…

Clustering is a hard discrete optimization problem. Nonconvex approaches such as low-rank semidefinite programming (SDP) have recently demonstrated promising statistical and local algorithmic guarantees for cluster recovery. Due to the…

Let $A$ be an abelian variety over the function field $K$ of a curve over a finite field. We describe several mild geometric conditions ensuring that the group $A(K^{\rm perf})$ is finitely generated and that the $p$-primary torsion…

We say that two abelian varieties $A$ and $A'$ defined over a field $F$ are polyquadratic twists if they are isogenous over a Galois extension of $F$ whose Galois group has exponent dividing $2$. Let $A$ and $A'$ be abelian varieties…