Results 91 to 100 of about 549,106 (324)
Bijections from Dyck and Motzkin meanders with catastrophes to pattern avoiding Dyck paths [PDF]
Discrete Mathematics Letters, 2021 Jean-Luc Baril, Sergey Kirgizov
doaj +1 more source
Computational Approaches to Consecutive Pattern Avoidance in Permutations [PDF]
, 2011 In recent years, there has been increasing interest in consecutive pattern avoidance in permutations. In this paper, we introduce two approaches to counting permutations that avoid a set of prescribed patterns consecutively.
Nakamura, Brian
core
Classical pattern distributions in $\mathcal{S}_{n}(132)$ and $\mathcal{S}_{n}(123)$
, 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 ...
Qiu, Dun, Remmel, Jeffrey
core +1 more source
Degradation mechanism of the von Willebrand factor A2 domain by nattokinase
FEBS Letters, EarlyView.Nattokinase, a natto‐derived protease, exhibits potent antithrombotic effects. This study demonstrates that nattokinase directly cleaves the von Willebrand factor (vWF) A2 domain in vitro. Unlike the native regulator ADAMTS13, nattokinase degrades folded vWF independently of shear stress.
Ryuichi Hyakumoto +3 more
wiley +1 more source
On the sub-permutations of pattern avoiding permutations
, 2014 There is a deep connection between permutations and trees. Certain sub-structures of permutations, called sub-permutations, bijectively map to sub-trees of binary increasing trees.
Disanto, Filippo, Wiehe, Thomas
core +1 more source
FEBS Letters, EarlyView.The pyruvate generator, which causes activation of respiration by extra‐mitochondrial Ca2+, is also present and functional in rat brainstem mitochondria, as it is in other brain regions. This finding is confirmed by experiments with a fully reconstituted malate–aspartate shuttle (MAS).
Grazyna Debska‐Vielhaber +7 more
wiley +1 more source
Highly sorted permutations with respect to a 312-avoiding stack [PDF]
Enumerative Combinatorics and Applications, 2023 Yuji Choi, Yunseo Choi
doaj +1 more source
Pattern Avoidance and Young Tableaux
The Electronic Journal of Combinatorics, 2017 This paper extends Lewis's bijection (J. Combin. Theorey Ser. A 118, 2011) to a bijection between a more general class $\mathcal{L}(n,k,I)$ of permutations and the set of standard Young tableaux of shape $\langle (k+1)^n\rangle$, so the cardinality\[|\mathcal{L}(n,k,I)|=f^{\langle (k+1)^n\rangle},\]is independent of the choice of $I\subseteq [n]$. As a
Zhousheng Mei, Suijie Wang
openaire +2 more sources
Molecular Oncology, Volume 20, Issue 6, Page 1513-1534, June 2026.Nanosecond infrared laser (NIRL) low‐volume sampling combined with shotgun lipidomics uncovers distinct lipidome alterations in oropharyngeal squamous cell carcinoma (OPSCC) of the palatine tonsil. Several lipid species consistently differentiate tumor from healthy tissue, highlighting their potential as diagnostic markers.
Leonard Kerkhoff +11 more
wiley +1 more source
Pattern-Avoiding Shallow Permutations
The Electronic Journal of CombinatoricsShallow permutations were defined in 1977 to be those that satisfy the lower bound of the Diaconis-Graham inequality. Recently, there has been renewed interest in these permutations. In particular, Berman and Tenner showed they satisfy certain pattern avoidance conditions in their cycle form and Woo showed they are exactly those whose cycle diagrams ...
Kassie Archer +2 more
openaire +2 more sources