Results 21 to 30 of about 476,988 (354)
Regenerative random permutations of integers [PDF]
Annals of Probability, 2017 Motivated by recent studies of large Mallows$(q)$ permutations, we propose a class of random permutations of $\mathbb{N}_{+}$ and of $\mathbb{Z}$, called regenerative permutations.
J. Pitman, Wenpin Tang
semanticscholar +1 more source
On the distribution of the length of the longest increasing subsequence of random permutations [PDF]
, 1998 Let SN be the group of permutations of 1,2,..., N. If 7r E SN, we say that 7(i1),... , 7F(ik) is an increasing subsequence in 7r if il < i2 < ... < ik and 7r(ii) < 7r(i2) < ...< 7r(ik). Let 1N(r) be the length of the longest increasing subsequence.
J. Baik, P. Deift, K. Johansson
semanticscholar +1 more source
Calculating Permutation Entropy without Permutations [PDF]
Complexity, 2020 A method for analyzing sequential data sets, similar to the permutation entropy one, is discussed. The characteristic features of this method are as follows: it preserves information about equal values, if any, in the embedding vectors; it is exempt from combinatorics; and it delivers the same entropy value as does the permutation method, provided the ...
openaire +4 more sources
Permutation tableaux and permutation patterns
Journal of Combinatorial Theory, Series A, 2007 Clarification of proofs (thanks to referees); report on progress on our open problems by Burstein, Corteel, Eriksen, Reifegerste, and Viennot. 25 pages, 7 figures.
Lauren Williams, Einar Steingrímsson
openaire +3 more sources
eLife, 2016 Exploration of developmental mechanisms classically relies on analysis of pattern regularities. Whether disorders induced by biological noise may carry information on building principles of developmental systems is an important debated question. Here, we
Yassin Refahi +6 more
doaj +1 more source
Permutation Classes of Polynomial Growth [PDF]
, 2007 A pattern class is a set of permutations closed under the formation of subpermutations. Such classes can be characterised as those permutations not involving a particular set of forbidden permutations.
M. D. Atkinson +5 more
core +4 more sources
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 +3 more sources
Determinant of binary circulant matrices
Special Matrices, 2019 This article gives a closed-form expression for the determinant of binary circulant matrices.
Hariprasad M.
doaj +1 more source
On the Cycle Structure of Mallows Permutations [PDF]
, 2016 We study the length of cycles of random permutations drawn from the Mallows distribution. Under this distribution, the probability of a permutation $\pi \in \mathbb{S}_n$ is proportional to $q^{\textrm{inv}(\pi)}$ where ...
Alex Gladkich, R. Peled
semanticscholar +1 more source
The # product in combinatorial Hopf algebras [PDF]
Discrete Mathematics & Theoretical Computer Science, 2011 We show that the # product of binary trees introduced by Aval and Viennot (2008) is in fact defined at the level of the free associative algebra, and can be extended to most of the classical combinatorial Hopf algebras.
Jean-Christophe Aval +2 more
doaj +1 more source