相关论文: AG codes on certain maximal curves
Generalized unitarity cut of a Feynman diagram generates an algebraic system of polynomial equations. At high-loop levels, these equations may define a complex curve or a (hyper-)surface with complicated topology. We study the curve cases,…
In this paper we investigate the number of minimum weight codewords of some dual Algebraic-Geometric codes associated with the Giulietti-Korchm\'aros maximal curve, by computing the maximal number of intersections between the…
We show how the theory of affine geometries over the ring ${\mathbb Z}/\langle q - 1\rangle$ can be used to understand the properties of toric and generalized toric codes over ${\mathbb F}_q$. The minimum distance of these codes is strongly…
In this paper, we address a class of specially structured problems that include speed planning, for mobile robots and robotic manipulators, and dynamic programming. We develop two new numerical procedures, that apply to the general case and…
We begin this chapter by introducing the simple algebraic structure of cyclic codes over finite fields. This structure undergoes a series of generalizations to present algebraic descriptions of constacyclic, quasi-cyclic (QC), quasi-twisted…
In this survey article, we summarise the known results towards the conjecture: elliptic curves over totally real number fields are modular. For understanding these recent results in the literature, we present some necessary background along…
We give an upper bound for the degree of rational curves in a family that covers a given birational ruled surface in projective space. The upper bound is stated in terms of the degree, sectional genus and arithmetic genus of the surface. We…
T-curves are piecewise linear curves which have been used with success since the beginning of the 1990's to construct new real algebraic curves with prescribed topology mainly on the real projective plane. In fact T-curves can be used on…
We study a class of quasi-cyclic LDPC codes. We provide precise conditions guaranteeing high girth in their Tanner graph. Experimentally, the codes we propose perform no worse than random LDPC codes with their same parameters, which is a…
In the present paper we investigate the question concerning the existence of maximizing curves of degree $7$ with some prescribed ${\rm ADE}$ singularities. We give a result proving the non-existence of such maximizing septics and we…
We define new higher-order Alexander modules $\mathcal{A}_n(C)$ and higher-order degrees $\delta_n(C)$ which are invariants of the algebraic planar curve $C$. These come from analyzing the module structure of the homology of certain…
In this paper we collect the main properties of free curves in the complex projective plane and a lot of conjectures and open problems, both old and new. In the quest to understand the mystery of free curves, many tools were developed and…
We prove that maximal real algebraic curves associated with sub-Gaussian random real holomorphic sections of a smoothly curved ample line bundle are exponentially rare. This generalizes the result of Gayet and Welschinger \cite{GW} proved…
On logarithmic paper some real algebraic curves look like smoothed broken lines. Moreover, the broken lines can be obtained as limits of those curves. The corresponding deformation can be viewed as a quantization, in which the broken line…
Toric codes are obtained by evaluating rational functions of a nonsingular toric variety at the algebraic torus. One can extend toric codes to the so called generalized toric codes. This extension consists on evaluating elements of an…
Very recently, the first geometric-arithmetic index $GA$ and arithmetic-geometric index $AG$ were introduced in mathematical chemistry. In the present paper, we first obtain some lower and upper bounds on $AG$ and characterize the extremal…
We propose a new algorithm to the problem of polygonal curve approximation based on a multiresolution approach. This algorithm is suboptimal but still maintains some optimality between successive levels of resolution using dynamic…
We derive a linear programming bound on the maximum cardinality of error-correcting codes in the sum-rank metric. Based on computational experiments on relatively small instances, we observe that the obtained bounds outperform all…
We present some new and recent algorithmic results concerning polynomial system solving over various rings. In particular, we present some of the best recent bounds on: (a) the complexity of calculating the complex dimension of an algebraic…
A new generalization of the classical separate algebraicity theorem is suggested and proved.