Zobrazeno 1 - 10
of 10
pro vyhledávání: '"Lara Pudwell"'
Autor:
Ayomikun Adeniran, Lara Pudwell
Publikováno v:
Enumerative Combinatorics and Applications, Vol 3, Iss 3, p Article #S2R17 (2023)
Externí odkaz:
https://doaj.org/article/6bf9cdd771d7471cb018f9aa996f3955
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol Vol. 19 no. 2, Permutation..., Iss Permutation Patterns (2018)
In this paper, we consider pattern avoidance in a subset of words on $\{1,1,2,2,\dots,n,n\}$ called reverse double lists. In particular a reverse double list is a word formed by concatenating a permutation with its reversal. We enumerate reverse doub
Externí odkaz:
https://doaj.org/article/fbbbe53106cc431daa831f4f46c52ad8
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol Vol. 18 no. 2, Permutation..., Iss Permutation Patterns (2016)
We investigate pattern avoidance in permutations satisfying some additional restrictions. These are naturally considered in terms of avoiding patterns in linear extensions of certain forest-like partially ordered sets, which we call binary shrub fore
Externí odkaz:
https://doaj.org/article/8e3279638ee24c058308991f93ae03a9
Publikováno v:
International Journal of Mathematics and Mathematical Sciences, Vol 2004, Iss 61, Pp 3291-3299 (2004)
Externí odkaz:
https://doaj.org/article/97d969d3ea4c463b8430dfb4096884de
Autor:
Lara Pudwell
Publikováno v:
Math Horizons. 29:5-7
Publikováno v:
Journal of Physics A: Mathematical and Theoretical. 55:434002
Fitness landscapes help model the theory of adaption. We consider genetic fitness landscapes abstractly as acyclic orientations of Boolean lattices under the assumptions laid out by Crona et al. We focus on occurrences of reciprocal sign epistasis (R
A Mathematician's Practical Guide to Mentoring Undergraduate Research is a complete how-to manual on starting an undergraduate research program. Readers will find advice on setting appropriate problems, directing student progress, managing group dyna
Publikováno v:
Scopus-Elsevier
This paper considers the enumeration of ternary trees (i.e. rooted ordered trees in which each vertex has 0 or 3 children) avoiding a contiguous ternary tree pattern. We begin by finding recurrence relations for several simple tree patterns; then, fo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f56281a5bb98dfc5136b7d82c4c86868
http://www.scopus.com/inward/record.url?eid=2-s2.0-84855487478&partnerID=MN8TOARS
http://www.scopus.com/inward/record.url?eid=2-s2.0-84855487478&partnerID=MN8TOARS