Related papers: Long Cycle Factorizations : Bijective Computation …
In this paper, we study the product of orders of composition factors of odd order in a composition series of a finite linear group. First we generalize a result by Manz and Wolf about the order of solvable linear groups of odd order. Then…
We show that any finite group $G$ there exists a bijction $f$ from $G$ onto $C_{n}$ such that $o(x)$ divides $o(f(x))$ for all $x\in G$. This confirm Problem 18.1 in [7].
An important family of codes for data storage systems, cryptography, consumer electronics, and network coding for error control in digital communications are the so-called cyclic codes. This kind of linear codes are also important due to…
For a cyclic group $a$, define the atom of $a$ as the set of all elements generating $a$. Given any two elements $a,b$ of a finite cyclic group $G$, we study the sumset of the atom of $a$ and the atom of $b$. It is known that such a sumset…
We show how to get explicit induction formulae for finite group representations, and more generally for rational Green functors, by summing a divergent series over Dwyer's subgroup and centralizer decomposition spaces. This results in…
Given a finite abelian group $G$, consider the complete graph on the set of all elements of $G$. Find a Hamiltonian cycle in this graph and for each pair of consecutive vertices along the cycle compute their sum. What are the smallest and…
A finite group $G$ is called $k$-factorizable if for any factorization $|G|=a_1\cdots a_k$ with $a_i>1$ there exist subsets $A_i$ of $G$ with $|A_i|=a_i$ such that $G=A_1\cdots A_k$. We say that $G$ is \textit{multifold-factorizable} if $G$…
Several musical scales, like the major scale, can be described as finite arithmetic sequences modulo octave, i.e. chunks of an arithmetic sequence in a cyclic group. Hence the question of how many different arithmetic sequences in a cyclic…
In this paper, we formally introduce the concept of a row-sum matrix over an arbitrary group $G$. When $G$ is cyclic, these types of matrices have been widely used to build uniform 2-factorizations of small Cayley graphs (or, Cayley…
The first author introduced a sequence of polynomials (\cite{8}, sequence A174531) defined recursively. One of the main results of this study is proof of the integrality of its coefficients.
In this tutorial, exponentiation and factorization (decomposition) formulas are derived and discussed for common matrix operators that arise in studies of classical dynamics, linear and nonlinear optics, and special relativity. To…
Various specifiable combinatorial structures, with d extensive parameters, can be exactly sampled both by the recursive method, with linear arithmetic complexity if a heavy preprocessing is performed, or by the Boltzmann method, with…
In their study of cyclic pattern containment, Domagalski et al. conjecture differential equations for the generating functions of circular permutations avoiding consecutive patterns of length 3. In this note, we prove and significantly…
We compute the $n_h$ terms to the massive three loop vector-, axialvector-, scalar- and pseudoscalar form factors in a direct analytic calculation using the method of large moments. This method has the advantage, that the master integrals…
A matrix is said to be {\it cyclic} if its characteristic polynomial is equal to its minimal polynomial. Cyclic matrices play an important role in some algorithms for matrix group computation, such as the Cyclic Meataxe developed by P. M.…
In this note, we describe a construction that leads to families of graphs whose critical groups are cyclic. For some of these families we are able to give a formula for the number of spanning trees of the graph, which then determines the…
Prime factorization is an outstanding problem in arithmetic, with important consequences in a variety of fields, most notably cryptography. Here we employ the intriguing analogy between prime factorization and optical interferometry in…
Primary Cyclic matrices were used (but not named) by Holt and Rees in their version of Parker's MEAT-AXE algorithm to test irreducibility of finite matrix groups and algebras. They are matrices $X$ with at least one cyclic component in the…
We introduce and consider a certain probability question involving elementary number theory and the likelihood that a fixed prime will appear in a certain recursively defined factorization of an integer. We derive several convergent…
A cyclic order may be thought of informally as a way to seat people around a table, perhaps for a game of chance or for dinner. Given a set of agents such as $\{A,B,C\}$, we can formalize this by defining a cyclic order as a permutation or…