Results 31 to 40 of about 407,922 (313)
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
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 Reconstruction [PDF]
The Electronic Journal of Combinatorics, 2006 In this paper, we consider the problem of permutation reconstruction. This problem is an analogue of graph reconstruction, a famous question in graph theory. In the case of permutations, the problem can be stated as follows: In all possible ways, delete $k$ entries of the permutation $p=p_1p_2p_3...p_n$ and renumber accordingly, creating $n \choose k$
openaire +2 more sources
Physical Review E, 2018 The field of disordered systems provides many simple models in which the competing influences of thermal and non-thermal disorder lead to new phases and non-trivial thermal behavior of order parameters. In this paper, we add a model to the subject by considering a system where the state space consists of various orderings of a list. As in spin glasses,
openaire +3 more sources
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
, 2022 Let $C(n)$ denote the number of permutations $σ$ of $[n]=\{1,2,\dots,n\}$ such that $\gcd(j,σ(j))=1$ for each $j\in[n]$. We prove that for $n$ sufficiently large, $n!/3.73^n < C(n) < n!/2.5^n$.
openaire +3 more sources
Systematic Codes for Rank Modulation [PDF]
, 2014 The goal of this paper is to construct systematic error-correcting codes for permutations and multi-permutations in the Kendall's $\tau$-metric. These codes are important in new applications such as rank modulation for flash memories. The construction is
Bruck, Jehoshua +3 more
core +2 more sources
Permutation Statistics of Indexed Permutations
European Journal of Combinatorics, 1994 The definitions of descent, exceedance, major index, inversion index and Denert's statistic for the elements of the symmetric group \({\mathcal S}_ d\) are generalized to indexed permutations, i.e. the elements of the group \(S^ n_ d:=\mathbb{Z}_ n\wr{\mathcal S}_ d\), where \(\wr\) is the wreath product with respect to usual action of \({\mathcal S}_ ...
openaire +1 more source
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
On k-crossings and k-nestings of permutations [PDF]
, 2009 We introduce k-crossings and k-nestings of permutations. We show that the crossing number and the nesting number of permutations have a symmetric joint distribution.
Burrill, Sophie +2 more
core +1 more source