Lara Pudwell
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Lara Pudwell has a total of 30 co-authors. Here are the top co-authors by number of shared publications:
- Adam M. Goyt
Department of Mathematics Minnesota State University 56563 Moorhead Moorhead MN USA
5 shared publications - Eric Rowland
Hofstra University
3 shared publications - Anant Godbole
East Tennessee State University
2 shared publications Andrew M. Baxter
PENNSYLVANIA STATE UNIVERSITY, UNIVERSITY PARK
2 shared publicationsJennifer Herdan
Winona State University
2 shared publications- Alexa Serrato
Department of Mathematics, Harvey Mudd College, Claremont, CA 91711, USA
1 shared publication
Latest Publications
- 15 April 2024
- Published by Taylor & Francis in Mathematics Magazine
- Vol. 97 (3) , 279-283
Catalan Numbers and Permutations
- 15 April 2024
- Published by Taylor & Francis in Mathematics Magazine
- Vol. 97 (3) , 279-283
Catalan Numbers and Permutations
- Open Access
Pattern Avoidance in Parking Functions
In this paper, we view parking functions viewed as labeled Dyck paths in order to study a notion of pattern avoidance first introduced by Remmel and Qiu. In particular we enumerate the parking functions avoiding any set of two or more patterns of length 3, and we obtain a number of well-known combinatorial sequences as a result. Along the way, we find bijections between specific sets of pattern-avoiding parking functions and a number of combinatorial objects such as partitions of polygons and trees with certain restrictions.
Open AccessPattern Avoidance in Parking Functions
In this paper, we view parking functions viewed as labeled Dyck paths in order to study a notion of pattern avoidance first introduced by Remmel and Qiu. In particular we enumerate the parking functions avoiding any set of two or more patterns of length 3, and we obtain a number of well-known combinatorial sequences as a result. Along the way, we find bijections between specific sets of pattern-avoiding parking functions and a number of combinatorial objects such as partitions of polygons and trees with certain restrictions.
- 25 November 2020
- Published by Taylor & Francis in The American Mathematical Monthly
- Vol. 127 (10) , 953-957
An Introduction to Undergraduate Research in Computational and Mathematical Biology Edited by Hannah Callender Highlander, Alex Capaldi, and Carrie Diaz Eaton; and A Project-Based Guide to Undergraduate Research in Mathematics. Edited by Pamela Harris, Erik Insko, and Aaron Wootton
- 25 November 2020
- Published by Taylor & Francis in The American Mathematical Monthly
- Vol. 127 (10) , 953-957
An Introduction to Undergraduate Research in Computational and Mathematical Biology Edited by Hannah Callender Highlander, Alex Capaldi, and Carrie Diaz Eaton; and A Project-Based Guide to Undergraduate Research in Mathematics. Edited by Pamela Harris, Erik Insko, and Aaron Wootton
- Open Access
- 13 April 2018
- Published by The Electronic Journal of Combinatorics in The Electronic Journal of Combinatorics
- Vol. 25 (2) , P2.27
Avoiding Fractional Powers over the Natural Numbers
We study the lexicographically least infinite $a/b$-power-free word on the alphabet of non-negative integers. Frequently this word is a fixed point of a uniform morphism, or closely related to one. For example, the lexicographically least $7/4$-power-free word is a fixed point of a $50847$-uniform morphism. We identify the structure of the lexicographically least $a/b$-power-free word for three infinite families of rationals $a/b$ as well many "sporadic" rationals that do not seem to belong to general families. To accomplish this, we develop an automated procedure for proving $a/b$-power-freeness for morphisms of a certain form, both for explicit and symbolic rational numbers $a/b$. Finally, we establish a connection to words on a finite alphabet. Namely, the lexicographically least $27/23$-power-free word is in fact a word on the finite alphabet $\{0, 1, 2\}$, and its sequence of letters is $353$-automatic.- 13 April 2018
- Published by The Electronic Journal of Combinatorics in The Electronic Journal of Combinatorics
- Vol. 25 (2) , P2.27
Open AccessAvoiding Fractional Powers over the Natural Numbers
We study the lexicographically least infinite $a/b$-power-free word on the alphabet of non-negative integers. Frequently this word is a fixed point of a uniform morphism, or closely related to one. For example, the lexicographically least $7/4$-power-free word is a fixed point of a $50847$-uniform morphism. We identify the structure of the lexicographically least $a/b$-power-free word for three infinite families of rationals $a/b$ as well many "sporadic" rationals that do not seem to belong to general families. To accomplish this, we develop an automated procedure for proving $a/b$-power-freeness for morphisms of a certain form, both for explicit and symbolic rational numbers $a/b$. Finally, we establish a connection to words on a finite alphabet. Namely, the lexicographically least $27/23$-power-free word is in fact a word on the finite alphabet $\{0, 1, 2\}$, and its sequence of letters is $353$-automatic. - 3 August 2016
- Published by Taylor & Francis in PRIMUS
- Vol. 27 (3) , 320-336
Successfully Mentoring Undergraduates in Research: A How To Guide for Mathematicians
Undergraduate research occurs in a variety of mathematical fields and in diverse settings, but all mentors of undergraduates face a number of common considerations. This article is a brief guide to help faculty with various levels of previous mentoring experience lead students in research projects. In particular, we discuss the issues of picking appropriate research problems, recruiting students, setting expectations, moving research forward, and helping students to communicate their work.
- 3 August 2016
- Published by Taylor & Francis in PRIMUS
- Vol. 27 (3) , 320-336
Successfully Mentoring Undergraduates in Research: A How To Guide for Mathematicians
Undergraduate research occurs in a variety of mathematical fields and in diverse settings, but all mentors of undergraduates face a number of common considerations. This article is a brief guide to help faculty with various levels of previous mentoring experience lead students in research projects. In particular, we discuss the issues of picking appropriate research problems, recruiting students, setting expectations, moving research forward, and helping students to communicate their work.
- 23 June 2016
- Published by Taylor & Francis in PRIMUS
- Vol. 27 (2) , 281-292
Teaching the Inquiry Process Through Experimental Mathematics
In this paper, we discuss the Experimental Mathematics course taught at Valparaiso University since 2009. We focus on aspects of the course that facilitate students’ abilities to ask and explore their own research questions.
- 23 June 2016
- Published by Taylor & Francis in PRIMUS
- Vol. 27 (2) , 281-292
Teaching the Inquiry Process Through Experimental Mathematics
In this paper, we discuss the Experimental Mathematics course taught at Valparaiso University since 2009. We focus on aspects of the course that facilitate students’ abilities to ask and explore their own research questions.
- 5 November 2015
- Published by Springer Nature in The Mathematical Intelligencer
- Vol. 37 (4) , 54-60
What’s in YOUR Wallet?
- 5 November 2015
- Published by Springer Nature in The Mathematical Intelligencer
- Vol. 37 (4) , 54-60
What’s in YOUR Wallet?
- Open Access
On Packing Densities of Set Partitions
We study packing densities for set partitions, which is a generalization of packing words. We use results from the literature about packing densities for permutations and words to provide packing densities for set partitions. These results give us most of the packing densities for partitions of the set $\{1,2,3\}$. In the final section we determine the packing density of the set partition $\{\{1,3\},\{2\}\}$.Open AccessOn Packing Densities of Set Partitions
We study packing densities for set partitions, which is a generalization of packing words. We use results from the literature about packing densities for permutations and words to provide packing densities for set partitions. These results give us most of the packing densities for partitions of the set $\{1,2,3\}$. In the final section we determine the packing density of the set partition $\{\{1,3\},\{2\}\}$. - Open Access
Ascent sequences avoiding pairs of patterns
Ascent sequences were introduced by Bousquet-Melou et al. in connection with (2+2)-avoiding posets and their pattern avoidance properties were first considered by Duncan and Steingrimsson. In this paper, we consider ascent sequences of length $n$ avoiding two patterns of length 3, and we determine an exact enumeration for 16 different pairs of patterns. Methods include simple recurrences, bijections to other combinatorial objects (including Dyck paths and pattern-avoiding permutations), and generating trees. We also provide an analogue of the Erdos-Szekeres Theorem to prove that any sufficiently long ascent sequence contains either many copies of the same number or a long increasing subsequence, with a precise bound.Open AccessAscent sequences avoiding pairs of patterns
Ascent sequences were introduced by Bousquet-Melou et al. in connection with (2+2)-avoiding posets and their pattern avoidance properties were first considered by Duncan and Steingrimsson. In this paper, we consider ascent sequences of length $n$ avoiding two patterns of length 3, and we determine an exact enumeration for 16 different pairs of patterns. Methods include simple recurrences, bijections to other combinatorial objects (including Dyck paths and pattern-avoiding permutations), and generating trees. We also provide an analogue of the Erdos-Szekeres Theorem to prove that any sufficiently long ascent sequence contains either many copies of the same number or a long increasing subsequence, with a precise bound. - 2 January 2015
- Published by The Electronic Journal of Combinatorics in The Electronic Journal of Combinatorics
- Vol. 22 (1) , P1.58
Ascent Sequences Avoiding Pairs of Patterns
Ascent sequences were introduced by Bousquet-Melou et al. in connection with (2+2)-avoiding posets and their pattern avoidance properties were first considered by Duncan and Steingrímsson. In this paper, we consider ascent sequences of length $n$ avoiding two patterns of length 3, and we determine an exact enumeration for 16 different pairs of patterns. Methods include simple recurrences, bijections to other combinatorial objects (including Dyck paths and pattern-avoiding permutations), and generating trees. We also provide an analogue of the Erdős-Szekeres Theorem to prove that any sufficiently long ascent sequence contains either many copies of the same number or a long increasing subsequence, with a precise bound.- 2 January 2015
- Published by The Electronic Journal of Combinatorics in The Electronic Journal of Combinatorics
- Vol. 22 (1) , P1.58
Ascent Sequences Avoiding Pairs of Patterns
Ascent sequences were introduced by Bousquet-Melou et al. in connection with (2+2)-avoiding posets and their pattern avoidance properties were first considered by Duncan and Steingrímsson. In this paper, we consider ascent sequences of length $n$ avoiding two patterns of length 3, and we determine an exact enumeration for 16 different pairs of patterns. Methods include simple recurrences, bijections to other combinatorial objects (including Dyck paths and pattern-avoiding permutations), and generating trees. We also provide an analogue of the Erdős-Szekeres Theorem to prove that any sufficiently long ascent sequence contains either many copies of the same number or a long increasing subsequence, with a precise bound.