Related papers: On permutations derived from integer powers $x^n$

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$…

It is an open problem whether $ \binom{2n}{n} $ is divisible by 4 or 9 for all $n>256$. In connection with this, we prove that for a fixed uneven $m$ the asymptotic density of $k$'s such that $ m \nmid \binom{2^{k+1}}{2^{k}} $ is 0. To do…

We construct a new bijection between the set of $n\times k$ $0$-$1$ matrices with no three $1$'s forming a $\Gamma$ configuration and the set of $(n,k)$-Callan sequences, a simple structure counted by poly-Bernoulli numbers. We give two…

We study the process of bootstrap percolation on n x n permutation matrices, inspired by the work of Shapiro and Stephens [5]. In this percolation model, cells mutate (from 0 to 1) if at least two of their cardinal neighbors contain a 1,…

Let $\ell\ge5$ be an odd prime and $j, s$ be positive integers. We study the distribution of the coefficients of integer and half-integral weight modular forms modulo odd positive integer $M$. As a consequence, we prove that for each…

It is proven that, contrarily to the common belief, the notion of zero is not necessary for having positional representations of numbers. Namely, for any positive integer $k$, a positional representation with the symbols for $1, 2, \ldots,…

This paper mainly studies problems about so called "permutation polynomials modulo $m$", polynomials with integer coefficients that can induce bijections over Z_m={0,...,m-1}. The necessary and sufficient conditions of permutation…

We introduce a notion of permutation presentations of modules over finite groups, and completely determine finite groups over which every module has a permutation presentation. To get this result, we prove that every coflasque module over a…

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.…

Let $n$ be a fixed integer with $n\geq 2$. For $i,j\in\mathbb{Z}_n$, define $||i,j||_n$ to be the distance between $i$ and $j$ when the elements of $\mathbb{Z}_n$ are written in a cycle. So $||i,j||_n=\min\{(i-j)\bmod n,(j-i)\bmod n\}$. For…

We develop an analog for shifted primes of the Kubilius model of prime factors of integers. We prove a total variation distance estimate for the difference between the model and actual prime factors of shifted primes, and apply it to show…

Let $p=3n+1$ be a prime with $n\in\mathbb{N}=\{0,1,\cdots\}$, and let $g\in\mathbb{Z}$ be a primitive root modulo $p$. Let $0<a_1<\cdots<a_n<p$ be all the cubic residues modulo $p$ in the interval $(0,p)$. Then clearly the sequence $$a_1\…

Elizalde (2011) characterized which permutations can be obtained by ordering consecutive elements in the trajectories of (positive) beta-transformations and beta-shifts. We prove similar results for negative bases beta.

Let $R=\bigoplus_{\underline{n} \in \mathbb{N}^t}R_{\underline{n}}$ be a commutative Noetherian $\mathbb{N}^t$-graded ring, and $L = \bigoplus_{\underline{n}\in\mathbb{N}^t}L_{\underline{n}}$ be a finitely generated $\mathbb{N}^t$-graded…

Let $p$ be an odd prime and let $n$ be a natural number. In this article we determine the irreducible constituents of the permutation module induced by the action of the symmetric group $\mathfrak{S}_n$ on the cosets of a Sylow $p$-subgroup…

A classical result of A. Fleck states that if p is a prime, and n>0 and r are integers, then $$\sum_{k=r(mod p)}\binom {n}{k}(-1)^k=0 (mod p^{[(n-1)/(p-1)]}).$$ Recently R. M. Wilson used Fleck's congruence and Weisman's extension to…

In this paper we give simple expressions, involving binomials coefficients, for the value of $c(n,k)$ modulo $p^{v_p(n)}$, when $v_p(n) > 0$. Here $c(n,k)$ denotes a Stirling number of the first kind, and $v_p(n)$ is the highest power of…

$ n-$cycle permutation polynomials with small n have the advantage that their compositional inverses are efficient in terms of implementation. These permutation polynomials have significant applications in cryptography and coding theory. In…

Let $P^+(n)$ denote the largest prime factor of the integer $n$ and $P_y^+(n)$ denote the largest prime factor $p$ of $n$ which satisfies $p\leqslant y$. In this paper, firstly we show that the triple consecutive integers with the two…

For a prime p and base b, the digit function delta(r) = floor(br/p) partitions the residues {1, ..., p-1} into b contiguous bins. The collision count C(g) records how many residues share a bin with their image under multiplication by g. We…