Related papers: A note on inverses of cyclotomic mapping permutati…
It is proved that the random integral mappings (some type of functionals of L\'evy processes) are always isomorphisms between convolution semigroups of infinitely divisible measures. However, the inverse mappings are no longer of the random…
Building upon the foundational work of Thomas and Williams on the modular sweep map, Garsia and Xin have developed a straightforward algorithm for the inversion of the sweep map on rational $(m,n)$-Dyck paths, where $(m,n)$ represents…
An additive fast Fourier transform over a finite field of characteristic two efficiently evaluates polynomials at every element of an $\mathbb{F}_2$-linear subspace of the field. We view these transforms as performing a change of basis from…
Permutation trinomials over finite fields consititute an active research due to their simple algebraic form, additional extraordinary properties and their wide applications in many areas of science and engineering. In the present paper, six…
Let $r\geq 3$ be a positive integer and $\mathbb{F}_q$ the finite field with $q$ elements. In this paper, we consider the $r$-regular complete permutation property of maps with the form $f=\tau\circ\sigma_M\circ\tau^{-1}$ where $\tau$ is a…
We generalize the definition of overconvergent $p$-adic multiple polylogarithms and of $p$-adic cyclotomic multiple zeta values and we prove a bound on their norm. A byproduct of the proof is a characterization of these objects in terms of…
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…
We give formulas for the number of polynomials over a finite field with given root multiplicities, in particular in cases when the formula is surprisingly simple (a power of q). Besides this concrete interpretation, we also prove an…
We provide upper bounds for the cardinality of the value set of a polynomial map in several variables over a finite field. These bounds generalize earlier bounds for univariate polynomials.
Motivated by the $Z$-polynomials of matroids, Ferroni, Matherne, Stevens, and Vecchi introduced the inverse $Z$-polynomial of a matroid. In this paper, we prove several fundamental properties of the inverse $Z$-polynomial, including…
We show the existence of and explicitly construct generic polynomials for various groups, over fields of positive characteristic. The methods we develop apply to a broad class of connected linear algebraic groups defined over finite fields…
We describe an algorithm, implemented in Python, which can enumerate any permutation class with polynomial enumeration from a structural description of the class. In particular, this allows us to find formulas for the number of permutations…
In this dissertation, we explore the structure of inversion graphs of permutations--a class of graphs that naturally arises by representing each permutation as a graph, where vertices correspond to entries and edges encode inversions.…
The paper studies constructions of irreducible polynomials over finite fields using polynomial composition method.
Generalizing a result in the theory of finite fields we prove that, apart from a couple of exceptions that can be classified, for any elements $a_1,...,a_m$ of the cyclic group of order $m$, there is a permutation $\pi$ such that…
A simple procedure to obtain complete, closed expressions for Lie algebra invariants is presented. The invariants are ultimately polynomials in the group parameters. The construction of finite group elements require the use of projectors,…
The inversion formula is given for automorphisms of the Weyl algebras with polynomial coefficients over a field of characteristic zero. The theorem of Gabber on the degree of polynomial automorphism is extended. It is proved that any…
We introduce inversions tableaux, a new combinatorial model for Schubert polynomials and Stanley symmetric functions that directly specializes to semi-standard Young tableaux in the Grassmannian case. They are a modification of the balanced…
The permutation groups of cyclic codes are widely applicable in determining the weight distribution of codes, decoding theory and various other areas. In this paper, by employing two distinct matrix representations, we can relate cyclic…
In this paper, we use the method developed previously by Hong, Qin and Zhao to obtain several results on the permutational behavior of the reversed Dickson polynomial $D_{n,k}(1,x)$ of the $(k+1)$-th kind over the finite field ${\mathbb…