Related papers: Symbolic Hamburger-Noether expressions of plane cu…
We present a novel certified and complete algorithm to compute arrangements of real planar algebraic curves. It provides a geometric-topological analysis of the decomposition of the plane induced by a finite number of algebraic curves in…
We propose a probabilistic variant of Brill-Noether's algorithm for computing a basis of the Riemann-Roch space $L(D)$ associated to a divisor $D$ on a projective nodal plane curve $\mathcal C$ over a sufficiently large perfect field $k$.…
In this paper, we consider the hull of an algebraic geometry code, meaning the intersection of the code and its dual. We demonstrate how codes whose hulls are algebraic geometry codes may be defined using only rational places of Kummer…
We use an embedding of the symmetric $d$th power of any algebraic curve $C$ of genus $g$ into a Grassmannian space to give algorithms for working with divisors on $C$, using only linear algebra in vector spaces of dimension $O(g)$, and…
In this work we study the generalized Weierstrass semigroup $\widehat{H} (\mathbf{P}_m)$ at an $m$-tuple $\mathbf{P}_m = (P_{1}, \ldots , P_{m})$ of rational points on certain curves admitting a plane model of the form $f(y) = g(x)$ over…
Rational curves on Hilbert schemes of points on $K3$ surfaces and generalised Kummer manifolds are constructed by using Brill-Noether theory on nodal curves on the underlying surface. It turns out that all wall divisors can be obtained, up…
We present algorithms to compute the topology of 2D and 3D hyperelliptic curves. The algorithms are based on the fact that 2D and 3D hyperelliptic curves can be seen as the image of a planar curve (the Weierstrass form of the curve), whose…
{\sc CLIFFORD} is a Maple package for computations in Clifford algebras $\cl (B)$ of an arbitrary symbolic or numeric bilinear form B. In particular, B may have a non-trivial antisymmetric part. It is well known that the symmetric part g of…
We suggest a programming realization of an algorithm for verifying a given set of algebraic relations in the form of a supercommutator multiplication table for the Verma module, which is constructed according to a generalized Cartan…
In this paper we introduce a working generalization of the theory of Gr\"obner bases for algebras of partial difference polynomials with constant coefficients. One obtains symbolic (formal) computation for systems of linear or non-linear…
In this article we use techniques from coding theory to derive upper bounds for the number of rational places of the function field of an algebraic curve defined over a finite field. The used techniques yield upper bounds if the…
In 1874 Brill and Noether designed a seminal geometric method for computing bases of Riemann-Roch spaces. From then, their method has led to several algorithms, some of them being implemented in computer algebra systems. The usual proofs…
We present an algorithm to compute the Weierstrass semigroup at a point P together with functions for each value in the semigroup, provided P is the only branch at infinity of a singular plane model for the curve. As a byproduct, the method…
In this article we explicitly determine the structure of the Weierstrass semigroups $H(P)$ for any point $P$ of the Suzuki curve $\mathcal{S}_q$. As the point $P$ varies, exactly two possibilities arise for $H(P)$: one for the…
In this paper, algebraic-geometric (AG) codes associated with the GGS maximal curve are investigated. The Weierstrass semigroup at all $\mathbb F_{q^2}$-rational points of the curve is determined; the Feng-Rao designed minimum distance is…
Developing an algorithm for computing the Betti numbers of semi-algebraic sets with singly exponential complexity has been a holy grail in algorithmic semi-algebraic geometry and only partial results are known. In this paper we consider the…
We exhibit an algorithm to compute equations of an algebraic curve over a computable characteristic 0 field from the power series expansions of its regular 1-forms at a nonrational point of the curve, extending a 2005 algorithm of Baker,…
The aim of this paper is two--fold. We first strongly improve our previous main result Theorem 3.1 in Arxiv 1702.00918v3 12Feb2018 ("Brill-Noether loci of rank two vector bundles on a general $\nu$-gonal curve"), concerning classification…
We study the Horn problem in the context of algebraic codes on a smooth projective curve defined over a finite field, reducing the problem to the representation theory of the special linear group $SL(2,F_q)$. We characterize the…
Lie-theoretic structures of type $E_8$ (e.g., Lie groups and algebras, Hecke algebras and Kazhdan-Lusztig cells, ...) are considered to serve as a `gold standard' when it comes to judging the effectiveness of a general algorithm for solving…