Related papers: Permutation Polynomials Under Multiplicative-Addit…
Permutation Pattern Matching (PPM) is the problem of deciding for a given pair of permutations P and T whether the pattern P is contained in the text T. Bose, Buss and Lubiw showed that PPM is NP-complete. In view of this result, it is…
Consider the gradient map associated to any non-constant homogeneous polynomial $f\in \C[x_0,...,x_n]$ of degree $d$, defined by \[\phi_f=grad(f): D(f)\to \CP^n, (x_0:...:x_n)\to (f_0(x):...:f_n(x))\] where $D(f)=\{x\in \CP^n; f(x)\neq 0\}$…
In this paper, we construct a new class of complete permutation monomials and several classes of permutation polynomials. Further, by giving another characterization of o-polynomials, we obtain a class of permutation polynomials of the form…
In a prior paper \cite{EFRST20}, two of us, along with P. Ellingsen, P. Felke and A. Tkachenko, 1defined a new (output) multiplicative differential, and the corresponding $c$-differential uniformity, which has the potential of extending…
Polytopic matrix factorization (PMF) is a recently introduced matrix decomposition method in which the data vectors are modeled as linear transformations of samples from a polytope. The successful recovery of the original factors in the…
Nonnegative matrix factorization (NMF) is a popular dimension reduction technique that produces interpretable decomposition of the data into parts. However, this decompostion is not generally identifiable (even up to permutation and…
Let $F$ be an infinite field, and let $M_{n}(F)$ be the algebra of $n\times n$ matrices over $F$. Suppose that this algebra is equipped with an elementary grading whose neutral component coincides with the main diagonal. In this paper, we…
Algebraic techniques in phylogenetics have historically been successful at proving identifiability results and have also led to novel reconstruction algorithms. In this paper, we study the ideal of phylogenetic invariants of the…
The $c$-differential uniformity is recently proposed to reflect resistance against some variants of differential attack. Finding functions with low $c$-differential uniformity is attracting attention from many researchers. For even…
This paper investigates the value distribution and growth properties of linear total differential polynomials $\mathcal{L}_k[D]f$ for meromorphic functions in several complex variables $\mathbb{C}^n$. By extending the classical Milloux…
Permutation polynomials over finite fields constitute an active research area and have applications in many areas of science and engineering. In this paper, four classes of monomial complete permutation polynomials and one class of…
We show that for any permutation $\pi$ there exists an integer $k_{\pi}$ such that every permutation avoiding $\pi$ as a pattern is a product of at most $k_{\pi}$ separable permutations. In other words, every strict class $\mathcal C$ of…
We prove that if x^m + c*x^n permutes the prime field GF(p), where m>n>0 and c is in GF(p)^*, then gcd(m-n,p-1) > sqrt{p} - 1. Conversely, we prove that if q>=4 and m>n>0 are fixed and satisfy gcd(m-n,q-1) > 2q*(log log q)/(log q), then…
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…
We show that C-minimal fields (i.e., C-minimal expansions of ACVF) have the exchange property, answering a question of Haskell and Macpherson. Additionally, we strengthen some theorems of Cubides Kovacsics and Delon on C-minimal fields.…
Let $\mathbb{F}_{p^m}$ be a finite field with $p^m$ elements, where $p$ is an odd prime and $m$ is a positive integer. Recently, \cite{Hengar} and \cite{Wang2020} determined the weight distributions of subfield codes with the form…
Permutation polynomials are of particular significance in several areas of applied mathematics, such as Coding theory and Cryptography. Many recent constructions are based on the Akbary-Ghioca-Wang (AGW) criterion. Along this line of…
In this paper, utilizing Nevanlinna theory, we study existence and forms of the entire solutions $ f $ of the quadratic trinomial-type partial differential-difference equations in $ \mathbb{C}^n $ \begin{align*} a\left(\alpha\dfrac{\partial…
Permutation polynomials have been a subject of study for a long time and have applications in many areas of science and engineering. However, only a small number of specific classes of permutation polynomials are described in the literature…
Block ciphers use S-boxes to create confusion in the cryptosystems. Such S-boxes are functions over $\mathbb{F}_{2^{n}}$. These functions should have low differential uniformity, high nonlinearity, and high algebraic degree in order to…