Related papers: About the choice of a basis in Kedlaya's algorithm
In this paper we present an algorithm for computing a matrix representation for a surface in P^3 parametrized over a 2-dimensional toric variety T. This algorithm follows the ideas of [Botbol-Dickenstein-Dohm-09] and it was implemented in…
Let $K$ be a field of characteristic different from $2$ and let $E$ be an elliptic curve over $K$, defined either by an equation of the form $y^{2} = f(x)$ with degree $3$ or as the Jacobian of a curve defined by an equation of the form…
We present a fast Jacobi-like algorithm for computing the eigenvalues, and optionally the eigenvectors, of a real normal matrix. The method gains a computational advantage by using Paardekooper's method for skew-symmetric matrices The…
In this article we study the endomorphism algebras of abelian varieties $A$ defined over a given number field $K$ with large cyclic 2-torsion fields. A key step in doing so is to provide criteria for all the endomorphisms of $A$ to be…
Index maps taking values in the $K$-theory of a mapping cone are defined and discussed. The resulting index theorem can be viewed in analogy with the Freed-Melrose index theorem. The framework of geometric $K$-homology is used in a…
We provide a framework for using elliptic curves with complex multiplication to determine the primality or compositeness of integers that lie in special sequences, in deterministic quasi-quadratic time. We use this to find large primes,…
In this paper, we propose an efficient continuation method for locating multiple power flow solutions. We adopt the holomorphic embedding technique to represent solution curves as holomorphic functions in the complex plane. The…
Whilst Paul de Casteljau is now famous for his fundamental algorithm of curve and surface approximation, little is known about his other findings. This article offers an insight into his results in geometry, algebra and number theory.…
In this paper we provide, first, a general symbolic algorithm for computing the symmetries of a given rational surface, based on the classical differential invariants of surfaces, i.e. Gauss curvature and mean curvature. In practice, the…
We present a new quadratic Chabauty method to compute the integral points on certain even degree hyperelliptic curves. Our approach relies on a nontrivial degree zero divisor supported at the two points at infinity to restrict the $p$-adic…
Let E be an elliptic curve with complex multiplication by R, where R is an order of discriminant D<-4 of an imaginary quadratic field K . If a prime number p is decomposed completely in the ring class field associated with R, then E has…
The ellipsoid algorithm is a fundamental algorithm for computing a solution to the system of $m$ linear inequalities in $n$ variables $(P): A^{\top}x \le u$ when its set of solutions has positive volume. However, when $(P)$ is infeasible,…
We develop a geometric version of the circle method and use it to compute the compactly supported cohomology of the space of rational curves through a point on a smooth affine hypersurface of sufficiently low degree.
This paper presents a graph bundling algorithm that agglomerates edges taking into account both spatial proximity as well as user-defined criteria in order to reveal patterns that were not perceivable with previous bundling techniques. Each…
This work blends the inexact Newton method with iterative combined approximations (ICA) for solving topology optimization problems under the assumption of geometric nonlinearity. The density-based problem formulation is solved using a…
We show that a monic univariate polynomial over a field of characteristic zero, with $k$ distinct non-zero known roots, is determined by its $k$ proper leading coefficients by providing an explicit algorithm for computing the multiplicities…
We prove an effective bound for the degrees of generators of the algebraic de Rham cohomology of smooth affine hypersurfaces. In particular, we show that the de Rham cohomology H_dR^p(X) of a smooth hypersurface X of degree d in C^n can be…
In this article, we describe an efficient method for computing Teitelbaum's $p$-adic $\mathcal{L}$-invariant. These invariants are realized as the eigenvalues of the $\mathcal{L}$-operator acting on a space of harmonic cocycles on the…
An exact algorithm is presented for solving edge weighted graph partitioning problems. The algorithm is based on a branch and bound method applied to a continuous quadratic programming formulation of the problem. Lower bounds are obtained…
We define a function in terms of quotients of the $p$-adic gamma function which generalizes earlier work of the author on extending hypergeometric functions over finite fields to the $p$-adic setting. We prove, for primes $p > 3$, that the…