Related papers: A Method for Finding All Permutiples with a Fixed …

We prove that it is always possible to find a permutation $p$ on the set $\{1,...,n\}$ such that $c+p(c)$ is prime for all $c \in \{1,...,n\}.$

Motivated by classical nontransitivity paradoxes, we call an $n$-tuple $(x_1,\dots,x_n) \in[0,1]^n$ \textit{cyclic} if there exist independent random variables $U_1,\dots, U_n$ with $P(U_i=U_j)=0$ for $i\not=j$ such that…

Consider a finite sequence of permutations of the elements 1,...,n, with the property that each element changes its position by at most 1 from any permutation to the next. We call such a sequence a tangle, and we define a move of element i…

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…

We call a set of positive integers closed under taking unitary divisors a unitary ideal. It can be regarded as a simplicial complex. Moreover, a multiplicative arithmetical function on such a set corresponds to a function on the simplicial…

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…

Taking the absolute value of consecutive differences of a cyclicly ordered list of integers constitutes a simple dynamical system. For lists of lenght a power of two the process will terminate in all zeros, but examples with arbitarily long…

Let $ (P_n)_{n\ge 0}$ be the sequence of Perrin numbers defined by ternary relation $ P_0=3 $, $ P_1=0 $, $ P_2=2 $, and $ P_{n+3}=P_{n+1}+P_n $ for all $ n\ge 0 $. In this paper, we use Baker's theory for nonzero linear forms in logarithms…

A \emph{repdigit} is a natural number greater than 10 which has all of its base-10 digits the same. In this paper we find all examples of two repdigits adding to a square. The proofs lead to interesting questions about consecutive quadratic…

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…

In order to study signed Eulerian numbers, we introduce permutations of a particular type, called parity-alternate permutations, because they take even and odd entries alternately. The objective of this paper is twofold. The first is to…

For a given base $g\ge2$, a positive integer is called a palindrome if its base $g$ expansion reads the same backwards as forwards. In this paper, we give an asymptotic formula for the number of relatively prime pairs of palindromes of a…

We define cyclic $U$-statistics as a variant of $U$-statistics based on variables $X_1,\dots,X_n$ that are assumed to be cyclically ordered. We also define alternating $U$-statistics where in the definition terms are summed with alternating…

We studied two probabilistic models of the distribution of primes in the natural number [1].The paper considers the third probabilistic model of the distribution of primes in the natural number. The author proved that the results obtained…

There is a deep connection between permutations and trees. Certain sub-structures of permutations, called sub-permutations, bijectively map to sub-trees of binary increasing trees. This opens a powerful tool set to study enumerative and…

Let $A$ be a set of positive integers. We define a positive integer $n$ as an $A$-practical number if every positive integer from the set $\left\{1,\ldots ,\sum_{d\in A, d\mid n}d\right\}$ can be written as a sum of distinct divisors of $n$…

We consider primitive divisors of terms of integer sequences defined by quadratic polynomials. Apart from some small counterexamples, when a term has a primitive divisor, that primitive divisor is unique. It seems likely that the number of…

Let Sym_n denote the symmetric group of all permutations pi = a_1...a_n of {1,...,n}. An index i is a peak of pi if a_{i-1} < a_i > a_{i+1} and we let P(pi) be the set of peaks of pi. Given any set S of positive integers we define P(S;n) to…

Adding a column of numbers produces "carries" along the way. We show that random digits produce a pattern of carries with a neat probabilistic description: the carries form a one-dependent determinantal point process. This makes it easy to…

The computation of the normaliser of a permutation group in the full symmetric group is an important and hard problem in computational group theory. This article reports on an algorithm that builds a descending chain of overgroups to…