Results 11 to 20 of about 825,768 (324)
$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 +5 more sources
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 ...
Yu Zhao +4 more
doaj +2 more sources
Boundary Value Problems, 2020 In this paper, we introduce and study a tripled system of three associated fractional differential equations. Prior to proceeding to the main results, the proposed system is converted into an equivalent integral form by the help of fractional calculus ...
Mohammed M. Matar +2 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
Cyclically Consecutive Permutation Avoidance [PDF]
SIAM Journal on Discrete Mathematics, 2016 6 ...
Richard Ehrenborg
openalex +5 more sources
Permutation Decoding and the Stopping Redundancy Hierarchy of Cyclic and Extended Cyclic Codes [PDF]
, 2008 We introduce the notion of the stopping redundancy hierarchy of a linear block code as a measure of the trade-off between performance and complexity of iterative decoding for the binary erasure channel.
Hehn, Thorsten +3 more
core +2 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
Generating a random cyclic permutation [PDF]
BIT, 1988 We prove correct an algorithm that, given \(n>0\), stores in array b[0..n- 1] a random cyclic permutation of the integers in 0..n-1, with each cyclic permutation having equal probability of being stored in b. The algorithm was developed by Sattolo; our contribution is to present a more convincing proof using standard program-proving methods.
David Gries, Jinyun Xue
openaire +4 more sources
Cyclic Permutations in Doubly-Transitive Groups [PDF]
Communications in Algebra, 1997 Let Ω be a finite set of size n. A cyclic permutation on Ω is a permutation whose cycle decomposition is one cycle of length n. This paper classifies all finite doubly-transitive permutation groups which contain a cyclic permutation.
McSorley, John P.
core +5 more sources
Cyclic permutation-time symmetric structure with coupled gain-loss microcavities [PDF]
, 2015 We study the coupled even number of microcavities with the balanced gain and loss between any pair of their neighboring components. The effective non-Hermitian Hamiltonian for such structure has the cyclic permutation-time symmetry with respect to the ...
He, Bing +3 more
core +2 more sources