Results 31 to 40 of about 7,638 (298)
Constructing Large Girth QC Protograph LDPC Codes Based on PSD-PEG Algorithm
IEEE Access, 2017 For a given base graph, the lifted graph can be obtained by a copy-and-permute procedure. If the permutation is cyclic, the lifted graph corresponds to a quasi-cyclic (QC) protograph low-density parity-check (LDPC) code.
Xue-Qin Jiang +3 more
doaj +1 more source
The Dade group of a metacyclic $p$-group. [PDF]
, 2003 The Dade group $D(P)$ of a finite $p$-group $P$, formed by equivalence classes of endo-permutation modules, is a finitely generated abelian group. Its torsion-free rank equals the number of conjugacy classes of non-cyclic subgroups of $P$ and it is ...
Mazza, Nadia
core +1 more source
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 +1 more source
Skew characters and cyclic sieving
Forum of Mathematics, Sigma, 2021 In 2010, Rhoades proved that promotion on rectangular standard Young tableaux, together with the associated fake-degree polynomial, provides an instance of the cyclic sieving phenomenon.
Per Alexandersson +3 more
doaj +1 more source
Cyclic permutations and evolutionary trees
Advances in Applied Mathematics, 2004 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Charles Semple, Mike A. Steel
openaire +1 more source
Mathematics, 2020 The crossing number cr ( G ) of a graph G is the minimum number of edge crossings over all drawings of G in the plane. The main goal of the paper is to state the crossing number of the join product K 2 , 3 + C n for the complete ...
Michal Staš
doaj +1 more source
Slow Coloring Cyclic Permutation Graphs [PDF]
, 2021 The slow coloring game is played by two players, Lister and Painter, on a graph \(G\). In round \(i\), Lister marks a nonempty subset of \(V(G)\), which we'll call \(M\). By doing this he scores \(|M|\) points.
Morris, Joan
core
Implementation of quantum permutation algorithm with classical light [PDF]
, 2019 We report the experimental implementation of quantum permutation algorithm using polarization and orbital angular momentum of the classical optical beam. The easy-handling optical setup to realize all eight cyclic permutation transformations for an input
Zhang, Shihao +4 more
core +1 more source
Chosen-Key Secure Even-Mansour Cipher from a Single Permutation
IACR Transactions on Symmetric Cryptology, 2023 At EUROCRYPT 2015, Cogliati and Seurin proved that the 4-round Iterated Even-Mansour (IEM) cipher with Independent random Permutations and no key schedule EMIP4(k, u) = k⊕p4 ( k⊕p3 ( k⊕p2 (k⊕p1 (k⊕u)))) is sequentially indifferentiable from an ideal ...
Shanjie Xu, Qi Da, Chun Guo
doaj +1 more source
Erdős–Szekeres theorem for cyclic permutations [PDF]
Involve, a Journal of Mathematics, 2019 8 pages, 2 ...
Czabarka, Éva, Wang, Zhiyu
openaire +3 more sources