Results 1 to 10 of about 206,672 (309)
Twin-width and permutations [PDF]
Log. Methods Comput. Sci., 2021 Inspired by a width invariant on permutations defined by Guillemot and Marx, Bonnet, Kim, Thomass\‘e, and Watrigant introduced the twin-width of graphs, which is a parameter describing its structural complexity.
Édouard Bonnet +4 more
semanticscholar +1 more source
Descents on quasi-Stirling permutations [PDF]
Journal of Combinatorial Theory, 2020 Stirling permutations were introduced by Gessel and Stanley, who used their enumeration by the number of descents to give a combinatorial interpretation of certain polynomials related to Stirling numbers. Quasi-Stirling permutations, which can be viewed
S. Elizalde
semanticscholar +1 more source
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
SIF Permutations and Chord-Connected Permutations [PDF]
Discrete Mathematics & Theoretical Computer Science, 2014 A stabilized-interval-free (SIF) permutation on [n], introduced by Callan, is a permutation that does not stabilize any proper interval of [n]. Such permutations are known to be the irreducibles in the decomposition of permutations along non-crossing ...
Natasha Blitvić
doaj +1 more source
To permute or not to permute [PDF]
Bioinformatics, 2006 Abstract Permutation test is a popular technique for testing a hypothesis of no effect, when the distribution of the test statistic is unknown. To test the equality of two means, a permutation test might use a test statistic which is the difference of the two sample means in the univariate case.
Yifan Huang +3 more
openaire +2 more sources
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 ...
Julie Linman, Michael Pinsker
openaire +3 more sources
IEEE Transactions on Information Theory, 2023 Motivated by the problem of constructing bijective maps with low differential uniformity, we introduce the notion of permutation resemblance of a function, which looks to measure the distance a given map is from being a permutation. We prove several results concerning permutation resemblance and show how it can be used to produce low differentially ...
Li-An Chen, Robert S. Coulter
openaire +2 more sources
The Electronic Journal of Combinatorics, 2021 The concept of prolificity was previously introduced by the authors in the context of compositions of integers. We give a general interpretation of prolificity that applies across a range of relational structures defined in terms of counting embeddings.
Michael Albert 0001, Murray Tannock
openaire +1 more source
Cladistics, 1994 Peer Reviewed ; http://deepblue.lib.umich.edu/bitstream/2027.42/31724/1/0000662 ...
Farris, James S. +3 more
openaire +4 more sources
Counting 3-stack-sortable permutations [PDF]
Journal of Combinatorial Theory, 2019 We prove a "decomposition lemma" that allows us to count preimages of certain sets of permutations under West's stack-sorting map $s$. As a first application, we give a new proof of Zeilberger's formula for the number of 2-stack-sortable permutations in $
Colin Defant
semanticscholar +1 more source