Results 41 to 50 of about 476,988 (354)
Minimum Number of Monotone Subsequences of Length 4 in Permutations [PDF]
Combinatorics, probability & computing, 2014 We show that for every sufficiently large n, the number of monotone subsequences of length four in a permutation on n points is at least \begin{equation*} \binom{\lfloor{n/3}\rfloor}{4} + \binom{\lfloor{(n+1)/3}\rfloor}{4} + \binom{\lfloor{(n+2)/3 ...
J. Balogh +5 more
semanticscholar +1 more source
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
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
A relation on 132-avoiding permutation patterns [PDF]
Discrete Mathematics & Theoretical Computer Science, 2015 A permutation $σ$ contains the permutation $τ$ if there is a subsequence of $σ$ order isomorphic to $τ$. A permutation $σ$ is $τ$-avoiding if it does not contain the permutation $τ$.
Natalie Aisbett
doaj +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
Permutation P-values Should Never Be Zero: Calculating Exact P-values When Permutations Are Randomly Drawn [PDF]
Statistical Applications in Genetics and Molecular Biology, 2010 Permutation tests are amongst the most commonly used statistical tools in modern genomic research, a process by which p-values are attached to a test statistic by randomly permuting the sample or gene labels.
B. Phipson, Gordon K. Smyth
semanticscholar +1 more source
Bounded affine permutations I. Pattern avoidance and enumeration [PDF]
Discrete Mathematics & Theoretical Computer Science, 2021 We introduce a new boundedness condition for affine permutations, motivated by the fruitful concept of periodic boundary conditions in statistical physics. We study pattern avoidance in bounded affine permutations.
Neal Madras, Justin M. Troyka
doaj +1 more source
Surrogate Data Preserving All the Properties of Ordinal Patterns up to a Certain Length
Entropy, 2019 We propose a method for generating surrogate data that preserves all the properties of ordinal patterns up to a certain length, such as the numbers of allowed/forbidden ordinal patterns and transition likelihoods from ordinal patterns into others.
Yoshito Hirata +2 more
doaj +1 more source
On the Wilf-Stanley limit of 4231-avoiding permutations and a conjecture of Arratia [PDF]
, 2005 We construct a sequence of finite automata that accept subclasses of the class of 4231-avoiding permutations. We thereby show that the Wilf-Stanley limit for the class of 4231-avoiding permutations is bounded below by 9.35.
A. Rechnitzer +20 more
core +5 more sources