Related papers: Fast point counting on genus two curves in charact…
In a previous paper, we proved that over a finite field $k$ of sufficiently large cardinality, all curves of genus at most 3 over k can be modeled by a bivariate Laurent polynomial that is nondegenerate with respect to its Newton polytope.…
Based on previous results of digital topology, this paper focuses on algorithms of topological invariants of objects in 2D and 3D Digital Spaces. We specifically interest in solving hole counting of 2D objects and genus of closed surface in…
In this paper, we compute the number of covers of curves with given branch behavior in characteristic p for one class of examples with four branch points and degree p. Our techniques involve related computations in the case of three branch…
We describe and analyze an interior-point method to decide feasibility problems of second-order conic systems. A main feature of our algorithm is that arithmetic operations are performed with finite precision. Bounds for both the number of…
Genus 5 curves can be hyperelliptic, trigonal, or non-hyperelliptic non-trigonal, whose model is a complete intersection of three quadrics in $\mathbb{P}^4$. We present and explain algorithms we used to determine, up to isomorphism over…
In this paper we enumerate nonhyperelliptic superspecial curves of genus $4$ over prime fields of characteristic $p\le 11$. Our algorithm works for nonhyperelliptic curves over an arbitrary finite field in characteristic $p \ge 5$. We…
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…
In this paper, we give an efficient algorithm of degree reduction of B\'ezier curves with box constraints. The idea is to combine the previous iterative approach, that has been presented recently in (P. Gospodarczyk, Comput. Aided Des. 62…
In algebraic geometry, it is important to provide effective parametrizations for families of curves, both in theory and in practice. In this paper, we present such an effective parametrization for the moduli of genus-$5$ curves that are…
Estimating the number of triangles in graph streams using a limited amount of memory has become a popular topic in the last decade. Different variations of the problem have been studied, depending on whether the graph edges are provided in…
Higher order cumulants of point processes, such as skew and kurtosis, require significant computational effort to calculate. The traditional counts-in-cells method implicitly requires a large amount of computation since, for each sampling…
We generalize the explicit quadratic Chabauty techniques for integral points on odd degree hyperelliptic curves and for rational points on genus 2 bielliptic curves to arbitrary number fields using restriction of scalars. This is achieved…
Working over an algebraically closed field of arbitrary characteristic we study, for integers $N\geq 2$ and $g\geq 2$, the set of points of order dividing $N$ lying on an irreducible smooth proper curve of genus $g$ embedded in its jacobian…
We produce a collection of families of curves, whose point count statistics over F_p becomes Gaussian for p fixed. In particular, the average number of F_p points on curves in these families tends to infinity.
We investigate algorithms for encoding of one-point algebraic geometry (AG) codes over certain plane curves called $C_{ab}$ curves, as well as algorithms for inverting the encoding map, which we call "unencoding". Some $C_{ab}$ curves have…
Metric magnitude is a measure of the "size" of point clouds with many desirable geometric properties. It has been adapted to various mathematical contexts and recent work suggests that it can enhance machine learning and optimization…
In this work, we present the first efficient and practical algorithm for estimating the number of triangles in a graph stream using predictions. Our algorithm combines waiting room sampling and reservoir sampling with a predictor for the…
This paper contains an account of arbitrary cubic function fields of characteristic three. We define a standard form for an arbitrary cubic curve and consider its function field. By considering an integral basis for the maximal order of…
A curve X over the field Q of rational numbers is modular if it is dominated by X_1(N) for some N; if in addition the image of its jacobian in J_1(N) is contained in the new subvariety of J_1(N), then X is called a new modular curve. We…
Efficient characteristic set methods for computing solutions of polynomial equation systems in a finite field are proposed. The concept of proper triangular sets is introduced and an explicit formula for the number of solutions of a proper…