Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 2 of 2
Full-Text Articles in Entire DC Network
On The Cyclically Fully Commutative Elements Of Coxeter Groups, T. Boothby, J. Burket, M. Eichwald, D. C. Ernst, R. M. Green, Matthew Macauley
On The Cyclically Fully Commutative Elements Of Coxeter Groups, T. Boothby, J. Burket, M. Eichwald, D. C. Ernst, R. M. Green, Matthew Macauley
Publications
Let W be an arbitrary Coxeter group. If two elements have expressions that are cyclic shifts of each other (as words), then they are conjugate (as group elements) in W. We say that w is cyclically fully commutative (CFC) if every cyclic shift of any reduced expression for w is fully commutative (i.e., avoids long braid relations). These generalize Coxeter elements in that their reduced expressions can be described combinatorially by acyclic directed graphs, and cyclically shifting corresponds to source-to-sink conversions. In this paper, we explore the combinatorics of the CFC elements and enumerate them in all Coxeter groups. …
Nested Canalyzing Depth And Network Stability, Lori Layne, Elena Dimitrova, Matthew Macauley
Nested Canalyzing Depth And Network Stability, Lori Layne, Elena Dimitrova, Matthew Macauley
Publications
We introduce the nested canalyzing depth of a function, which measures the extent to which it retains a nested canalyzing structure. We characterize the structure of functions with a given depth and compute the expected activities and sensitivities of the variables. This analysis quantifies how canalyzation leads to higher stability in Boolean networks. It generalizes the notion of nested canalyzing functions (NCFs), which are precisely the functions with maximum depth. NCFs have been proposed as gene regulatory network models, but their structure is frequently too restrictive and they are extremely sparse. We find that functions become decreasingly sensitive to input …