Results 41 to 50 of about 339 (52)
A generalization of the "probléme des rencontres" [PDF]
, 2018 In this paper, we study a generalization of the classical \emph{probl\'eme des rencontres} (\emph{problem of coincidences}), consisting in the enumeration of all permutations $ \pi \in \SS_n $ with $k$ fixed points, and, in particular, in the ...
Capparelli, Stefano +3 more
core
A Cyclic Analogue of Stanley's Shuffle Theorem
, 2022 We introduce the cyclic major index of a cycle permutation and give a bivariate analogue of enumerative formula for the cyclic shuffles with a given cyclic descent numbers due to Adin, Gessel, Reiner and Roichman, which can be viewed as a cyclic analogue
Ji, Kathy Q., Zhang, Dax T. X.
core
Pattern Count on Multiply Restricted Permutations [PDF]
, 2013 Previous work has studied the pattern count on singly restricted permutations. In this work, we focus on patterns of length 3 in multiply restricted permutations, especially for double and triple pattern-avoiding permutations. We derive explicit formulae
Zhao, Alina F. Y.
core
. We study the descent distribution over the set of centrosymmetric permutations that avoid a pattern of length 3. In the most puzzling case, namely, τ = 123 and n even, our main tool is a bijection that associates a Dyck pre x of length 2n to every ...
Flavio Bonetti +2 more
core
The Eulerian numbers on restricted centrosymmetric permutations
, 2009 We study the descent distribution over the set of centrosymmetric permutations that avoid the pattern of length 3. Our main tool in the most puzzling case, namely, $\tau=123$ and $n$ even, is a bijection that associates a Dyck prefix of length $2n$ to ...
Barnabei, Marilena +2 more
core
Ascent Sequences Avoiding Pairs of Patterns [PDF]
, 2014 Ascent sequences were introduced by Bousquet-Melou et al. in connection with (2+2)-avoiding posets and their pattern avoidance properties were first considered by Duncan and Steingrímsson.
Baxter, Andrew M, Pudwell, Lara
core +4 more sources
Set-Valued Tableaux & Generalized Catalan Numbers
, 2017 Standard set-valued Young tableaux are a generalization of standard Young tableaux in which cells may contain more than one integer, with the added conditions that every integer at position $(i,j)$ must be smaller than every integer at positions $(i,j+1)$
Drube, Paul
core
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Short Block-Move–CPP is NP-Complete
Matemática Contemporânea, 2020The Closest Object Problem aims to find one object in the center of all others. It was studied for strings with respect to the Hamming distance, where the Hamming Closest String Problem was settled to be NP-complete. The Closest Permutation Problem (CPP)
L. Cunha +3 more
semanticscholar +1 more source
Encoding of partition set using sub-exceeding function
, 2018We introduce in this paper a new method to encode all partitions of any set of n objects using sub-exceeding function. So, let n and k be two positive integers such that 1 ≤ k ≤ n and let too Ω a set of cardinal n.
Luc Rabefihavanana
semanticscholar +1 more source
On the recursion formula of polynomials generated by rational functions
International Journal of Mathematical Analysis, 2019Our goal in this work is to found the unified recursion formula of polynomials associated to rational generating functions.
M. Goubi
semanticscholar +1 more source