Results 1 to 10 of about 476,988 (354)
Snow Leopard Permutations and Their Even and Odd Threads [PDF]
Discrete Mathematics & Theoretical Computer Science, 2016 Caffrey, Egge, Michel, Rubin and Ver Steegh recently introduced snow leopard permutations, which are the anti-Baxter permutations that are compatible with the doubly alternating Baxter permutations. Among other things, they showed that these permutations
Eric S. Egge, Kailee Rubin
doaj +3 more sources
The Brownian limit of separable permutations [PDF]
Annals of Probability, 2017 We study random uniform permutations in an important class of pattern-avoiding permutations: the separable permutations. We describe the asymptotics of the number of occurrences of any fixed given pattern in such a random permutation in terms of the ...
Bassino, Frédérique +4 more
core +4 more sources
Journal of Algebraic Combinatorics, 2013 Arc permutations and unimodal permutations were introduced in the study of triangulations and characters. This paper studies combinatorial properties and structures on these permutations. First, both sets are characterized by pattern avoidance.
Elizalde, Sergi, Roichman, Yuval
core +3 more sources
On the sub-permutations of pattern avoiding permutations
Discrete Mathematics, 2014 There is a deep connection between permutations and trees. Certain sub-structures of permutations, called sub-permutations, bijectively map to sub-trees of binary increasing trees.
Disanto, Filippo, Wiehe, Thomas
core +3 more sources
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 +3 more sources
Interlocked permutations [PDF]
SIAM Journal on Discrete Mathematics, 2018 The zero-error capacity of channels with a countably infinite input alphabet formally generalises Shannon's classical problem about the capacity of discrete memoryless channels. We solve the problem for three particular channels.
Cohen, Gerard +2 more
core +3 more sources
The Dirac Equation, Mass and Arithmetic by Permutations of Automaton States [PDF]
EntropyThe cornerstones of the Cellular Automaton Interpretation of Quantum Mechanics are its underlying ontological states that evolve by permutations. They do not create would-be quantum mechanical superposition states.
Hans-Thomas Elze
doaj +2 more sources
Palindromic permutations and generalized Smarandache palindromic permutations
viXra, 2006 The idea of left(right) palindromic permutations(LPPs,RPPs) and left(right) generalized Smarandache palindromic permutations(LGSPPs,RGSPPs) are introduced in symmetric groups S_n of degree n.
Jaiyeola, Temitope Gbolahan
core +8 more sources
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
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.
Jason C. Hsu +3 more
openaire +3 more sources