Central Sets Theorem on noncommutative semigroups

Let $D$ be a directed set without maximal element, $S$ be an infinite semigroup and ${}^{D}S$ be the collection of all functions from $D$ into $S$. It is shown that for a commutative semigroup $S$, $A?S$ is a $C$-set with respect to ${}^{\mathbb{N}}S$ if and only if $A$ is a $C$-set with respect to ${}^{D}S$. We investigate the Central Sets Theorem for arbitrary semigroups. In fact the Central Sets Theorem is stated with respect to ${}^{S}S$ for arbitrary semigroups.     

Representation and factorization theorems for almost-Lp-spaces

We extend the notions of $p$-convexity and $p$-concavity for Banach ideals of measurable functions following an asymptotic procedure. We prove a representation theorem for the spaces satisfying both properties as the one that works for the classical case: each almost $p$-convex and almost $p$-concave space is order isomorphic to an almost-$L^p$-space. The class of almost-$L^p$-spaces contains, in particular, direct sums of (infinitely many) $L^p$-spaces with different norms, that are not in general $p$-convex – nor $p$-concave –. We also analyze in this context the extension of the Maurey–Rosenthal factorization theorem that works for $p$-concave operators acting in $p$-convex spaces. In this way we provide factorization results that allow to deal with more general factorization spaces than $L^p$-spaces.     

On the symbol-pair distances of repeated-root constacyclic codes of length 2ps

Let $p$ be an odd prime, and $\lambda$ be a nonzero element of the finite field ${\mathbb{F}}_{p^m}$. The $\lambda$-constacyclic codes of length $2p^s$ over ${\mathbb{F}}_{p^m}$ are classified as the ideals of quotient ring $\frac{{\mathbb{F}}_{p^m}\left[x\right]}{〈x^{2p^s}?\lambda 〉}$ in terms of their generator polynomials. Based on these generator polynomials, the symbol-pair distances of all such $\lambda$-constacyclic codes of length $2p^s$ are obtained in this paper. As an application, all MDS symbol-pair constacyclic codes of length $2p^s$ over ${\mathbb{F}}_{p^m}$ are established, which produce many new MDS symbol-pair codes with good parameters.     

Complete permutation polynomials with the form (xpm−x+δ)s+axpm+bx over Fpn

In this paper, several classes of complete permutation polynomials with the form ${(x^{p^m}-x+\delta )}^s+a{x}^{p^m}+bx$ over ${\mathbb{F}}_{p^n}$ are proposed by the AGW criterion and determining the number of solutions of some equations. Our results also enrich constructions of known permutation polynomials.     

On the Hamming distances of repeated-root constacyclic codes of length 4ps

Let $p$ be an odd prime, $s$, $m$ be positive integers, $\gamma ,\lambda$ be nonzero elements of the finite field ${\mathbb{F}}_{p^m}$ such that ${\gamma }^{p^s}=\lambda$. In this paper, we show that, for any positive integer $\eta$, the Hamming distances of all repeated-root $\lambda$-constacyclic codes of length $\eta p^s$ can be determined by those of certain simple-root $\gamma$-constacyclic codes of length $\eta$. Using this result, Hamming distances of all constacyclic codes of length $4p^s$ are obtained. As an application, we identify all MDS $\lambda$-constacyclic codes of length $4p^s$.     

Maximality of Ciani curves over finite fields

In this paper, we will study Ciani curves in characteristic $p\ge 3$, in particular their standard forms $C:x^4+y^4+z^4+r{x}^2{y}^2+s{y}^2{z}^2+t{z}^2{x}^2=0$. It is well-known that any Ciani curve is a non-hyperelliptic curve of genus 3, and its Jacobian variety is isogenous to the product of three elliptic curves. As a main result, we will show that if C is superspecial, then $r,s,t$ belong to ${\mathbb{F}}_{p^2}$ and C is maximal or minimal over ${\mathbb{F}}_{p^2}$. Moreover, in this case we will provide a simple criterion in terms of $r,s,t,p$ that tells whether C is maximal (resp. minimal) over ${\mathbb{F}}_{p^2}$.