Results 41 to 50 of about 975,846 (299)
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
Cyclic permutations for qudits in d dimensions [PDF]
AbstractOne of the main challenges in quantum technologies is the ability to control individual quantum systems. This task becomes increasingly difficult as the dimension of the system grows. Here we propose a general setup for cyclic permutations Xd in d dimensions, a major primitive for constructing arbitrary qudit gates.
Isdraila, Tudor-Alexandru +2 more
openaire +3 more sources
Descents of $\lambda$-unimodal cyclic permutations [PDF]
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
Cyclically permutable representations of cyclic codes
A cyclically permutable code is a binary block code of length \(n\) such that each codeword has \(n\) distinct cyclic shifts and such that no codeword can be obtained by one or more cyclic shifts of another codeword. Cyclically permutable codes have been studied for several applications involving synchronization, code-division multiple access (CDMA ...
Smith, Derek H., Perkins, Stephanie
openaire +1 more source
Skew characters and cyclic sieving
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
The q-ary image of some qm-ary cyclic codes: permutation group and soft-decision decoding [PDF]
Using a particular construction of generator matrices of the q-ary image of qm-ary cyclic codes, it is proved that some of these codes are invariant under the action of particular permutation groups.
Delpeyroux, Emmanuelle, Lacan, Jérôme
core +1 more source
Vincular pattern avoidance on cyclic permutations
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.
openaire +4 more sources
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
On the symmetry of good nonlinear codes [PDF]
It is shown that there are arbitrarily long "good" (in the sense of Gilbert) binary block codes that are preserved under very large permutation groups. This result contrasts sharply with the properties of linear codes: it is conjectured that long cyclic ...
McEliece, Robert J.
core +1 more source
Chosen-Key Secure Even-Mansour Cipher from a Single Permutation
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

