Further enumeration results concerning a recent equivalence of restricted inversion sequences [PDF]
Discrete Mathematics & Theoretical Computer Science, 2022 Let asc and desc denote respectively the statistics recording the number of ascents or descents in a sequence having non-negative integer entries.
Toufik Mansour, Mark Shattuck
doaj +1 more source
New asymptotic expansions on hyperfactorial functions
, 2021 In this paper, by using the Bernoulli numbers and the exponential complete Bell polynomials, we establish four general asymptotic expansions for the hyperfactorial functions ∏n k=1 k kq , which have only odd power terms or even power terms. We derive the
Jianjun Xu
semanticscholar +1 more source
Enumeration of super-strong Wilf equivalence classes of permutations in the generalized factor order [PDF]
Discrete Mathematics & Theoretical Computer Science, 2019 Super-strong Wilf equivalence classes of the symmetric group ${\mathcal S}_n$ on $n$ letters, with respect to the generalized factor order, were shown by Hadjiloucas, Michos and Savvidou (2018) to be in bijection with pyramidal sequences of consecutive ...
Ioannis Michos, Christina Savvidou
doaj +1 more source
Inversion sequences avoiding 021 and another pattern of length four [PDF]
Discrete Mathematics & Theoretical Computer Science, 2023 We study the enumeration of inversion sequences that avoid the pattern 021 and another pattern of length four. We determine the generating trees for all possible pattern pairs and compute the corresponding generating functions.
Toufik Mansour, Gökhan Yıldırım
doaj +1 more source
Sensitivities and block sensitivities of elementary symmetric Boolean functions
Journal of Mathematical Cryptology, 2021 Boolean functions have important applications in molecular regulatory networks, engineering, cryptography, information technology, and computer science. Symmetric Boolean functions have received a lot of attention in several decades.
Zhang Jing, Li Yuan, Adeyeye John O.
doaj +1 more source
Crossings and nestings of matchings and partitions [PDF]
, 2005 We present results on the enumeration of crossings and nestings for matchings and set partitions. Using a bijection between partitions and vacillating tableaux, we show that if we fix the sets of minimal block elements and maximal block elements, the ...
William Y. C. Chen +4 more
semanticscholar +1 more source
Distribution of sets of descent tops and descent bottoms on restricted permutations [PDF]
Discrete Mathematics & Theoretical Computer ScienceIn this note, we prove some and conjecture other results regarding the distribution of descent top and descent bottom sets on some pattern-avoiding permutations.
Alexander Burstein
doaj +1 more source
Avoiding maximal parabolic subgroups of S_k [PDF]
, 2000 We find an explicit expression for the generating function of the number of permutations in S_n avoiding a subgroup of S_k generated by all but one simple transpositions.
Mansour, Toufik, Vainshtein, Alek
core +4 more sources
Classical pattern distributions in $\mathcal{S}_{n}(132)$ and $\mathcal{S}_{n}(123)$ [PDF]
Discrete Mathematics & Theoretical Computer Science, 2019 Classical pattern avoidance and occurrence are well studied in the symmetric group $\mathcal{S}_{n}$. In this paper, we provide explicit recurrence relations to the generating functions counting the number of classical pattern occurrence in the set of ...
Dun Qiu, Jeffrey Remmel
doaj +1 more source
On sums with generalized harmonic, hyperharmonic and special numbers
Miskolc Mathematical Notes, 2020 In this paper, we establish interesting sums including generalized harmonic numbers and special numbers by using generating functions of these numbers and some combinatorial identities.
Ö. Duran, N. Ömür, S. Koparal
semanticscholar +1 more source