Results 11 to 20 of about 476,988 (354)
Information, 2021 During the search for S-boxes resistant to Power Attacks, the S-box space has recently been divided into Hamming Weight classes, according to its theoretical resistance to these attacks using the metric variance of the confusion coefficient.
Carlos Miguel Legón-Pérez +5 more
doaj +1 more source
Permutations on the Random Permutation [PDF]
The Electronic Journal of Combinatorics, 2015 The random permutation is the Fraïssé limit of the class of finite structures with two linear orders. Answering a problem stated by Peter Cameron in 2002, we use a recent Ramsey-theoretic technique to show that there exist precisely 39 closed supergroups of the automorphism group of the random permutation, and thereby expose all symmetries of this ...
Michael Pinsker, Julie Linman
openaire +3 more sources
Cladistics, 1994 Peer Reviewed ; http://deepblue.lib.umich.edu/bitstream/2027.42/31724/1/0000662 ...
Farris, James S. +3 more
openaire +4 more sources
Discrete Mathematics & Theoretical Computer Science, 2008 Severini and Mansour introduced $\textit{square polygons}$, as graphical representations of $\textit{square permutations}$, that is, permutations such that all entries are records (left or right, minimum or maximum), and they obtained a nice formula for their number.
Duchi, Enrica, Poulalhon, Dominique
openaire +4 more sources
Modified Growth Diagrams, Permutation Pivots, and the BWX Map $\phi^*$ [PDF]
Discrete Mathematics & Theoretical Computer Science, 2012 In their paper on Wilf-equivalence for singleton classes, Backelin, West, and Xin introduced a transformation $\phi^*$, defined by an iterative process and operating on (all) full rook placements on Ferrers boards. Bousquet-Mélou and Steingrimsson proved
Jonathan Bloom, Dan Saracino
doaj +1 more source
Minimal Factorizations of Permutations into Star Transpositions [PDF]
Discrete Mathematics & Theoretical Computer Science, 2008 We give a compact expression for the number of factorizations of any permutation into a minimal number of transpositions of the form $(1 i)$. Our result generalizes earlier work of Pak ($\textit{Reduced decompositions of permutations in terms of star ...
J. Irving, A. Rattan
doaj +1 more source
bioRxiv, 2020 Social network methods have become a key tool for describing, modelling, and testing hypotheses about the social structures of animals. However, due to the non-independence of network data and the presence of confounds, specialized statistical techniques
Michael N. Weiss +5 more
semanticscholar +1 more source
The expected number of inversions after n adjacent transpositions [PDF]
Discrete Mathematics & Theoretical Computer Science, 2009 We give a new expression for the expected number of inversions in the product of n random adjacent transpositions in the symmetric group S_{m+1}. We then derive from this expression the asymptotic behaviour of this number when n scales with m in various ...
Mireille Bousquet-Mélou
doaj +1 more source
Decoding Reed-Muller and Polar Codes by Successive Factor Graph Permutations [PDF]
International Symposium on Turbo Codes and Iterative Information Processing, 2018 Reed-Muller (RM) and polar codes are a class of capacity-achieving channel coding schemes with the same factor graph representation. Low-complexity decoding algorithms fall short in providing a good error-correction performance for RM and polar codes ...
Seyyed Ali Hashemi +3 more
semanticscholar +1 more source
Polyominoes determined by permutations [PDF]
Discrete Mathematics & Theoretical Computer Science, 2006 In this paper we consider the class of $\textit{permutominoes}$, i.e. a special class of polyominoes which are determined by a pair of permutations having the same size. We give a characterization of the permutations associated with convex permutominoes,
I. Fanti +4 more
doaj +1 more source