Results 21 to 30 of about 6,509 (277)
Rational and quasi-permutation representations of holomorphs of cyclic $p$-groups [PDF]
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
The Crossing Numbers of Join Products of Paths and Cycles with Four Graphs of Order Five
The main aim of the paper is to establish the crossing numbers of the join products of the paths and the cycles on n vertices with a connected graph on five vertices isomorphic to the graph K1,1,3\e obtained by removing one edge e incident with some ...
Michal Staš
doaj +1 more source
Periodic Patterns of Signed Shifts [PDF]
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
Erdős–Szekeres theorem for cyclic permutations [PDF]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Czabarka, Éva, Wang, Zhiyu
openaire +3 more sources
Study of noise in virtual distillation circuits for quantum error mitigation [PDF]
Virtual distillation has been proposed as an error mitigation protocol for estimating the expectation values of observables in quantum algorithms. It proceeds by creating a cyclic permutation of $M$ noisy copies of a quantum state using a sequence of ...
Pontus Vikstål +2 more
doaj +1 more source
Cyclically Consecutive Permutation Avoidance [PDF]
6 ...
openaire +2 more sources
CYCLIC PERMUTATIONS IN KAZAMA-SUZUKI STRING MODELS [PDF]
Moddings by cyclic permutation symmetries are performed on four-dimensional strings, built from N=2 coset models of the type CPm=SU(m+1)/[SU(m)×U(1)]. For some illustrative cases, the massless chiral and antichiral states of E6 are computed. The extent of the equivalence between different conformal invariant theories which possess equal chiral rings ...
Aldazabal, G. +3 more
openaire +4 more sources
Constructing Large Girth QC Protograph LDPC Codes Based on PSD-PEG Algorithm
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
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
On the crossing number of join product of the discrete graph with special graphs of order five
The main aim of the paper is to give the crossing number of join product G+Dn for the disconnected graph G of order five consisting of the complete graph K4 and of one isolated vertex.
Michal Staš
doaj +1 more source

