Related papers: Permutation-like Matrix Groups with a Maximal Cycl…

A permutiple is a natural number that is a nontrivial multiple of a permutation of its digits in some base. Special cases of permutiples include cyclic numbers (multiples of cyclic permutations of their digits) and palintiple numbers…

Circulant matrices are an important tool widely used in coding theory and cryptography. A circulant matrix is a square matrix whose rows are the cyclic shifts of the first row. Such a matrix can be efficiently stored in memory because it is…

A permutative matrix is a square matrix such that every row is a permutation of the first row. A constructive version of a result attributed to Suleimanova is given via permutative matrices. In addition, we strengthen a well-known result by…

Let $G$ be a finite permutation group on $\Omega$. An ordered sequence of elements of $\Omega$, $(\omega_1,\dots, \omega_t)$, is an irredundant base for $G$ if the pointwise stabilizer $G_{(\omega_1,\dots, \omega_t)}$ is trivial and no…

We determine a condition on the minimum Hamming weight of some special abelian group codes and, as a consequence of this result, we establish that any such code is, up to permutational equivalence, a subspace of the direct sum of $s$ copies…

Cohn and Kumar showed the quadratic character of $q$ modulo $p$ gives the sign of the permutation of Hurwitz primes of norm $p$ induced by the Hurwitz primes of norm $q$ under metacommutation. We demonstrate that these permutations are…

This paper introduces a new graph construction, the permutational power of a graph, whose adjacency matrix is obtained by the composition of a permutation matrix with the adjacency matrix of the graph. It is shown that this construction…

Each square complex matrix is unitarily similar to an upper triangular matrix with diagonal entries in any prescribed order. Let A and B be upper triangular n-by-n matrices that (i) are not similar to direct sums of matrices of smaller…

By definition, admissible matrix groups are those that give rise to a wavelet-type inversion formula. This paper investigates necessary and sufficient admissibility conditions for abelian matrix groups. We start out by deriving a block…

Using the Polya Enumeration Theorem, we count with particular attention to C^3/Gamma up to C^6/Gamma, abelian orbifolds in various dimensions which are invariant under cycles of the permutation group S_D. This produces a collection of…

We study permutations on n elements preserving orientation (parity) of every subset of size k. We describe all groups of these permutations. Unexpectedly, these groups (except for some special cases) are either trivial, cyclic or dihedral.…

Let $R$ be a commutative ring and $g(t) \in R[t]$ a monic polynomial. The commutative ring of polynomials $f(C_g)$ in the companion matrix $C_g$ of $g(t)$, where $f(t)\in R[t]$, is called the Companion Ring of $g(t)$. Special instances…

Gilbert Strang posited that a permutation matrix of bandwidth $w$ can be written as a product of $N < 2w$ permutation matrices of bandwidth 1. A proof employing a greedy ``parallel bubblesort'' algorithm on the rows of the permutation…

An element of a Coxeter group $W$ is called fully commutative if any two of its reduced decompositions can be related by a series of transpositions of adjacent commuting generators. In the preprint "Fully commutative elements in finite and…

Let D be an acyclic orientation of a simple graph G. An arc of D is called dependent if its reversal creates a directed cycle. Let d(D) denote the number of dependent arcs in D. Define m and M to be the minimum and the maximum number of…

Let $\sigma =\{\sigma_{i} | i\in I\}$ be some partition of the set of all primes $\Bbb{P}$ and let $G$ be a finite group. Then $G$ is said to be $\sigma $-full if $G$ has a Hall $\sigma _{i}$-subgroup for all $i$. A subgroup $A$ of $G$ is…

We show that using the cyclic group the transpose of an R-cyclic matrix can be decomposed along diagonal parts into a sum of parts which are freely independent over diagonal scalar matrices. Moreover, if the R-cyclic matrix is self-adjoint…

In $1998,$ Daemen {\it{ et al.}} introduced a circulant Maximum Distance Separable (MDS) matrix in the diffusion layer of the Rijndael block cipher, drawing significant attention to circulant MDS matrices. This block cipher is now…

In symmetric groups, studies of permutation factorizations or triples of permutations satisfying certain conditions have a long history. One particular interesting case is when two of the involved permutations are long cycles, for which…

A permutation graph is a cubic graph admitting a 1-factor M whose complement consists of two chordless cycles. Extending results of Ellingham and of Goldwasser and Zhang, we prove that if e is an edge of M such that every 4-cycle containing…