SearcharxivSearch

arXiv subjects

Massimo Giulietti

Publications and source records attributed to Massimo Giulietti.

At least 19 recordsLinked to original sources

Curves with a large automorphism group admitting a cyclic subgroup of index $2$

The Hurwitz bound on the order of the $\mathbb K$-automorphism group ${\rm{Aut}}({\mathcal{X}})$ of an algebraic curve ${\mathcal{X}}$ of genus $g(\mathcal{X})\ge 2$ defined over a field $\mathbb K$ of zero characteristic states that $|{\rm{Aut}}({\mathcal{X}})|\le 84(g(\mathcal{X})-1)$. Improved bounds are available for the order of certain types of subgroups within automorphism groups. For instance, if a subgroup $H$ of ${\rm{Aut}}({\mathcal{X}})$ is dihedral, then in the complex case, $|H| \leq 4g(\mathcal{X}) + 4$. More recently it has been shown that a tighter bound holds for $H$ a generalized quasi-dihedral group. In this paper we explore the more general setting of a curve defined over a field of any characteristic, and $H$ a group admitting a cyclic subgroup of index two. We show that the same upper bound for the size of a dihedral group of automorphisms holds for curves defined over an algebraically closed field of characteristic $p\ne 2$. Then we provide some classification results about (non-dihedral) groups of size larger than $4g(\mathcal{X})+4$ admitting a cyclic subgroup of index $2$.

math.AG

Large automorphism groups compared to the $p$-rank of algebraic curves in characteristic $p$

Let $\cX$ be a (projective, geometrically irreducible, non-singular) algebraic curve of genus $\ge 2$ and positive $p$-rank $\gamma(\cX)$, defined over an algebraically closed field $\mathbb{K}$ of positive characteristic $p>0$. Contrary to what occurs for the genera, no function $h(\gamma)$ exists such that $|\aut(\cX)|\le h(\gamma)$ whenever $\gamma=\gamma(\cX)$. Thus, to have a bound on $|\aut(\cX)|$ only depending on $\gamma(\cX)$, some restrictions on $\cX$ and $\aut(\cX)$ are needed. In this context, the following theorem is proven. Let $\Gamma$ be a subgroup of $\aut(\cX)$. Assume the existence of a point $P\in \cX$ such that if $S_P$ is the Sylow $p$-subgroup of $\Gamma_P$ fixing $P$, then the quotient curve $\cX/S_P$ is rational. Then %$\gamma(\cX)\ge 2$ and the following $p$-rank analog of the Riemann-Hurwitz bound \begin{equation*} %\label{eq18122025} |\Gamma|<900 \left(\frac{p}{p-1}\right)^4 \gamma(\cX)^4 \end{equation*} holds, unless a subgroup of index $\le 2$ of $\Gamma$ fixes $P$. This bound is sharp apart from the constant.

math.AG

AG codes from the Hermitian curve for Cross-Subspace Alignment in Private Information Retrieval

Private information retrieval (PIR) addresses the problem of retrieving a desired message from distributed databases without revealing which message is being requested. Recent works have shown that cross-subspace alignment (CSA) codes constructed from algebraic geometry (AG) codes on high-genus curves can improve PIR rates over classical constructions. In this paper, we propose a new PIR scheme based on AG codes from the Hermitian curve, a well-known example of an $F_\ell$-maximal curve, that is, a curve defined over the finite field with $\ell$ elements which attains the Hasse-Weil upper bound on the number of its $F_\ell$-rational points. The large number of rational points enables longer code constructions, leading to higher retrieval rates than schemes based on genus 0, genus 1, and hyperelliptic curves of arbitrary genus. Our results highlight the potential of maximal curves as a natural source of efficient PIR constructions.

math.AG

Algebraic curves with a large cyclic automorphism group

The study of algebraic curves $\cX$ with numerous automorphisms in relation to their genus $g(\cX)$ is a well-established area in Algebraic Geometry. In 1995, Irokawa and Sasaki \cite{Sasaki} gave a complete classification of curves over $\mathbb{C}$ with an automorphism of order $N \geq 2g(\mathcal{X}) + 1$. Precisely, such curves are either hyperelliptic with $N=2g(\cX)+2$ with $g(\cX)$ even, or are quotients of the Fermat curve of degree $N$ by a cyclic group of order $N$. Such a classification does not hold in positive characteristic $p$, the curve with equation $y^2=x^p-x$ being a well-studied counterexample. This paper successfully classifies curves with a cyclic automorphism group of order $N$ at least $2g(\mathcal{X}) + 1$ in positive characteristic $p \neq 2$, offering the positive characteristic counterpart to the Irokawa-Sasaki result. The possibility of wild ramification in positive characteristic has presented a few challenges to the investigation.

math.AG

Towards the classification of exceptional scattered polynomials

Scattered polynomials over finite fields attracted an increasing attention in the last years. One of the reasons is their deep connection with Maximum Rank Distance (MRD) codes. Known classification results for exceptional scattered polynomials, i.e. polynomials which are scattered over infinite field extensions, are limited to the cases where their index $\ell$ is small, or a prime number larger than the $q$-degree $k$ of the polynomial, or an integer smaller than the $k$ in the case where $k$ is a prime. In this paper we completely classify exceptional scattered polynomials when the maximum between $\ell$ and $k$ is odd, and give partial results when it is even, extending a result of Ferraguti and Micheli in 2021.

math.NT

PIR codes from combinatorial structures

A $k$-server Private Information Retrieval (PIR) code is a binary linear $[m,s]$-code admitting a generator matrix such that for every integer $i$ with $1\le i\le s$ there exist $k$ disjoint subsets of columns (called recovery sets) that add up to the vector of weight one, with the single $1$ in position $i$. As shown in \cite{Fazeli1}, a $k$-server PIR code is useful to reduce the storage overhead of a traditional $k$-server PIR protocol. Finding $k$-server PIR codes with a small blocklength for a given dimension has recently become an important research challenge. In this work, we propose new constructions of PIR codes from combinatorial structures, introducing the notion of $k$-partial packing. Several bounds over the existing literature are improved.

cs.IT

New examples of maximal curves with low genus

We investigate the Jacobian decomposition of some algebraic curves over finite fields with genus $4$, $5$ and $10$. As a corollary, explicit equations for curves that are either maximal or minimal over the finite field with $p^2$ elements are obtained for infinitely many $p$'s. Lists of small $p$'s for which maximality holds are provided. In some cases we describe the automorphism group of the curve.

math.AG

Algebraic curves with many automorphisms

Let $X$ be a (projective, geometrically irreducible, nonsingular) algebraic curve of genus $g \ge 2$ defined over an algebraically closed field $K$ of odd characteristic $p$. Let $Aut(X)$ be the group of all automorphisms of $X$ which fix $K$ element-wise. It is known that if $|Aut(X)|\geq 8g^3$ then the $p$-rank (equivalently, the Hasse-Witt invariant) of $X$ is zero. This raises the problem of determining the (minimum-value) function $f(g)$ such that whenever $|Aut(X)|\geq f(g)$ then $X$ has zero $p$-rank. For {\em{even}} $g$ we prove that $f(g)\leq 900 g^2$. The {\em{odd}} genus case appears to be much more difficult although, for any genus $g\geq 2$, if $Aut(X)$ has a solvable subgroup $G$ such that $|G|>252 g^2$ then $X$ has zero $p$-rank and $G$ fixes a point of $X$. Our proofs use the Hurwitz genus formula and the Deuring Shafarevich formula together with a few deep results from finite group theory characterizing finite simple groups whose Sylow $2$-subgroups have a cyclic subgroup of index $2$. We also point out some connections with the Abhyankar conjecture and the Katz-Gabber covers.

math.AG

On the Dickson-Guralnick-Zieve curve

The Dickson-Guralnick-Zieve curve, briefly DGZ curve, defined over the finite field $\mathbb{F}_q$ arises naturally from the classical Dickson invariant of the projective linear group $PGL(3,\mathbb{F}_q)$. The DGZ curve is an (absolutely irreducible, singular) plane curve of degree $q^3-q^2$ and genus $\frac{1}{2}q(q-1)(q^3-2q-2)+1.$ In this paper we show that the DGZ curve has several remarkable features, those appearing most interesting are: the DGZ curve has a large automorphism group compared to its genus albeit its Hasse-Witt invariant is positive; the Fermat curve of degree $q-1$ is a quotient curve of the DGZ curve; among the plane curves with the same degree and genus of the DGZ curve and defined over $\mathbb{F}_{q^3}$, the DGZ curve is optimal with respect the number of its $\mathbb{F}_{q^3}$-rational points.

math.AG

An $\mathbb{F}_{p^2}$-maximal Wiman's sextic and its automorphisms

In 1895 Wiman introduced a Riemann surface $\mathcal{W}$ of genus $6$ over the complex field $\mathbb{C}$ defined by the homogeneous equation $\mathcal{W}:X^6+Y^6+Z^6+(X^2+Y^2+Z^2)(X^4+Y^4+Z^4)-12X^2 Y^2 Z^2=0$, and showed that its full automorphism group is isomorphic to the symmetric group $S_5$. The curve $\mathcal{W}$ was previously studied as a curve defined over a finite field $\mathbb{F}_{p^2}$ where $p$ is a prime, and necessary and sufficient conditions for its maximality over $\mathbb{F}_{p^2}$ were obtained. In this paper we first show that the result of Wiman concerning the automorphism group of $\mathcal{W}$ holds also over an algebraically closed field $\mathbb{K}$ of positive characteristic $p$, provided that $p \geq 7$. For $p=2,3$ the polynomial $X^6+Y^6+Z^6+(X^2+Y^2+Z^2)(X^4+Y^4+Z^4)-12X^2 Y^2 Z^2$ is not irreducible over $\mathbb{K}$, while for $p=5$ the curve $\mathcal{W}$ is rational and $Aut(\mathcal{W}) \cong PGL(2,\mathbb{K})$. We also show that the $\mathbb{F}_{19^2}$-maximal Wiman's sextic $\mathcal{W}$ is not Galois covered by the Hermitian curve $\mathcal{H}_{19}$ over $\mathbb{F}_{19^2}$.

math.AG

Linear codes from Denniston maximal arcs

In this paper we construct functional codes from Denniston maximal arcs. For $q=2^{4n+2}$ we obtain linear codes with parameters $[(\sqrt{q}-1)(q+1),5,d]_q$ where $\lim_{q \to +\infty} d=(\sqrt{q}-1)q-3\sqrt{q}$. We also find for $q=16,32$ a number of linear codes which appear to have larger minimum distance with respect to the known codes with same length and dimension.

math.CO

Permutation polynomials, fractional polynomials, and algebraic curves

In this note we prove a conjecture by Li, Qu, Li, and Fu on permutation trinomials over $\mathbb{F}_3^{2k}$. In addition, new examples and generalizations of some families of permutation polynomials of $\mathbb{F}_{3^k}$ and $\mathbb{F}_{5^k}$ are given. We also study permutation quadrinomials of type $Ax^{q(q-1)+1} + Bx^{2(q-1)+1} + Cx^{q} + x$. Our method is based on the investigation of an algebraic curve associated with a {fractional polynomial} over a finite field.

math.CO

On some Galois covers of the Suzuki and Ree curves

We determine the full automorphism group of two recently constructed families $\tilde{\mathcal{S}}_q$ and $\tilde{\mathcal{R}}_q$ of maximal curves over finite fields. These curves are covers of the Suzuki and Ree curves, and are analogous to the Giulietti-Korchmáros cover of the Hermitian curve. We also show that $\tilde{\mathcal{S}}_q$ is not Galois covered by the Hermitian curve maximal over $\mathbb{F}_{q^4}$, and $\tilde{\mathcal{R}}_q$ is not Galois covered by the Hermitian curve maximal over $\mathbb{F}_{q^6}$. Finally, we compute the genera of many Galois subcovers of $\tilde{\mathcal{S}}_q$ and $\tilde{\mathcal{R}}_q$; this provides new genera for maximal curves.

math.AG

Upper bounds on the smallest size of a saturating set in projective planes and spaces of even dimension

In a projective plane $Π_{q}$ (not necessarily Desarguesian) of order $q$, a point subset $\mathcal{S}$ is saturating (or dense) if any point of $Π_{q}\setminus \mathcal{S}$ is collinear with two points in $\mathcal{S}$. Modifying an approach of [31], we proved the following upper bound on the smallest size $s(2,q)$ of a saturating set in $Π_{q}$: \begin{equation*} s(2,q)\leq \sqrt{(q+1)\left(3\ln q+\ln\ln q +\ln\frac{3}{4}\right)}+\sqrt{\frac{q}{3\ln q}}+3. \end{equation*} The bound holds for all q, not necessarily large. By using inductive constructions, upper bounds on the smallest size of a saturating set in the projective space $\mathrm{PG}(N,q)$ with even dimension $N$ are obtained. All the results are also stated in terms of linear covering codes.

math.CO

Complete permutation polynomials from exceptional polynomials

We classify complete permutation polynomials of type $aX^{\frac{q^n-1}{q-1}+1}$ over the finite field with $q^n$ elements, for $n+1$ a prime and $n^4 < q$. For the case $n+1$ a power of the characteristic we study some known families. We also classify indecomposable exceptional polynomials of degree $8$ and $9$.

math.CO

On upper bounds on the smallest size of a saturating set in a projective plane

In a projective plane $Π_{q}$ (not necessarily Desarguesian) of order $q,$ a point subset $S$ is saturating (or dense) if any point of $Π_{q}\setminus S$ is collinear with two points in$~S$. Using probabilistic methods, the following upper bound on the smallest size $ s(2,q)$ of a saturating set in $Π_{q}$ is proved: \begin{equation*} s(2,q)\leq 2\sqrt{(q+1)\ln (q+1)}+2\thicksim 2\sqrt{q\ln q}. \end{equation*} We also show that for any constant $c\ge 1$ a random point set of size $k$ in $Π_{q}$ with $ 2c\sqrt{(q+1)\ln(q+1)}+2\le k<\frac{q^{2}-1}{q+2}\thicksim q$ is a saturating set with probability greater than $1-1/(q+1)^{2c^{2}-2}.$ Our probabilistic approach is also applied to multiple saturating sets. A point set $S\subset Π_{q}$ is $(1,μ)$-saturating if for every point $Q$ of $Π_{q}\setminus S$ the number of secants of $S$ through $Q$ is at least $μ$, counted with multiplicity. The multiplicity of a secant $ \ell $ is computed as ${\binom{\#(\ell \,\cap S)}{2}}.$ The following upper bound on the smallest size $s_{μ}(2,q)$ of a $(1,μ)$-saturating set in $Π_{q}$ is proved: \begin{equation*} s_{μ}(2,q)\leq 2(μ+1)\sqrt{(q+1)\ln (q+1)}+2\thicksim 2(μ+1)\sqrt{ q\ln q}\,\text{ for }\,2\leq μ\leq \sqrt{q}. \end{equation*} By using inductive constructions, upper bounds on the smallest size of a saturating set (as well as on a $(1,μ)$-saturating set) in the projective space $PG(N,q)$ are obtained. All the results are also stated in terms of linear covering codes.

math.CO

A family of semifields in characteristic 2

We construct and describe the basic properties of a family of semifields in characteristic $2.$ The construction relies on the properties of projective polynomials over finite fields. We start by associating non-associative products to each such polynomial. The resulting presemifields form the degenerate case of our family. They are isotopic to the Knuth semifields which are quadratic over left and right nucleus. The non-degenerate members of our family display a very different behaviour. Their left and right nucleus agrees with the center, the middle nucleus is quadratic over the center. None of those semifields is isotopic or Knuth equivalent to a commutative semifield. As a by-product we obtain the complete taxonomy of the characteristic $2$ semifields which are quadratic over the middle nucleus, bi-quadratic over the left and right nucleus and not isotopic to twisted fields. This includes {determining} when two such semifields are isotopic and the order of the autotopism group.

math.CO

Maximum scattered linear sets and complete caps in Galois spaces

Explicit constructions of infinite families of scattered ${\mathbb F}_q$--linear sets in $PG(r-1,q^t)$ of maximal rank $\frac{rt}2$, for $t$ even, are provided. When $q=2$ and $r$ is odd, these linear sets correspond to complete caps in $AG(r,2^t)$ fixed by a translation group of size $2^{\frac{rt}2}$. The doubling construction applied to such caps gives complete caps in $AG(r+1,2^t)$ of size $2^{\frac{rt}2+1}$. For Galois spaces of even dimension greater than $2$ and even square order, this solves the long-standing problem of establishing whether the theoretical lower bound for the size of a complete cap is substantially sharp.

math.CO