Results 11 to 20 of about 516,804 (240)
Endo-permutation modules as sources of simple modules. [PDF]
, 2003 The source of a simple $kG$-module, for a finite $p$-solvable group $G$ and an algebraically closed field $k$ of prime characteristic $p$, is an endo-permutation module (see~\cite{Pu1} or~\cite{Th}). L.
Mazza, Nadia
core +4 more sources
Developing a Linear Algorithm for Cubing a Cyclic Permutation [PDF]
, 1986 A linear algorithm is developed for cubing a cyclic permutation stored as a function in an array. This continues work discussed in [0] and [1] on searching for disciplined methods for developing and describing algorithms that deal with complicated ...
Xue, Jinyun, Gries, David
core +4 more sources
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
Cyclic Permutations in Determining Crossing Numbers
Discussiones Mathematicae Graph Theory, 2022 The crossing number of a graph G is the minimum number of edge crossings over all drawings of G in the plane. Recently, the crossing numbers of join products of two graphs have been studied.
Klešč Marián, Staš Michal
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
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
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
Permutation inference for the general linear model [PDF]
, 2014 Permutation methods can provide exact control of false positives and allow the use of non-standard statistics, making only weak assumptions about the data.
Winkler, Anderson +9 more
core +1 more source
Generalized permutation patterns - a short survey [PDF]
, 2010 An occurrence of a classical pattern p in a permutation π is a subsequence of π whose letters are in the same relative order (of size) as those in p.
Steingrimsson, Einar
core +2 more sources
Constructing Large Girth QC Protograph LDPC Codes Based on PSD-PEG Algorithm
IEEE 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