On Weierstrass semigroup at \(m\) points on curves of the form \(f(y)=g(x)\) (Q1703595)

Let \(X\) be a projective, non-singular, geometrically irreducible algebraic curve defined over a finite field \(k\) of order \(q\). For \(m\geq q\) an integer, let \(P_1,\dots,P_m\) be \(m\) pairwise distinct \(k\)-rational points in \(X\). In the paper under review, the authors deal with the problem of computing multi-point Weierstrass semigroups at \(P_1,\dots,P_m\), namely additive submonoids in \({\mathbb N}^m_0\), \(\mathbf H=\{(a_1,\ldots,a_m):\exists f\in Rt\) with \(\mathrm{div}_\infty(f)=a_1P_1+\ldots+a_mP_m\}\), where \(R\) is the ring of regular functions on \(X\setminus\{P_1,\ldots,P_m\}\), and \(\mathrm{div}_\infty(f)\) is the polar divisor of \(f\). This submonoid encodes intrinsic geometrical properties of \(X\) and its computation is highly non-trivial (the case \(m=1\) is classical: in characteristic zero, it is related e.g. to the study of automorphisms (or moduli problems) on curves, see e.g. [\textit{A. Del Centina}, Ann. Univ. Ferrara, Sez. VII, Sci. Mat. 54, No. 1, 37--59 (2008; Zbl 1179.14001)]; in positive characteristic its study is intrinsically related to Coding Theory, see \textit{V. D. Goppa}'s book [Geometry and Codes. Kluwer Acad. Publishers (1988; Zbl 1097.14502)]. The case \(m=2\) was so much studied by \textit{S. J. Kim} [Arch. Math. 62, No. 1, 73--82 (1994; Zbl 0815.14020)] and \textit{M. Homma} [Arch. Math. 67, No. 4, 337--348 (1996; Zbl 0869.14015)]. In general, there is a minimal generating set \(\Gamma=\Gamma(P_1,\dots,P_m)\) which completely determines \(\mathbf H\); see [\textit{G. L. Matthews} and \textit{J. D. Peachey}, Contemp. Math. 518, 315--326 (2010; Zbl 1226.14037)]. In this paper, the curve \(X\) is defined by a plane model of type \(f(y)=g(x)\). Then the main key technical result is a characterization of the set \(\Gamma\) by means of the concept of \textit{discrepancy} introduced by \textit{I. M. Duursma} and \textit{S. Park} [Finite Fields Appl. 18, No. 5, 865--885 (2012; Zbl 1279.94150)]. The authors give concrete examples whenever \(X\) is defined by \(y^q+y=x^{q^r+1}\), \(r\geq 1\) odd, which is a curve introduced by \textit{S. Kondo} et al. and quite useful in Coding Theory [IEEE Trans. Inf. Theory 47, No. 6, 2573--2579 (2001; Zbl 0998.94034)]); they also work out examples on certain Kummer extensions.