Related papers: Cycle structure of permutation functions over fini…
In this paper we describe a class of codes called {\it permutation codes}. This class of codes is a generalization of cyclic codes and quasi-cyclic codes. We also give some examples of optimal permutation codes over binary, ternary, and…
We give an account on what is known on the subject of permutation matchings, which are bijections of a finite regular semigroup that map each element to one of its inverses. This includes partial solutions to some open questions, including…
We present a mathematical model: dynamical systems over finite sets (DSF), and we show that Boolean and discrete genetic models are special cases of DFS. In this paper, we prove that a function defined over finite sets with different number…
This paper defines and develops cycle indices for the finite classical groups. These tools are then applied to study properties of a random matrix chosen uniformly from one of these groups. Properties studied by this technique will include…
We show that the trace formula interpretation of the explicit formulas expresses the counting function N(q) of the hypothetical curve C associated to the Riemann zeta function, as an intersection number involving the scaling action on the…
Given two quivers, each with a reddening sequence, we show how to construct a plethora of mutation cycles. We give several examples, including a generalization of the construction of long mutation cycles in earlier work by the second…
Using the analytical expressions for the genuine eigenfunctions $\varphi_{\mu\nu}(z)$ and eigenvalues $E_{\mu,\nu}$, of open, bounded and quasi-bounded finite periodic systems, we derive the eigenfunctions space-inversion symmetry…
Two new matrix classes are introduced; inverse cyclic matrices and bi-diagonal south-west matrices. An interesting relation is established between these classes. Applications to two classes of inverse $Z$-matrices are provided.
We describe the structure of finite Boolean inverse monoids and apply our results to the representation theory of finite inverse semigroups. We then generalize to semisimple Boolean inverse semigroups.
We prove a geometric property of the set A^{-1} of inverses of the nonzero elements of an F_q-subspace A of a finite field involving the size of its intersection with two-dimensional F_q-subspaces. We give some applications, including a new…
With the help of hypergeometric functions over finite fields, we study some arithmetic properties of cyclotomic matrices involving characters and binary quadratic forms over finite fields. Also, we confirm some related conjectures posed by…
Consider the power pseudorandom-number generator in a finite field ${\mathbb F}_q$. That is, for some integer $e\ge2$, one considers the sequence $u,u^e,u^{e^2},\dots$ in ${\mathbb F}_q$ for a given seed $u\in {\mathbb F}_q^\times$. This…
$f$-electron systems exhibit a subtle interplay between strong spin--orbit coupling and crystal-field effects, producing complex energy landscapes that are computationally demanding. We introduce auxiliary functions, constructed by…
We construct several new classes of transcendental entire functions, f, such that both the escaping set, I(f), and the fast escaping set, A(f), have a structure known as a spider's web. We show that some of these classes have a degree of…
The R\'{e}dei function defined over a field of even characteristic has been introduced by N\"{o}bauer in 1986 \cite{even}. In this paper, inspired by the work of Fu et al. \cite{wang} in odd characteristic, employing the AGW criterion…
Pippenger's Galois theory of finite functions and relational constraints is extended to the infinite case. The functions involved are functions of several variables on a set $A$ and taking values in a possibly different set $B$, where any…
It is shown that a refined version of a q-analogue of the Eulerian numbers together with the action, by conjugation, of the subgroup of the symmetric group $S_n$ generated by the $n$-cycle $(1,2,...,n)$ on the set of permutations of fixed…
Recently, P. Yuan presented a local method to find permutation polynomials and their compositional inverses over finite fields. The work of P. Yuan inspires us to compute the compositional inverses of three classes of the permutation…
We define a number of related combinatorial objects, each of which possesses a surprising symmetry. We include several applications such as a combinatorial explanation for certain fixed points of the involution $\omega$ on the ring of…
We introduce a self-inverse function via an integral equivalent to a two-term combination of dilogarithms. We refer to this function as a fundamental form, since there is a family of extensions of this function that satisfy similar…