Results 51 to 60 of about 476,988 (354)
Sorting by Multi-Cut Rearrangements
Algorithms, 2021 A multi-cut rearrangement of a string S is a string S′ obtained from S by an operation called k-cut rearrangement, that consists of (1) cutting S at a given number k of places in S, making S the concatenated string X1·X2·X3·…·Xk·Xk+1, where X1 and Xk+1 ...
Laurent Bulteau +3 more
doaj +1 more source
The Kendall and Mallows Kernels for Permutations
IEEE Transactions on Pattern Analysis and Machine Intelligence, 2015 We show that the widely used Kendall tau correlation coefficient, and the related Mallows kernel, are positive definite kernels for permutations. They offer computationally attractive alternatives to more complex kernels on the symmetric group to learn ...
Yunlong Jiao, Jean-Philippe Vert
semanticscholar +1 more source
Finding small patterns in permutations in linear time [PDF]
ACM-SIAM Symposium on Discrete Algorithms, 2013 Given two permutations σ and π, the Permutation Pattern problem asks if σ is a subpattern of π. We show that the problem can be solved in time 2O(e2loge). n, where e = |σ| and n = |π|.
Sylvain Guillemot, D. Marx
semanticscholar +1 more source
Journal of High Energy Physics, 2003 N-fold tensor products of a rational CFT carry an action of the permutation group S_N. These automorphisms can be used as gluing conditions in the study of boundary conditions for tensor product theories. We present an ansatz for such permutation boundary states and check that it satisfies the cluster condition and Cardy's constraints.
openaire +3 more sources
Permutation orientifolds [PDF]
Journal of High Energy Physics, 2007 32 pages, 1 Figure, v2: references added, minor correction, version published in ...
Vladimir Mitev, Ilka Brunner
openaire +2 more sources
Permutations with restricted patterns and Dyck paths [PDF]
, 2000 We exhibit a bijection between 132-avoiding permutations and Dyck paths. Using this bijection, it is shown that all the recently discovered results on generating functions for 132-avoiding permutations with a given number of occurrences of the pattern ...
Krattenthaler, Christian
core +2 more sources
Discrete Mathematics, 1998 AbstractChung et al. (1978) have proved that the number of Baxter permutations on [n] is ∑r=0n−1(n+1r)(n+1r+1)(n+1r+2)(n+11)(n+12)Viennot (1981) has then given a combinatorial proof of this formula, showing this sum corresponds to the distribution of these permutations according to their number of rises.Cori et al.
Dulucq, Serge, Guibert, Olivier
openaire +3 more sources
Permutation Statistics of Indexed Permutations
European Journal of Combinatorics, 1994 AbstractThe definitions of descent, excedance, major index, inversion index and Denert's statistics for the elements of the symmetric group Ld are generalized to indexed permutation, i.e. the elements of the group Snd: = Zn ≀ Ld, where ≀ is the wreath product with respect to the usual action of Ld by permutation of {1, 2,…, d}.It is shown, bijectively,
openaire +2 more sources
Permutation and complete permutation polynomials
Finite Fields and Their Applications, 2015 Polynomials of type x q + 2 + b x over the field F q 2 and of type x q 2 + q + 2 + b x over F q 3 , where q = p m 2 is a power of a prime p are considered. All cases when these polynomials are permutation polynomials are classified. Therefore, all cases when the polynomials b - 1 x q + 2 over F q 2 and b - 1 x q 2 + q + 2 over F q 3 are the complete ...
L.A. Bassalygo, Victor Zinoviev
openaire +2 more sources
Journal of the Egyptian Mathematical Society, 2012 AbstractWe give an upper bound of the number of edges of a permutation graph. We introduce some necessary conditions for a graph to be a permutation graph, and we discuss the independence of these necessary conditions. We show that they are altogether not sufficient for a graph to be a permutation graph.
Mohamed Seoud, A.E.A. Mahran
openaire +3 more sources