Results 21 to 30 of about 158 (109)
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
On the Okounkov-Olshanski formula for standard tableaux of skew shapes [PDF]
, 2022 The classical hook length formula counts the number of standard tableaux of straight shapes. In 1996, Okounkov and Olshanski found a positive formula for the number of standard Young tableaux of a skew shape.
H. Morales, Alejandro H. +1 more
core +1 more source
No extremal square-free words over large alphabets [PDF]
, 2022 A word is square-free if it does not contain any square (a word of the form \(XX\)), and is extremal square-free if it cannot be extended to a new square-free word by inserting a single letter at any position.
Zhang, Shengtong, Hong, Letong
core +1 more source
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
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
Restricted lonesum matrices [PDF]
, 2018 Lonesum matrices are matrices that are uniquely reconstructible from their row and column sum vectors. These matrices are enumerated by the poly-Bernoulli numbers; a sequence related to the multiple zeta values with a rich literature in number theory.
Bényi, Beáta
core +1 more source
A bijective proof of Kohnert's rule for Schubert polynomials [PDF]
, 2022 Kohnert proposed a formula for Schubert polynomials as the generating polynomial for certain unit cell diagrams obtained from the diagram of a permutation.
Assaf, Sami H.
core +1 more source
Generalized Stirling permutations and forests: Higher-order Eulerian and Ward numbers [PDF]
, 2014 20 pags.; 4 figs.; Mathematics Subject Classifications: 05A05, 05A15, 05C30We define a new family of generalized Stirling permutations that can be interpreted in terms of ordered trees and forests.
Sánchez Villaseñor, Eduardo Jesús +8 more
core +1 more source
Consecutive Patterns in Inversion Sequences [PDF]
Discrete Mathematics & Theoretical Computer Science, 2019 An inversion sequence of length $n$ is an integer sequence $e=e_{1}e_{2}\dots e_{n}$ such that $0\leq e_{i}
Juan S. Auli, Sergi Elizalde
doaj +1 more source