Permutation polynomials of the type $$x^rg(x^{s})$$ over $${\mathbb {F}}_{q^{2n}}$$Fq2n

We provide some new families of permutation polynomials of \({\mathbb {F}}_{q^{2n}}\) of the type \(x^rg(x^{s})\), where the integers r, s and the polynomial \(g \in {\mathbb {F}}_q[x]\) satisfy particular restrictions. Some generalizations of known permutation binomials and trinomials that involve a sort of symmetric polynomials are given. Other constructions are based on the study of algebraic curves associated to certain polynomials. In particular we generalize families of permutation polynomials constructed by Gupta–Sharma, Li–Helleseth, Li–Qu–Li–Fu.     

Explicit classes of permutation polynomials of $$ \mathbb{F}_{3^{3m} } $$

Permutation polynomials have been an interesting subject of study for a long time and have applications in many areas of mathematics and engineering. However, only a small number of specific classes of permutation polynomials are known so far. In this paper, six classes of linearized permutation polynomials and six classes of nonlinearized permutation polynomials over are presented. These polynomials have simple shapes, and they are related to planar functions. This work was supported by Australian Research Council (Grant No. DP0558773), National Natural Science Foundation of China (Grant No. 10571180) and the Research Grants Council of the Hong Kong Special Administrative Region of China (Grant No. 612405)     

New constructions of permutation polynomials of the form $$x^rh\left( x^{q-1}\right) $$ over $${\mathbb F}_{q^2}$$Fq2

Permutation polynomials over finite fields have been studied extensively recently due to their wide applications in cryptography, coding theory, communication theory, among others. Recently, several authors have studied permutation trinomials of the form \(x^rh\left( x^{q-1}\right) \) over \({\mathbb F}_{q^2}\), where \(q=2^k\), \(h(x)=1+x^s+x^t\) and \(r, k>0, s, t\) are integers. Their methods are essentially usage of a multiplicative version of AGW Criterion because they all transformed the problem of proving permutation polynomials over \({\mathbb F}_{q^2}\) into that of showing the corresponding fractional polynomials permute a smaller set \(\mu _{q+1}\), where \(\mu _{q+1}:=\{x\in \mathbb {F}_{q^2} : x^{q+1}=1\}\). Motivated by these results, we characterize the permutation polynomials of the form \(x^rh\left( x^{q-1}\right) \) over \({\mathbb F}_{q^2}\) such that \(h(x)\in {\mathbb F}_q[x]\) is arbitrary and q is also an arbitrary prime power. Using AGW Criterion twice, one is multiplicative and the other is additive, we reduce the problem of proving permutation polynomials over \({\mathbb F}_{q^2}\) into that of showing permutations over a small subset S of a proper subfield \({\mathbb F}_{q}\), which is significantly different from previously known methods. In particular, we demonstrate our method by constructing many new explicit classes of permutation polynomials of the form \(x^rh\left( x^{q-1}\right) \) over \({\mathbb F}_{q^2}\). Moreover, we can explain most of the known permutation trinomials, which are in Ding et al. (SIAM J Discret Math 29:79–92, 2015), Gupta and Sharma (Finite Fields Appl 41:89–96, 2016), Li and Helleseth (Cryptogr Commun 9:693–705, 2017), Li et al. (New permutation trinomials constructed from fractional polynomials, arXiv: 1605.06216v1, 2016), Li et al. (Finite Fields Appl 43:69–85, 2017) and Zha et al. (Finite Fields Appl 45:43–52, 2017) over finite field with even characteristic.     

Some permutations over $$\pmb {\mathbb {F}}_p$$ F p concerning primitive roots

The Ramanujan Journal - Let p be an odd prime and let $${\mathbb {F}}_p$$ denote the finite field with p elements. Suppose that g is a primitive root of $${\mathbb {F}}_p$$ . Define the permutation...     

Cyclic codes over $${{\mathbb{F}}_2+u{\mathbb{F}}_2+v{\mathbb{F}}_2+uv{\mathbb{F}}_2}$$

In this work, we focus on cyclic codes over the ring \mathbbF₂+u\mathbbF₂+v\mathbbF₂+uv\mathbbF₂{{{\mathbb{F}}_2+u{\mathbb{F}}_2+v{\mathbb{F}}_2+uv{\mathbb{F}}_2}} , which is not a finite chain ring. We use ideas from group rings and works of AbuAlrub et.al. in (Des Codes Crypt 42:273–287, 2007) to characterize the ring (\mathbbF₂+u\mathbbF₂+v\mathbbF₂+uv\mathbbF₂)/(xⁿ-1){({{\mathbb{F}}_2+u{\mathbb{F}}_2+v{\mathbb{F}}_2+uv{\mathbb{F}}_2})/(x^n-1)} and cyclic codes of odd length. Some good binary codes are obtained as the images of cyclic codes over \mathbbF₂+u\mathbbF₂+v\mathbbF₂+uv\mathbbF₂{{{\mathbb{F}}_2+u{\mathbb{F}}_2+v{\mathbb{F}}_2+uv{\mathbb{F}}_2}} under two Gray maps that are defined. We also characterize the binary images of cyclic codes over \mathbbF₂+u\mathbbF₂+v\mathbbF₂+uv\mathbbF₂{{{\mathbb{F}}_2+u{\mathbb{F}}_2+v{\mathbb{F}}_2+uv{\mathbb{F}}_2}} in general.     

On some permutation binomials and trinomials over $$\mathbb {F}_{2^n}$$

In this work, we completely characterize (1) permutation binomials of the form \(x^{{{2^n -1}\over {2^t-1}}+1}+ ax \in \mathbb {F}_{2^n}[x], n = 2^st, a \in \mathbb {F}_{2^{2t}}^{*}\), and (2) permutation trinomials of the form \(x^{2^s+1}+x^{2^{s-1}+1}+\alpha x \in \mathbb {F}_{2^t}[x]\), where s, t are positive integers. The first result, which was our primary motivation, is a consequence of the second result. The second result may be of independent interest.     

Classification of permutation polynomials of the form $$x^3g(x^{q-1})$$ x 3 g ( x q - 1 ) of $${\mathbb F}_{q^2}$$ F q 2 where $$g(x)=x^3+bx+c$$ g ( x ) = x 3 + b x + c and $$b,c \in {\mathbb F}_q^*$$ b,c ∈ F q ∗

Designs, Codes and Cryptography - We classify all permutation polynomials of the form $$x^3g(x^{q-1})$$ of $${\mathbb F}_{q^2}$$ where $$g(x)=x^3+bx+c$$ and $$b,c \in {\mathbb F}_q^*$$ . Moreover...     

On sums of polynomial-type exceptional units in $$\varvec{\mathbb {Z}}/\varvec{n\mathbb {Z}}$$Z/nZ

A unit u in a commutative ring with unity R is called exceptional if $$u-1$$ is also a unit. We introduce the notion of a polynomial version of this (abbreviated as $$f\hbox {-exunits}$$) for any $$f(X) \in \mathbb {Z}[X]$$. We find the number of representations of a non-zero element of $$\mathbb {Z}/n\mathbb {Z}$$ as a sum of two f-exunits for an infinite family of polynomials f of each degree $$\ge 1$$. We also derive the exact formulae for certain infinite families of linear and quadratic polynomials. This generalizes a result proved by Sander (J Number Theory 159:1–6, 2016).     

Closed characteristics on non-compact hypersurfaces in $${\mathbb {R}^{2n}}$$

Viterbo demonstrated that any (2n − 1)-dimensional compact hypersurface of contact type has at least one closed characteristic. This result proved the Weinstein conjecture for the standard symplectic space (, ω). Various extensions of this theorem have been obtained since, all for compact hypersurfaces. In this paper we consider non-compact hypersurfaces coming from mechanical Hamiltonians, and prove an analogue of Viterbo’s result. The main result provides a strong connection between the top half homology groups H _i (M), i = n, . . . , 2n − 1, and the existence of closed characteristics in the non-compact case (including the compact case). J. B. van den Berg is supported by NWO VENI grant 639.031.204. R. C. Vandervorst and F. Pasquotto are supported by NWO VIDI grant 639.032.202. This research is also partially supported by the RTN project ‘Fronts-Singularities’.     

On Linear Codes over $${\mathbb{Z}}_{2^{s}}$$

In an earlier paper the authors studied simplex codes of type α and β over and obtained some known binary linear and nonlinear codes as Gray images of these codes. In this correspondence, we study weight distributions of simplex codes of type α and β over The generalized Gray map is then used to construct binary codes. The linear codes meet the Griesmer bound and a few non-linear codes are obtained that meet the Plotkin/Johnson bound. We also give the weight hierarchies of the first order Reed-Muller codes over The above codes are also shown to satisfy the chain condition.A part of this paper is contained in his Ph.D. Thesis from IIT Kanpur, India     

Minimal non-$${\mathcal {F}}$$ -groups

Let be a saturated formation. We describe minimal non- -, minimal non- -, and minimal non-metabelian groups. Dedicated to L. A. Shemetkov on the occasion of his seventieth birthday.     

Trajectory of an Observer Tracking Object Motion around Convex Obstacles in $${{\mathbb{R}}^{2}}$$ and $${{\mathbb{R}}^{3}}$$

Doklady Mathematics - An autonomous object moves at a constant speed along the shortest path, while bypassing an ordered collection of pairwise disjoint convex sets. The object is tracked by an...     

Elliptic near-MDS codes over $${\mathbb{F}}_5$$

Let Γ₆ be the elliptic curve of degree 6 in PG(5, q) arising from a non-singular cubic curve of PG(2, q) via the canonical Veronese embedding

On $${\mathcal{F}}$$ -supplemented subgroups of finite groups

Let G be a finite group and a formation of finite groups. We say that a subgroup H of G is -supplemented in G if there exists a subgroup T of G such that G = TH and is contained in the -hypercenter of G/H _G . In this paper, we use -supplemented subgroups to study the structure of finite groups. A series of previously known results are unified and generalized. Research of the author is supported by a NNSF grant of China (Grant #10771180).     

( q,t)-analogues and $GL_{n}({\ma thbb{F}}_{ q})$

We start with a (q,t)-generalization of a binomial coefficient. It can be viewed as a polynomial in t that depends upon an integer q, with combinatorial interpretations when q is a positive integer, and algebraic interpretations when q is the order of a finite field. These (q,t)-binomial coefficients and their interpretations generalize further in two directions, one relating to column-strict tableaux and Macdonald’s “7 ^th variation” of Schur functions, the other relating to permutation statistics and Hilbert series from the invariant theory of GL_n(\mathbbF_q)GL_{n}({\mathbb{F}}_{q}) .     

Counting SL2（F2^s） Representations of Torus Knot Groups

In this paper,we count the number of SL2(F2^s)-representations of torus knot groups up to a conjugacy.For the finite field F2^s with character 2,the counting method is similar to that in out previous work[1].Explicit formulae of the effective counting are given in this paper.Twisted Alexander polynomials related to those reprsentations are discussed.     

On the reflexivity of $$\mathcal {P}_{w}(^{n}E;F)$$

In this paper we prove that if E and F are reflexive Banach spaces and G is a closed linear subspace of the space \(\mathcal {L}_{K}(E;F)\) of all compact linear operators from E into F, then G is either reflexive or non-isomorphic to a dual space. This result generalizes (Israel J Math 21:38-49, 1975, Theorem 2) and gives the solution to a problem posed by Feder (Ill J Math 24:196-205, 1980, Problem 1). We also prove that if E and F are reflexive Banach spaces, then the space \(\mathcal {P}_{w}(^{n}E;F)\) of all n-homogeneous polynomials from E into F which are weakly continuous on bounded sets is either reflexive or non-isomorphic to a dual space.     

Examples of scalar-flat hypersurfaces in $${\mathbb{R}^{n+1}}$$

Given a hypersurface M of null scalar curvature in the unit sphere , n ≥ 4, such that its second fundamental form has rank greater than 2, we construct a singular scalar-flat hypersurface in as a normal graph over a truncated cone generated by M. Furthermore, this graph is 1-stable if the cone is strictly 1-stable.     

A new characterization of Sobolev spaces on $${\mathbb{R}^{n}}$$

In this paper we present a new characterization of Sobolev spaces on . Our characterizing condition is obtained via a quadratic multiscale expression which exploits the particular symmetry properties of Euclidean space. An interesting feature of our condition is that depends only on the metric of and the Lebesgue measure, so that one can define Sobolev spaces of any order of smoothness on any metric measure space.