Results 41 to 50 of about 203,327 (292)
Minimal and random generation of permutation and matrix groups [PDF]
, 2012 We prove explicit bounds on the numbers of elements needed to generate various types of finite permutation groups and finite completely reducible matrix groups, and present examples to show that they are sharp in all cases.
Derek F. Holt +5 more
core +1 more source
Image Encryption Algorithm Based on Substitution Principle and Shuffling Scheme [PDF]
Engineering and Technology Journal, 2020 This research presents a method of image encryption that has been designed based on the algorithm of complete shuffling, transformation of substitution box, and predicated image crypto-system. This proposed algorithm presents extra confusion in the first
Atyaf Hamad, Alaa Farhan
doaj +1 more source
Estimating significances of differences between slopes: A new methodology and software [PDF]
Computational Ecology and Software, 2013 Determining the significance of slope differences is a common requirement in studies of self-thinning, ontogeny and sexual dimorphism, among others. This has long been carried out testing for the overlap of the bootstrapped 95% confidence intervals of ...
Vasco M. N. C. S. Vieira, Joel Creed
doaj
Entropy, 2019 Image encryption is one of the essential tasks in image security. In this paper, we propose a novel approach that integrates a hyperchaotic system, pixel-level Dynamic Filtering, DNA computing, and operations on 3D Latin Cubes, namely DFDLC, for image ...
Taiyong Li +4 more
doaj +1 more source
Permutation Statistics of Indexed Permutations
European Journal of Combinatorics, 1994 The definitions of descent, exceedance, major index, inversion index and Denert's statistic for the elements of the symmetric group \({\mathcal S}_ d\) are generalized to indexed permutations, i.e. the elements of the group \(S^ n_ d:=\mathbb{Z}_ n\wr{\mathcal S}_ d\), where \(\wr\) is the wreath product with respect to usual action of \({\mathcal S}_ ...
openaire +2 more sources
Permutation Reconstruction [PDF]
The Electronic Journal of Combinatorics, 2006 In this paper, we consider the problem of permutation reconstruction. This problem is an analogue of graph reconstruction, a famous question in graph theory. In the case of permutations, the problem can be stated as follows: In all possible ways, delete $k$ entries of the permutation $p=p_1p_2p_3...p_n$ and renumber accordingly, creating $n \choose k$
openaire +2 more sources
Topics in computational group theory : primitive permutation groups and matrix group normalisers [PDF]
, 2012 Part I of this thesis presents methods for finding the primitive permutation groups of degree d, where 2500 ≤ d < 4096, using the O'Nan-Scott Theorem and Aschbacher's theorem. Tables of the groups G are given for each O'Nan-Scott class.
Coutts, Hannah Jane
core +2 more sources
On the Phase Sequences and Permutation Functions in the SLM Scheme for OFDM-IM Systems
IEEE Access, 2020 In orthogonal frequency division multiplexing with index modulation (OFDM-IM), the active subcarriers can convey information bits by modulated symbols as well as their indices. OFDM-IM has attracted a great deal of attention from researchers by virtue of
Kee-Hoon Kim
doaj +1 more source
On dots in boxes, or Permutation pattern classes and regular languages [PDF]
, 2015 This thesis investigates permutation pattern classes in a language theoretic context. Specifically we explored the regularity of sets of permutations under the rank encoding. We found that the subsets of plus- and minus-(in)decomposable permutations of
Hoffmann, Ruth
core +2 more sources
Some theoretical foundations for the design and analysis of randomized experiments
Journal of Causal InferenceNeyman’s seminal work in 1923 has been a milestone in statistics over the century, which has motivated many fundamental statistical concepts and methodology.
Shi Lei, Li Xinran
doaj +1 more source