Related papers: Equivalence Relations for Computing Permutation Po…
We design new polynomials for representing threshold functions in three different regimes: probabilistic polynomials of low degree, which need far less randomness than previous constructions, polynomial threshold functions (PTFs) with…
Let $f=a{\tt x} +b{\tt x}^q+{\tt x}^{2q-1}\in\Bbb F_q[{\tt x}]$. We find explicit conditions on $a$ and $b$ that are necessary and sufficient for $f$ to be a permutation polynomial of $\Bbb F_{q^2}$. This result allows us to solve a related…
We propose investigating a summation analog of the paradigm for parallel integration. We make some first steps towards an indefinite summation method applicable to summands that rationally depend on the summation index and a P-recursive…
We consider a class of pattern matching problems where a normalising transformation is applied at every alignment. Normalised pattern matching plays a key role in fields as diverse as image processing and musical information processing…
A permutation array(permutation code, PA) of length $n$ and distance $d$, denoted by $(n,d)$ PA, is a set of permutations $C$ from some fixed set of $n$ elements such that the Hamming distance between distinct members…
We define two new families of polynomials that generalize permanents and prove upper and lower bounds on their determinantal complexities comparable to the known bounds for permanents. One of these families is obtained by replacing…
We show that many infinite classes of permutations over finite fields can be constructed via translators with a large choice of parameters. We first charac- terize some functions having linear translators, based on which several families of…
We use cyclotomy to design new classes of permutation polynomials over finite fields. This allows us to generate many classes of permutation polynomials in an algorithmic way. Many of them are permutation polynomials of large indices.
In this paper, a construction of complete permutation polynomials over finite fields of even characteristic proposed by Tu et al. recently is generalized in a recursive manner. Besides, several classes of complete permutation polynomials…
A method for calculating the $1/d$ expansion coefficients for solutions of integration by parts relations for Feynman integrals is presented. The idea is to use linear substitutions to transform these relations to an explicitly recursive…
We compute the number of ways a given permutation can be written as a product of exactly $k$ transpositions. We express this number as a linear combination of explicit geometric sequences, with coefficients which can be computed in many…
Permutation polynomials over finite fields have wide applications in many areas of science and engineering. In this paper, we present six new classes of permutation trinomials over $\mathbb{F}_{2^n}$ which have explicit forms by determining…
We characterize completey (give a necessary and suffcient condition using special neat embeddings)for a relation algebra to belong to the amalgamation, strong amalgamation, and superamalgamation base of the class of representable algebras.…
We propose an algorithm that approximates a given matrix polynomial of degree $d$ by another skew-symmetric matrix polynomial of a specified rank and degree at most $d$. The algorithm is built on recent advances in the theory of generic…
Let F_{q^n} be the field of order q^n, and let Tr be the trace map from F_{q^n} to its q-element subfield. We exhibit nine sequences of polynomials of the form f(x):=x+c*Tr(x^k), with c in F_{q^n}, such that for each polynomial the function…
We describe differential invariants of infinite-dimensional algebras being equivalence algebras of some classes of PDE and study structure of these algebras.
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…
For any real numbers $B \ge 1$ and $\delta \in (0, 1)$ and function $f: [0, B] \rightarrow \mathbb{R}$, let $d_{B; \delta} (f) \in \mathbb{Z}_{> 0}$ denote the minimum degree of a polynomial $p(x)$ satisfying $\sup_{x \in [0, B]} \big| p(x)…
We apply the technique of self-similar exponential approximants based on successive truncations of continued exponentials to reconstruct functional laws of the quasi-exponential class from the knowledge of only a few terms of their power…
Kaneko and Tsumura proved a relation of multiple $\tilde{T}$-values involving Entringer numbers counting the total number of down-up permutations starting with a fixed value. In the present paper, we generalize this relation and provide…