Results 21 to 30 of about 71,552 (319)
On the crossing numbers of join products of five graphs of order six with the discrete graph [PDF]
Opuscula Mathematica, 2020 The main purpose of this article is broaden known results concerning crossing numbers for join of graphs of order six. We give the crossing number of the join product \(G^{\ast} + D_n\), where the disconnected graph \(G^{\ast}\) of order six consists of ...
Michal Staš
doaj +1 more source
Periodic Patterns of Signed Shifts [PDF]
Discrete Mathematics & Theoretical Computer Science, 2013 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
Rational and quasi-permutation representations of holomorphs of cyclic $p$-groups [PDF]
International Journal of Group Theory, 2022 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
Distributional Chaos and Sensitivity for a Class of Cyclic Permutation Maps
Mathematics, 2023 Several chaotic properties of cyclic permutation maps are considered. Cyclic permutation maps refer to p-dimensional dynamical systems of the form φ(b1,b2,⋯,bp)=(up(bp),u1(b1),⋯,up−1(bp−1)), where bj∈Hj (j∈{1,2,⋯,p}), p≥2 is an integer, and Hj (j∈{1,2 ...
Yu Zhao +4 more
doaj +1 more source
On the crossing number of join product of the discrete graph with special graphs of order five
Electronic 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
The Crossing Numbers of Join Products of Paths and Cycles with Four Graphs of Order Five
Mathematics, 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
On permutation-twisted free fermions and two conjectures [PDF]
, 2013 We conjecture that the category of permutation-twisted modules for a multi-fold tensor product vertex operator superalgebra and a cyclic permutation of even order is isomorphic to the category of parity-twisted modules for the underlying vertex operator ...
Katrina Barron, Nathan, Vander Werf
core +1 more source
Erdős–Szekeres theorem for cyclic permutations [PDF]
Involve, a Journal of Mathematics, 2019 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]
QuantumVirtual 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]
SIAM Journal on Discrete Mathematics, 2016 6 ...
openaire +2 more sources