Related papers: Decomposing abelian varieties into simple factors:…

A polynomial-time algorithm is produced which, given generators for a group of permutations on a finite set, returns a direct product decomposition of the group into directly indecomposable subgroups. The process uses bilinear maps and…

Let G be a finite group acting on a smooth projective curve X. This induces an action of G on the Jacobian JX of X and thus a decomposition of JX up to isogeny. The most prominent example of such a situation is the group G of two elements.…

Canonical Polyadic Decomposition (CPD) of a third-order tensor is decomposition in a minimal number of rank-$1$ tensors. We call an algorithm algebraic if it is guaranteed to find the decomposition when it is exact and if it only relies on…

Let $(X,L)$ be a polarized complex abelian variety of dimension $g$ where $L$ is a polarization of type $(1,...,1,d)$. For $(X,L)$ genberic we prove the following: (1) If $d \ge g+2$, then $\phi_L\colon X \to {\bf P}^{d-1}$ defines a…

This thesis examins a generalisation of polar decompositions to indefinite inner product spaces. The necessary general theory is studied and some general results are given. The main part of the thesis focuses on polar decompositions with…

We prove the integral Hodge conjecture for one-cycles on a principally polarized complex abelian variety whose minimal class is algebraic. In particular, any product of Jacobians of smooth projective curves over the complex numbers…

For any split totally degenerate abelian variety over a complete discrete valuation field, we construct a log abelian variety over the discrete valuation ring extending the given abelian variety. This generalizes the log Tate curve of Kato.

Let K be a CM-field, i.e., a totally complex quadratic extension of a totally real field F. Let X be a g-dimensional abelian variety admitting an algebra embedding of F into the rational endomorphisms of X. Let A be the product of X and…

To any closed subvariety $Y$ of a complex abelian variety one can attach a reductive algebraic group $G$ which is determined by the decomposition of the convolution powers of $Y$ via a certain Tannakian formalism. For a theta divisor $Y$ on…

We study quotients of principally polarized abelian varieties with real multiplication by Galois-stable finite subgroups and describe when these quotients are principally polarizable. We use this characterization to provide an algorithm to…

Finitely generated Z-modules have canonical decompositions. When such modules are given in a finitely presented form there is a classical algorithm for computing a canonical decomposition. This is the algorithm for computing the Smith…

We give an efficient, deterministic algorithm to decide if two abelian varieties over a number field are isogenous. From this, we derive an algorithm to compute the endomorphism ring of an elliptic curve over a number field.

For any given finite abelian group, we give factorizations of the group determinant in the group algebra of any subgroup. The factorizations are an extension of Dedekind's theorem. The extension leads to a generalization of Dedekind's…

The Narasimhan-Nori conjecture asks for a closed formula for the number of non-isomorphic principal polarizations of any given abelian variety. In this paper, we introduce a new algorithm that gives a lower bound on the number of…

We study endomorphism rings of principally polarized abelian surfaces over finite fields from a computational viewpoint with a focus on exhaustiveness. In particular, we address the cases of non-ordinary and non-simple varieties. For each…

In this paper we consider disjoint decomposition of algebraic and non-linear partial differential systems of equations and inequations into so-called simple subsystems. We exploit Thomas decomposition ideas and develop them into a new…

We start with elementary algebraic theory of factorization of linear ordinary differential equations developed in the period 1880-1930. After exposing these classical results we sketch more sophisticated algorithmic approaches developed in…

The problem of decomposing a given covariance matrix as the sum of a positive semi-definite matrix of given rank and a positive semi-definite diagonal matrix, is considered. We present a projection-type algorithm to address this problem.…

We present an algorithm to reduce the computational effort for the multiplication of a given matrix with an unknown column vector. The algorithm decomposes the given matrix into a product of matrices whose entries are either zero or integer…

An abelian variety admits only a finite number of isomorphism classes of principal polarizations. The paper gives an interpretation of this number in terms of class numbers of definite Hermitian forms in the case of a product of elliptic…