Results 11 to 20 of about 37 (37)

Evaluation of the effects of chlorhexidine digluconate with and without cBD103 or cCath against multidrug‐resistant clinical isolates of Staphylococcus pseudintermedius

open access: yesVeterinary Dermatology, Volume 33, Issue 1, Page 17-e6, February 2022., 2022
Background – Because of the increased incidence of multidrug‐resistant (MDR) bacteria, the use of disinfectants over antibiotics has been encouraged. However, the interactions between disinfectants and host local immunity are poorly understood. Objective – To assess the effects of chlorhexidine digluconate (Chx), with and without selected host defence ...
Domenico Santoro   +3 more
wiley   +1 more source

Down-step statistics in generalized Dyck paths [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2022
The number of down-steps between pairs of up-steps in $k_t$-Dyck paths, a generalization of Dyck paths consisting of steps $\{(1, k), (1, -1)\}$ such that the path stays (weakly) above the line $y=-t$, is studied.
Andrei Asinowski   +2 more
doaj   +1 more source

Enumeration of super-strong Wilf equivalence classes of permutations in the generalized factor order [PDF]

open access: yesDiscrete 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

Further enumeration results concerning a recent equivalence of restricted inversion sequences [PDF]

open access: yesDiscrete 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

Proofs of Conjectures about Pattern-Avoiding Linear Extensions [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2019
After fixing a canonical ordering (or labeling) of the elements of a finite poset, one can associate each linear extension of the poset with a permutation.
Colin Defant
doaj   +1 more source

Inversion sequences avoiding 021 and another pattern of length four [PDF]

open access: yesDiscrete 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 permutation class Av(4213,2143) [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2017
We determine the structure of permutations avoiding the patterns 4213 and 2143. Each such permutation consists of the skew sum of a sequence of plane trees, together with an increasing sequence of points above and an increasing sequence of points to its ...
David Bevan
doaj   +1 more source

Sensitivities and block sensitivities of elementary symmetric Boolean functions

open access: yesJournal 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

Classical pattern distributions in $\mathcal{S}_{n}(132)$ and $\mathcal{S}_{n}(123)$ [PDF]

open access: yesDiscrete 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

Consecutive Patterns in Inversion Sequences [PDF]

open access: yesDiscrete 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

Home - About - Disclaimer - Privacy