Results 21 to 30 of about 7,638 (298)
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
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 ...
Derek H. Smith, Stephanie Perkins
openaire +1 more source
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
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
Construction of regular quasi-cyclic protograph LDPC codes based on Vandermonde matrices [PDF]
In this contribution, we investigate the attainable performance of quasi-cyclic (QC) protograph Low-Density Parity-Check (LDPC) codes for transmission over both Additive White Gaussian Noise (AWGN) and uncorrelated Rayleigh channels.
Sheng Chen +5 more
core +1 more source
Cyclically Consecutive Permutation Avoidance [PDF]
We give an explicit formula for the number of permutations avoiding cyclically a consecutive pattern in terms of the spectrum of the associated operator of the consecutive pattern. As an example, the number of cyclically consecutive $123$-avoiding permutations in ${\mathfrak S}_{n}$ is given by $n!$ times the convergent series ${\displaystyle \sum_{k=-\
openaire +2 more sources
Cyclic Permutations of Sequences and Uniform Partitions [PDF]
Let $\vec{r}=(r_i)_{i=1}^n$ be a sequence of real numbers of length $n$ with sum $s$. Let $s_0=0$ and $s_i=r_1+\ldots +r_i$ for every $i\in\{1,2,\ldots,n\}$. Fluctuation theory is the name given to that part of probability theory which deals with the fluctuations of the partial sums $s_i$.
Po-Yi Huang, Jun Ma 0017, Yeong-Nan Yeh
openaire +2 more sources
Permutation groups, simple groups and sieve methods [PDF]
We show that the number of integers n ≤ x which occur as indices of subgroups of nonabelian finite simple groups, excluding that of An-1 in An, is ∼ hx/log x, for some given constant h.
Heath-Brown, D. R. +9 more
core +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
Developing a linear algorithm for cubing a cyclic permutation [PDF]
A linear algorithm is developed for cubing a cyclic permutation stored as a function in an array. This continues work discussed in [1] and [2] on searching for disciplined methods for developing and describing algorithms that deal with complicated data ...
Xue, Jinyun, Gries, David
core +1 more source

