arXiv subjects

A. Campillo

Publications and source records attributed to A. Campillo.

23 records · Page 2Linked to original sources

arXiv2000

Integration with respect to Euler characteristic over the projectivization of the space of functions and the Alexander polynomial of a plane curve singularity

We discuss a notion of integration with respect to the Euler characteristic in the projectivization $¶{\cal O}_{\C^n,0}$ of the ring ${\cal O}_{\C^n,0}$ of germs of functions on $C^n$ and show that the Alexander polynomial and the zeta-function of a plane curve singularity can be expressed as certain integrals over $¶{\cal O}_{\C^2,0}$ with respect to the Euler characteristic.

math.AG↗

arXiv2000

The Alexander polynomial of a plane curve singularity and the ring of functions on it

We give two formulae which express the Alexander polynomial $Δ^C$ of several variables of a plane curve singularity $C$ in terms of the ring ${\cal O}_{C}$ of germs of analytic functions on the curve. One of them expresses $Δ^C$ in terms of dimensions of some factorspaces corresponding to a (multi-indexed) filtration on the ring ${\cal O}_{C}$. The other one gives the coefficients of the Alexander polynomial $Δ^C$ as Euler characteristics of some explicitly described spaces (complements to arrangements of projective hyperplanes).

math.AG↗

arXiv1999

On the parameters of Algebraic Geometry codes related to Arf semigroups

In this paper we compute the order (or Feng-Rao) bound on the minimum distance of one-point algebraic geometry codes, when the Weierstrass semigroup at the point Q is an Arf semigroup. The results developed to that purpose also provide the dimension of the improved geometric Goppa codes related to those.

math.NT↗

arXiv1999

Symbolic Hamburger-Noether expressions of plane curves and construction of AG codes

We present an algorithm to compute bases for the spaces L(G), provided G is a rational divisor over a non-singular absolutely irreducible algebraic curve, and also another algorithm to compute the Weierstrass semigroup at P together with functions for each value in this semigroup, provided P is a rational branch of a singular plane model for the curve. The method is founded on the Brill-Noether algorithm by combining in a suitable way the theory of Hamburger-Noether expansions and the imposition of virtual passing conditions. Such algorithms are given in terms of symbolic computation by introducing the notion of symbolic Hamburger-Noether expressions. Everything can be applied to the effective construction of Algebraic Geometry codes and also in the decoding problem of such codes, including the case of the Feng and Rao scheme for one-point codes.

math.AG↗

arXiv1999

Computing Weierstrass semigroups and the Feng-Rao distance from singular plane models

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 also provides us with a basis for the spaces L(mP) and the computation of the Feng-Rao distance for the corresponding array of geometric Goppa codes. A general computation of the Feng-Rao distance is also obtained. Everything can be applied to the decoding problem by using the majority scheme of Feng and Rao.

math.AG↗