Results 11 to 20 of about 71,552 (319)
Descents of $\lambda$-unimodal cyclic permutations [PDF]
Discrete Mathematics & Theoretical Computer Science, 2014 We prove an identity conjectured by Adin and Roichman involving the descent set of $\lambda$-unimodal cyclic permutations. These permutations appear in the character formulas for certain representations of the symmetric group and these formulas are ...
Kassie Archer
doaj +2 more sources
Vincular pattern avoidance on cyclic permutations
Enumerative Combinatorics and Applications, 2021 Pattern avoidance for permutations has been extensively studied, and has been generalized to vincular patterns, where certain elements can be required to be adjacent. In addition, cyclic permutations, i.e., permutations written in a circle rather than a line, have been frequently studied, including in the context of pattern avoidance.
Rupert Li
openalex +5 more sources
On the permutation polytopes of some cyclic groups
Special MatricesIn this article, we study the combinatorics of permutation polytopes of some cyclic groups, denoted by P⟨g⟩P\langle g\rangle where g∈Sng\in {S}_{n}. We give a formula on the dimension and the number of vertices of the smallest faces containing two given
Chen Zhi, Yang Zhiwen, Zhu Kebin
doaj +2 more sources
$C_2$-cofiniteness of 2-cyclic permutation orbifold models [PDF]
Communications in Mathematical Physics, 2011 In this article, we consider permutation orbifold models of $C_2$-cofinite vertex operator algebras of CFT type. We show the $C_2$-cofiniteness of the 2-cyclic permutation orbifold model $(V\otimes V)^{S_2}$ for an arbitrary $C_2$-cofinite simple vertex ...
A. Klemm +14 more
core +3 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
Cyclic sieving phenomenon on annular noncrossing permutations [PDF]
, 2012 12 pages, 3 ...
Jang Soo Kim
openalex +4 more sources
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
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 +1 more source
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
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