Results 1 to 10 of about 7,570 (298)
Distributional Chaos and Sensitivity for a Class of Cyclic Permutation Maps
Mathematics, 2023 Several chaotic properties of cyclic permutation maps are considered. Cyclic permutation maps refer to p-dimensional dynamical systems of the form φ(b1,b2,⋯,bp)=(up(bp),u1(b1),⋯,up−1(bp−1)), where bj∈Hj (j∈{1,2,⋯,p}), p≥2 is an integer, and Hj (j∈{1,2 ...
Risong Li, Tianxiu Lu, Zhi-Wen Mo
exaly +4 more sources
Permutation Polytopes of Cyclic Groups [PDF]
Discrete Mathematics & Theoretical Computer Science, 2012 We investigate the combinatorics and geometry of permutation polytopes associated to cyclic permutation groups, i.e., the convex hulls of cyclic groups of permutation matrices.
Barbara Baumeister +3 more
doaj +5 more sources
A Cyclic Permutation Approach to Removing Spatial Dependency between Clustered Gene Ontology Terms [PDF]
BiologyTraditional gene set enrichment analysis falters when applied to large genomic domains, where neighboring genes often share functions. This spatial dependency creates misleading enrichments, mistaking mere physical proximity for genuine biological ...
Rachel Rapoport +3 more
doaj +2 more sources
Cyclic Permutations in Determining Crossing Numbers
Discussiones Mathematicae Graph Theory, 2022 The crossing number of a graph G is the minimum number of edge crossings over all drawings of G in the plane. Recently, the crossing numbers of join products of two graphs have been studied.
Klešč Marián, Staš Michal
doaj +2 more sources
Graphical cyclic permutation groups
Discrete Mathematics, 2014 We establish conditions for a permutation group generated by a single permutation of a prime power order to be an automorphism group of a graph or an edge-colored graph. This corrects and generalizes the results of the two papers on cyclic permutation groups published in 1978 and 1981 by S. P. Mohanty, M. R. Sridharan, and S. K. Shukla.
Mariusz Grech
exaly +4 more sources
Cyclic Permutation Groups that are Automorphism Groups of Graphs [PDF]
Graphs and Combinatorics, 2019 Abstract In this paper we establish conditions for a permutation group generated by a single permutation to be an automorphism group of a graph. This solves the so called concrete version of König’s problem for the case of cyclic groups. We establish also similar conditions for the symmetry groups of other related structures: digraphs, supergraphs, and
Mariusz Grech, Andrzej Kisielewicz
exaly +2 more sources
Dynamic Injection and Permutation Coding for Enhanced Data Transmission [PDF]
EntropyIn this paper, we propose a novel approach to enhance spectral efficiency in communication systems by dynamically adjusting the mapping between cyclic permutation coding (CPC) and its injected form.
Kehinde Ogunyanda +2 more
doaj +2 more sources
On the permutation groups of cyclic codes [PDF]
Journal of Algebraic Combinatorics, 2012 The authors generalize the results of [\textit{R. Bienert} and \textit{B. Klopsch}, J. Algebr. Comb. 31, No. 1, 33--52 (2010; Zbl 1195.94083)] and classify the permutation groups of the non-elementary cyclic codes (the elementary codes have permutation group \(S_n\)) over arbitrary finite fields.
Kenza Guenda +2 more
exaly +2 more sources
Signed graphs and signed cycles of hyperoctahedral groups
Electronic Journal of Graph Theory and Applications, 2023 For a graph with edge ordering, a linear order on the edge set, we obtain a permutation of vertices by considering the edges as transpositions of endvertices.
Ryo Uchiumi
doaj +1 more source
The crossing numbers of join products of paths with three graphs of order five [PDF]
Opuscula Mathematica, 2022 The main aim of this paper is to give the crossing number of the join product \(G^\ast+P_n\) for the disconnected graph \(G^\ast\) of order five consisting of the complete graph \(K_4\) and one isolated vertex, where \(P_n\) is the path on \(n\) vertices.
Michal Staš, Mária Švecová
doaj +1 more source