Results 21 to 30 of about 7,570 (298)

The Crossing Numbers of Join Products of Paths and Cycles with Four Graphs of Order Five

open access: yesMathematics, 2021
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

open access: yesDiscrete Applied Mathematics, 2008
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]

open access: yesQuantum
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]

open access: yesScientific Reports, 2019
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

Cyclically Consecutive Permutation Avoidance [PDF]

open access: yesSIAM Journal on Discrete Mathematics, 2016
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]

open access: yesThe Electronic Journal of Combinatorics, 2010
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

Constructing Large Girth QC Protograph LDPC Codes Based on PSD-PEG Algorithm

open access: yesIEEE 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]

open access: yes, 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

On the crossing number of join product of the discrete graph with special graphs of order five

open access: yesElectronic Journal of Graph Theory and Applications, 2020
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

Descents of $\lambda$-unimodal cyclic permutations [PDF]

open access: yesDiscrete 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

Home - About - Disclaimer - Privacy