Results 11 to 20 of about 7,570 (298)
In-situ inversion of a cyclic permutation [PDF]
Information Processing Letters, 1987 An algorithm is developed for the in-situ inversion of a cyclic permutation represented in an array. The emphasis is on the quo modo rather than the quod**; we are interested in finding concepts and notations for dealing more effectively with formal developments and proofs of such algorithms, rather than in this particular algorithm itself.
W. H. J. Feijen +2 more
openaire +2 more sources
The Topological Entropy of Cyclic Permutation Maps and Some Chaotic Properties on Their MPE sets
Complexity, 2020 In this paper, we study some chaotic properties of s-dimensional dynamical system of the form Ψa1,a2,…,as=gsas,g1a1,…,gs−1as−1, where ak∈Hk for any k∈1,2,…,s, s≥2 is an integer, and Hk is a compact subinterval of the real line ℝ=−∞,+∞ for any k∈1,2,…,s ...
Risong Li, Tianxiu Lu
doaj +2 more sources
Application of a permutation group on sasirangan pattern
Desimal, 2021 A permutation group is a group of all permutations of some set. If the set that forms a permutation group is the n-first of natural number, then a permutation group is called a symmetry group.
Na'imah Hijriati +3 more
doaj +2 more sources
On the crossing numbers of join products of W_{4}+P_{n} and W_{4}+C_{n} [PDF]
Opuscula Mathematica, 2021 The crossing number \(\mathrm{cr}(G)\) of a graph \(G\) is the minimum number of edge crossings over all drawings of \(G\) in the plane. The main aim of the paper is to give the crossing number of the join product \(W_4+P_n\) and \(W_4+C_n\) for the ...
Michal Staš, Juraj Valiska
doaj +1 more source
On the crossing numbers of join products of five graphs of order six with the discrete graph [PDF]
Opuscula Mathematica, 2020 The main purpose of this article is broaden known results concerning crossing numbers for join of graphs of order six. We give the crossing number of the join product \(G^{\ast} + D_n\), where the disconnected graph \(G^{\ast}\) of order six consists of ...
Michal Staš
doaj +1 more source
On Cyclic Schur-Positive Sets of Permutations [PDF]
The Electronic Journal of Combinatorics, 2020 We introduce a notion of cyclic Schur-positivity for sets of permutations, which naturally extends the classical notion of Schur-positivity, and it involves the existence of a bijection from permutations to standard Young tableaux that preserves the cyclic descent set.
Jonathan Bloom +2 more
openaire +2 more sources
Cyclic permutations: Degrees and combinatorial types [PDF]
Journal of Combinatorial Theory, Series A, 2021 This note will give an enumeration of $n$-cycles in the symmetric group ${\mathcal S}_n$ by their degree (also known as their cyclic descent number) and studies similar counting problems for the conjugacy classes of $n$-cycles under the action of the rotation subgroup of ${\mathcal S}_n$.
openaire +2 more sources
Rational and quasi-permutation representations of holomorphs of cyclic $p$-groups [PDF]
International Journal of Group Theory, 2022 For a finite group $G$, three of the positive integers governing its representation theory over $\mathbb{C}$ and over $\mathbb{Q}$ are $p(G),q(G),c(G)$.
Soham Pradhan, B. Sury
doaj +1 more source
Electronic Notes in Discrete Mathematics, 2013 We study lower and upper bounds for the maximum size of a set of pairwise cyclic colliding permutations.
Gérard Cohen, MALVENUTO, Claudia
openaire +2 more sources
Periodic Patterns of Signed Shifts [PDF]
Discrete Mathematics & Theoretical Computer Science, 2013 The periodic patterns of a map are the permutations realized by the relative order of the points in its periodic orbits. We give a combinatorial description of the periodic patterns of an arbitrary signed shift, in terms of the structure of the descent ...
Kassie Archer, Sergi Elizalde
doaj +1 more source