Results 31 to 40 of about 476,988 (354)
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.M.B. Dukes +3 more
semanticscholar +1 more source
Discrete Mathematics & Theoretical Computer Science, 2011 In this work we introduce and study tree-like tableaux, which are certain fillings of Ferrers diagrams in simple bijection with permutation tableaux and alternative tableaux.
Jean-Christophe Aval +2 more
doaj +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
Factorization of Permutations [PDF]
The Electronic Journal of Linear Algebra, 2015 The problem of factoring a permutation as a product of special types of transpositions, namely, those transpositions involving two positions with bounded distances, is considered. In particular, the minimum number, δ, such that every permutation can be factored into no more than δ special transpositions is investigated.
Li Sharon Hang +5 more
openaire +3 more sources
Avoiding maximal parabolic subgroups of S_k [PDF]
Discrete Mathematics & Theoretical Computer Science, 2000 We find an explicit expression for the generating function of the number of permutations in S_n avoiding a subgroup of S_k generated by all but one simple transpositions.
Toufik Mansour, Alek Vainshtein
doaj +1 more source
Restricted Dumont permutations, Dyck paths, and noncrossing partitions [PDF]
, 2006 We complete the enumeration of Dumont permutations of the second kind avoiding a pattern of length 4 which is itself a Dumont permutation of the second kind.
Combinatoire Algébrique +4 more
core +3 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
European Journal of Combinatorics, 2011 We study unfair permutations, which are generated by letting [Formula: see text] players draw numbers and assuming that player [Formula: see text] draws [Formula: see text] times from the unit interval and records her largest value. This model is natural in the context of partitions: the score of the [Formula: see text]th player corresponds to the ...
Prodinger H., Schneider C., Wagner S.
openaire +4 more sources
New Hopf Structures on Binary Trees [PDF]
Discrete Mathematics & Theoretical Computer Science, 2009 The multiplihedra $\mathcal{M}_{\bullet} = (\mathcal{M}_n)_{n \geq 1}$ form a family of polytopes originating in the study of higher categories and homotopy theory. While the multiplihedra may be unfamiliar to the algebraic combinatorics community, it is
Stefan Forcey +2 more
doaj +1 more source
Magic Square and Arrangement of Consecutive Integers That Avoids k-Term Arithmetic Progressions
Mathematics, 2021 In 1977, Davis et al. proposed a method to generate an arrangement of [n]={1,2,…,n} that avoids three-term monotone arithmetic progressions. Consequently, this arrangement avoids k-term monotone arithmetic progressions in [n] for k≥3.
Kai An Sim, Kok Bin Wong
doaj +1 more source