Results 1 to 10 of about 119 (92)
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
The number of {1243, 2134}-avoiding permutations [PDF]
Discrete Mathematics & Theoretical Computer Science, 2023 We show that the counting sequence for permutations avoiding both of the (classical) patterns 1243 and 2134 has the algebraic generating function supplied by Vaclav Kotesovec for sequence A164651 in The On-Line Encyclopedia of Integer Sequences.
David Callan
doaj +1 more source
Permutations avoiding 4321 and 3241 have an algebraic generating function [PDF]
Discrete Mathematics & Theoretical Computer Science, 2022 We show that permutations avoiding both of the (classical) patterns 4321 and 3241 have the algebraic generating function conjectured by Vladimir Kruchinin.
David Callan
doaj +1 more source
Deepest Nodes in Marked Ordered Trees
Annales Mathematicae Silesianae, 2022 A variation of ordered trees, where each rightmost edge might be marked or not, if it does not lead to an endnode, is investigated. These marked ordered trees were introduced by E. Deutsch et al. to model skew Dyck paths.
Prodinger Helmut
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
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
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
Duality for convolution on subclasses of analytic functions and weighted integral operators
Demonstratio Mathematica, 2023 In this article, we investigate a class of analytic functions defined on the unit open disc U={z:∣z∣0\alpha \gt 0, 0≤β≤10\le \beta \le 1 ...
Amini Ebrahim +3 more
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
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