Results 31 to 40 of about 206,672 (309)
Enumeration of the distinct shuffles of permutations [PDF]
Discrete Mathematics & Theoretical Computer Science, 2009 A shuffle of two words is a word obtained by concatenating the two original words in either order and then sliding any letters from the second word back past letters of the first word, in such a way that the letters of each original word remain spelled ...
Camillia Smith Barnes
doaj +1 more source
The Student Mathematical Library, 2018 A bstract . An action trace is a function naturally associated to a probability measure preserving action of a group on a standard probability space. For countable amenable groups, we characterise stability in permutations using action traces.
W. Dukes +3 more
semanticscholar +1 more source
Fixed points and cycle structure of random permutations [PDF]
, 2015 Using the recently developed notion of permutation limits this paper derives the limiting distribution of the number of fixed points and cycle structure for any convergent sequence of random permutations, under mild regularity conditions.
S. Mukherjee
semanticscholar +1 more source
Partitioned Cacti: a Bijective Approach to the Cycle Factorization Problem [PDF]
Discrete Mathematics & Theoretical Computer Science, 2008 In this paper we construct a bijection for partitioned 3-cacti that gives raise to a new formula for enumeration of factorizations of the long cycle into three permutations with given number of cycles.
Gilles Schaeffer, Ekaterina Vassilieva
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
Optimum Circuits for Bit-Dimension Permutations
IEEE Transactions on Very Large Scale Integration (VLSI) Systems, 2019 In this paper, we present a systematic approach to design hardware circuits for bit-dimension permutations. The proposed approach is based on decomposing any bit-dimension permutation into elementary bit-exchanges. Such decomposition is proven to achieve
M. Garrido, J. Grajal, O. Gustafsson
semanticscholar +1 more source
Exact testing with random permutations [PDF]
Test (Madrid), 2014 When permutation methods are used in practice, often a limited number of random permutations are used to decrease the computational burden. However, most theoretical literature assumes that the whole permutation group is used, and methods based on random
Jesse Hemerik, J. Goeman
semanticscholar +1 more source
J. Integer Seq., 2015 Define a sequence of positive integers by the rule that a(n) = n for 1 <= n <= 3, and for n >= 4, a(n) is the smallest number not already in the sequence which has a common factor with a(n-2) and is relatively prime to a(n-1). We show that this is a permutation of the positive integers. The remarkable graph of this sequence consists of runs of
David L. Applegate +5 more
openaire +4 more sources
Interlocked Permutations [PDF]
SIAM Journal on Discrete Mathematics, 2019 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. Our results are purely combinatorial and in line with previous work of the third author about permutation capacity.
Cohen, Gérard +2 more
openaire +3 more sources
Homogeneous Permutations [PDF]
The Electronic Journal of Combinatorics, 2002 There are just five Fraïssé classes of permutations (apart from the trivial class of permutations of a singleton set); these are the identity permutations, reversing permutations, composites (in either order) of these two classes, and all permutations. The paper also discusses infinite generalisations of permutations, and the connection with Fraïssé's ...
openaire +2 more sources