Results 11 to 20 of about 108,510 (269)
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
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 +2 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 +3 more sources
Permutation and complete permutation polynomials
Finite Fields and Their Applications, 2015 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Leonid A. Bassalygo, Victor A. Zinoviev
openaire +1 more source
Bounded affine permutations I. Pattern avoidance and enumeration [PDF]
Discrete Mathematics & Theoretical Computer Science, 2021 We introduce a new boundedness condition for affine permutations, motivated by the fruitful concept of periodic boundary conditions in statistical physics. We study pattern avoidance in bounded affine permutations.
Neal Madras, Justin M. Troyka
doaj +1 more source
Ballot permutations and odd order permutations [PDF]
Discrete Mathematics, 2020 There was an error with an alternative formula for b(n,3) that was on page ...
openaire +2 more sources