Results 11 to 20 of about 302 (115)
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
Generating functions for a lattice path model introduced by Deutsch
Special Matrices, 2021 The lattice path model suggested by E. Deutsch is derived from ordinary Dyck paths, but with additional down-steps of size −3, −5, −7, . . . . For such paths, we find the generating functions of them, according to length, ending at level i, both, when ...
Prodinger Helmut
doaj +1 more source
Two examples of Wilf-collapse [PDF]
Discrete Mathematics & Theoretical Computer Science, 2021 Two permutation classes, the X-class and subpermutations of the increasing oscillation are shown to exhibit an exponential Wilf-collapse. This means that the number of distinct enumerations of principal subclasses of each of these classes grows much more
Michael Albert +2 more
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
Associated r-Dowling numbers and some relatives
, 2021 In this paper, we introduce a new generalization of Bell numbers, the s-associated r -Dowling numbers by combining two investigational directions. Here, r distinguished elements have to be in distinct blocks, some elements are coloured according to a ...
Eszter Gyimesi, Gábor Nyul
semanticscholar +1 more source
Compression with wildcards: All exact or all minimal hitting sets
Open Mathematics, 2023 Our objective is the compressed enumeration (based on wildcards) of all minimal hitting sets of general hypergraphs. To the author’s best knowledge, the only previous attempt towards compression, due to Toda, is based on binary decision diagrams and much
Wild Marcel
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
A note on Eulerian numbers and Toeplitz matrices
Special Matrices, 2020 This note presents a new formula of Eulerian numbers derived from Toeplitz matrices via Riordan array approach.
He Tian-Xiao, Shiue Peter J.-S.
doaj +1 more source
Enumerating two permutation classes by the number of cycles [PDF]
Discrete Mathematics & Theoretical Computer Science, 2022 We enumerate permutations in the two permutation classes $\text{Av}_n(312, 4321)$ and $\text{Av}_n(321, 4123)$ by the number of cycles each permutation admits. We also refine this enumeration with respect to several statistics.
Kassie Archer
doaj +1 more source
Refined ratio monotonicity of the coordinator polynomials of the root lattice of type Bn
Open Mathematics, 2023 Ratio monotonicity, a property stronger than both log-concavity and the spiral property, describes the behavior of the coefficients of many classical polynomials.
Su Xun-Tuan, Sun Fan-Bo
doaj +1 more source