Related papers: A point counting algorithm using cohomology with c…
For $g\ge 2$ and $n\ge 0$, let $\mathcal{H}_{g,n}\subset \mathcal{M}_{g,n}$ denote the complex moduli stack of $n$-marked smooth hyperelliptic curves of genus $g$. A normal crossings compactification of this space is provided by the theory…
We compare three different ways of defining group cohomology with coefficients in a crossed-module: 1) explicit approach via cocycles; 2) geometric approach via gerbes; 3) group theoretic approach via butterflies. We discuss the case where…
New algorithms are presented for computing annihilating polynomials of Toeplitz, Hankel, and more generally Toeplitz+ Hankel-like matrices over a field. Our approach follows works on Coppersmith's block Wiedemann method with structured…
For fixed compact connected Lie groups H \subseteq G, we provide a polynomial time algorithm to compute the multiplicity of a given irreducible representation of H in the restriction of an irreducible representation of G. Our algorithm is…
We propose a measure based upon the fundamental theoretical concept in algorithmic information theory that provides a natural approach to the problem of evaluating $n$-dimensional complexity by using an $n$-dimensional deterministic Turing…
We present a new algorithm for computing integral bases in algebraic function fields of one variable, or equivalently for constructing the normalization of a plane curve. Our basic strategy makes use of the concepts of localization and…
This article concerns the computational problem of counting the lattice points inside convex polytopes, when each point must be counted with a weight associated to it. We describe an efficient algorithm for computing the highest degree…
In this paper we outline an approach to calculus over quasitriangular Hopf algebras. We study differential operators in the framework of monoidal categories equipped with a braiding or symmetry. To be more concrete, we choose as an example…
We describe a practical algorithm for computing Brauer-Manin obstructions to the existence of rational points on hyperelliptic curves defined over number fields. This offers advantages over descent based methods in that its correctness does…
We present an exact sampling algorithm for Pfaffian point processes based on a skew-symmetric analogue of the Cholesky factorization. This algorithm enables efficient sampling of a wide range of statistics arising in random matrix theory…
A theory of numerical path-following in toric varieties was suggested in two previous papers. The motivation is solving systems of polynomials with real or complex coefficients. When those polynomials are not assumed 'dense', solving them…
The number of rational points of a plane non-singular algebraic curve X defined over a finite field is computed, provided that the generic point of X is not an inflexion and that X is Frobenius non-classical with respect to conics.
Algorithms for node clustering typically focus on finding homophilous structure in graphs. That is, they find sets of similar nodes with many edges within, rather than across, the clusters. However, graphs often also exhibit heterophilous…
We generalize Elkies's method, an essential ingredient in the SEA algorithm to count points on elliptic curves over finite fields of large characteristic, to the setting of p.p. abelian surfaces. Under reasonable assumptions related to the…
This article is a revised, short and english version of my PhD thesis. First, we show a mirror theorem : the Frobenius manifold associated to the orbifold quantum cohomology of weighted projective space is isomorphic to the one attached to…
Counts of curves in $\mathbb{P}^1\times\mathbb{P}^1$ with fixed contact order with the toric boundary and satisfying point conditions can be determined with tropical methods by Mikhalkin. If we require that our curves intersect the zero-…
We consider heuristic algorithm for solving graph isomorphism problem. The algorithm based on a successive splitting of the eigenvalues of the matrices which are modifications (to positive defined) of graphs' adjacency matrices.…
We compute the rational cohomology of the universal family of smooth cubic surfaces using Vassiliev's method of simplicial resolution. Modulo embedding, the universal family has cohomology isomorphic to that of $\mathbb{P}^2$. A consequence…
We analyse the complexity of computing class polynomials, that are an important ingredient for CM constructions of elliptic curves, via complex floating point approximations of their roots. The heart of the algorithm is the evaluation of…
A new method is given for computing generators of the homology groups with integer coefficients for any finite $T_0$-space. An important role in this method is played by irreducible cycles which are defined here and give rise to continuous…