相关论文: Remarks on codes from modular curves: MAGMA applic…

Much of arithmetic geometry is concerned with the study of principal bundles. They occur prominently in the arithmetic of elliptic curves and, more recently, in the study of the Diophantine geometry of curves of higher genus. In particular,…

In this article, we present a new construction of codes from algebraic curves. Given a curve over a non-prime finite field, the obtained codes are defined over a subfield. We call them Cartier Codes since their construction involves the…

The purpose of these notes is to give an introduction to Deligne-Mumford stacks and their moduli spaces, with emphasis on the moduli problem for curves. The paper has 4 sections. In section 1 we discuss the general problem of constructing a…

A theory of graded manifolds can be viewed as a generalization of differential geometry of smooth manifolds. It allows one to work with functions which locally depend not only on ordinary real variables, but also on $\mathbb{Z}$-graded…

We contribute to the foundations of tropical geometry with a view towards formulating tropical moduli problems, and with the moduli space of curves as our main example. We propose a moduli functor for the moduli space of curves and show…

This paper is a continuation of our previous works (see Mui\'c in Monatsh. Math. 180, no. 3, 607--629, (2016)) and (Mui\'c, Kodrnja in Ramanujan J. 55, no. 2, 393--420, (2021)) where we have studied maps from $X_0(N)$ into $\mathbb P^2$…

Classical Goppa codes are a well-known class of codes with applications in code-based cryptography, which are a special case of alternant codes. Many papers are devoted to the search for Goppa codes with a cyclic extension or with a cyclic…

The central objective of this dissertation was to present the Goppa Geometry Codes via elementary methods which were introduced by J.H. van Lint ,R.Pellikaan and T. Hohold about 1998. On the first part of such dissertation are presented the…

In this paper, we discuss some problems of elementary plane differential geometry and kinematics. Although the results are not new, the consistent use of complex-valued functions (plane curves) of a real variable (parameter) allows to…

We report on the computation of invariants, covariants, and contravariants of cubic surfaces. All algorithms are implemented in the computer algebra system magma.

We introduce group corings, and study functors between categories of comodules over group corings, and the relationship to graded modules over graded rings. Galois group corings are defined, and a Structure Theorem for the $G$-comodules…

We investigate the arithmetic of algebraic curves on coarse moduli spaces for special linear rank two local systems on surfaces with fixed boundary traces. We prove a structure theorem for morphisms from the affine line into the moduli…

Lenstra and Guruswami described number field analogues of the algebraic geometry codes of Goppa. Recently, the first author and Oggier generalised these constructions to other arithmetic groups: unit groups in number fields and orders in…

In this work we present a way to construct the so-called root diagram for one-point AG codes $C$ arising from certain types of curves $\mathcal{X}$ over $\mathbb{F}_q$ with plane model $f(y)=g(x)$. Using this root diagram we can get an…

We describe a new arithmetic system for the Magma computer algebra system for working with $p$-adic numbers exactly, in the sense that numbers are represented lazily to infinite $p$-adic precision. This is the first highly featured such…

Here we investigate some birational properties of two collections of moduli spaces, namely moduli spaces of (pointed) stable curves and of (pointed) spin curves. In particular, we focus on vanishings of Hodge numbers of type (p,0) and on…

Matrix Graph Grammars (MGG) is a novel approach to the study of graph dynamics ([15]). In the present contribution we look at MGG as a formal grammar and as a model of computation, which is a necessary step in the more ambitious program of…

In this paper a construction of quantum codes from self-orthogonal algebraic geometry codes is provided. Our method is based on the CSS construction as well as on some peculiar properties of the underlying algebraic curves, named Swiss…

We give practical algorithms for computing the divisor class group and the gonality of a curve over a finite field, achieving several orders of magnitude speedup over existing methods for sufficiently large genus or residue field. The…

In this paper we construct parameterizations of elliptic curves over the rationals which have many consecutive integral multiples. Using these parameterizations, we perform searches in GMP and Magma to find curves with points of small…