Related papers: A general construction of regular complete permuta…
Let $q$ be a prime power and $n$ and $r$ be positive integers. It is well known that the linearized binomial $L_r(x)=x^{q^r}+ax\in\mathbb{F}_{q^n}[x]$ is a permutation polynomial if and only if $(-1)^{n/d}a^{{(q^n-1)}/{(q^{d}-1)}}\neq 1$…
This work is a survey on completely regular codes. Known properties, relations with other combinatorial structures and constructions are stated. The existence problem is also discussed and known results for some particular cases are…
Let $\mathbb{F}_q$ be a finite field with $q$ elements and let $n$ be a positive integer. In this paper, we study the digraph associated to the map $x\mapsto x^n h(x^{\frac{q-1}{m}})$, where $h(x)\in\mathbb{F}_q[x].$ We completely determine…
This paper deals with some special integral transforms of Bargmann-Fock type in the setting of quaternionic valued slice hyperholomorphic and Cauchy-Fueter regular functions. The construction is based on the well-known Fueter mapping…
Leo Creedon and Kieran Hughes in [18] studied derivations of a group ring $RG$ (of a group $G$ over a commutative unital ring $R$) in terms of generators and relators of group $G$. In this article, we do that for $(\sigma,…
In an earlier paper we showed that we can improve results by Emmy Noether and Alexander Ostrowski concerning the reducibility modulo p of absolutely irreducible polynomials with integer coefficients by giving the problem a geometric turn…
Combinatorial $t$-designs have nice applications in coding theory, finite geometries and several engineering areas. There are two major methods of constructing $t$-designs. One of them is via group actions of certain permutation groups…
Let $\varphi\colon\Gamma\to G$ be a homomorphism of groups. We consider factorizations $\Gamma\xrightarrow{f} M\xrightarrow{g} G$ of $\varphi$ such that either $g$ or $f$ are universal normal maps (namely, crossed modules). These two…
Polynomial maps attached to polynomials of an Ore extension are naturally defi ned. In this setting we show the importance of pseudo-linear transformations and give some applications. In particular, factorizations of polynomials in an Ore…
The purpose of this paper is to present the structure of the linear codes over a finite field with q elements that have a permutation automorphism of order m. These codes can be considered as generalized quasi-cyclic codes. Quasi-cyclic…
We begin with (densely-defined) fractional linear transformations (FLT) on (some) Banach algebras and their relatives. This leads to Wedderburn's continued fractions (recursively-defined noncommutative polynomials) for any ring. Along the…
A definition of quasi-flat left module is proposed and it is shown that any left module which is either quasi-projective or flat is quasi-flat. A characterization of local commutative rings for which each ideal is quasi-flat (resp.…
In this paper, by use of matrix inversions, we establish a general $q$-expansion formula of arbitrary formal power series $F(z)$ with respect to the base $$\left\{z^n\frac{(az:q)_n}{(bz:q)_n}\bigg|n=0,1,2\cdots\right\}.$$ Some concrete…
The generalized cyclotomic mappings over finite fields $\mathbb{F}_{q}$ are those mappings which induce monomial functions on all cosets of an index $\ell$ subgroup $C_0$ of the multiplicative group $\mathbb{F}_{q}^{*}$. Previous research…
We show that the singular holomorphic foliations induced by dominant quasi-homogeneous rational maps fill out irreducible components of the space $\mathscr F_q(r, d)$ of singular foliations of codimension $q$ and degree $d$ on the complex…
We introduce a variant of PCPs, that we refer to as rectangular PCPs, wherein proofs are thought of as square matrices, and the random coins used by the verifier can be partitioned into two disjoint sets, one determining the row of each…
Interesting properties of the partitions of a finite field $\mathbb F_q$ induced by the combination of involutions and trace maps are studied. The special features of involutions of the form $\frac{u}{z}$, $u$ being a fixed element of…
In this paper, we propose a new method for constructing $1$-perfect mixed codes in the Cartesian product $\mathbb{F}_{n} \times \mathbb{F}_{q}^n$, where $\mathbb{F}_{n}$ and $\mathbb{F}_{q}$ are finite fields of orders $n = q^m$ and $q$. We…
Let $r > 0$ be an integer, let $\mathbb{F}_q$ be a finite field of $q$ elements, and let $\mathcal{A}$ be a nonempty proper subset of $\mathbb{F}_q$. Moreover, let $\mathbf{M}$ be a random $m \times n$ rank-$r$ matrix over $\mathbb{F}_q$…
Let $P: \F \times \F \to \F$ be a polynomial of bounded degree over a finite field $\F$ of large characteristic. In this paper we establish the following dichotomy: either $P$ is a moderate asymmetric expander in the sense that $|P(A,B)|…