The cycles of the multiway perfect shuffle permutation.
Ellis, John, Fan, Hongbing, Shallit, Jeffrey (2002)
Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]
Similarity:
Ellis, John, Fan, Hongbing, Shallit, Jeffrey (2002)
Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]
Similarity:
Bijan Taeri (2010)
Rendiconti del Seminario Matematico della Università di Padova
Similarity:
Martyn Dixon, Thomas A. Fournelle (1984)
Compositio Mathematica
Similarity:
Władysław Narkiewicz (2002)
Journal de théorie des nombres de Bordeaux
Similarity:
It is shown that the methods established in [HKN3] can be effectively used to study polynomial cycles in certain rings. We shall consider the rings and shall describe polynomial cycles in the case when is either odd or twice a prime.
B. Kaufmann (1939)
Compositio Mathematica
Similarity:
Panagiotis C. Soules (1986)
Rendiconti del Seminario Matematico della Università di Padova
Similarity:
Meszka, Mariusz (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Marián Klešč (2005)
Discussiones Mathematicae Graph Theory
Similarity:
The exact values of crossing numbers of the Cartesian products of four special graphs of order five with cycles are given and, in addition, all known crossing numbers of Cartesian products of cycles with connected graphs on five vertices are summarized.
Gary Mullen (1976)
Acta Arithmetica
Similarity:
Pedro Lopes (2009)
Open Mathematics
Similarity:
In this article we look into characterizing primitive groups in the following way. Given a primitive group we single out a subset of its generators such that these generators alone (the so-called primitive generators) imply the group is primitive. The remaining generators ensure transitivity or comply with specific features of the group. We show that, other than the symmetric and alternating groups, there are infinitely many primitive groups with one primitive generator each. These primitive...