Results 11 to 20 of about 141,402 (295)
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 +3 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 +4 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
Pattern avoidance in partial permutations [PDF]
, 2010 Motivated by the concept of partial words, we introduce an analogous concept of partial permutations. A partial permutation of length n with k holes is a sequence of symbols $\pi = \pi_1\pi_2 ...
Claesson, A. +7 more
core +4 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
The Möbius function of separable and decomposable permutations [PDF]
, 2011 We give a recursive formula for the Moebius function of an interval $[\sigma,\pi]$ in the poset of permutations ordered by pattern containment in the case where $\pi$ is a decomposable permutation, that is, consists of two blocks where the first one ...
Jelínek, Vít +3 more
core +4 more sources
Permutations sortable by n-4 passes through a stack [PDF]
, 2010 The subject of pattern avoiding permutations has its roots in computer science, namely in the problem of sorting a permutation through a stack. A formula for the number of permutations of length n that can be sorted by passing it twice through a stack ...
Steingrimsson, Einar +2 more
core +3 more sources
Permutation tableaux and permutation patterns
Journal of Combinatorial Theory, Series A, 2007 Clarification of proofs (thanks to referees); report on progress on our open problems by Burstein, Corteel, Eriksen, Reifegerste, and Viennot. 25 pages, 7 figures.
Einar Steingrímsson, Lauren K. Williams
openaire +3 more sources
Calculating Permutation Entropy without Permutations [PDF]
Complexity, 2020 A method for analyzing sequential data sets, similar to the permutation entropy one, is discussed. The characteristic features of this method are as follows: it preserves information about equal values, if any, in the embedding vectors; it is exempt from combinatorics; and it delivers the same entropy value as does the permutation method, provided the ...
openaire +4 more sources